Stephan Kreutzer: Publications

[1]	Algorithmic Meta-Theorems Stephan Kreutzer 2008. Details \| BibTeX \| Link (pdf)

[2]	Digraph Decompositions and Monotonocity in Digraph Searching Stephan Kreutzer, Sebastian Ordyniak 2008. Details \| BibTeX

[3]	On Datalog vs. LFP Anuj Dawar, Stephan Kreutzer 2008. Details \| BibTeX \| Link (pdf)

[4]	Digraph Decompositions and Monotonocity in Digraph Searching Stephan Kreutzer, Sebastian Ordyniak 2008. Preprint. Slightly revised version of arXiv.org (no arXiv:0802.2228v1). Details \| BibTeX \| Link (pdf)

[5]	Digraph Measures: Kelly Decompositions, Games, and Orderings Paul Hunter, Stephan Kreutzer Theoretical Computer Science (TCS), Vol. 399, pages 206-219. 2008. Details \| BibTeX \| Link (pdf)

[6]	Computing Excluded Minors Isolde Adler, Martin Grohe and Stephan Kreutzer In ACM-SIAM Symposium on Discrete Algorithms (SODA) 2008. Details \| BibTeX \| Link (pdf)

[7]	Digraph Measures: Kelly Decompositions, Games, and Orderings Paul Hunter, Stephan Kreutzer In ACM-SIAM Symposium on Discrete Algorithms (SODA) 2007. Details \| BibTeX

[8]	Generalising Automaticity to Model Properties of Finite Structures Anuj Dawar, Stephan Kreutzer Theoretical Computer Science, Vol. 379, No. 1-2, pages 266 — 285. 2007. Details \| BibTeX

[9]	Model theory makes formulas large Anuj Dawar et al. In International Colloquium on Automata, Languages and Programming (ICALP) Vol. 4596 of Lecture Notes in Computer Science, pages 913-924. 2007. Details \| BibTeX

[10]	Locally Excluding a Minor Anuj Dawar, Martin Grohe and Stephan Kreutzer In Logic in Computer Science (LICS) pages 270-279. 2007. Details \| BibTeX \| Link (pdf)

[11]	The Complexity of Independence-Friendly Fixpoint Logic Julian Bradfield, Stephan Kreutzer In Foundations of the Formal Sciences V - Infinite Games (FotFS V) Vol. 11 of Studies in Logic. College Publications, London, 2007, 2007. Details \| BibTeX

[12]	Backtracking Games and Inflationary Fixed Points Anuj Dawar, Erich Grädel and Stephan Kreutzer Theoretical Computer Science, Vol. 350, No. 2-3, pages 171 — 187. 2006. ICALP 2004 Selected Paper issue. Details \| BibTeX

[13]	DAG-Width and Parity Games Dietmar Berwanger et al. In Symposium on Theoretical Aspects of Computer Science (STACS) 2006. Details \| BibTeX \| Link (pdf)

[14]	Approximation Schemes for First-Order Definable Optimisation Problems Stephan Kreutzer Nicole Schweikardt Anuj Dawar, Martin Grohe In Logic in Computer Science (LICS) pages 411-420. 2006. Details \| BibTeX

[15]	The Expressive Power of Two-Variable Least Fixed-Point Logics M. Grohe, S. Kreutzer and N. Schweikardt In Symposium on Mathematical Foundations of Computer Science (MFCS) pages 422 — 434. Springer, 2005. Details \| BibTeX \| Link (pdf)

[16]	The Complexity of Independence-Friendly Fixpoint Logic Julian Bradfield, Stephan Kreutzer In Proceedings of the 14th Annual Conference of the European Association for Computer Science Logic (CSL) Vol. 3634 of Lecture Notes in Computer Science. Springer, 2005. Details \| BibTeX

[17]	An Extension of Muchnik's Theorem Achim Blumensath, Stephan Kreutzer Journal of Logic and Computation, Vol. 15, No. 1, pages 59 — 74. 2005. Details \| BibTeX

[18]	Logik und Informatik Stephan Kreutzer, Nicole Schweikardt it - Information Technology, Vol. 46, No. 3, pages 162—166. 2004. in german. Details \| BibTeX

