Stephan Kreutzer

	2012
56		Stephan Kreutzer, Siamak Tazari: Directed nowhere dense classes of graphs. SODA 2012: 1552-1562
55		Ken-ichi Kawarabayashi, Stephan Kreutzer, Bojan Mohar: Linkless and Flat Embeddings in 3-Space. Discrete & Computational Geometry 47(4): 731-755 (2012)
54		Stephan Kreutzer: On the Parameterized Intractability of Monadic Second-Order Logic Logical Methods in Computer Science 8(1): (2012)
	2011
53		Stephan Kreutzer, Siamak Tazari: Directed Nowhere Dense Classes of Graphs CoRR abs/1104.3808: (2011)
52		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)
51		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)
50		Stephan Kreutzer, Sebastian Ordyniak: Digraph decompositions and monotonicity in digraph searching. Theor. Comput. Sci. 412(35): 4688-4703 (2011)
	2010
49		Stephan Kreutzer, Siamak Tazari: Lower Bounds for the Complexity of Monadic Second-Order Logic. LICS 2010: 189-198
48		Roland Axelsson, Matthew Hague, Stephan Kreutzer, Martin Lange, Markus Latte: Extended Computation Tree Logic. LPAR (Yogyakarta) 2010: 67-81
47		Stephan Kreutzer, Siamak Tazari: On Brambles, Grid-Like Minors, and Parameterized Intractability of Monadic Second-Order Logic. SODA 2010: 354-364
46		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
45		Stephan Kreutzer, Siamak Tazari: Lower Bounds for the Complexity of Monadic Second-Order Logic CoRR abs/1001.5019: (2010)
44		Roland Axelsson, Matthew Hague, Stephan Kreutzer, Martin Lange, Markus Latte: Extended Computation Tree Logic CoRR abs/1006.3709: (2010)
	2009
43		Christoph Haase, Stephan Kreutzer, Joël Ouaknine, James Worrell: Reachability in Succinct and Parametric One-Counter Automata. CONCUR 2009: 369-383
42		Stephan Kreutzer: On the Parameterised Intractability of Monadic Second-Order Logic. CSL 2009: 348-363
41		Anuj Dawar, Stephan Kreutzer: Domination Problems in Nowhere-Dense Classes. FSTTCS 2009: 157-168
40		Stephan Kreutzer, Sebastian Ordyniak: Distance d-Domination Games. WG 2009: 308-319
39		Stephan Kreutzer: Algorithmic Meta-Theorems CoRR abs/0902.3616: (2009)
38		Stephan Kreutzer: On the Parameterised Intractability of Monadic Second-Order Logic CoRR abs/0904.1302: (2009)
37		Stephan Kreutzer, Siamak Tazari: On Brambles, Grid-Like Minors, and Parameterized Intractability of Monadic Second-Order Logic CoRR abs/0907.3076: (2009)
36		Anuj Dawar, Stephan Kreutzer: Domination Problems in Nowhere-Dense Classes of Graphs CoRR abs/0907.4283: (2009)
35		Stephan Kreutzer, Anuj Dawar: Parameterized Complexity of First-Order Logic. Electronic Colloquium on Computational Complexity (ECCC) 16: 131 (2009)
34		Stephan Kreutzer: Algorithmic Meta-Theorems. Electronic Colloquium on Computational Complexity (ECCC) 16: 147 (2009)
	2008
33		Anuj Dawar, Stephan Kreutzer: On Datalog vs. LFP. ICALP (2) 2008: 160-171
32		Stephan Kreutzer: Algorithmic Meta-theorems. IWPEC 2008: 10-12
31		Stephan Kreutzer, Martin Lange: Non-regular fixed-point logics and games. Logic and Automata 2008: 423-456
30		Isolde Adler, Martin Grohe, Stephan Kreutzer: Computing excluded minors. SODA 2008: 641-650
29		Stephan Kreutzer, Sebastian Ordyniak: Digraph Decompositions and Monotonicity in Digraph Searching. WG 2008: 336-347
28		Stephan Kreutzer, Sebastian Ordyniak: Digraph Decompositions and Monotonicity in Digraph Searching CoRR abs/0802.2228: (2008)
27		Paul Hunter, Stephan Kreutzer: Digraph measures: Kelly decompositions, games, and orderings. Theor. Comput. Sci. 399(3): 206-219 (2008)
	2007
