| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Matthew Hague, Roland Meyer 0001, Sebastian Muskalla, Martin Zimmermann 0002 |
Parity to Safety in Polynomial Time for Pushdown and Collapsible Pushdown Systems.  |
MFCS  |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Mikhail Andreev, Gleb Posobin, Alexander Shen |
Plain Stopping Time and Conditional Complexities Revisited. |
MFCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Pinar Heggernes, Davis Issac, Juho Lauri, Paloma T. Lima, Erik Jan van Leeuwen |
Rainbow Vertex Coloring Bipartite Graphs and Chordal Graphs. |
MFCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Manuel Bodirsky, Barnaby Martin, Marcello Mamino, Antoine Mottet |
The Complexity of Disjunctive Linear Diophantine Constraints. |
MFCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Akitoshi Kawamura, Holger Thies, Martin Ziegler 0001 |
Average-Case Polynomial-Time Computability of Hamiltonian Dynamics. |
MFCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Stéphane Le Roux 0001 |
Concurrent Games and Semi-Random Determinacy. |
MFCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Hamburger, Ross M. McConnell, Attila Pór, Jeremy P. Spinrad, Zhisheng Xu |
Double Threshold Digraphs. |
MFCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Kozachinskiy |
From Expanders to Hitting Distributions and Simulation Theorems. |
MFCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Mamadou Moustapha Kanté, Kaveh Khoshkhah, Mozhgan Pourmoradnasseri |
Enumerating Minimal Transversals of Hypergraphs without Small Holes. |
MFCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Guy Avni, Shibashis Guha, Orna Kupferman |
Timed Network Games with Clocks. |
MFCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Bärtschi, Daniel Graf 0001, Matús Mihalák |
Collective Fast Delivery by Energy-Efficient Agents. |
MFCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Kazuyuki Amano |
Depth Two Majority Circuits for Majority and List Expanders. |
MFCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Göbel 0001, J. A. Gregor Lagodzinski, Karen Seidel 0001 |
Counting Homomorphisms to Trees Modulo a Prime. |
MFCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Costanza Catalano, Raphaël M. Jungers |
On Randomized Generation of Slowly Synchronizing Automata. |
MFCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Marco Aldi, Niel de Beaudrap, Sevag Gharibian, Seyran Saeedi |
On Efficiently Solvable Cases of Quantum k-SAT. |
MFCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Francesco Cellinese, Gianlorenzo D'Angelo, Gianpiero Monaco, Yllka Velaj |
Generalized Budgeted Submodular Set Function Maximization. |
MFCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Jenish C. Mehta |
Tree Tribes and Lower Bounds for Switching Lemmas. |
MFCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Mareike Dressler, Adam Kurpisz, Timo de Wolff |
Optimization over the Boolean Hypercube via Sums of Nonnegative Circuit Polynomials. |
MFCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Erlebach, Jakob T. Spooner |
Faster Exploration of Degree-Bounded Temporal Graphs. |
MFCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Hendrik Fichtenberger, Yadu Vasudev |
A Two-Sided Error Distributed Property Tester For Conductance. |
MFCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Louisa Seelbach Benkner, Markus Lohrey |
Average Case Analysis of Leaf-Centric Binary Tree Sources. |
MFCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Titus Dose |
Balance Problems for Integer Circuits. |
MFCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin R. Moore, Naomi Nishimura, Vijay Subramanya |
Reconfiguration of Graph Minors. |
MFCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Ralph Christian Bottesch |
On W[1]-Hardness as Evidence for Intractability. |
MFCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis |
Binary Search in Graphs Revisited. |
MFCS |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Katrin Casel, Henning Fernau, Alexander Grigoriev, Markus L. Schmid, Sue Whitesides |
Combinatorial Properties and Recognition of Unit Square Visibility Graphs. |
MFCS |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Ludmila Glinskih, Dmitry Itsykson |
Satisfiable Tseitin Formulas Are Hard for Nondeterministic Read-Once Branching Programs. |
MFCS |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Durand 0001, Andrei E. Romashchenko |
On the Expressive Power of Quasiperiodic SFT. |
MFCS |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Xiaotie Deng, Yansong Gao, Jie Zhang 0008 |
Smoothed and Average-Case Approximation Ratios of Mechanisms: Beyond the Worst-Case Analysis. |
MFCS |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Filippo Cavallari, Henryk Michalewski, Michal Skrzypczak |
A Characterisation of Pi^0_2 Regular Tree Languages. |
MFCS |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Laure Daviaud, Pierre Guillon 0001, Glenn Merlet |
Comparison of Max-Plus Automata and Joint Spectral Radius of Tropical Matrices. |
MFCS |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Laure Daviaud, Marianne Johnson |
The Shortest Identities for Max-Plus Automata with Two States. |
MFCS |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Eduard Eiben, Danny Hermelin, M. S. Ramanujan 0001 |
Lossy Kernels for Hitting Subgraphs. |
MFCS |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Catarina Carvalho, Barnaby Martin, Dmitriy Zhuk |
The Complexity of Quantified Constraints Using the Algebraic Formulation. |
MFCS |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | |
Front Matter, Table of Contents, Preface, Conference Organization. |
MFCS |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Ruggero Lanotte, Massimo Merro, Simone Tini |
Compositional Weak Metrics for Group Key Update. |
MFCS |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomoyuki Yamakami |
The 2CNF Boolean Formula Satisfiability Problem and the Linear Space Hypothesis. |
MFCS |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Sushmita Gupta, Sanjukta Roy, Saket Saurabh 0001, Meirav Zehavi |
Parameterized Algorithms and Kernels for Rainbow Matching. |
MFCS |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Colcombet, Daniela Petrisan |
Automata in the Category of Glued Vector Spaces. |
MFCS |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Nathan Grosshans, Pierre McKenzie, Luc Segoufin |
The Power of Programs over Monoids in DA. |
MFCS |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Shankara Narayanan Krishna, Khushraj Madnani, Paritosh K. Pandya |
Making Metric Temporal Logic Rational. |
MFCS |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Eric Allender, Shuichi Hirahara |
New Insights on the (Non-)Hardness of Circuit Minimization and Related Problems. |
MFCS |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Henning Urbat, Jirí Adámek, Liang-Ting Chen 0001, Stefan Milius |
Eilenberg Theorems for Free. |
MFCS |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Simina Brânzei, Aris Filos-Ratsikas, Peter Bro Miltersen, Yulong Zeng |
Walrasian Pricing in Multi-Unit Auctions. |
MFCS |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Krishnendu Chatterjee, Monika Henzinger, Alexander Svozil |
Faster Algorithms for Mean-Payoff Parity Games. |
MFCS |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Samson Abramsky, Rui Soares Barbosa, Nadish de Silva, Octavio Zapata |
The Quantum Monad on Relational Structures. |
MFCS |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos |
Structured Connectivity Augmentation. |
MFCS |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Guillaume Lagarde, Nutan Limaye, Srikanth Srinivasan 0001 |
Lower Bounds and PIT for Non-Commutative Arithmetic Circuits with Restricted Parse Trees. |
MFCS |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Krishnendu Chatterjee, Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen |
Strategy Complexity of Concurrent Safety Games. |
MFCS |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean-Daniel Boissonnat, Kunal Dutta, Arijit Ghosh, Sudeshna Kolay |
Kernelization of the Subset General Position Problem in Geometry. |
MFCS |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Emmanuel Jeandel, Simon Perdrix, Renaud Vilmart, Quanlong Wang |
ZX-Calculus: Cyclotomic Supplementarity and Incompleteness for Clifford+T Quantum Mechanics. |
MFCS |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Erik Paul |
Monitor Logics for Quantitative Monitor Automata. |
MFCS |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Dominik Barth, Moritz Beck 0001, Titus Dose, Christian Glaßer, Larissa Michler, Marc Technau |
Emptiness Problems for Integer Circuits. |
MFCS |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Akinori Kawachi, Mitsunori Ogihara, Kei Uchizawa |
Generalized Predecessor Existence Problems for Boolean Finite Dynamical Systems. |
MFCS |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Neil Lutz |
Fractal Intersections and Products via Algorithmic Dimension. |
MFCS |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Ping Lu 0007, Zhilin Wu, Haiming Chen |
The Complexity of SORE-definability Problems. |
MFCS |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Hartmut Klauck |
The Complexity of Quantum Disjointness. |
MFCS |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Damaschke |
Dividing Splittable Goods Evenly and With Limited Fragmentation. |
MFCS |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Palash Dey, Neeldhara Misra |
On the Exact Amount of Missing Information that Makes Finding Possible Winners Hard. |
MFCS |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | George B. Mertzios, André Nichterlein, Rolf Niedermeier |
The Power of Linear-Time Data Reduction for Maximum Matching. |
MFCS |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Guy Avni, Shibashis Guha, Orna Kupferman |
Timed Network Games. |
MFCS |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuka Tanimura, Takaaki Nishimoto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda |
Small-Space LCE Data Structure with Constant-Time Queries. |
MFCS |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Irene Muzi, Michael P. O'Brien, Felix Reidl, Blair D. Sullivan |
Being Even Slightly Shallow Makes Life Hard. |
MFCS |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Simon Castellan, Pierre Clairambault, Glynn Winskel |
Distributed Strategies Made Easy. |
MFCS |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Kim G. Larsen, Hans L. Bodlaender, Jean-François Raskin (eds.) |
42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017, August 21-25, 2017 - Aalborg, Denmark |
MFCS |
2017 |
DBLP BibTeX RDF |
|
| 1 | Akanksha Agrawal 0001 |
Fine-Grained Complexity of Rainbow Coloring and its Variants. |
MFCS |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Emanuel Kieronski, Antti Kuusisto |
One-Dimensional Logic over Trees. |
MFCS |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Michal Pilipczuk |
On Definable and Recognizable Properties of Graphs of Bounded Treewidth (Invited Talk). |
MFCS |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Manfred Droste, Stefan Dück, Dino Mandrioli, Matteo Pradella |
Weighted Operator Precedence Languages. |
MFCS |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Gianlorenzo D'Angelo, Lorenzo Severini, Yllka Velaj |
Selecting Nodes and Buying Links to Maximize the Information Diffusion in a Network. |
MFCS |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Milanic, Peter Mursic, Marcelo Mydlarz |
Induced Embeddings into Hamming Graphs. |
MFCS |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou 0001 |
Parameterized Complexity of the List Coloring Reconfiguration Problem with Graph Parameters. |
MFCS |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Jonsson, Victor Lagerkvist, Biman Roy |
Time Complexity of Constraint Satisfaction via Universal Algebra. |
MFCS |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | S. Akshay 0001, Nikhil Balaji, Nikhil Vyas 0001 |
Complexity of Restricted Variants of Skolem and Related Problems. |
MFCS |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Enric Cosme-Llópez, Damien Pous |
K4-free Graphs as a Free Algebra. |
MFCS |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Sudeshna Kolay, Fahad Panolan, Saket Saurabh 0001 |
Communication Complexity of Pairs of Graph Families with Applications. |
MFCS |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, Rajit Datta, Partha Mukhopadhyay, S. Raja 0001 |
Efficient Identity Testing and Polynomial Factorization in Nonassociative Free Rings. |
MFCS |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Mohamed Faouzi Atig, Roland Meyer 0001, Sebastian Muskalla, Prakash Saivasan |
On the Upward/Downward Closures of Petri Nets. |
MFCS |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Michal Pilipczuk, Erik Jan van Leeuwen, Andreas Wiese |
Approximation and Parameterized Algorithms for Geometric Independent Set with Shrinking. |
MFCS |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Austin J. Parker, Kelly B. Yancey, Matthew P. Yancey |
Regular Language Distance and Entropy. |
MFCS |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Narayan Vikas |
Computational Complexity of Graph Partition under Vertex-Compaction to an Irreflexive Hexagon. |
MFCS |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Meena Mahajan, Prajakta Nimbhorkar, Anuj Tawari |
Computing the Maximum using (min, +) Formulas. |
MFCS |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexandre Blanché, Konrad K. Dabrowski, Matthew Johnson 0002, Vadim V. Lozin, Daniël Paulusma, Viktor Zamaraev |
Clique-Width for Graph Classes Closed under Complementation. |
MFCS |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Thijs Laarhoven |
Hypercube LSH for Approximate near Neighbors. |
MFCS |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthew Hague, Roland Meyer 0001, Sebastian Muskalla |
Domains for Higher-Order Games. |
MFCS |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Fulla, Stanislav Zivný |
The Complexity of Boolean Surjective General-Valued CSPs. |
MFCS |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Hoffmann 0001, Csaba D. Tóth |
Two-Planar Graphs Are Quasiplanar. |
MFCS |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Härmel Nestra |
Grammars for Indentation-Sensitive Parsing. |
MFCS |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexei G. Myasnikov, Armin Weiß |
TC0 Circuits for Algorithmic Problems in Nilpotent Groups. |
MFCS |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Erik Paul |
The Equivalence, Unambiguity and Sequentiality Problems of Finitely Ambiguous Max-Plus Tree Automata are Decidable. |
MFCS |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Philippe Schnoebelen |
Ideal-Based Algorithms for the Symbolic Verification of Well-Structured Systems (Invited Talk). |
MFCS |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Chloe Ching-Yun Hsu, Chris Umans |
On Multidimensional and Monotone k-SUM. |
MFCS |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Eric Allender, Andreas Krebs, Pierre McKenzie |
Better Complexity Bounds for Cost Register Automata. |
MFCS |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Igor Potapov, Pavel Semukhin |
Membership Problem in GL(2, Z) Extended by Singular Matrices. |
MFCS |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicolas Markey |
Temporal Logics for Multi-Agent Systems (Invited Talk). |
MFCS |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | David M. Kahn |
Undecidable Problems for Probabilistic Network Programming. |
MFCS |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Shaohua Li 0005, Qilong Feng, Xiangzhong Meng, Jianxin Wang 0001 |
An Improved FPT Algorithm for the Flip Distance Problem. |
MFCS |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Rasmus Pagh |
Hardness and Approximation of High-Dimensional Search Problems (Invited Talk). |
MFCS |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Bart Jacobs 0001, Fabio Zanasi |
A Formal Semantics of Influence in Bayesian Reasoning. |
MFCS |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Neil Ghani, Conor McBride, Fredrik Nordvall Forsberg, Stephan Spahn |
Variations on Inductive-Recursive Definitions. |
MFCS |
2017 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")
data released under the ODC-BY 1.0 license