Stephan Kreutzer
Stephan Kreutzer
Professor of Computer Science, Technical University Berlin
Verified email at - Homepage
Cited by
Cited by
Deciding first-order properties of nowhere dense graphs
M Grohe, S Kreutzer, S Siebertz
Journal of the ACM (JACM) 64 (3), 1-32, 2017
DAG-width and parity games
D Berwanger, A Dawar, P Hunter, S Kreutzer
Annual Symposium on Theoretical Aspects of Computer Science, 524-536, 2006
Digraph Measures: Kelly Decompositions ‚Games ‚and Orderings
P Hunter, S Kreutzer
Theoretical Computer Science (TCS) 399, 2008
Locally excluding a minor
A Dawar, M Grohe, S Kreutzer
22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007), 270-279, 2007
The dag-width of directed graphs
D Berwanger, A Dawar, P Hunter, S Kreutzer, J Obdržálek
Journal of Combinatorial Theory, Series B 102 (4), 900-923, 2012
Reachability in succinct and parametric one-counter automata
C Haase, S Kreutzer, J Ouaknine, J Worrell
International Conference on Concurrency Theory, 369-383, 2009
Computing excluded minors
I Adler, M Grohe, S Kreutzer
Methods for algorithmic meta theorems
M Grohe, S Kreutzer
Model Theoretic Methods in Finite Combinatorics 558, 181-206, 2011
Algorithmic meta-theorems
S Kreutzer
International Workshop on Parameterized and Exact Computation, 10-12, 2008
Domination problems in nowhere-dense classes of graphs
A Dawar, S Kreutzer
arXiv preprint arXiv:0907.4283, 2009
Quantitative graph theory: mathematical foundations and applications
M Dehmer, F Emmert-Streib
CRC press, 2014
Model theory makes formulas large
A Dawar, M Grohe, S Kreutzer, N Schweikardt
International Colloquium on Automata, Languages, and Programming, 913-924, 2007
Expressive equivalence of least and inflationary fixed-point logic
S Kreutzer
Annals of Pure and Applied Logic 130 (1-3), 61-78, 2004
Kernelization and sparseness: the case of dominating set
PG Drange, MS Dregi, FV Fomin, S Kreutzer, D Lokshtanov, M Pilipczuk, ...
arXiv preprint arXiv:1411.4575, 2014
Algorithmic meta-theorems.
S Kreutzer
Finite and algorithmic model theory 379, 177-270, 2011
Approximation schemes for first-order definable optimisation problems
A Dawar, M Grohe, S Kreutzer, N Schweikardt
21st Annual IEEE Symposium on Logic in Computer Science (LICS'06), 411-420, 2006
Inflationary fixed points in modal logic
A Dawar, E Grädel, S Kreutzer
ACM Transactions on Computational Logic (TOCL) 5 (2), 282-315, 2004
On brambles, grid-like minors, and parameterized intractability of monadic second-order logic
S Kreutzer, S Tazari
Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete …, 2010
Digraph decompositions and monotonicity in digraph searching
S Kreutzer, S Ordyniak
International Workshop on Graph-Theoretic Concepts in Computer Science, 336-347, 2008
Lower bounds for the complexity of monadic second-order logic
S Kreutzer, S Tazari
2010 25th Annual IEEE Symposium on Logic in Computer Science, 189-198, 2010
The system can't perform the operation now. Try again later.
Articles 1–20