Obserwuj
Stephan Kreutzer
Stephan Kreutzer
Professor of Computer Science, Technical University Berlin
Zweryfikowany adres z tu-berlin.de - Strona główna
Tytuł
Cytowane przez
Cytowane przez
Rok
Deciding first-order properties of nowhere dense graphs
M Grohe, S Kreutzer, S Siebertz
Journal of the ACM (JACM) 64 (3), 1-32, 2017
2482017
Digraph measures: Kelly decompositions, games, and orderings
P Hunter, S Kreutzer
Theoretical Computer Science 399 (3), 206-219, 2008
1702008
DAG-width and parity games
D Berwanger, A Dawar, P Hunter, S Kreutzer
STACS 2006: 23rd Annual Symposium on Theoretical Aspects of Computer Science …, 2006
1652006
Locally excluding a minor
A Dawar, M Grohe, S Kreutzer
22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007), 270-279, 2007
1492007
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
1012012
Reachability in succinct and parametric one-counter automata
C Haase, S Kreutzer, J Ouaknine, J Worrell
CONCUR 2009-Concurrency Theory: 20th International Conference, CONCUR 2009 …, 2009
962009
Computing excluded minors
I Adler, M Grohe, S Kreutzer
892008
Methods for algorithmic meta theorems
M Grohe, S Kreutzer
Model Theoretic Methods in Finite Combinatorics 558, 181-206, 2011
822011
Domination problems in nowhere-dense classes of graphs
A Dawar, S Kreutzer
arXiv preprint arXiv:0907.4283, 2009
742009
Algorithmic meta-theorems
S Kreutzer
Parameterized and Exact Computation: Third International Workshop, IWPEC …, 2008
712008
Model theory makes formulas large
A Dawar, M Grohe, S Kreutzer, N Schweikardt
Automata, Languages and Programming: 34th International Colloquium, ICALP …, 2007
642007
The Directed Grid Theorem
KI Kawarabayashi, S Kreutzer
Forty-Seventh Annual ACM on Symposium on Theory of Computing (STOC), 655-664, 2015
622015
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
602014
Algorithmic meta-theorems.
S Kreutzer
Finite and algorithmic model theory 379, 177-270, 2011
602011
First-order interpretations of bounded expansion classes
J Gajarský, S Kreutzer, J Nešetřil, POD Mendez, M Pilipczuk, S Siebertz, ...
ACM Transactions on Computational Logic (TOCL) 21 (4), 1-41, 2020
592020
Digraph decompositions and monotonicity in digraph searching
S Kreutzer, S Ordyniak
Theoretical Computer Science 412 (35), 4688-4703, 2011
562011
Expressive equivalence of least and inflationary fixed-point logic
S Kreutzer
Annals of Pure and Applied Logic 130 (1-3), 61-78, 2004
532004
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
502006
Neighborhood complexity and kernelization for nowhere dense classes of graphs
K Eickmeyer, AC Giannopoulou, S Kreutzer, O Kwon, M Pilipczuk, ...
arXiv preprint arXiv:1612.08197, 2016
492016
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
492010
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20