| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Paul Brunet |
Reversible Kleene lattices.  |
MFCS  |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson 0002, Daniël Paulusma |
Recognizing Graphs Close to Bipartite Graphs. |
MFCS |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Russell Impagliazzo, Valentine Kabanets, Antonina Kolokolova, Pierre McKenzie, Shadab Romani |
Does Looking Inside a Circuit Help?. |
MFCS |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Lauri Hella, Antti Kuusisto, Arne Meier, Jonni Virtema |
Model Checking and Validity in Propositional and Modal Inclusion Logics. |
MFCS |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Christoph Haase, Stefan Kiefer, Markus Lohrey |
Counting Problems for Parikh Images. |
MFCS |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Bergougnoux, Eduard Eiben, Robert Ganian, Sebastian Ordyniak, M. S. Ramanujan 0001 |
Towards a Polynomial Kernel for Directed Feedback Vertex Set. |
MFCS |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Martin A. Nowak |
Faster Monte-Carlo Algorithms for Fixation Probability of the Moran Process on Undirected Graphs. |
MFCS |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul-Elliot Anglès d'Auriac, Benoît Monin |
Another Characterization of the Higher K-Trivials. |
MFCS |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Michalina Dzyga, Robert Ferens, Vladimir V. Gusev, Marek Szykula |
Attainable Values of Reset Thresholds. |
MFCS |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Ivan Bliznets, Nikolay Karpov |
Parameterized Algorithms for Partitioning Graphs into Highly Connected Clusters. |
MFCS |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Joel D. Day, Florin Manea, Dirk Nowotka |
The Hardness of Solving Simple Word Equations. |
MFCS |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephan Kreutzer, Michal Pilipczuk, Roman Rabinovich 0001, Sebastian Siebertz |
The Generalised Colouring Numbers on Classes of Bounded Expansion. |
MFCS |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | Virginia Vassilevska Williams |
RNA-Folding - From Hardness to Algorithms. |
MFCS |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | Frank Kammer, Dieter Kratsch, Moritz Laudahn |
Space-Efficient Biconnected Components and Recognition of Outerplanar Graphs. |
MFCS |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | Nadia Labai, Johann A. Makowsky |
On the Exact Learnability of Graph Parameters: The Case of Partition Functions. |
MFCS |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | Paola Quaglia |
Symbolic Lookaheads for Bottom-up Parsing. |
MFCS |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr Jancar |
Deciding Semantic Finiteness of Pushdown Processes and First-Order Grammars w.r.t. Bisimulation Equivalence. |
MFCS |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | Juha Kontinen, Antti Kuusisto, Jonni Virtema |
Decidability of Predicate Logics with Team Semantics. |
MFCS |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop |
Nested Weighted Limit-Average Automata of Bounded Width. |
MFCS |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | Mikolaj Bojanczyk |
Decidable Extensions of MSO. |
MFCS |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | Dana Angluin, Udi Boker, Dana Fisman |
Families of DFAs as Acceptors of omega-Regular Languages. |
MFCS |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | Parvaneh Babari, Karin Quaas, Mahsa Shirmohammadi |
Synchronizing Data Words for Register Automata. |
MFCS |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki, Junichi Teruyama |
Bounded Depth Circuits with Weighted Symmetric Gates: Satisfiability, Lower Bounds and Compression. |
MFCS |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | Martijn Baartse, Klaus Meer |
Real Interactive Proofs for VPSPACE. |
MFCS |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | Takayuki Kihara, Arno Pauly |
Dividing by Zero - How Bad Is It, Really?. |
MFCS |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | Irving van Heuven van Staereling, Bart de Keijzer, Guido Schäfer |
The Ground-Set-Cost Budgeted Maximum Coverage Problem. |
MFCS |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | Thibault Godin, Ines Klimann |
Connected Reversible Mealy Automata of Prime Size Cannot Generate Infinite Burnside Groups. |
MFCS |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | Igor Potapov, Pavel Semukhin |
Vector Reachability Problem in SL(2, Z). |
MFCS |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | Patricia Bouyer-Decitre |
Optimal Reachability in Weighted Timed Automata and Games. |
MFCS |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, Frank Fuhlbrück, Johannes Köbler, Sebastian Kuhnert, Gaurav Rattan |
The Parameterized Complexity of Fixing Number and Vertex Individualization in Graphs. |
MFCS |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Ganian, N. S. Narayanaswamy, Sebastian Ordyniak, C. S. Rahul 0001, M. S. Ramanujan 0001 |
On the Complexity Landscape of Connected f-Factor Problems. |
MFCS |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | Jesper Jansson 0001, Wing-Kin Sung |
Minimal Phylogenetic Supertrees and Local Consensus Trees. |
MFCS |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Golovnev, Edward A. Hirsch, Alexander Knop, Alexander S. Kulikov |
On the Limits of Gate Elimination. |
MFCS |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | Sudeshna Kolay, Fahad Panolan, Venkatesh Raman 0001, Saket Saurabh 0001 |
Parameterized Algorithms on Perfect Graphs for Deletion to (r, l)-Graphs. |
MFCS |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | Anja Rey, Jörg Rothe |
Structural Control in Weighted Voting Games. |
MFCS |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | Georgios Amanatidis, Evangelos Markakis, Krzysztof Sornat |
Inequity Aversion Pricing over Social Networks: Approximation Algorithms and Hardness Results. |
MFCS |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Place, Marc Zeitoun |
The Covering Problem: A Unified Approach for Investigating the Expressive Power of Logics. |
MFCS |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | Victor Lagerkvist, Biman Roy |
A Preliminary Investigation of Satisfiability Problems Not Harder than 1-in-3-SAT. |
MFCS |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | Manindra Agrawal, Nitin Saxena 0001, Shubham Sahai Srivastava |
Integer Factoring Using Small Algebraic Dependencies. |
MFCS |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | Itai Arad, Adam Bouland, Daniel Grier, Miklos Santha, Aarthi Sundaram, Shengyu Zhang 0002 |
On the Complexity of Probabilistic Trials for Hidden Satisfiability Problems. |
MFCS |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | Cody W. Geary, Pierre-Etienne Meunier, Nicolas Schabanel, Shinnosuke Seki |
Programming Biomolecules That Fold Greedily During Transcription. |
MFCS |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | Reino Niskanen, Igor Potapov, Julien Reichert |
Undecidability of Two-dimensional Robot Games. |
MFCS |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | Christof Löding, Andreas Tollkötter |
Transformation Between Regular Expressions and omega-Automata. |
MFCS |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | Alex Bredariol Grilo, Iordanis Kerenidis, Attila Pereszlényi |
Pointer Quantum PCPs and Multi-Prover Games. |
MFCS |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | Dennis Komm, Rastislav Královic, Richard Královic, Christian Kudahl |
Advice Complexity of the Online Induced Subgraph Problem. |
MFCS |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul S. Bonsma, Daniël Paulusma |
Using Contracted Solution Graphs for Solving Reconfiguration Problems. |
MFCS |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Bläser, Vladimir Lysikov |
On Degeneration of Tensors and Algebras. |
MFCS |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | Takaaki Nishimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
Fully Dynamic Data Structure for LCE Queries in Compressed Space. |
MFCS |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Dixon 0002, Debasis Mandal, Aduri Pavan, N. V. Vinodchandran |
A Note on the Advice Complexity of Multipass Randomized Logspace. |
MFCS |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | Mitali Bafna, Satyanarayana V. Lokam, Sébastien Tavenas, Ameya Velingker |
On the Sensitivity Conjecture for Read-k Formulas. |
MFCS |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | Tobias Harks, Britta Peis, Daniel Schmand, Laura Vargas Koch |
Competitive Packet Routing with Priority Lists. |
MFCS |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | Vivek Anand T. Kallampally, Raghunath Tewari |
Trading Determinism for Time in Space Bounded Computations. |
MFCS |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | Volker Betz, Stéphane Le Roux 0001 |
Stable States of Perturbed Markov Chains. |
MFCS |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | Vladimir V. Gusev, Elena V. Pribavkina |
On Synchronizing Colorings and the Eigenvectors of Digraphs. |
MFCS |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | Samir Datta, Raghav Kulkarni, Anish Mukherjee 0001 |
Space-Efficient Approximation Scheme for Maximum Matching in Sparse Graphs. |
MFCS |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuta Fujishige, Yuki Tsujimaru, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
Computing DAWGs and Minimal Absent Words in Linear Time for Integer Alphabets. |
MFCS |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | Shay Moran, Cyrus Rashtchian |
Shattered Sets and the Hilbert Function. |
MFCS |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthieu Rosenfeld |
Every Binary Pattern of Length Greater Than 14 Is Abelian-2-Avoidable. |
MFCS |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | Orna Kupferman, Gal Vardi |
Eulerian Paths with Regular Constraints. |
MFCS |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | Shai Ben-David |
How Far Are We From Having a Satisfactory Theory of Clustering? |
MFCS |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | Dmitry Itsykson, Alexander Okhotin, Vsevolod Oparin |
Computational and Proof Complexity of Partial String Avoidability. |
MFCS |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
Shortest Unique Substring Queries on Run-Length Encoded Strings. |
MFCS |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | Maurice Chandoo |
On the Implicit Graph Conjecture. |
MFCS |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | Guilhem Gamard, Gwénaël Richomme |
Determining Sets of Quasiperiods of Infinite Words. |
MFCS |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | Kenjiro Takazawa |
Finding a Maximum 2-Matching Excluding Prescribed Cycles in Bipartite Graphs. |
MFCS |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | Marcin Przybylko, Michal Skrzypczak |
On the Complexity of Branching Games with Regular Conditions. |
MFCS |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | Zeyu Guo 0001, Anand Kumar Narayanan, Chris Umans |
Algebraic Problems Equivalent to Beating Exponent 3/2 for Polynomial Factorization over Finite Fields. |
MFCS |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | Dominik Kaaser, Frederik Mallmann-Trenn, Emanuele Natale |
On the Voting Time of the Deterministic Majority Process. |
MFCS |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | Anurag Pandey 0001, Nitin Saxena 0001, Amit Sinhababu |
Algebraic Independence over Positive Characteristic: New Criterion and Applications to Locally Low Algebraic Rank Circuits. |
MFCS |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | Andre Droschinsky, Nils M. Kriege, Petra Mutzel |
Faster Algorithms for the Maximum Common Subtree Isomorphism Problem. |
MFCS |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Veronika Loitzenbauer |
Conditionally Optimal Algorithms for Generalized Büchi Games. |
MFCS |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | Stacey Jeffery, François Le Gall |
Quantum Communication Complexity of Distributed Set Joins. |
MFCS |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | Yijia Chen, Jörg Flum |
Some Lower Bounds in Parameterized AC^0. |
MFCS |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | Will Dison, Eduard Einstein, Timothy R. Riley |
Ackermannian Integer Compression and the Word Problem for Hydra Groups. |
MFCS |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | |
Front Matter, Foreword, Conference Organization, External Reviewers, Table of Contents. |
MFCS |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Schuster |
Transducer-Based Rewriting Games for Active XML. |
MFCS |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | Titus Dose |
Complexity of Constraint Satisfaction Problems over Finite Subsets of Natural Numbers. |
MFCS |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | Iordanis Kerenidis, Adi Rosén, Florent Urrutia |
Multi-Party Protocols, Information Complexity and Privacy. |
MFCS |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | Chenglin Fan, Omrit Filtser, Matthew J. Katz, Binhai Zhu |
On the General Chain Pair Simplification Problem. |
MFCS |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | Christof Löding, Sarah Winter |
Uniformization Problems for Tree-Automatic Relations and Top-Down Tree Transducers. |
MFCS |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | Nikhil Balaji, Samir Datta, Raghav Kulkarni, Supartha Podder |
Graph Properties in Node-Query Setting: Effect of Breaking Symmetry. |
MFCS |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | Xiang Huang 0001, Donald M. Stull |
Polynomial Space Randomness in Analysis. |
MFCS |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | S. Akshay 0001, Patricia Bouyer, Shankara Narayanan Krishna, Lakshmi Manasa, Ashutosh Trivedi 0001 |
Stochastic Timed Games Revisited. |
MFCS |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | Mingyu Xiao 0001, Shaowei Kou |
An Improved Approximation Algorithm for the Traveling Tournament Problem with Maximum Trip Length Two. |
MFCS |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | Matias David Lee, Erik P. de Vink |
Logical Characterization of Bisimulation for Transition Relations over Probability Distributions with Internal Actions. |
MFCS |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Fafianie, Eva-Maria C. Hols, Stefan Kratsch, Vuong Anh Quyen |
Preprocessing Under Uncertainty: Matroid Intersection. |
MFCS |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | Angelo Fanelli 0001, Gianluigi Greco |
Ride Sharing with a Vehicle of Unlimited Capacity. |
MFCS |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Golovnev, Alexander S. Kulikov, Alexander V. Smal, Suguru Tamaki |
Circuit Size Lower Bounds and #SAT Upper Bounds Through a General Framework. |
MFCS |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | Amaldev Manuel, A. V. Sreejith |
Two-Variable Logic over Countable Linear Orderings. |
MFCS |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | Dimitris Chatzidimitriou, Archontia C. Giannopoulou, Spyridon Maniatis, Clément Requilé, Dimitrios M. Thilikos, Dimitris Zoros |
FPT Algorithms for Plane Completion Problems. |
MFCS |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | George B. Mertzios, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis |
Stably Computing Order Statistics with Arithmetic Population Protocols. |
MFCS |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | Eduard Eiben, Robert Ganian, O-joung Kwon |
A Single-Exponential Fixed-Parameter Algorithm for Distance-Hereditary Vertex Deletion. |
MFCS |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | Saeed Akhoondian Amiri, Stephan Kreutzer, Dániel Marx, Roman Rabinovich 0001 |
Routing with Congestion in Acyclic Digraphs. |
MFCS |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | Simon Perdrix, Quanlong Wang |
Supplementarity is Necessary for Quantum Diagram Reasoning. |
MFCS |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | Tobias Friedrich 0001 |
Scale-Free Networks, Hyperbolic Geometry, and Efficient Algorithms. |
MFCS |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Brunet, Damien Pous |
A Formal Exploration of Nominal Kleene Algebra. |
MFCS |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | Bart M. P. Jansen, Astrid Pieterse |
Optimal Sparsification for Some Binary CSPs Using Low-Degree Polynomials. |
MFCS |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Faliszewski, Anca Muscholl, Rolf Niedermeier (eds.) |
41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016, August 22-26, 2016 - Kraków, Poland |
MFCS |
2016 |
DBLP BibTeX RDF |
|
| 1 | Peter Fulla, Stanislav Zivný |
On Planar Valued CSPs. |
MFCS |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Krötzsch, Tomás Masopust, Michaël Thomazo |
On the Complexity of Universality for Partially Ordered NFAs. |
MFCS |
2016 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")
data released under the ODC-BY 1.0 license