| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Aleksander B. G. Christiansen, Jacob Holm, Eva Rotenberg, Carsten Thomassen |
On Dynamic α + 1 Arboricity Decomposition and Out-Orientation.  |
MFCS  |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexandre Clément, Simon Perdrix |
Resource Optimisation of Coherently Controlled Quantum Computations with the PBS-Calculus. |
MFCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Lohrey, Lukas Lück |
Streaming Word Problems. |
MFCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Jérémie Chalopin, Victor Chepoi, Fionn Mc Inerney, Sébastien Ratel, Yann Vaxès |
Sample Compression Schemes for Balls in Graphs. |
MFCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Masahiro Takahashi, Kunihiro Wasa |
Independent Set Reconfiguration on Directed Graphs. |
MFCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Jingyang Zhao 0001, Mingyu Xiao 0001, Chao Xu 0002 |
Improved Approximation Algorithms for the Traveling Tournament Problem. |
MFCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Dmitry Chistikov 0001, Christoph Haase, Zahra Hadizadeh, Alessio Mansutti |
Higher-Order Quantified Boolean Satisfiability. |
MFCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Samson Abramsky, Dan Marsden |
Comonadic semantics for hybrid logic. |
MFCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Bullinger |
Boundaries to Single-Agent Stability in Additively Separable Hedonic Games. |
MFCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Tim A. Hartmann, Stefan Lendl |
Dispersing Obnoxious Facilities on Graphs by Rounding Distances. |
MFCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Supratik Chakraborty, S. Akshay 0001 |
On Synthesizing Computable Skolem Functions for First Order Logic. |
MFCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Mingyang Gong, Jing Fan, Guohui Lin, Eiji Miyano |
Approximation Algorithms for Covering Vertices by Long Paths. |
MFCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Julian D'Costa, Engel Lefaucheux, Eike Neumann, Joël Ouaknine, James Worrell 0001 |
Bounding the Escape Time of a Linear Dynamical System over a Compact Semialgebraic Set. |
MFCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuri Bilu, Florian Luca, Joris Nieuwveld, Joël Ouaknine, David Purser, James Worrell 0001 |
Skolem Meets Schanuel. |
MFCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | David Auger, Pierre Coucheney, Loric Duhaze |
Polynomial Time Algorithm for ARRIVAL on Tree-Like Multigraphs. |
MFCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Olivier Carton, Gaëtan Douéneau-Tabot |
Continuous Rational Functions Are Deterministic Regular. |
MFCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Hoàng-Oanh Le, Van Bang Le |
Complexity of the Cluster Vertex Deletion Problem on H-Free Graphs. |
MFCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr Gregor, Arturo I. Merino, Torsten Mütze |
The Hamilton Compression of Highly Symmetric Graphs. |
MFCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Adam Ó Conghaile |
Cohomology in Constraint Satisfaction and Structure Isomorphism. |
MFCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Ruiwen Dong 0001 |
On the Identity Problem for Unitriangular Matrices of Dimension Four. |
MFCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Michel Rigo, Manon Stipulanti, Markus A. Whiteland |
On Extended Boundary Sequences of Morphic and Sturmian Words. |
MFCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Aram Berendsohn, Simona Boyadzhiyska, László Kozma 0002 |
Fixed-Point Cycles and Approximate EFX Allocations. |
MFCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Esther Galby, Liana Khazaliya, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale |
Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters. |
MFCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | C. S. Bhargav, Sagnik Dutta, Nitin Saxena 0001 |
Improved Lower Bound, and Proof Barrier, for Constant Depth Algebraic Circuits. |
MFCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | M. S. Ramanujan 0001, Abhishek Sahu, Saket Saurabh 0001, Shaily Verma |
An Exact Algorithm for Knot-Free Vertex Deletion. |
MFCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Colcombet, Arthur Jaquard |
A Complexity Approach to Tree Algebras: the Polynomial Case. |
MFCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Yijia Chen, Jörg Flum, Mingjun Liu, Zhiyang Xun |
On Algorithms Based on Finitely Many Homomorphism Counts. |
MFCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicolas El Maalouly, Raphael Steiner |
Exact Matching in Graphs of Bounded Independence Number. |
MFCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Komusiewicz, Nils Morawietz |
Finding 3-Swap-Optimal Independent Sets and Dominating Sets Is Hard. |
MFCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Julian D'Costa, Toghrul Karimov, Rupak Majumdar, Joël Ouaknine, Mahmoud Salamati, James Worrell 0001 |
The Pseudo-Reachability Problem for Diagonalisable Linear Dynamical Systems. |
MFCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Mo Liu 0002, Anantha Padmanabha, R. Ramanujam 0001, Yanjing Wang 0001 |
Generalized Bundled Fragments for First-Order Modal Logic. |
MFCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Paloma T. Lima, Vinícius Fernandes dos Santos, Ignasi Sau, Uéverton S. Souza, Prafullkumar Tale |
Reducing the Vertex Cover Number via Edge Contractions. |
MFCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Monika Henzinger |
Modern Dynamic Data Structures (Invited Talk). |
MFCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Dmitry Itsykson, Artur Riazanov |
Automating OBDD proofs is NP-hard. |
MFCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Antoine Amarilli, Mikaël Monet |
Weighted Counting of Matchings in Unbounded-Treewidth Graph Families. |
MFCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Vijay V. Vazirani |
Online Bipartite Matching and Adwords (Invited Talk). |
MFCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Panagiotis Kanellopoulos, Maria Kyropoulou, Alexandros A. Voudouris |
Not All Strangers Are the Same: The Impact of Tolerance in Schelling Games. |
MFCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Zhuan Khye Koh, Georg Loho |
Beyond Value Iteration for Parity Games: Strategy Iteration with Universal Trees. |
MFCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Lane A. Hemaspaandra, Mandar Juvekar, Arian Nadjimzadah, Patrick A. Phillips |
Gaps, Ambiguity, and Establishing Complexity-Class Containments via Iterative Constant-Setting. |
MFCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Marta Kwiatkowska, Gethin Norman, David Parker 0001, Gabriel Santos, Rui Yan 0002 |
Probabilistic Model Checking for Strategic Equilibria-Based Decision Making: Advances and Challenges (Invited Talk). |
MFCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Gregory Emdin, Alexander S. Kulikov, Ivan Mihajlin, Nikita Slezkin |
CNF Encodings of Parity. |
MFCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Mingyang Deng, Virginia Vassilevska Williams, Ziqian Zhong |
New Lower Bounds and Upper Bounds for Listing Avoidable Vertices. |
MFCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Dominik Bojko, Karol Gotfryd, Dariusz R. Kowalski, Dominik Pajak |
Tree Exploration in Dual-Memory Model. |
MFCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Nina Klobas, George B. Mertzios, Hendrik Molter, Paul G. Spirakis |
The Complexity of Computing Optimum Labelings for Temporal Connectivity. |
MFCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Rabinovich |
On Uniformization in the Full Binary Tree. |
MFCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthew Earnshaw, Pawel Sobocinski 0001 |
Regular Monoidal Languages. |
MFCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Duncan Adamson, Argyrios Deligkas, Vladimir V. Gusev, Igor Potapov |
The Complexity of Periodic Energy Minimisation. |
MFCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Radovan Cervený, Pratibha Choudhary, Ondrej Suchý |
On Kernels for d-Path Vertex Cover. |
MFCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Florian Luca, Joël Ouaknine, James Worrell 0001 |
A Universal Skolem Set of Positive Lower Density. |
MFCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Will Simmons, Aleks Kissinger |
Higher-Order Causal Theories Are Models of BV-Logic. |
MFCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Guido Brückner, Ignaz Rutter, Peter Stumpf |
Extending Partial Representations of Circle Graphs in Near-Linear Time. |
MFCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Dominik Peteler, Karin Quaas |
Deciding Emptiness for Constraint Automata on Strings with the Prefix and Suffix Order. |
MFCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Nadia Creignou, Arnaud Durand 0001, Heribert Vollmer |
Enumeration Classes Defined by Circuits. |
MFCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Amotz Bar-Noy, David Peleg, Mor Perry, Dror Rawitz |
Graph Realization of Distance Sets. |
MFCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Anton Ehrmanntraut, Fabian Egidy, Christian Glaßer |
Oracle with P = NP ∩ coNP, but No Many-One Completeness in UP, DisjNP, and DisjCoNP. |
MFCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexandre Fernandez, Luidnel Maignan, Antoine Spicher |
Non-Determinism in Lindenmayer Systems and Global Transformations. |
MFCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov |
Long Cycles in Graphs: Extremal Combinatorics Meets Parameterized Algorithms (Invited Talk). |
MFCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Timo Gervens, Martin Grohe |
Graph Similarity Based on Matrix Norms. |
MFCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Amotz Bar-Noy, Toni Böhnlein, David Peleg, Dror Rawitz |
On the Role of the High-Low Partition in Realizing a Degree Sequence by a Bipartite Graph. |
MFCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Szeider, Robert Ganian, Alexandra Silva 0001 (eds.) |
47th International Symposium on Mathematical Foundations of Computer Science, MFCS 2022, August 22-26, 2022, Vienna, Austria. |
MFCS |
2022 |
DBLP BibTeX RDF |
|
| 1 | Sriram Bhyravarapu, Subrahmanyam Kalyanasundaram, Rogers Mathew |
Conflict-Free Coloring on Claw-Free Graphs and Interval Graphs. |
MFCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Gal Beniamini |
Algebraic Representations of Unique Bipartite Perfect Matching. |
MFCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Patrizio Angelini, Michael A. Bekos, Julia Katheder, Michael Kaufmann 0001, Maximilian Pfister 0002 |
RAC Drawings of Graphs with Low Degree. |
MFCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Ronald Fagin, Jonathan Lenchner, Nikhil Vyas 0001, R. Ryan Williams |
On the Number of Quantifiers as a Complexity Measure. |
MFCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Lohrey, Andreas Rosowski, Georg Zetzsche |
Membership Problems in Finite Groups. |
MFCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Ilario Bonacina, Nicola Galesi, Massimo Lauria |
On Vanishing Sums of Roots of Unity in Polynomial Calculus and Sum-Of-Squares. |
MFCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Niclas Boehmer, Klaus Heeger, Rolf Niedermeier |
Deepening the (Parameterized) Complexity Analysis of Incremental Stable Matching Problems. |
MFCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Seiichiro Tani |
Space-Bounded Unitary Quantum Computation with Postselection. |
MFCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Patrizio Angelini, Steven Chaplick, Sabine Cornelsen, Giordano Da Lozzo |
On Upward-Planar L-Drawings of Graphs. |
MFCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Dariusz Dereniowski, Izajasz P. Wrosz |
Constant-Factor Approximation Algorithm for Binary Search in Trees with Monotonic Query Times. |
MFCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Ishay Haviv, Michal Parnas |
On the Binary and Boolean Rank of Regular Matrices. |
MFCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Jedrzej Kolodziejski, Bartek Klin |
Countdown μ-Calculus. |
MFCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Jin-Yi Cai, Daniel P. Szabo |
Bounded Degree Nonnegative Counting CSP. |
MFCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert I. Booth, Titouan Carette |
Complete ZX-Calculi for the Stabiliser Fragment in Odd Prime Dimensions. |
MFCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Shibashis Guha, Ismaël Jecker, Karoliina Lehtinen, Martin Zimmermann 0002 |
A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct. |
MFCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Christoph Haase, Alessio Mansutti |
On Deciding Linear Arithmetic Constraints Over p-adic Integers for All Primes. |
MFCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Siddharth Bhaskar, Robin Kaarsgaard |
Graph Traversals as Universal Constructions. |
MFCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Stelios Tsampas 0001, Christian Williams, Andreas Nuyts, Dominique Devriese, Frank Piessens |
Abstract Congruence Criteria for Weak Bisimilarity. |
MFCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Anuj Dawar, Danny Vagnozzi |
On the Relative Power of Linear Algebraic Approximations of Graph Isomorphism. |
MFCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Caroline Mattes, Armin Weiß |
Parallel Algorithms for Power Circuits and the Word Problem of the Baumslag Group. |
MFCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Nils Morawietz, Petra Wolf 0002 |
A Timecop's Chase Around the Table. |
MFCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Samir Datta, Kishlaya Jaiswal |
Parallel Polynomial Permanent Mod Powers of 2 and Shortest Disjoint Cycles. |
MFCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Kevin Buchin, Maarten Löffler, Aleksandr Popov 0001, Marcel Roeloffzen |
Uncertain Curve Simplification. |
MFCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Guillaume Ducoffe |
Isometric Embeddings in Trees and Their Use in Distance Problems. |
MFCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Renaud Vilmart |
Quantum Multiple-Valued Decision Diagrams in Graphical Calculi. |
MFCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Julian D'Costa, Engel Lefaucheux, Eike Neumann, Joël Ouaknine, James Worrell 0001 |
On the Complexity of the Escape Problem for Linear Dynamical Systems over Compact Semialgebraic Sets. |
MFCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Bader Abu Radi, Orna Kupferman, Ofer Leshkowitz |
A Hierarchy of Nondeterminism. |
MFCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Max A. Deppert, Klaus Jansen, Kim-Manuel Klein |
Fuzzy Simultaneous Congruences. |
MFCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Kaminski, Igor E. Shparlinski |
Sets of Linear Forms Which Are Hard to Compute. |
MFCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Marie Fortin, Louwe B. Kuijer, Patrick Totzke, Martin Zimmermann 0002 |
HyperLTL Satisfiability Is Σ₁¹-Complete, HyperCTL* Satisfiability Is Σ₁²-Complete. |
MFCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | |
Front Matter, Table of Contents, Preface, Conference Organization. |
MFCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Silvia Butti, Víctor Dalmau |
Fractional Homomorphism, Weisfeiler-Leman Invariance, and the Sherali-Adams Hierarchy for the Constraint Satisfaction Problem. |
MFCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Hermann Gruber, Markus Holzer 0001 |
Optimal Regular Expressions for Palindromes of Given Length. |
MFCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Hausmann 0001, Stefan Milius, Lutz Schröder |
A Linear-Time Nominal μ-Calculus with Name Allocation. |
MFCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Celina M. H. de Figueiredo, Alexsander Andrade de Melo, Fabiano de S. Oliveira, Ana Silva 0001 |
Maximum Cut on Interval Graphs of Interval Count Four Is NP-Complete. |
MFCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Eva Rotenberg |
On Dynamic Graphs (Invited Talk). |
MFCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Giacomo Paesani, Daniël Paulusma, Pawel Rzazewski |
Feedback Vertex Set and Even Cycle Transversal for H-Free Graphs: Finding Large Block Graphs. |
MFCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Satyadev Nandakumar, Subin Pulari |
Ergodic Theorems and Converses for PSPACE Functions. |
MFCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Kevin Buchin, Mart Hagedoorn, Irina Kostitsyna, Max van Mulken |
Dots & Boxes Is PSPACE-Complete. |
MFCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr Jancar, Jirí Síma |
The Simplest Non-Regular Deterministic Context-Free Language. |
MFCS |
2021 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")
data released under the ODC-BY 1.0 license