default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID37. MFCS 2012: Bratislava, Slovakia
- Branislav Rovan, Vladimiro Sassone, Peter Widmayer:
Mathematical Foundations of Computer Science 2012 - 37th International Symposium, MFCS 2012, Bratislava, Slovakia, August 27-31, 2012. Proceedings. Lecture Notes in Computer Science 7464, Springer 2012, ISBN 978-3-642-32588-5 - Georg Gottlob
, Marco Manna, Michael Morak, Andreas Pieris:
On the Complexity of Ontological Reasoning under Disjunctive Existential Rules. 1-18 - Christian Komusiewicz, Rolf Niedermeier:
New Races in Parameterized Algorithmics. 19-30 - Antonino Salibra:
Scott Is Always Simple. 31-45 - Nicole Schweikardt:
A Toolkit for Proving Limitations of the Expressive Power of Logics. 46-47 - Esko Ukkonen:
How to Reconstruct a Genome. 48 - Igor Walukiewicz:
Simple Models for Recursive Schemes. 49-60 - Gerhard J. Woeginger:
Transportation under Nasty Side Constraints. 61-62 - Mihalis Yannakakis:
Computation of Least Fixed Points. 63 - Lauri Ahlroth, Pekka Orponen:
Unordered Constraint Satisfaction Games. 64-75 - Tatsuya Akutsu, Takeyuki Tamura:
A Polynomial-Time Algorithm for Computing the Maximum Common Subgraph of Outerplanar Graphs of Bounded Degree. 76-87 - Eric Allender, Harry Buhrman, Luke Friedman, Bruno Loff:
Reductions to the Set of Random Strings: The Resource-Bounded Case. 88-99 - Vikraman Arvind, Johannes Köbler, Sebastian Kuhnert, Yadu Vasudev:
Approximate Graph Isomorphism. 100-111 - Vikraman Arvind, Partha Mukhopadhyay, Prajakta Nimbhorkar, Yadu Vasudev:
Near-Optimal Expanding Generator Sets for Solvable Permutation Groups. 112-123 - Eugene Asarin, Nicolas Basset, Aldric Degorre, Dominique Perrin:
Generating Functions of Timed Languages. 124-135 - Cristina Bazgan, Morgan Chopin:
The Robust Set Problem: Parameterized Complexity and Approximation. 136-147 - Paul C. Bell, Mika Hirvensalo, Igor Potapov:
Mortality for 2×2 Matrices Is NP-Hard. 148-159 - Dietmar Berwanger, Lukasz Kaiser, Simon Leßenich:
Solving Counter Parity Games. 160-171 - Therese Biedl, Peter Floderus:
Drawing Planar Graphs on Points Inside a Polygon. 172-183 - Davide Bilò, Anna Zych:
New Advances in Reoptimizing the Minimum Steiner Tree Problem. 184-197 - Markus Bläser, Bodo Manthey:
Smoothed Complexity Theory. 198-209 - Francine Blanchet-Sadri, Sean Simmons:
Abelian Pattern Avoidance in Partial Words. 210-221 - Paul S. Bonsma:
The Complexity of Rerouting Shortest Paths. 222-233 - Olivier Bournez, Pierre Fraigniaud, Xavier Koegler:
Computing with Large Populations Using Interactions. 234-246 - Laurent Bulteau, Guillaume Fertin, Irena Rusu:
Pancake Flipping Is Hard. 247-258 - Jingsen Chen, Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen:
In-place Heap Construction with Optimized Comparisons, Moves, and Cache Misses. 259-270 - Taolue Chen, Klaus Dräger, Stefan Kiefer:
Model Checking Stochastic Branching Processes. 271-282 - Robert Crowston, Gregory Z. Gutin, Mark Jones, Saket Saurabh, Anders Yeo:
Parameterized Study of the Test Cover Problem. 283-295 - Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk:
Sitting Closer to Friends Than Enemies, Revisited. 296-307 - Nicolas de Rugy-Altherre:
A Dichotomy Theorem for Homomorphism Polynomials. 308-322 - Martin Delacourt, Petr Kurka:
Finite State Transducers for Modular Möbius Number Systems. 323-334 - Giovanni Di Crescenzo, Vadym Fedyukovych:
Zero-Knowledge Proofs via Polynomial Representations. 335-347 - Martin Doucha, Jan Kratochvíl:
Cluster Vertex Deletion: A Parameterization between Vertex Cover and Clique-Width. 348-359 - Angelo Fanelli, Luca Moscardelli, Alexander Skopalik:
On the Impact of Fair Best Response Dynamics. 360-371 - Andreas Emil Feldmann:
Fast Balanced Partitioning Is Hard Even on Grids and Trees. 372-382 - Gabriele Fici:
A Characterization of Bispecial Sturmian Words. 383-394 - Dimitris Fotakis, Paraschos Koutris:
Online Sum-Radii Clustering. 395-406 - Tom Friedetzky, Leszek Gasieniec, Thomas Gorry, Russell Martin:
Observe and Remain Silent (Communication-Less Agent Location Discovery). 407-418 - Robert Ganian, Petr Hlinený, Jaroslav Nesetril, Jan Obdrzálek, Patrice Ossona de Mendez, Reshma Ramadurai:
When Trees Grow Low: Shrubs and Fast MSO1. 419-430 - Marcus Gelderie:
Strategy Machines and Their Complexity. 431-442 - Petr A. Golovach, Daniël Paulusma, Bernard Ries:
Coloring Graphs Characterized by a Forbidden Subgraph. 443-454 - Petr A. Golovach, Pim van 't Hof, Daniël Paulusma:
Obtaining Planarity by Contracting Few Edges. 455-466 - Michelangelo Grigni, Hao-Hsiang Hung:
Light Spanners in Bounded Pathwidth Graphs. 467-477 - Rohit Gurjar, Arpita Korwar, Jochen Messner, Simon Straub, Thomas Thierauf:
Planarizing Gadgets for Perfect Matching Do Not Exist. 478-490 - Torben Hagerup:
Kernels for Edge Dominating Set: Simpler or Smaller. 491-502 - Furio Honsell, Marina Lenisa, Rekha Redamalla:
Categories of Coalgebraic Games. 503-515 - David Janin:
Quasi-recognizable vs MSO Definable Languages of One-Dimensional Overlapping Tiles - (Extended Abstract). 516-528 - Klaus Jansen, Stefan Erich Julius Kraft:
An Improved Approximation Scheme for Variable-Sized Bin Packing. 529-541 - Sayaka Kamei, Anissa Lamani, Fukuhito Ooshita, Sébastien Tixeuil:
Gathering an Even Number of Robots in an Odd Ring without Global Multiplicity Detection. 542-553 - Christos A. Kapoutsis, Giovanni Pighizzini:
Reversal Hierarchies for Small 2DFAs. 554-565 - Alexander Kartzow, Pawel Parys:
Strictness of the Collapsible Pushdown Hierarchy. 566-577 - Akitoshi Kawamura, Hiroyuki Ota, Carsten Rösnick, Martin Ziegler:
Computational Complexity of Smooth Differential Equations. 578-589 - Christoph Behle, Andreas Krebs, Klaus-Jörn Lange, Pierre McKenzie:
The Lower Reaches of Circuit Uniformity. 590-602 - Manfred Kufleitner, Alexander Lauser:
The Join Levels of the Trotter-Weil Hierarchy Are Decidable. 603-614 - Tommi Lehtinen:
Equations X + A = B and (X + X) + C = (X - X) + D over Sets of Natural Numbers. 615-629 - Anthony Widjaja Lin:
Weakly-Synchronized Ground Tree Rewriting - (with Applications to Verifying Multithreaded Programs). 630-642 - Katja Losemann, Wim Martens, Matthias Niewerth:
Descriptional Complexity of Deterministic Regular Expressions. 643-654 - Meena Mahajan, B. V. Raghavendra Rao, Karteek Sreenivasaiah:
Identity Testing, Multilinearity Testing, and Monomials in Read-Once/Twice Formulas and Branching Programs. 655-667 - Florin Manea, Robert Mercas, Dirk Nowotka:
Fine and Wilf's Theorem and Pseudo-repetitions. 668-680 - Kim Guldstrand Larsen, Radu Mardare, Prakash Panangaden:
Taking It to the Limit: Approximate Reasoning for Markov Processes. 681-692 - Matús Mihalák, Jan Christoph Schlegel:
Asymmetric Swap-Equilibrium: A Unifying Equilibrium Concept for Network Creation Games. 693-704 - Filip Murlak, Michal Oginski, Marcin Przybylko:
Between Tree Patterns and Conjunctive Queries: Is There Tractability beyond Acyclicity? 705-717 - Jesper Nederlof, Erik Jan van Leeuwen, Ruben van der Zwaan:
Reducing a Target Interval to a Few Exact Queries. 718-727 - Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis:
Maximum Cliques in Graphs with Small Intersection Number and Random Intersection Graphs. 728-739 - Dorit Pardo Ordentlich, Alexander Rabinovich:
A Finite Basis for 'Almost Future' Temporal Logic over the Reals. 740-751 - Elena A. Petrova, Arseny M. Shur:
Constructing Premaximal Ternary Square-Free Words of Any Level. 752-763 - Christof Löding, Stefan Repke:
Regularity Problems for Weak Pushdown ω-Automata and Games. 764-776 - Ville Salo, Ilkka Törmä:
Computational Aspects of Cellular Automata on Countable Sofic Shifts. 777-788 - Tatiana Starikovskaya:
Computing Lempel-Ziv Factorization Online. 789-799 - Igor N. Tunev, Arseny M. Shur:
On Two Stronger Versions of Dejean's Conjecture. 800-812 - Thomas Weidner:
Probabilistic Automata and Probabilistic Logic. 813-824 - Mingyu Xiao, Jiong Guo:
A Quadratic Vertex Kernel for Feedback Arc Set in Bipartite Tournaments. 825-835
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-01-18 00:48 CET 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:
