2009 |
33 | EE | Stephan Kreutzer:
Algorithmic Meta-Theorems
CoRR abs/0902.3616: (2009) |
32 | EE | Stephan Kreutzer:
On the Parameterised Intractability of Monadic Second-Order Logic
CoRR abs/0904.1302: (2009) |
2008 |
31 | EE | Anuj Dawar,
Stephan Kreutzer:
On Datalog vs. LFP.
ICALP (2) 2008: 160-171 |
30 | EE | Stephan Kreutzer:
Algorithmic Meta-theorems.
IWPEC 2008: 10-12 |
29 | EE | Isolde Adler,
Martin Grohe,
Stephan Kreutzer:
Computing excluded minors.
SODA 2008: 641-650 |
28 | EE | Stephan Kreutzer,
Sebastian Ordyniak:
Digraph Decompositions and Monotonicity in Digraph Searching.
WG 2008: 336-347 |
27 | EE | Stephan Kreutzer,
Sebastian Ordyniak:
Digraph Decompositions and Monotonicity in Digraph Searching
CoRR abs/0802.2228: (2008) |
26 | EE | Paul Hunter,
Stephan Kreutzer:
Digraph measures: Kelly decompositions, games, and orderings.
Theor. Comput. Sci. 399(3): 206-219 (2008) |
2007 |
25 | EE | Stephan Kreutzer,
Martin Otto,
Nicole Schweikardt:
Boundedness of Monadic FO over Acyclic Structures.
ICALP 2007: 571-582 |
24 | EE | Anuj Dawar,
Martin Grohe,
Stephan Kreutzer,
Nicole Schweikardt:
Model Theory Makes Formulas Large.
ICALP 2007: 913-924 |
23 | EE | Anuj Dawar,
Martin Grohe,
Stephan Kreutzer:
Locally Excluding a Minor.
LICS 2007: 270-279 |
22 | EE | Paul Hunter,
Stephan Kreutzer:
Digraph measures: Kelly decompositions, games, and orderings.
SODA 2007: 637-644 |
21 | EE | Anuj Dawar,
Stephan Kreutzer:
Generalising automaticity to modal properties of finite structures.
Theor. Comput. Sci. 379(1-2): 266-285 (2007) |
2006 |
20 | EE | Anuj Dawar,
Martin Grohe,
Stephan Kreutzer,
Nicole Schweikardt:
Approximation Schemes for First-Order Definable Optimisation Problems.
LICS 2006: 411-420 |
19 | EE | Dietmar Berwanger,
Anuj Dawar,
Paul Hunter,
Stephan Kreutzer:
DAG-Width and Parity Games.
STACS 2006: 524-536 |
18 | EE | Anuj Dawar,
Erich Grädel,
Stephan Kreutzer:
Backtracking games and inflationary fixed points.
Theor. Comput. Sci. 350(2-3): 174-187 (2006) |
2005 |
17 | EE | Julian C. Bradfield,
Stephan Kreutzer:
The Complexity of Independence-Friendly Fixpoint Logic.
CSL 2005: 355-368 |
16 | EE | Martin Grohe,
Stephan Kreutzer,
Nicole Schweikardt:
The Expressive Power of Two-Variable Least Fixed-Point Logics.
MFCS 2005: 422-434 |
15 | EE | Achim Bluemnsath,
Stephan Kreutzer:
An Extension of Muchnik's Theorem.
J. Log. Comput. 15(1): 59-74 (2005) |
2004 |
14 | EE | Anuj Dawar,
Erich Grädel,
Stephan Kreutzer:
Backtracking Games and Inflationary Fixed Points.
ICALP 2004: 420-432 |
13 | EE | Anuj Dawar,
Erich Grädel,
Stephan Kreutzer:
Inflationary fixed points in modal logic.
ACM Trans. Comput. Log. 5(2): 282-315 (2004) |
12 | EE | Stephan Kreutzer:
Expressive equivalence of least and inflationary fixed-point logic.
Ann. Pure Appl. Logic 130(1-3): 61-78 (2004) |
11 | EE | Stephan Kreutzer,
Nicole Schweikardt:
Logik und Informatik.
it - Information Technology 46(3): 162-166 (2004) |
2003 |
10 | EE | Erich Grädel,
Stephan Kreutzer:
Will Deflation Lead to Depletion? On Non-Monotone Fixed Point Inductions.
LICS 2003: 158- |
9 | EE | 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 |
2002 |
8 | EE | Stephan Kreutzer:
Partial Fixed-Point Logic on Infinite Structures.
CSL 2002: 337-351 |
7 | EE | Anuj Dawar,
Stephan Kreutzer:
Generalising Automaticity to Modal Properties of Finite Structures.
FSTTCS 2002: 109-120 |
6 | EE | Stephan Kreutzer:
Expressive Equivalence of Least and Inflationary Fixed-Point Logic.
LICS 2002: 403- |
2001 |
5 | EE | Anuj Dawar,
Erich Grädel,
Stephan Kreutzer:
Inflationary Fixed Points in Modal Logic.
CSL 2001: 277-291 |
4 | EE | Stephan Kreutzer:
Query Languages for Constraint Databases: First-Order Logic, Fixed-Points, and Convex Hulls.
ICDT 2001: 248-262 |
3 | EE | Stephan Kreutzer:
Operational Semantics for Fixed-Point Logics on Constraint Databases.
LPAR 2001: 470-484 |
2000 |
2 | EE | Stephan Kreutzer:
Fixed-Point Query Languages for Linear Constraint Databases.
PODS 2000: 116-125 |
1999 |
1 | | Erich Grädel,
Stephan Kreutzer:
Descriptive Complexity Theory for Constraint Databases.
CSL 1999: 67-81 |