Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Kreutzer, Stephan"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Graph searching games and width measures for directed graphs
Saeed Akhoondian Amiri
,
Łukasz Kaiser
,
Stephan Kreutzer
,
Roman Rabinovich
,
Sebastian Siebertz
Leibniz International Proceedings in Informatics (LIPIcs)
30
, 2015, pp. 34-47
Characterisations of nowhere dense graphs
Martin Grohe
,
Stephan Kreutzer
,
Sebastian Siebertz
Leibniz International Proceedings in Informatics (LIPIcs)
24
, 2013, pp. 21-40
The DAG-width of directed graphs
Dietmar Berwanger
,
Anuj Dawar
,
Paul Hunter
,
Stephan Kreutzer
,
Jan Obdrz̑álek
Journal of Combinatorial Theory Series B
102
(4), 2012, pp. 900-923
Digraph decompositions and monotonicity in digraph searching
Stephan Kreutzer
,
Sebastian Ordyniak
Theoretical Computer Science
412
(35), 2011, pp. 4688-4703
Distance
d
-domination games
Stephan Kreutzer
,
Sebastian Ordyniak
Lecture Notes in Computer Science
5911
, 2010, pp. 308-319
Domination problems in nowhere-dense classes
Anuj Dawar
,
Stephan Kreutzer
Leibniz International Proceedings in Informatics (LIPIcs)
4
, 2009, pp. 157-168
On Datalog vs. LFP
Anuj Dawar
,
Stephan Kreutzer
Lecture Notes in Computer Science
5126
, 2008, pp. 160-171
Digraph measures: Kelly decompositions, games, and orderings
Paul Hunter
,
Stephan Kreutzer
Theoretical Computer Science
399
(3), 2008, pp. 206-219
Digraph decompositions and monotonicity in digraph searching
Stephan Kreutzer
,
Sebastian Ordyniak
Lecture Notes in Computer Science
5344
, 2008, pp. 336-347
Model theory makes formulas large
Anuj Dawar
,
Martin Grohe
,
Stephan Kreutzer
,
Nicole Schweikardt
Lecture Notes in Computer Science
4596
, 2007, pp. 913-924
Generalising automaticity to modal properties of finite structures
Anuj Dawar
,
Stephan Kreutzer
Theoretical Computer Science
379
(1-2), 2007, pp. 266-285
Boundedness of monadic FO over acyclic structures
Stephan Kreutzer
,
Martin Otto
,
Nicole Schweikardt
Lecture Notes in Computer Science
4596
, 2007, pp. 571-582
DAG-width and parity games
Dietmar Berwanger
,
Anuj Dawar
,
Paul Hunter
,
Stephan Kreutzer
Lecture Notes in Computer Science
3884
, 2006, pp. 524-536
Backtracking games and inflationary fixed points
Anuj Dawar
,
Erich Grädel
,
Stephan Kreutzer
Theoretical Computer Science
350
(2-3), 2006, pp. 174-187
The expressive power of two-variable least fixed-point logics
Martin Grohe
,
Stephan Kreutzer
,
Nicole Schweikardt
Lecture Notes in Computer Science
3618
, 2005, pp. 422-434
Backtracking games and inflationary fixed points
Anuj Dawar
,
Erich Grädel
,
Stephan Kreutzer
Lecture Notes in Computer Science
3142
, 2004, pp. 420-432