Stephan Kreutzer

Ken-ichi Kawarabayashi, Daniel Král', Marek Krcál, Stephan Kreutzer: Packing directed cycles through a specified vertex set. SODA 2013: 365-377

Stephan Kreutzer: On the Parameterized Intractability of Monadic Second-Order Logic. Logical Methods in Computer Science 8(1) (2012)

Ken-ichi Kawarabayashi, Stephan Kreutzer, Bojan Mohar: Linkless and Flat Embeddings in 3-Space. Discrete & Computational Geometry 47(4): 731-755 (2012)

Dietmar Berwanger, Anuj Dawar, Paul Hunter, Stephan Kreutzer, Jan Obdrzálek: The dag-width of directed graphs. J. Comb. Theory, Ser. B 102(4): 900-923 (2012)

Fedor V. Fomin, Pierre Fraigniaud, Stephan Kreutzer, Dimitrios M. Thilikos: Foreword: Special Issue on Theory and Applications of Graph Searching Problems. Theor. Comput. Sci. 463: 1 (2012)

Viktor Engelmann, Stephan Kreutzer, Sebastian Siebertz: First-Order and Monadic Second-Order Model-Checking on Ordered Structures. LICS 2012: 275-284

Stephan Kreutzer, Siamak Tazari: Directed nowhere dense classes of graphs. SODA 2012: 1552-1562

Christoph Dittmann, Stephan Kreutzer, Alexandru I. Tomescu: Graph Operations on Parity Games and Polynomial-Time Algorithms. CoRR abs/1208.1640 (2012)

Fedor V. Fomin, Pierre Fraigniaud, Stephan Kreutzer, Dimitrios M. Thilikos: Special Issue on "Theory and Applications of Graph Searching Problems". Theor. Comput. Sci. 412(24): 2699 (2011)

Stephan Kreutzer, Sebastian Ordyniak: Digraph decompositions and monotonicity in digraph searching. Theor. Comput. Sci. 412(35): 4688-4703 (2011)

Stephan Kreutzer, Siamak Tazari: Directed Nowhere Dense Classes of Graphs. CoRR abs/1104.3808 (2011)

Fedor V. Fomin, Pierre Fraigniaud, Stephan Kreutzer, Dimitrios M. Thilikos: Theory and Applications of Graph Searching Problems (GRASTA 2011) (Dagstuhl Seminar 11071). Dagstuhl Reports 1(2): 30-46 (2011)

Ken-ichi Kawarabayashi, Stephan Kreutzer, Bojan Mohar: Linkless and flat embeddings in 3-space and the unknot problem. Symposium on Computational Geometry 2010: 97-106

Stephan Kreutzer, Siamak Tazari: Lower Bounds for the Complexity of Monadic Second-Order Logic. LICS 2010: 189-198

Roland Axelsson, Matthew Hague, Stephan Kreutzer, Martin Lange, Markus Latte: Extended Computation Tree Logic. LPAR (Yogyakarta) 2010: 67-81

Stephan Kreutzer, Siamak Tazari: On Brambles, Grid-Like Minors, and Parameterized Intractability of Monadic Second-Order Logic. SODA 2010: 354-364

Stephan Kreutzer, Siamak Tazari: Lower Bounds for the Complexity of Monadic Second-Order Logic. CoRR abs/1001.5019 (2010)

Roland Axelsson, Matthew Hague, Stephan Kreutzer, Martin Lange, Markus Latte: Extended Computation Tree Logic. CoRR abs/1006.3709 (2010)

Christoph Haase, Stephan Kreutzer, Joël Ouaknine, James Worrell: Reachability in Succinct and Parametric One-Counter Automata. CONCUR 2009: 369-383

Stephan Kreutzer: On the Parameterised Intractability of Monadic Second-Order Logic. CSL 2009: 348-363

Anuj Dawar, Stephan Kreutzer: Domination Problems in Nowhere-Dense Classes. FSTTCS 2009: 157-168

Stephan Kreutzer, Sebastian Ordyniak: Distance d-Domination Games. WG 2009: 308-319

Stephan Kreutzer: Algorithmic Meta-Theorems. CoRR abs/0902.3616 (2009)

Stephan Kreutzer: On the Parameterised Intractability of Monadic Second-Order Logic. CoRR abs/0904.1302 (2009)

Stephan Kreutzer, Siamak Tazari: On Brambles, Grid-Like Minors, and Parameterized Intractability of Monadic Second-Order Logic. CoRR abs/0907.3076 (2009)

Anuj Dawar, Stephan Kreutzer: Domination Problems in Nowhere-Dense Classes of Graphs. CoRR abs/0907.4283 (2009)

Stephan Kreutzer, Anuj Dawar: Parameterized Complexity of First-Order Logic. Electronic Colloquium on Computational Complexity (ECCC) 16: 131 (2009)

Stephan Kreutzer: Algorithmic Meta-Theorems. Electronic Colloquium on Computational Complexity (ECCC) 16: 147 (2009)