26		Stephan Kreutzer, Martin Otto, Nicole Schweikardt: Boundedness of Monadic FO over Acyclic Structures. ICALP 2007: 571-582
25		Anuj Dawar, Martin Grohe, Stephan Kreutzer, Nicole Schweikardt: Model Theory Makes Formulas Large. ICALP 2007: 913-924
24		Anuj Dawar, Martin Grohe, Stephan Kreutzer: Locally Excluding a Minor. LICS 2007: 270-279
23		Paul Hunter, Stephan Kreutzer: Digraph measures: Kelly decompositions, games, and orderings. SODA 2007: 637-644
22		Anuj Dawar, Stephan Kreutzer: Generalising automaticity to modal properties of finite structures. Theor. Comput. Sci. 379(1-2): 266-285 (2007)
	2006
21		Anuj Dawar, Martin Grohe, Stephan Kreutzer, Nicole Schweikardt: Approximation Schemes for First-Order Definable Optimisation Problems. LICS 2006: 411-420
20		Dietmar Berwanger, Anuj Dawar, Paul Hunter, Stephan Kreutzer: DAG-Width and Parity Games. STACS 2006: 524-536
19		Anuj Dawar, Erich Grädel, Stephan Kreutzer: Backtracking games and inflationary fixed points. Theor. Comput. Sci. 350(2-3): 174-187 (2006)
	2005
18		Julian C. Bradfield, Stephan Kreutzer: The Complexity of Independence-Friendly Fixpoint Logic. CSL 2005: 355-368
17		Martin Grohe, Stephan Kreutzer, Nicole Schweikardt: The Expressive Power of Two-Variable Least Fixed-Point Logics. MFCS 2005: 422-434
16		Achim Bluemnsath, Stephan Kreutzer: An Extension of Muchnik's Theorem. J. Log. Comput. 15(1): 59-74 (2005)
	2004
15		Anuj Dawar, Erich Grädel, Stephan Kreutzer: Backtracking Games and Inflationary Fixed Points. ICALP 2004: 420-432
14		Anuj Dawar, Erich Grädel, Stephan Kreutzer: Inflationary fixed points in modal logic. ACM Trans. Comput. Log. 5(2): 282-315 (2004)
13		Stephan Kreutzer: Expressive equivalence of least and inflationary fixed-point logic. Ann. Pure Appl. Logic 130(1-3): 61-78 (2004)
12		Stephan Kreutzer, Nicole Schweikardt: Logik und Informatik. it - Information Technology 46(3): 162-166 (2004)
	2003
11		Erich Grädel, Stephan Kreutzer: Will Deflation Lead to Depletion? On Non-Monotone Fixed Point Inductions. LICS 2003: 158-
10		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
9		Stephan Kreutzer: Partial Fixed-Point Logic on Infinite Structures. CSL 2002: 337-351
8		Anuj Dawar, Stephan Kreutzer: Generalising Automaticity to Modal Properties of Finite Structures. FSTTCS 2002: 109-120
7		Stephan Kreutzer: Expressive Equivalence of Least and Inflationary Fixed-Point Logic. LICS 2002: 403-
6		Stephan Kreutzer: Pure and applied fixed-point logics. Universität Aachen 2002: 1-231
	2001
5		Anuj Dawar, Erich Grädel, Stephan Kreutzer: Inflationary Fixed Points in Modal Logic. CSL 2001: 277-291
4		Stephan Kreutzer: Query Languages for Constraint Databases: First-Order Logic, Fixed-Points, and Convex Hulls. ICDT 2001: 248-262
3		Stephan Kreutzer: Operational Semantics for Fixed-Point Logics on Constraint Databases. LPAR 2001: 470-484
	2000
2		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

Coauthor Index

1	Isolde Adler	[30]
2	Roland Axelsson	[44] [48]
3	Dietmar Berwanger	[10] [20]
4	Achim Bluemnsath	[16]
5	Julian C. Bradfield	[18]
6	Anuj Dawar	[5] [8] [14] [15] [19] [20] [21] [22] [24] [25] [33] [35] [36] [41]
7	Fedor V. Fomin	[51] [52]
8	Pierre Fraigniaud	[51] [52]
9	Erich Grädel	[1] [5] [10] [11] [14] [15] [19]
10	Martin Grohe	[17] [21] [24] [25] [30]
11	Christoph Haase	[43]
12	Matthew Hague	[44] [48]
13	Paul Hunter	[20] [23] [27]
14	Ken-ichi Kawarabayashi	[46] [55]
15	Martin Lange	[31] [44] [48]
16	Markus Latte	[44] [48]
17	Bojan Mohar	[46] [55]
18	Sebastian Ordyniak	[28] [29] [40] [50]
19	Martin Otto	[26]
20	Joël Ouaknine	[43]
21	Nicole Schweikardt	[12] [17] [21] [25] [26]
22	Siamak Tazari	[37] [45] [47] [49] [53] [56]
23	Dimitrios M. Thilikos	[51] [52]
24	James Worrell	[43]

Colors in the list of coauthors

Last update Fri May 25 01:42:58 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page