default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID25th FCT 2025: Wrocław, Poland
- Artur Jez
, Jan Otop:
Fundamentals of Computation Theory - 25th International Symposium, FCT 2025, Wrocław, Poland, September 15-17, 2025, Proceedings. Lecture Notes in Computer Science 16106, Springer 2026, ISBN 978-3-032-04699-4 - Ankit Abhinav, Sriram Bhyravarapu, A. Mohanapriya, Saket Saurabh:
On the Parameterized Complexity of Connected Cluster Vertex Deletion. 1-14 - Duncan Adamson, Pamela Fleischmann, Annika Huch, Florin Manea, Paul Sarnighausen-Cahn, Max Wiedenhöft:
Tight Bounds for the Number of Absent Subsequences. 15-29 - Kevin Kurien Alex, Rajesh Chitnis, Alex Tempest:
On the Exact & Approximate Complexity of the Strongly Connected Steiner Subgraph Problem on Two Terminals with Demands. 30-44 - Robert D. Barish, Tetsuo Shibuya:
Reconfiguring Planar Perfect Matchings via Bounded Length Alternating Cycles. 45-56 - Ronak Bhadra, Raghunath Tewari:
Inductive Tracing and the Complexity of Finding Hamiltonian Path in DAGs. 57-67 - Tiziana Calamoneri, Federico Corò, Neeldhara Misra, Saraswati Girish Nanoti, Giacomo Paesani:
m-Eternal Domination and Variants on Some Classes of Finite and Infinite Graphs. 68-81 - Justine Cauvi, Laurent Viennot:
Parameterized Restless Temporal Path. 82-93 - Gennaro Cordasco, Luisa Gargano, Adele A. Rescigno:
Red-Blue Unshared Dominators. 94-108 - Konrad K. Dabrowski, Tala Eagling-Vose, Matthew Johnson, Giacomo Paesani, Daniël Paulusma:
Finding d-Cuts in Probe H-Free Graphs. 109-121 - Sandip Das, Soura Sena Das, Sweta Das, Sk Samim Islam:
On Distance-d Independent Set Problems for Some Graph Classes. 122-135 - Bireswar Das, Dipan Dey, Jinia Ghosh:
On the Complexity of Problems on Graphs Defined on Groups. 136-149 - Hiroshi Eto, Tesshu Hanaka, Eiji Miyano, Shuya Yoshida:
On the Complexity of Locally Rainbow Path. 150-164 - Ajinkya Gaikwad, Hitendra Kumar, Soumen Maity:
Parameterized Algorithms for Editing to Uniform Cluster Graph. 165-179 - Waldo Gálvez, Mayank Goswami, Arturo Merino, GiBeom Park, Meng-Tsung Tsai:
Computing Diverse and Nice Triangulations. 180-193 - Valentin Gledel, Gerold Jäger:
Determining the Metric Dimension of Ka ˟ Kb ˟ Kc by Static Black-Peg Mastermind. 194-207 - Joshua A. Grochow, Dan Johnson, Michael Levet:
Complexity of Identifying Fitting-Free Groups. 208-220 - Lukás Holík, Ondrej Lengál, Juraj Major, Adéla Stepková, Jan Strejcek:
On Complementation of Nondeterministic Finite Automata Without Full Determinization. 221-237 - Takashi Horiyama, Fumiya Sakamoto, Kazuhisa Seto, Ryu Suzuki:
Hardness of Pre-assignment Problem for Unique Minimum Vertex Cover on Planar Graphs with Maximum Degree 3. 238-251 - Michael Itzhaki:
Combinatorics of Palindromes. 252-266 - Enrico Iurlano, Günther R. Raidl:
Complexity of Positive Influence Domination on Partial Grids. 267-280 - D. Karthika, R. Muthucumaraswamy, V. P. Abidha, Pradeesha Ashok, Sriram Bhyravarapu, Sayani Das, Saket Saurabh, Ayush Sawlani, Vikash Tripathi:
On the Parameterized Complexity of Cosecure Domination. 281-294 - Jan Kratochvíl, Melanie Reihl:
Simultaneous Contact Representations of Planar Graphs. 295-308 - Susumu Kubo:
Partially Ordered Sets Corresponding to the Partition Problem. 309-321 - Dietrich Kuske:
Disjointness, Inclusion, and Regularity of ømega-Rational Trace Languages - Extended Abstract -. 322-335 - Tetiana Lavynska:
Linear Time Algorithms for Colorful 3-Rainbow Domination in Block and Cactus Graphs. 336-349 - Michael Levet, Pranjal Srivastava, Dhara Thakkar:
Complexity of Minimal Faithful Permutation Degree for Fitting-Free Groups. 350-361 - Michal Parnas, Adi Shraibman:
A Study of the Binary and Boolean Rank of Matrices with Small Constant Real Rank. 362-375 - S. K. M. Anoop, Jayalal Sarma:
Shallow-Rotation Distance via Forest Representations. 376-390 - Jayalal Sarma, Kei Uchizawa:
On Saving Energy in Boolean Circuits via Negations. 391-405 - Kazumasa Shinagawa, Koji Nuida:
Cyclic Equalizability of Words and Its Application to Card-Based Cryptography. 406-419 - Tomoyuki Yamakami:
Quantum First-Order Logics and Quantum Natural Deduction. 420-433 - Wiktor Zuba, Oded Lachish, Solon P. Pissis:
Minimizers in Semi-dynamic Strings. 434-447
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-10-13 21:41 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