Paul Hunter, Stephan Kreutzer: Digraph measures: Kelly decompositions, games, and orderings. Theor. Comput. Sci. 399(3): 206-219 (2008)

Stephan Kreutzer, Martin Lange: Non-regular fixed-point logics and games. Logic and Automata 2008: 423-456

Anuj Dawar, Stephan Kreutzer: On Datalog vs. LFP. ICALP (2) 2008: 160-171

Stephan Kreutzer: Algorithmic Meta-theorems. IWPEC 2008: 10-12

Isolde Adler, Martin Grohe, Stephan Kreutzer: Computing excluded minors. SODA 2008: 641-650

Stephan Kreutzer, Sebastian Ordyniak: Digraph Decompositions and Monotonicity in Digraph Searching. WG 2008: 336-347

Stephan Kreutzer, Sebastian Ordyniak: Digraph Decompositions and Monotonicity in Digraph Searching. CoRR abs/0802.2228 (2008)

Anuj Dawar, Stephan Kreutzer: Generalising automaticity to modal properties of finite structures. Theor. Comput. Sci. 379(1-2): 266-285 (2007)

Stephan Kreutzer, Martin Otto, Nicole Schweikardt: Boundedness of Monadic FO over Acyclic Structures. ICALP 2007: 571-582

Anuj Dawar, Martin Grohe, Stephan Kreutzer, Nicole Schweikardt: Model Theory Makes Formulas Large. ICALP 2007: 913-924

Anuj Dawar, Martin Grohe, Stephan Kreutzer: Locally Excluding a Minor. LICS 2007: 270-279

Paul Hunter, Stephan Kreutzer: Digraph measures: Kelly decompositions, games, and orderings. SODA 2007: 637-644

Anuj Dawar, Erich Grädel, Stephan Kreutzer: Backtracking games and inflationary fixed points. Theor. Comput. Sci. 350(2-3): 174-187 (2006)

Anuj Dawar, Martin Grohe, Stephan Kreutzer, Nicole Schweikardt: Approximation Schemes for First-Order Definable Optimisation Problems. LICS 2006: 411-420

Dietmar Berwanger, Anuj Dawar, Paul Hunter, Stephan Kreutzer: DAG-Width and Parity Games. STACS 2006: 524-536

Achim Bluemnsath, Stephan Kreutzer: An Extension of Muchnik's Theorem. J. Log. Comput. 15(1): 59-74 (2005)

Julian C. Bradfield, Stephan Kreutzer: The Complexity of Independence-Friendly Fixpoint Logic. CSL 2005: 355-368

Martin Grohe, Stephan Kreutzer, Nicole Schweikardt: The Expressive Power of Two-Variable Least Fixed-Point Logics. MFCS 2005: 422-434

Stephan Kreutzer: Expressive equivalence of least and inflationary fixed-point logic. Ann. Pure Appl. Logic 130(1-3): 61-78 (2004)

Stephan Kreutzer, Nicole Schweikardt: Logik und Informatik. it - Information Technology 46(3): 162-166 (2004)

Anuj Dawar, Erich Grädel, Stephan Kreutzer: Inflationary fixed points in modal logic. ACM Trans. Comput. Log. 5(2): 282-315 (2004)

Anuj Dawar, Erich Grädel, Stephan Kreutzer: Backtracking Games and Inflationary Fixed Points. ICALP 2004: 420-432

Erich Grädel, Stephan Kreutzer: Will Deflation Lead to Depletion? On Non-Monotone Fixed Point Inductions. LICS 2003: 158-

Dietmar Berwanger, Erich Grädel, Stephan Kreutzer: Once upon a Time in a West - Determinacy, Definability, and Complexity of Path Games. LPAR 2003: 229-243

Stephan Kreutzer: Pure and applied fixed-point logics. Universität Aachen 2002, pp. 1-231

Stephan Kreutzer: Partial Fixed-Point Logic on Infinite Structures. CSL 2002: 337-351

Anuj Dawar, Stephan Kreutzer: Generalising Automaticity to Modal Properties of Finite Structures. FSTTCS 2002: 109-120

Stephan Kreutzer: Expressive Equivalence of Least and Inflationary Fixed-Point Logic. LICS 2002: 403-

Anuj Dawar, Erich Grädel, Stephan Kreutzer: Inflationary Fixed Points in Modal Logic. CSL 2001: 277-291

Stephan Kreutzer: Query Languages for Constraint Databases: First-Order Logic, Fixed-Points, and Convex Hulls. ICDT 2001: 248-262

Stephan Kreutzer: Operational Semantics for Fixed-Point Logics on Constraint Databases. LPAR 2001: 470-484

Stephan Kreutzer: Fixed-Point Query Languages for Linear Constraint Databases. PODS 2000: 116-125

Erich Grädel, Stephan Kreutzer: Descriptive Complexity Theory for Constraint Databases. CSL 1999: 67-81