Stephan Kreutzer : Publications
Book chapters
|
[1] |
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 |
Journal papers
|
[1] |
Distance−d−Domination Games Stephan Kreutzer and Sebastian Ordyniak In 34th International Workshop on Graph−Theoretic Concepts in Computer Science (WG). 2009. |
|
[2] |
Logik und Informatik Stephan Kreutzer and Nicole Schweikardt In it − Information Technology. Vol. 46. No. 3. Pages 162–166. 2004. in german |
|
[3] |
Expressive Equivalence of Least and Inflationary Fixed−Point Logic Stephan Kreutzer In Annals of Pure and Applied Logic. Vol. 130. No. 1−3. Pages 61–78. 2004. LICS 2002 Selected Paper Issue |
|
[4] |
Digraph Measures: Kelly Decompositions‚ Games‚ and Orderings Paul Hunter and Stephan Kreutzer In Theoretical Computer Science (TCS). Vol. 399. Pages 206−219. 2008. |
|
[5] |
Generalising Automaticity to Model Properties of Finite Structures Anuj Dawar and Stephan Kreutzer In Theoretical Computer Science. Vol. 379. No. 1−2. Pages 266 – 285. 2007. |
|
[6] |
Inflationary Fixed Points in Modal Logics Anuj Dawar‚ Erich Grädel and Stephan Kreutzer In ACM Transactions on Computational Logic (TOCL. Vol. 5. No. 2. Pages 282 − 315. 2004. |
|
[7] |
Backtracking Games and Inflationary Fixed Points Anuj Dawar‚ Erich Grädel and Stephan Kreutzer In Theoretical Computer Science. Vol. 350. No. 2−3. Pages 171 – 187. 2006. ICALP 2004 Selected Paper issue |
|
[8] |
An Extension of Muchnik's Theorem Achim Blumensath and Stephan Kreutzer In Journal of Logic and Computation. Vol. 15. No. 1. Pages 59 – 74. 2005. |
Conference papers
|
[1] |
Domination Problems in Nowhere−Dense Classes of Graphs‚ Anuj Dawar and Stephan Kreutzer In Foundations of Software Technology and Theoretical Computer Science (FSTTCS). 2009. |
|
[2] |
On Brambles‚ Grid−Like Minors‚ and Parameterized Intractability of Monadic Second−Order Logic Stephan Kreutzer and Siamak Tazari In Symposium on Discrete Algorithms (SODA). 2010. |
|
[3] |
On the Parameterised Intractability of Monadic Second−Order Logic Stephan Kreutzer In Computer Science Logic (CSL). 2009. |
|
[4] |
Reachability in Succinct and Parametric One−Counter Automata Christoph Haase‚ Stephan Kreutzer‚ Joel Ouaknine and James Worrell In M. Bravetti and G. Zavattaro, editors, Proceedings of the 20th International Conference on Concurrency Theory (CONCUR'09). Vol. 5710 of Lecture Notes in Computer Science. Pages 369–383. Springer. September, 2009. Details | BibTeX | Download (pdf) | DOI (10.1007/978-3-642-04081-8_25) |
|
[5] |
Algorithmic Meta−Theorems Stephan Kreutzer In International Workshop on Exact and Parameterized Computation (IWPEC). 2008. |
|
[6] |
Digraph Decompositions and Monotonocity in Digraph Searching Stephan Kreutzer and Sebastian Ordyniak In 34th International Workshop on Graph−Theoretic Concepts in Computer Science (WG). 2008. |
|
[7] |
On Datalog vs. LFP Anuj Dawar and Stephan Kreutzer In 35th International Colloquium on Automata‚ Languages and Programming (ICALP). 2008. |
|
[8] |
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. |
|
[9] |
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. |
|
[10] |
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. |
|
[11] |
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. |
|
[12] |
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. |
|
[13] |
Digraph Measures: Kelly Decompositions‚ Games‚ and Orderings Paul Hunter and Stephan Kreutzer In ACM−SIAM Symposium on Discrete Algorithms (SODA). 2007. |
|
[14] |
Descriptive Complexity Theory for Constraint Databases E. Grädel and S. Kreutzer In Computer Science Logic (CSL). No. 1683. Pages 67 – 82. Springer. 1999. |
|
[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. |
|
[16] |
Will Deflation Lead to Depletion? On Non−Monotone Fixed−Point Inductions E. Grädel and S. Kreutzer In IEEE Symp. of Logic in Computer Science (LICS). 2003. |
|
[17] |
Generalising Automaticity to Modal Properties of Finite Structures A. Dawar and 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. |
|
[18] |
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#. 2001. |
|
[19] |
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. |
|
[20] |
Model theory makes formulas large Anuj Dawar‚ Martin Grohe‚ Stephan Kreutzer and Nicole Schweikardt In International Colloquium on Automata‚ Languages and Programming (ICALP). Vol. 4596 of Lecture Notes in Computer Science. Pages 913−924. 2007. |
|
[21] |
Locally Excluding a Minor Anuj Dawar‚ Martin Grohe and Stephan Kreutzer In Logic in Computer Science (LICS). Pages 270−279. 2007. |
|
[22] |
The Complexity of Independence−Friendly Fixpoint Logic Julian Bradfield and 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. |
|
[23] |
The Complexity of Independence−Friendly Fixpoint Logic Julian Bradfield and Stephan Kreutzer In Foundations of the Formal Sciences V − Infinite Games (FotFS V). Vol. 11 of Studies in Logic. College Publications‚ London‚ 2007. 2007. |
|
[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 and 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. |
|
[25] |
DAG−Width and Parity Games Dietmar Berwanger‚ Anuj Dawar‚ Paul Hunter and Stephan Kreutzer In Symposium on Theoretical Aspects of Computer Science (STACS). 2006. |
|
[26] |
Approximation Schemes for First−Order Definable Optimisation Problems Stephan Kreutzer Nicole Schweikardt Anuj Dawar and Martin Grohe In Logic in Computer Science (LICS). Pages 411−420. 2006. |
|
[27] |
Computing Excluded Minors Isolde Adler‚ Martin Grohe and Stephan Kreutzer In ACM−SIAM Symposium on Discrete Algorithms (SODA). 2008. |
Theses
|
[1] |
Descriptive Complexity Theory for Constraint Databases S. Kreutzer Master's Thesis 1999. |
|
[2] |
Pure and Applied Fixed−Point Logics S. Kreutzer PhD Thesis Dissertation thesis‚ RWTH Aachen. 2002. |
Miscellaneous
|
[1] |
Digraph Decompositions and Monotonocity in Digraph Searching Stephan Kreutzer and Sebastian Ordyniak 2008. Preprint. Slightly revised version of arXiv.org (no arXiv:0802.2228v1) |
|
[2] |
|