| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Taolue Chen, Klaus Dräger, Stefan Kiefer |
Model Checking Stochastic Branching Processes.  |
MFCS  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerhard J. Woeginger |
Transportation under Nasty Side Constraints. |
MFCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Matús Mihalák, Jan Christoph Schlegel |
Asymmetric Swap-Equilibrium: A Unifying Equilibrium Concept for Network Creation Games. |
MFCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Ville Salo, Ilkka Törmä |
Computational Aspects of Cellular Automata on Countable Sofic Shifts. |
MFCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Torben Hagerup |
Kernels for Edge Dominating Set: Simpler or Smaller. |
MFCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Weidner |
Probabilistic Automata and Probabilistic Logic. |
MFCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicole Schweikardt |
A Toolkit for Proving Limitations of the Expressive Power of Logics. |
MFCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Davide Bilò, Anna Zych |
New Advances in Reoptimizing the Minimum Steiner Tree Problem. |
MFCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Crowston, Gregory Z. Gutin, Mark Jones 0001, Saket Saurabh 0001, Anders Yeo |
Parameterized Study of the Test Cover Problem. |
MFCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Christoph Behle, Andreas Krebs, Klaus-Jörn Lange, Pierre McKenzie |
The Lower Reaches of Circuit Uniformity. |
MFCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Eugene Asarin, Nicolas Basset, Aldric Degorre, Dominique Perrin |
Generating Functions of Timed Languages. |
MFCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Georg Gottlob, Marco Manna, Michael Morak, Andreas Pieris |
On the Complexity of Ontological Reasoning under Disjunctive Existential Rules. |
MFCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Dimitris Fotakis 0001, Paraschos Koutris |
Online Sum-Radii Clustering. |
MFCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Jesper Nederlof, Erik Jan van Leeuwen, Ruben van der Zwaan |
Reducing a Target Interval to a Few Exact Queries. |
MFCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr A. Golovach, Pim van 't Hof, Daniël Paulusma |
Obtaining Planarity by Contracting Few Edges. |
MFCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Dorit Pardo Ordentlich, Alexander Rabinovich |
A Finite Basis for 'Almost Future' Temporal Logic over the Reals. |
MFCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Delacourt, Petr Kurka |
Finite State Transducers for Modular Möbius Number Systems. |
MFCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Tommi Lehtinen 0001 |
Equations X + A = B and (X + X) + C = (X - X) + D over Sets of Natural Numbers. |
MFCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Florin Manea, Robert Mercas, Dirk Nowotka |
Fine and Wilf's Theorem and Pseudo-repetitions. |
MFCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicolas de Rugy-Altherre |
A Dichotomy Theorem for Homomorphism Polynomials. |
MFCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Dietmar Berwanger, Lukasz Kaiser, Simon Leßenich |
Solving Counter Parity Games. |
MFCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Elena A. Petrova, Arseny M. Shur |
Constructing Premaximal Ternary Square-Free Words of Any Level. |
MFCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr A. Golovach, Daniël Paulusma, Bernard Ries |
Coloring Graphs Characterized by a Forbidden Subgraph. |
MFCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Meena Mahajan, B. V. Raghavendra Rao, Karteek Sreenivasaiah |
Identity Testing, Multilinearity Testing, and Monomials in Read-Once/Twice Formulas and Branching Programs. |
MFCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Doucha, Jan Kratochvíl |
Cluster Vertex Deletion: A Parameterization between Vertex Cover and Clique-Width. |
MFCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Filip Murlak, Michal Oginski, Marcin Przybylko |
Between Tree Patterns and Conjunctive Queries: Is There Tractability beyond Acyclicity? |
MFCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Michelangelo Grigni, Hao-Hsiang Hung |
Light Spanners in Bounded Pathwidth Graphs. |
MFCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Emil Feldmann |
Fast Balanced Partitioning Is Hard Even on Grids and Trees. |
MFCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Katja Losemann, Wim Martens, Matthias Niewerth |
Descriptional Complexity of Deterministic Regular Expressions. |
MFCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Jingsen Chen, Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen |
In-place Heap Construction with Optimized Comparisons, Moves, and Cache Misses. |
MFCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Eric Allender, Harry Buhrman, Luke Friedman, Bruno Loff |
Reductions to the Set of Random Strings: The Resource-Bounded Case. |
MFCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul C. Bell, Mika Hirvensalo, Igor Potapov |
Mortality for 2×2 Matrices Is NP-Hard. |
MFCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Jansen, Stefan Erich Julius Kraft |
An Improved Approximation Scheme for Variable-Sized Bin Packing. |
MFCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk |
Sitting Closer to Friends Than Enemies, Revisited. |
MFCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Akitoshi Kawamura, Hiroyuki Ota, Carsten Rösnick, Martin Ziegler 0001 |
Computational Complexity of Smooth Differential Equations. |
MFCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, Johannes Köbler, Sebastian Kuhnert, Yadu Vasudev |
Approximate Graph Isomorphism. |
MFCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Olivier Bournez, Pierre Fraigniaud, Xavier Koegler |
Computing with Large Populations Using Interactions. |
MFCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Therese Biedl, Peter Floderus |
Drawing Planar Graphs on Points Inside a Polygon. |
MFCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Christof Löding, Stefan Repke |
Regularity Problems for Weak Pushdown ω-Automata and Games. |
MFCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Cristina Bazgan, Morgan Chopin |
The Robust Set Problem: Parameterized Complexity and Approximation. |
MFCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, Partha Mukhopadhyay, Prajakta Nimbhorkar, Yadu Vasudev |
Near-Optimal Expanding Generator Sets for Solvable Permutation Groups. |
MFCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Furio Honsell, Marina Lenisa, Rekha Redamalla |
Categories of Coalgebraic Games. |
MFCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Branislav Rovan, Vladimiro Sassone, Peter Widmayer (eds.) |
Mathematical Foundations of Computer Science 2012 - 37th International Symposium, MFCS 2012, Bratislava, Slovakia, August 27-31, 2012. Proceedings |
MFCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Mihalis Yannakakis |
Computation of Least Fixed Points. |
MFCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | David Janin |
Quasi-recognizable vs MSO Definable Languages of One-Dimensional Overlapping Tiles - (Extended Abstract). |
MFCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Ganian, Petr Hlinený, Jaroslav Nesetril, Jan Obdrzálek, Patrice Ossona de Mendez, Reshma Ramadurai |
When Trees Grow Low: Shrubs and Fast MSO1. |
MFCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Tom Friedetzky, Leszek Gasieniec, Thomas Gorry, Russell Martin |
Observe and Remain Silent (Communication-Less Agent Location Discovery). |
MFCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul S. Bonsma |
The Complexity of Rerouting Shortest Paths. |
MFCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Pawel Gawrychowski, Artur Jez, Andreas Maletti |
On Minimising Automata with Errors. |
MFCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Michal Pilipczuk |
Problems Parameterized by Treewidth Tractable in Single Exponential Time: A Logical Approach. |
MFCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Krishnendu Chatterjee, Laurent Doyen 0001 |
Energy and Mean-Payoff Parity Markov Decision Processes. |
MFCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Riccardo Dondi, Giancarlo Mauri, Italo Zoppis |
On the Complexity of the l-diversity Problem. |
MFCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Wollan |
New Proofs in Graph Minors. |
MFCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Filip Murlak, Piotr Sankowski (eds.) |
Mathematical Foundations of Computer Science 2011 - 36th International Symposium, MFCS 2011, Warsaw, Poland, August 22-26, 2011. Proceedings |
MFCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Olivier Bournez, Daniel Silva Graça, Amaury Pouly |
Solving Analytic Differential Equations in Polynomial Time over Unbounded Domains. |
MFCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Michel Blockelet, Sylvain Schmitz |
Model Checking Coverability Graphs of Vector Addition Systems. |
MFCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Christophe Paul, Anthony Perez 0001, Stéphan Thomassé |
Conflict Packing Yields Linear Vertex-Kernels for k -FAST, k -dense RTI and a Related Problem. |
MFCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | David A. Cohen, Páidí Creed, Peter G. Jeavons, Stanislav Zivný |
An Algebraic Theory of Complexity for Valued Constraints: Establishing a Galois Connection. |
MFCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Krebs, Nutan Limaye, Srikanth Srinivasan 0001 |
Streaming Algorithms for Recognizing Nearly Well-Parenthesized Expressions. |
MFCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Lohrey |
Compressed Word Problems for Inverse Monoids. |
MFCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Kévin Perrot, Eric Rémila |
Transduction on Kadanoff Sand Pile Model Avalanches, Application to Wave Pattern Emergence. |
MFCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Rémi Bonnet |
The Reachability Problem for Vector Addition System with One Zero-Test. |
MFCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Anne-Marie Kermarrec, Christopher Thraves |
Can Everybody Sit Closer to Their Friends Than Their Enemies? |
MFCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Okhotin, Kai Salomaa |
State Complexity of Operations on Input-Driven Pushdown Automata. |
MFCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Colcombet, Clemens Ley, Gabriele Puppis |
On the Use of Guards for Logics with Data. |
MFCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Mingyu Xiao 0001, Ton Kloks, Sheung-Hung Poon |
New Parameterized Algorithms for the Edge Dominating Set Problem. |
MFCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Yoram Bachrach |
The Least-Core of Threshold Network Flow Games. |
MFCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Laurent Doyen 0001, Thierry Massart, Mahsa Shirmohammadi |
Infinite Synchronizing Words for Probabilistic Automata. |
MFCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Dietrich Kuske, Thomas Weidner |
Size and Computation of Injective Tree Automatic Presentations. |
MFCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Kei Uchizawa, Eiji Takimoto |
Lower Bounds for Linear Decision Trees via an Energy Complexity Argument. |
MFCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Petra Berenbrink, Robert Elsässer, Tom Friedetzky, Lars Nagel 0001, Thomas Sauerwald |
Faster Coupon Collecting via Replication with Applications in Gossiping. |
MFCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Vanden Boom |
Weak Cost Monadic Logic over Infinite Trees. |
MFCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jun Hosoda, Juraj Hromkovic, Taisuke Izumi, Hirotaka Ono 0001, Monika Steinová, Koichi Wada 0001 |
On the Approximability of Minimum Topic Connected Overlay and Its Special Instances. |
MFCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Florin Manea, Robert Mercas, Catalin Tiseanu |
Periodicity Algorithms for Partial Words. |
MFCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Marats Golovkins, Maksim Kravtsev, Vasilijs Kravcevs |
Quantum Finite Automata and Probabilistic Reversible Automata: R-trivial Idempotent Languages. |
MFCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Stanislav Böhm, Stefan Göller |
Language Equivalence of Deterministic Real-Time One-Counter Automata Is NL-Complete. |
MFCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Franek, Stefan Ratschan, Piotr Zgliczynski |
Satisfiability of Systems of Equations of Real Analytic Functions Is Quasi-decidable. |
MFCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ocan Sankur |
Untimed Language Preservation in Timed Systems. |
MFCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Krzysztof Krzywdzinski, Katarzyna Rybarczyk |
Geometric Graphs with Randomly Deleted Edges - Connectivity and Routing Protocols. |
MFCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Sebastian S. Bauer, Uli Fahrenberg, Line Juhl, Kim G. Larsen, Axel Legay, Claus R. Thrane |
Quantitative Refinement for Weighted Modal Transition Systems. |
MFCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexandr Andoni |
Nearest Neighbor Search in High-Dimensional Spaces. |
MFCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrej Bogdanov, Akinori Kawachi, Hidetoki Tanaka |
Hard Functions for Low-Degree Polynomials over Prime Fields. |
MFCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr A. Golovach, Marcin Kaminski 0001, Daniël Paulusma |
Contracting a Chordal Graph to a Split Graph or a Tree. |
MFCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Wladimir Fridman, Bernd Puchala |
Distributed Synthesis for Regular and Contextfree Specifications. |
MFCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Mai Gehrke |
Duality and Recognition. |
MFCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Evgeny Demenkov, Alexander S. Kulikov |
An Elementary Proof of a 3n - o(n) Lower Bound on the Circuit Complexity of Affine Dispersers. |
MFCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Benedikt Bollig, Aiswarya Cyriac, Paul Gastin, Marc Zeitoun |
Temporal Logics for Concurrent Recursive Programs: Satisfiability and Model Checking. |
MFCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard J. Lipton, Kenneth W. Regan, Atri Rudra |
Symmetric Functions Capture General Functions. |
MFCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Bredereck, André Nichterlein, Rolf Niedermeier, Geevarghese Philip |
Pattern-Guided Data Anonymization and Clustering. |
MFCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Maletti, Daniel Quernheim |
Pushing for Weighted Tree Automata. |
MFCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Edith Hemaspaandra, Henning Schnoor |
A Universally Defined Undecidable Unimodal Logic. |
MFCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Paolo Baldan, Fabio Gadducci, Pawel Sobocinski 0001 |
Adhesivity Is Not Enough: Local Church-Rosser Revisited. |
MFCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Prasad Raghavendra |
Generic Techniques to Round SDP Relaxations. |
MFCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jacek Chrzaszcz, Aleksy Schubert |
The Role of Polymorphism in the Characterisation of Complexity by Soft Types. |
MFCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Vladimir Kolmogorov |
Submodularity on a Tree: Unifying $L^\natural$ -Convex and Bisubmodular Functions. |
MFCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Christina Boucher |
The Bounded Search Tree Algorithm for the Closest String Problem Has Quadratic Smoothed Complexity. |
MFCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Olaf Beyersdorff, Samir Datta, Meena Mahajan, Gido Scharfenberger-Fabian, Karteek Sreenivasaiah, Michael Thomas 0001, Heribert Vollmer |
Verifying Proofs in Constant Depth. |
MFCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Bläser, Radu Curticapean |
The Complexity of the Cover Polynomials for Planar Graphs of Bounded Degree. |
MFCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jörg Flum |
Invariantization of Listings. |
MFCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Balder ten Cate, Alessandro Facchini |
Characterizing EF over Infinite Trees and Modal Logic on Transitive Graphs. |
MFCS |
2011 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")
data released under the ODC-BY 1.0 license