| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Robert Ganian, Ronald de Haan, Iyad A. Kanj, Stefan Szeider |
On Existential MSO and its Relation to ETH.  |
MFCS  |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Masopust |
Piecewise Testable Languages and Nondeterministic Automata. |
MFCS |
2016 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Rabinovich |
An Unusual Temporal Logic. |
MFCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Grohe |
Logical and Structural Approaches to the Graph Isomorphism Problem. |
MFCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Ganian, Friedrich Slivovsky, Stefan Szeider |
Meta-kernelization with Structural Parameters. |
MFCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Souza |
Approximation Algorithms for Generalized Plant Location. |
MFCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Johannes Köbler, Sebastian Kuhnert, Oleg Verbitsky 0001 |
Helly Circular-Arc Graph Isomorphism Is in Logspace. |
MFCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrea Pietracaprina, Geppino Pucci, Francesco Silvestri 0001, Fabio Vandin |
Space-Efficient Parallel Algorithms for Combinatorial Search Problems. |
MFCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Sebastian Bala |
Which Finitely Ambiguous Automata Recognize Finitely Sequential Functions? - (Extended Abstract). |
MFCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Ariel Germán Fernández, Michael Soltys |
Feasible Combinatorial Matrix Theory. |
MFCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Vince Bárány, Michael Benedikt, Balder ten Cate |
Rewriting Guarded Negation Queries. |
MFCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephane Durocher, Rahul Shah 0001, Matthew Skala, Sharma V. Thankachan |
Linear-Space Data Structures for Range Frequency Queries on Arrays and Trees. |
MFCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Amr Elmasry, Jyrki Katajainen |
In-Place Binary Counters. |
MFCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein |
Bin Packing Games with Selfish Items. |
MFCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Francesco Ranzato |
A More Efficient Simulation Algorithm on Kripke Structures. |
MFCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Jens M. Schmidt |
A Planarity Test via Construction Sequences. |
MFCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Brandstädt, Martin Milanic, Ragnar Nevries |
New Polynomial Cases of the Weighted Efficient Domination Problem. |
MFCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Leonid Gurvits |
A Note on Deterministic Poly-Time Algorithms for Partition Functions Associated with Boolean Matrices with Prescribed Row and Column Sums. |
MFCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Zeume, Thomas Schwentick |
On the Quantifier-Free Dynamic Complexity of Reachability. |
MFCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean Goubault-Larrecq |
A Constructive Proof of the Topological Kruskal Theorem. |
MFCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | P. Buckheister, Georg Zetzsche |
Semilinearity and Context-Freeness of Languages Accepted by Valence Automata. |
MFCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Christoph Berkholz, Oleg Verbitsky 0001 |
On the Speed of Constraint Propagation and the Time Complexity of Arc Consistency Testing. |
MFCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephane Durocher, Saeed Mehrabi 0001 |
Guarding Orthogonal Art Galleries Using Sliding Cameras: Algorithmic and Hardness Results. |
MFCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicolas Bedon |
Logic and Branching Automata. |
MFCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Kristoffer Arnsfelt Hansen, Vladimir V. Podolskii |
Polynomial Threshold Functions and Boolean Threshold Circuits. |
MFCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Rohit Chadha, A. Prasad Sistla, Mahesh Viswanathan 0001 |
Probabilistic Automata with Isolated Cut-Points. |
MFCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Giorgio Bacci, Giovanni Bacci 0001, Kim G. Larsen, Radu Mardare |
Computing Behavioral Distances, Compositionally. |
MFCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Sam Buss |
Alternation Trading Proofs and Their Limitations. |
MFCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Dietrich Kuske |
Logical Aspects of the Lexicographic Order on 1-Counter Languages. |
MFCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Eric Angel, Evripidis Bampis, Alexander V. Kononov, Dimitris Paparas, Emmanouil Pountourakis, Vassilis Zissimopoulos |
Clustering on k-Edge-Colored Graphs. |
MFCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Wojciech Czerwinski, Petr Jancar, Martin Kot, Zdenek Sawa |
Complexity of Checking Bisimilarity between Sequential and Parallel Processes. |
MFCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Karl Bringmann |
Bringing Order to Special Cases of Klee's Measure Problem. |
MFCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Harry Buhrman, Lance Fortnow, John M. Hitchcock, Bruno Loff |
Learning Reductions to Sparse Sets. |
MFCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew V. Goldberg, Ilya P. Razenshteyn, Ruslan Savchenko |
Separating Hierarchical and General Hub Labelings. |
MFCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Orna Kupferman, Jonathan Mosheiff |
Prime Languages. |
MFCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Prachi Goyal, Vikram Kamat, Neeldhara Misra |
On the Parameterized Complexity of the Maximum Edge 2-Coloring Problem. |
MFCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Anca Muscholl, Sven Schewe |
Unlimited Decidability of Distributed Synthesis with Limited Missing Knowledge. |
MFCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Karl Bringmann, Christian Engels, Bodo Manthey, B. V. Raghavendra Rao |
Random Shortest Paths: Non-euclidean Instances for Metric Optimization Problems. |
MFCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Michal Kunc, Alexander Okhotin |
Reversibility of Computations in Graph-Walking Automata. |
MFCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Place, Lorijn van Rooijen, Marc Zeitoun |
Separating Regular Languages by Piecewise Testable and Unambiguous Languages. |
MFCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | John M. Hitchcock, Aduri Pavan |
Length-Increasing Reductions for PSPACE-Completeness. |
MFCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin |
Solving 3-Superstring in 3 n/3 Time. |
MFCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Piero A. Bonatti, Marco Faella, Clemente Galdi, Luigi Sauro |
Auctions for Partial Heterogeneous Preferences. |
MFCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Antonios Antoniadis 0001, Chien-Chung Huang, Sebastian Ott, José Verschae |
How to Pack Your Items When You Have to Buy Your Knapsack. |
MFCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Sarel Cohen, Amos Fiat, Moshik Hershcovitch, Haim Kaplan |
Minimal Indices for Successor Search - (Extended Abstract). |
MFCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Dexter Kozen, Radu Mardare, Prakash Panangaden |
Strong Completeness for Markovian Logics. |
MFCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Benedikt, Joost Engelfriet, Sebastian Maneth |
Determinacy and Rewriting of Top-Down and MSO Tree Transformations. |
MFCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Elias Koutsoupias |
Prior-Free Auctions of Digital Goods. |
MFCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Vincent Froese, René van Bevern, Rolf Niedermeier, Manuel Sorge |
A Parameterized Complexity Analysis of Combinatorial Feature Selection Problems. |
MFCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Sebastian Eggert, Henning Schnoor, Thomas Wilke |
Noninterference with Local Policies. |
MFCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Mengel |
Arithmetic Branching Programs with Memory. |
MFCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Nadia Creignou, Arne Meier, Julian-Steffen Müller, Johannes Schmidt 0001, Heribert Vollmer |
Paradigms for Parameterized Enumeration. |
MFCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Shenwei Huang |
Improved Complexity Results on k-Coloring P t -Free Graphs. |
MFCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Krishnendu Chatterjee, Jirí Sgall (eds.) |
Mathematical Foundations of Computer Science 2013 - 38th International Symposium, MFCS 2013, Klosterneuburg, Austria, August 26-30, 2013. Proceedings |
MFCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Nir Piterman |
Synthesis from Temporal Specifications: New Applications in Robotics and Model-Driven Development. |
MFCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Petr A. Golovach, Janne H. Korhonen |
On the Parameterized Complexity of Cutting a Few Vertices from a Graph. |
MFCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Huschenbett, Jiamou Liu |
A Polychromatic Ramsey Theory for Ordinals. |
MFCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Sébastien Tavenas |
Improved Bounds for Reduction to Depth 4 and Depth 3. |
MFCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Krebs, Nutan Limaye, Meena Mahajan, Karteek Sreenivasaiah |
Small Depth Proof Systems. |
MFCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuan Feng 0001, Nengkun Yu, Mingsheng Ying |
Reachability Analysis of Recursive Quantum Markov Chains. |
MFCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Hervé Fournier, Sylvain Perifel, Rémi de Joannis de Verclos |
On Fixed-Polynomial Size Circuit Lower Bounds for Uniform Polynomials in the Sense of Valiant. |
MFCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Heußner, Alexander Kartzow |
Reachability in Higher-Order-Counters. |
MFCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Marco Bender, Clemens Thielen, Stephan Westphal |
A Constant Factor Approximation for the Generalized Assignment Problem with Minimum Quantities and Unit Size Items. |
MFCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Meirav Zehavi |
Parameterized Algorithms for Module Motif. |
MFCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Arnold Beckmann, Pavel Pudlák, Neil Thapen |
Parity Games and Propositional Proofs. |
MFCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Felsner, George B. Mertzios, Irina Mustata |
On the Recognition of Four-Directional Orthogonal Ray Graphs. |
MFCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Yasuhiro Takahashi, Takeshi Yamazaki, Kazuyuki Tanaka |
Hardness of Classically Simulating Quantum Circuits with Unbounded Toffoli and Fan-Out Gates. |
MFCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Fink 0001, Sergey Pupyrev |
Ordering Metro Lines by Block Crossings. |
MFCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomohiro I, Wataru Matsubara, Kouji Shimohira, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Kazuyuki Narisawa, Ayumi Shinohara |
Detecting Regularities on Grammar-Compressed Strings. |
MFCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Moritz Müller, Stefan Szeider |
Revisiting Space in Proof Complexity: Treewidth and Pathwidth. |
MFCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Hanan Zebedat-Haider |
Rent or Buy Problems with a Fixed Time Horizon. |
MFCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Henrik Björklund, Wim Martens, Thomas Schwentick |
Validity of Tree Pattern Queries with Respect to Schema Information. |
MFCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Taolue Chen, Vojtech Forejt, Marta Z. Kwiatkowska, Aistis Simaitis, Clemens Wiltsche |
On Stochastic Games with Multiple Objectives. |
MFCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Neeldhara Misra, Fahad Panolan, Saket Saurabh 0001 |
Subexponential Algorithm for d-Cluster Edge Deletion: Exception or Rule? |
MFCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Ranko Lazic 0001, Joël Ouaknine, James Worrell 0001 |
Zeno, Hercules and the Hydra: Downward Rational Termination Is Ackermannian. |
MFCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Alain Finkel, Stefan Göller, Christoph Haase |
Reachability in Register Machines with Polynomial Updates. |
MFCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Angelo Fanelli 0001, Luca Moscardelli, Alexander Skopalik |
On the Impact of Fair Best Response Dynamics. |
MFCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Kim Guldstrand Larsen, Radu Mardare, Prakash Panangaden |
Taking It to the Limit: Approximate Reasoning for Markov Processes. |
MFCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis |
Maximum Cliques in Graphs with Small Intersection Number and Random Intersection Graphs. |
MFCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Lauri Ahlroth, Pekka Orponen |
Unordered Constraint Satisfaction Games. |
MFCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Tatsuya Akutsu, Takeyuki Tamura |
A Polynomial-Time Algorithm for Computing the Maximum Common Subgraph of Outerplanar Graphs of Bounded Degree. |
MFCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Esko Ukkonen |
How to Reconstruct a Genome. |
MFCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Rohit Gurjar, Arpita Korwar, Jochen Messner, Simon Straub, Thomas Thierauf |
Planarizing Gadgets for Perfect Matching Do Not Exist. |
MFCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Anthony Widjaja Lin |
Weakly-Synchronized Ground Tree Rewriting - (with Applications to Verifying Multithreaded Programs). |
MFCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Antonino Salibra |
Scott Is Always Simple. |
MFCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Mingyu Xiao 0001, Jiong Guo |
A Quadratic Vertex Kernel for Feedback Arc Set in Bipartite Tournaments. |
MFCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Francine Blanchet-Sadri, Sean Simmons 0001 |
Abelian Pattern Avoidance in Partial Words. |
MFCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Giovanni Di Crescenzo, Vadym Fedyukovych |
Zero-Knowledge Proofs via Polynomial Representations. |
MFCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Manfred Kufleitner, Alexander Lauser |
The Join Levels of the Trotter-Weil Hierarchy Are Decidable. |
MFCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Komusiewicz, Rolf Niedermeier |
New Races in Parameterized Algorithmics. |
MFCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Kartzow, Pawel Parys |
Strictness of the Collapsible Pushdown Hierarchy. |
MFCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Laurent Bulteau, Guillaume Fertin, Irena Rusu |
Pancake Flipping Is Hard. |
MFCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Tatiana Starikovskaya |
Computing Lempel-Ziv Factorization Online. |
MFCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Igor Walukiewicz |
Simple Models for Recursive Schemes. |
MFCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Sayaka Kamei, Anissa Lamani, Fukuhito Ooshita, Sébastien Tixeuil |
Gathering an Even Number of Robots in an Odd Ring without Global Multiplicity Detection. |
MFCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Marcus Gelderie |
Strategy Machines and Their Complexity. |
MFCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Bläser, Bodo Manthey |
Smoothed Complexity Theory. |
MFCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Christos A. Kapoutsis, Giovanni Pighizzini |
Reversal Hierarchies for Small 2DFAs. |
MFCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Igor N. Tunev, Arseny M. Shur |
On Two Stronger Versions of Dejean's Conjecture. |
MFCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Gabriele Fici |
A Characterization of Bispecial Sturmian Words. |
MFCS |
2012 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")
data released under the ODC-BY 1.0 license