| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Sewon Park 0001 |
Verified Exact Real Computation with Nondeterministic Functions and Limits.  |
FCT  |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Emmanuel Sam, Benjamin Bergougnoux, Petr A. Golovach, Nello Blaser |
Kernelization for Finding Lineal Topologies (Depth-First Spanning Trees) with Many or Few Leaves. |
FCT |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Pamela Fleischmann, Jonas Höfer, Annika Huch, Dirk Nowotka |
α-β-Factorization and the Binary Case of Simon's Congruence. |
FCT |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Kodai Tanaka, Takaaki Mizuki |
Two UNO Decks Efficiently Perform Zero-Knowledge Proof for Sudoku. |
FCT |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Van Bang Le, Christian Rosenke |
Computing Optimal Leaf Roots of Chordal Cographs in Linear Time. |
FCT |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan Matyás Kristan, Jakub Svoboda |
Shortest Dominating Set Reconfiguration Under Token Sliding. |
FCT |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuya Higashikawa, Naoki Katoh, Guohui Lin, Eiji Miyano, Suguru Tamaki, Junichi Teruyama, Binhai Zhu |
On Computing a Center Persistence Diagram. |
FCT |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Nick Brettell, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Erik Jan van Leeuwen |
Computing Subset Vertex Covers in H-Free Graphs. |
FCT |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Johanna Björklund |
The Impact of State Merging on Predictive Accuracy in Probabilistic Tree Automata: Dietze's Conjecture Revisited. |
FCT |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Antonio Al Serhali, Joachim Niehren |
Subhedge Projection for Stepwise Hedge Automata. |
FCT |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Nathalie Aubrun, Nicolas Bitar |
Domino Snake Problems on Groups. |
FCT |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Jeff Kinne, Akbar Rafiey, Arash Rafiey, Mohammad Sorkhpar |
Vertex Ordering with Precedence Constraints. |
FCT |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Samy Abbes |
Convergence of Distributions on Paths. |
FCT |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Zohair Raza Hassan, Edith Hemaspaandra, Stanislaw P. Radziszowski |
The Complexity of (Pk, Pℓ )-Arrowing. |
FCT |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | William S. Evans, David G. Kirkpatrick |
Minimizing Query Frequency to Bound Congestion Potential for Moving Entities at a Fixed Target Time. |
FCT |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniela Bubboloni, Costanza Catalano, Andrea Marino 0001, Ana Silva 0001 |
On Computing Optimal Temporal Branchings. |
FCT |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Carlos Alegría, Justin Dallant, Pablo Pérez-Lantero, Carlos Seara |
The Rectilinear Convex Hull of Line Segments. |
FCT |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Henning Fernau, Klaus Jansen (eds.) |
Fundamentals of Computation Theory - 24th International Symposium, FCT 2023, Trier, Germany, September 18-21, 2023, Proceedings |
FCT |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Ajinkya Gaikwad, Soumen Maity |
Parameterized Complexity of the Th+1-Free Edge Deletion Problem. |
FCT |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Feston Kastrati, Wendy J. Myrvold, Lucas D. Panjer, Aaron Williams |
Cordial Forests. |
FCT |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Fabian Frei, David Wehner |
Bounds for c-Ideal Hashing. |
FCT |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Joshua A. Grochow, Michael Levet |
On the Parallel Complexity of Group Isomorphism via Weisfeiler-Leman. |
FCT |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Johannes Rauch, Dieter Rautenbach, Uéverton S. Souza |
Exact and Parameterized Algorithms for the Independent Cutset Problem. |
FCT |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Dipayan Chakraborty, R. B. Sandeep |
Contracting Edges to Destroy a Pattern: A Complexity Study. |
FCT |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Lamar Chidiac, Santiago Guzmán-Pro, Winfried Hochstättler, Anthony Youssef |
An Efficient Computation of the Rank Function of a Positroid. |
FCT |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomoyuki Yamakami |
Power of Counting by Nonuniform Families of Polynomial-Size Finite Automata. |
FCT |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Berglund, Henrik Björklund, Johanna Björklund |
Parsing Unranked Tree Languages, Folded Once. |
FCT |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Zack Fitzsimmons, Edith Hemaspaandra |
Complexity of Conformant Election Manipulation. |
FCT |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Chris Köcher, Dietrich Kuske |
Forwards- and Backwards-Reachability for Cooperating Multi-pushdown Systems. |
FCT |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Dibyayan Chakraborty, Florent Foucaud, Anni Hakanen |
Distance-Based Covering Problems for Graphs of Given Cyclomatic Number. |
FCT |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Philip Kaelbling, Dakotah Lambert, Jeffrey Heinz |
Robust Identification in the Limit from Incomplete Positive Data. |
FCT |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Marc Neveling, Jörg Rothe, Robin Weishaupt |
The Possible Winner Problem with Uncertain Weights Revisited. |
FCT |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Borowiecki, Dariusz Dereniowski, Dorota Osula |
The Complexity of Bicriteria Tree-Depth. |
FCT |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicolas Bousquet, Alice Joffard |
TS-Reconfiguration of Dominating Sets in Circle and Circular-Arc Graphs. |
FCT |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Sanjana Dey, Anil Maheshwari, Subhas C. Nandy |
Minimum Consistent Subset Problem for Trees. |
FCT |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Alessio Conte, Roberto Grossi, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis, Giulia Punzi |
Beyond the BEST Theorem: Fast Assessment of Eulerian Trails. |
FCT |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Jin-Yi Cai, Austen Z. Fan, Yin Liu |
Bipartite 3-Regular Counting Problems with Mixed Signs. |
FCT |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Kyrill Winkler, Ulrich Schmid 0001, Thomas Nowak |
Valency-Based Consensus Under Message Adversaries Without Limit-Closure. |
FCT |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman 0001 |
Faster FPT Algorithms for Deletion to Pairs of Graph Classes. |
FCT |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicolas Maack, Hendrik Molter, Rolf Niedermeier, Malte Renken |
On Finding Separators in Temporal Split and Permutation Graphs. |
FCT |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Svein Høgemo, Benjamin Bergougnoux, Ulrik Brandes, Christophe Paul, Jan Arne Telle |
On Dasgupta's Hierarchical Clustering Objective and Its Relation to Other Graph Parameters. |
FCT |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Nobuko Yoshida, Fangyi Zhou 0002, Francisco Ferreira 0001 |
Communicating Finite State Machines and an Extensible Toolchain for Multiparty Session Types. |
FCT |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Christophe Crespelle |
Linear-Time Minimal Cograph Editing. |
FCT |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Lohrey |
Complexity of Word Problems for HNN-Extensions. |
FCT |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Jesper Jansson 0001, Wing Lik Lee |
Fast Algorithms for the Rooted Triplet Distance Between Caterpillars. |
FCT |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan Bok, Jirí Fiala 0001, Nikola Jedlicková, Jan Kratochvíl, Michaela Seifrtová |
Computational Complexity of Covering Disconnected Multigraphs. |
FCT |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Leupold, Sebastian Maneth |
Deciding Top-Down Determinism of Regular Tree Languages. |
FCT |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Henning Fernau, Kshitij Gajjar |
The Space Complexity of Sum Labelling. |
FCT |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Allen Ibiapina, Ana Silva 0001 |
Mengerian Temporal Graphs Revisited. |
FCT |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Hoffmann 0001 |
Computational Complexity of Synchronization Under Sparse Regular Constraints. |
FCT |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Hermann Gruber, Markus Holzer 0001, Simon Wolfsteiner |
On Minimizing Regular Expressions Without Kleene Star. |
FCT |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Vrunda Dave, Taylor Dohmen, Shankara Narayanan Krishna, Ashutosh Trivedi 0001 |
Regular Model Checking with Regular Relations. |
FCT |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Kristoffer Arnsfelt Hansen, Troels Bjerre Lund |
Computational Complexity of Computing a Quasi-Proper Equilibrium. |
FCT |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Max Bender, Jacob Gilbert, Kirk Pruhs |
A Poly-log Competitive Posted-Price Algorithm for Online Metrical Matching on a Spider. |
FCT |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Evripidis Bampis, Aris Pagourtzis (eds.) |
Fundamentals of Computation Theory - 23rd International Symposium, FCT 2021, Athens, Greece, September 12-15, 2021, Proceedings |
FCT |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Hugo Gimbert, Claire Mathieu, Simon Mauras |
Two-Sided Matching Markets with Strongly Correlated Preferences. |
FCT |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Maciej Skorski |
Concentration of the Collision Estimator. |
FCT |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Bharat Adsul, Saptarshi Sarkar 0001, A. V. Sreejith |
First-Order Logic and Its Infinitary Quantifier Extensions over Countable Words. |
FCT |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Jelle J. Oostveen, Erik Jan van Leeuwen |
Streaming Deletion Problems Parameterized by Vertex Cover. |
FCT |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | S. Raja 0001, G. V. Sumukha Bharadwaj |
On the Hardness of the Determinant: Sum of Regular Set-Multilinear Circuits. |
FCT |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Miroslav Chodil, Antonín Kucera 0001 |
The Satisfiability Problem for a Quantitative Fragment of PCTL. |
FCT |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Lukas Behrendt, Katrin Casel, Tobias Friedrich 0001, J. A. Gregor Lagodzinski, Alexander Löser, Marcus Wilhelm |
From Symmetry to Asymmetry: Generalizing TSP Approximations by Parametrization. |
FCT |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Joseph Livesey, Dominik Wojtczak |
Propositional Gossip Protocols. |
FCT |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | David Eppstein, Siddharth Gupta 0002, Elham Havvaei |
Parameterized Complexity of Finding Subgraphs with Hereditary Properties on Hereditary Graph Classes. |
FCT |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Leszek Antoni Gasieniec, Jesper Jansson 0001, Christos Levcopoulos (eds.) |
Fundamentals of Computation Theory - 22nd International Symposium, FCT 2019, Copenhagen, Denmark, August 12-14, 2019, Proceedings |
FCT |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Miroslaw Kowaluk, Andrzej Lingas |
Rare Siblings Speed-Up Deterministic Detection and Counting of Small Pattern Graphs. |
FCT |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, Frank Fuhlbrück, Johannes Köbler, Oleg Verbitsky 0001 |
On Weisfeiler-Leman Invariance: Subgraph Counts and Related Graph Properties. |
FCT |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Lohrey, Sebastian Maneth |
Largest Common Prefix of a Regular Tree Language. |
FCT |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Libor Barto |
Algebraic Theory of Promise Constraint Satisfaction Problems, First Steps. |
FCT |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Duygu Vietz, Egon Wanke |
The Fault-Tolerant Metric Dimension of Cographs. |
FCT |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Panagiotis Charalampopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba |
Circular Pattern Matching with k Mismatches. |
FCT |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Bärtschi, Stephan J. Eidenbenz |
Deterministic Preparation of Dicke States. |
FCT |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Dominique Schmitt |
Bivariate B-Splines from Convex Pseudo-circle Configurations. |
FCT |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora |
Extension of Some Edge Graph Problems: Standard and Parameterized Complexity. |
FCT |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Bernard Chazelle |
Some Observations on Dynamic Random Walks and Network Renormalization. |
FCT |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Frank Gurski, Dominique Komander, Carolin Rehs |
Computing Digraph Width Measures on Directed Co-graphs - (Extended Abstract). |
FCT |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Kozachinskiy, Alexander Shen |
Two Characterizations of Finite-State Dimension. |
FCT |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Coester, Thomas Schwentick, Martin Schuster |
Winning Strategies for Streaming Rewriting Games. |
FCT |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Iago A. Carvalho, Thomas Erlebach, Kleitos Papadopoulos |
An Efficient Algorithm for the Fast Delivery Problem. |
FCT |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Riccardo Dondi, Manuel Lafond |
On the Tractability of Covering a Graph with 2-Clubs. |
FCT |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Torben Hagerup |
Highly Succinct Dynamic Data Structures. |
FCT |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | |
Complete Disjoint CoNP-Pairs but No Complete Total Polynomial Search Problems Relative to an Oracle. |
FCT |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Carl Feghali, Matthew Johnson 0002, Giacomo Paesani, Daniël Paulusma |
On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest. |
FCT |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Jesús Domínguez, Maribel Fernández |
Nominal Syntax with Atom Substitutions: Matching, Unification, Rewriting. |
FCT |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Gianluca De Marco, Tomasz Jurdzinski, Dariusz R. Kowalski |
Optimal Channel Utilization with Limited Feedback. |
FCT |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Sankardeep Chakraborty, Anish Mukherjee 0001, Srinivasa Rao Satti |
Space Efficient Algorithms for Breadth-Depth Search. |
FCT |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Bireswar Das, Shivdutt Sharma, P. R. Vaidyanathan |
Succinct Representations of Finite Groups. |
FCT |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Hernán González-Aguilar, David Orden, Pablo Pérez-Lantero, David Rappaport, Carlos Seara, Javier Tejel, Jorge Urrutia |
Maximum Rectilinear Convex Subsets. |
FCT |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Klonowski, Dariusz R. Kowalski, Jaroslaw Mirek, Prudence W. H. Wong |
Fault-Tolerant Parallel Scheduling of Arbitrary Length Jobs on a Shared Channel. |
FCT |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Indranil Banerjee, Dana Richards |
New Results on Routing via Matchings on Graphs. |
FCT |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Christof Löding, Christopher Spinrath |
Decision Problems for Subclasses of Rational Relations over Finite and Infinite Words. |
FCT |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Albert Atserias, Phokion G. Kolaitis, Simone Severini |
Generalized Satisfiability Problems via Operator Assignments. |
FCT |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Anurag Anshu, Peter Høyer, Mehdi Mhalla, Simon Perdrix |
Contextuality in Multipartite Pseudo-Telepathy Graph Games. |
FCT |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Dariusz Dereniowski, Andrzej Lingas, Mia Persson, Dorota Urbanska, Pawel Zylinski |
The Snow Team Problem - (Clearing Directed Subgraphs by Mobile Agents). |
FCT |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Gianluca De Marco, Tomasz Jurdzinski, Michal Rózanski, Grzegorz Stachowiak |
Subquadratic Non-adaptive Threshold Group Testing. |
FCT |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Till Fluschnik, Marco Morik, Manuel Sorge |
The Complexity of Routing with Few Collisions. |
FCT |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Holger Petersen 0001 |
Busy Beaver Scores and Alphabet Size. |
FCT |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Max I. Kanovich, Stepan L. Kuznetsov, Andre Scedrov |
Undecidability of the Lambek Calculus with Subexponential and Bracket Modalities. |
FCT |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Endre Boros, Ondrej Cepek, Kazuhisa Makino |
Strong Duality in Horn Minimization. |
FCT |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Colcombet, Laure Daviaud, Florian Zuleger |
Automata and Program Analysis. |
FCT |
2017 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")
data released under the ODC-BY 1.0 license