[19]	Expressive Equivalence of Least and Inflationary Fixed-Point Logic Stephan Kreutzer Annals of Pure and Applied Logic, Vol. 130, No. 1-3, pages 61—78. 2004. LICS 2002 Selected Paper Issue. Details \| BibTeX

[20]	Inflationary Fixed Points in Modal Logics Anuj Dawar, Erich Grädel and Stephan Kreutzer ACM Transactions on Computational Logic (TOCL, Vol. 5, No. 2, pages 282 - 315. 2004. Details \| BibTeX

[21]	Backtracking games and inflationary fixed points Anuj Dawar, Erich Grädel and Stephan Kreutzer In 31st International Colloquium on Automata, Languages and Programming (ICALP) 2004. Details \| BibTeX

[22]	Pure and Applied Fixed-Point Logics Stephan Kreutzer In D. Wagner et al., editor, Ausgezeichnete Informatik Dissertationen 2003 Vol. D-3 of Lecture Notes in Informatics - Dissertations. German Informatics Society (GI). 2003. in german. Details \| BibTeX

[23]	Will Deflation Lead to Depletion? On Non-Monotone Fixed-Point Inductions E. Grädel, S. Kreutzer In IEEE Symp. of Logic in Computer Science (LICS) 2003. Details \| BibTeX

[24]

Once upon a time in the west — Determinacy, definability and complexity of path games

D. Berwanger, E. Grädel and S. Kreutzer

In M. Vardi, A. Voronkov, editors, Proceedings of the 10th International Conference on Logic for Programming and Automated Reasoning Vol. 2850 of Lecture Notes in Computer Science, pages 226 — 240. Springer, 2003.

Details | BibTeX

[25]	Pure and Applied Fixed-Point Logics S. Kreutzer PhD Thesis, Dissertation thesis, RWTH Aachen. 2002. Details \| BibTeX

[26]	Partial Fixed-Point Logic on Infinite Structures S. Kreutzer In Annual Conference of the European Association for Computer Science Logic (CSL) Vol. 2471 of Lecture Notes in Computer Science. Springer, 2002. Details \| BibTeX

[27]	Expressive Equivalence of Least and Inflationary Fixed-Point Logic S. Kreutzer In Proc. of the 17th Symp. on Logic in Computer Science (LICS) pages 403 — 413. 2002. Details \| BibTeX

[28]	Generalising Automaticity to Modal Properties of Finite Structures A. Dawar, S. Kreutzer In Proc. 22nd Conf. on Foundations of Software Technology and Theoretical Computer Science (FSTTCS) Vol. 2556 of Lecture Notes in Computer Science, pages 109—120. Springer, 2002. Details \| BibTeX

[29]

Operational Semantics for Fixed-Point Logics on Constraint Databases

S. Kreutzer

In Proceedings of the 8th International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR) Vol. 2250 of Lecture Notes in Artificial Intelligence (LNAI), pages 470 — 484. Springer, 2001.

Details | BibTeX

[30]	Query Languages for Constraint Databases: First-Order Logic, Fixed-Points, and Convex Hulls S. Kreutzer In Proceedings of the 8th International Conference on Database Theory (ICDT) No. 1973, pages 248—262. Springer, 2001. Details \| BibTeX

[31]	Inflationary Fixed Points in Modal Logics A. Dawar, E. Grädel and S. Kreutzer In Proc. of the 10th Conf. on Computer Science Logic (CSL) Vol. 2142 of Lecture Notes in Computer Science, pages 277—291. Springer-Verlag, 2001. Details \| BibTeX

[32]	Fixed-point Query Languages for Linear Constraint Databases S. Kreutzer In Proceedings of the 19th ACM Symp. on Principles of Database Systems (PODS), 2000 pages 116—125. ACM press, 2000. Details \| BibTeX

[33]	Descriptive Complexity Theory for Constraint Databases S. Kreutzer Master's Thesis. 1999. Details \| BibTeX

[34]	Descriptive Complexity Theory for Constraint Databases E. Grädel, S. Kreutzer In Computer Science Logic (CSL) No. 1683, pages 67 — 82. Springer, 1999. Details \| BibTeX

[35]	Details \| BibTeX