Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStephan Kreutzer
Person information
- affiliation: Technische Universität Berlin, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j29]Archontia C. Giannopoulou, Stephan Kreutzer, Sebastian Wiederrecht
:
Excluding a planar matching minor in bipartite graphs. J. Comb. Theory B 164: 161-221 (2024)- [c70]Maximilian Gorsky, Ken-ichi Kawarabayashi, Stephan Kreutzer, Sebastian Wiederrecht:
Packing Even Directed Circuits Quarter-Integrally. STOC 2024: 692-703 - [c69]Dario Giuliano Cavallaro, Ken-ichi Kawarabayashi, Stephan Kreutzer:
Edge-Disjoint Paths in Eulerian Digraphs. STOC 2024: 704-715 - [i35]Dario Cavallaro, Ken-ichi Kawarabayashi, Stephan Kreutzer:
Edge-Disjoint Paths in Eulerian Digraphs. CoRR abs/2402.13716 (2024) - [i34]Meike Hatzel, Stephan Kreutzer, Marcelo Garlet Milani, Irene Muzi:
Cycles of Well-Linked Sets and an Elementary Bound for the Directed Grid Theorem. CoRR abs/2404.19222 (2024) - 2023
- [c68]Ken-ichi Kawarabayashi, Stephan Kreutzer, O-joung Kwon, Qiqin Xie:
A half-integral Erdős-Pósa theorem for directed odd cycles. SODA 2023: 3043-3062 - [i33]Maximilian Gorsky, Ken-ichi Kawarabayashi, Stephan Kreutzer, Sebastian Wiederrecht:
Packing even directed circuits quarter-integrally. CoRR abs/2311.16816 (2023) - 2022
- [c67]Jakub Gajarský, Maximilian Gorsky, Stephan Kreutzer:
Differential Games, Locality, and Model Checking for FO Logic of Graphs. CSL 2022: 22:1-22:18 - [c66]Édouard Bonnet, Jan Dreier, Jakub Gajarský, Stephan Kreutzer, Nikolas Mählmann, Pierre Simon, Szymon Torunczyk:
Model Checking on Interpretations of Classes of Bounded Local Cliquewidth. LICS 2022: 54:1-54:13 - [c65]Archontia C. Giannopoulou, Ken-ichi Kawarabayashi, Stephan Kreutzer, O-joung Kwon:
Directed Tangle Tree-Decompositions and Applications. SODA 2022: 377-405 - [i32]Édouard Bonnet, Jan Dreier, Jakub Gajarský, Stephan Kreutzer, Nikolas Mählmann, Pierre Simon, Szymon Torunczyk:
Model Checking on Interpretations of Classes of Bounded Local Cliquewidth. CoRR abs/2202.13014 (2022) - 2021
- [i31]Archontia C. Giannopoulou, Stephan Kreutzer, Sebastian Wiederrecht:
Excluding a Planar Matching Minor in Bipartite Graphs. CoRR abs/2106.00703 (2021) - 2020
- [j28]Kord Eickmeyer, Jan van den Heuvel, Ken-ichi Kawarabayashi, Stephan Kreutzer, Patrice Ossona de Mendez, Michal Pilipczuk, Daniel A. Quiroz, Roman Rabinovich, Sebastian Siebertz:
Model-Checking on Ordered Structures. ACM Trans. Comput. Log. 21(2): 11:1-11:28 (2020) - [j27]Jakub Gajarský, Stephan Kreutzer, Jaroslav Nesetril, Patrice Ossona de Mendez, Michal Pilipczuk, Sebastian Siebertz, Szymon Torunczyk:
First-Order Interpretations of Bounded Expansion Classes. ACM Trans. Comput. Log. 21(4): 29:1-29:41 (2020) - [c64]Archontia C. Giannopoulou, Ken-ichi Kawarabayashi, Stephan Kreutzer, O-joung Kwon:
The Directed Flat Wall Theorem. SODA 2020: 239-258 - [c63]Jakub Gajarský, Stephan Kreutzer:
Computing Shrub-Depth Decompositions. STACS 2020: 56:1-56:17 - [i30]Jakub Gajarský, Maximilian Gorsky, Stephan Kreutzer:
Differential games, locality and model checking for FO logic of graphs. CoRR abs/2007.11345 (2020) - [i29]Archontia C. Giannopoulou, Ken-ichi Kawarabayashi, Stephan Kreutzer, O-joung Kwon:
The canonical directed tree decomposition and its applications to the directed disjoint paths problem. CoRR abs/2009.13184 (2020)
2010 – 2019
- 2019
- [j26]Saeed Akhoondian Amiri, Stephan Kreutzer, Dániel Marx, Roman Rabinovich:
Routing with congestion in acyclic digraphs. Inf. Process. Lett. 151 (2019) - [j25]Stephan Kreutzer, Roman Rabinovich, Sebastian Siebertz:
Polynomial Kernels and Wideness Properties of Nowhere Dense Graph Classes. ACM Trans. Algorithms 15(2): 24:1-24:19 (2019) - [c62]Meike Hatzel, Ken-ichi Kawarabayashi, Stephan Kreutzer:
Polynomial Planar Directed Grid Theorem. SODA 2019: 1465-1484 - [c61]Stephan Kreutzer, Irene Muzi, Patrice Ossona de Mendez, Roman Rabinovich, Sebastian Siebertz:
Algorithmic Properties of Sparse Digraphs. STACS 2019: 46:1-46:20 - 2018
- [j24]Stephan Kreutzer:
The Presburger Award 2018 - Laudatio for Aleksander Madry. Bull. EATCS 125 (2018) - [j23]Martin Grohe, Stephan Kreutzer, Roman Rabinovich, Sebastian Siebertz, Konstantinos S. Stavropoulos:
Coloring and Covering Nowhere Dense Graphs. SIAM J. Discret. Math. 32(4): 2467-2481 (2018) - [c60]Albert Atserias, Stephan Kreutzer, Marc Noy:
On Zero-One and Convergence Laws for Graphs Embeddable on a Fixed Surface. ICALP 2018: 116:1-116:14 - [c59]Jakub Gajarský, Stephan Kreutzer, Jaroslav Nesetril, Patrice Ossona de Mendez, Michal Pilipczuk, Sebastian Siebertz, Szymon Torunczyk:
First-Order Interpretations of Bounded Expansion Classes. ICALP 2018: 126:1-126:14 - [p4]Stephan Kreutzer, O-joung Kwon:
Digraphs of Bounded Width. Classes of Directed Graphs 2018: 405-466 - [i28]Jakub Gajarský, Stephan Kreutzer, Jaroslav Nesetril, Patrice Ossona de Mendez, Michal Pilipczuk, Sebastian Siebertz, Szymon Torunczyk:
First-order interpretations of bounded expansion classes. CoRR abs/1810.02389 (2018) - [i27]Kord Eickmeyer, Jan van den Heuvel, Ken-ichi Kawarabayashi, Stephan Kreutzer, Patrice Ossona de Mendez, Michal Pilipczuk, Daniel A. Quiroz, Roman Rabinovich, Sebastian Siebertz:
Model-Checking on Ordered Structures. CoRR abs/1812.08003 (2018) - 2017
- [j22]Stephan Kreutzer, Sang-il Oum, Paul D. Seymour, Dominic van der Zypen, David R. Wood:
Majority Colourings of Digraphs. Electron. J. Comb. 24(2): 2 (2017) - [j21]Stephan Kreutzer:
The Presburger Award for Young Scientists 2018 - Call for Nominations. Bull. EATCS 123 (2017) - [j20]Archontia C. Giannopoulou, Stephan Kreutzer, Sebastian Wiederrecht:
Matching Connectivity: On the Structure of Graphs with Perfect Matchings. Electron. Notes Discret. Math. 61: 505-511 (2017) - [j19]Martin Grohe, Stephan Kreutzer, Sebastian Siebertz:
Deciding First-Order Properties of Nowhere Dense Graphs. J. ACM 64(3): 17:1-17:32 (2017) - [c58]Stephan Kreutzer:
Current Trends and New Perspectives for First-Order Model Checking (Invited Talk). CSL 2017: 4:1-4:5 - [c57]Kord Eickmeyer, Archontia C. Giannopoulou, Stephan Kreutzer, O-joung Kwon, Michal Pilipczuk, Roman Rabinovich, Sebastian Siebertz:
Neighborhood Complexity and Kernelization for Nowhere Dense Classes of Graphs. ICALP 2017: 63:1-63:14 - [c56]Jan van den Heuvel, Stephan Kreutzer, Michal Pilipczuk, Daniel A. Quiroz, Roman Rabinovich, Sebastian Siebertz:
Model-checking for successor-invariant first-order formulas on graph classes of bounded expansion. LICS 2017: 1-11 - [c55]Stephan Kreutzer, Roman Rabinovich, Sebastian Siebertz:
Polynomial Kernels and Wideness Properties of Nowhere Dense Graph Classes. SODA 2017: 1533-1545 - [c54]Stephan Kreutzer, Roman Rabinovich, Sebastian Siebertz, Grischa Weberstädt:
Structural Properties and Constant Factor-Approximation of Strong Distance-r Dominating Sets in Sparse Directed Graphs. STACS 2017: 48:1-48:15 - [i26]Jan van den Heuvel, Stephan Kreutzer, Michal Pilipczuk, Daniel A. Quiroz, Roman Rabinovich, Sebastian Siebertz:
Model-Checking for Successor-Invariant First-Order Formulas on Graph Classes of Bounded Expansion. CoRR abs/1701.08516 (2017) - [i25]Stephan Kreutzer, Patrice Ossona de Mendez, Roman Rabinovich, Sebastian Siebertz:
Algorithmic Properties of Sparse Digraphs. CoRR abs/1707.01701 (2017) - 2016
- [j18]Viktor Engelmann, Sebastian Ordyniak, Stephan Kreutzer:
Directed elimination games. Discret. Appl. Math. 199: 187-198 (2016) - [j17]Andrei Bulatov, Stephan Kreutzer:
Preface. Theory Comput. Syst. 59(2): 159-160 (2016) - [j16]Christoph Dittmann, Stephan Kreutzer, Alexandru I. Tomescu:
Graph operations on parity games and polynomial-time algorithms. Theor. Comput. Sci. 614: 97-108 (2016) - [j15]Stephan Kreutzer, Sebastian Ordyniak:
Complexity and monotonicity results for domination games. Theor. Comput. Sci. 628: 1-29 (2016) - [j14]Saeed Akhoondian Amiri, Stephan Kreutzer, Roman Rabinovich:
DAG-width is PSPACE-complete. Theor. Comput. Sci. 655: 78-89 (2016) - [c53]Saeed Akhoondian Amiri, Stephan Kreutzer, Dániel Marx, Roman Rabinovich:
Routing with Congestion in Acyclic Digraphs. MFCS 2016: 7:1-7:11 - [c52]Stephan Kreutzer, Michal Pilipczuk, Roman Rabinovich, Sebastian Siebertz:
The Generalised Colouring Numbers on Classes of Bounded Expansion. MFCS 2016: 85:1-85:13 - [c51]Pål Grønås Drange, Markus Sortland Dregi, Fedor V. Fomin, Stephan Kreutzer, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Felix Reidl, Fernando Sánchez Villaamil, Saket Saurabh, Sebastian Siebertz, Somnath Sikdar:
Kernelization and Sparseness: the Case of Dominating Set. STACS 2016: 31:1-31:14 - [r1]Stephan Kreutzer:
Nowhere Crownful Classes of Directed Graphs. Encyclopedia of Algorithms 2016: 1416-1419 - [i24]Saeed Akhoondian Amiri, Ken-ichi Kawarabayashi, Stephan Kreutzer, Paul Wollan:
The Erdos-Posa Property for Directed Graphs. CoRR abs/1603.02504 (2016) - [i23]Saeed Akhoondian Amiri, Stephan Kreutzer, Dániel Marx, Roman Rabinovich:
Routing with Congestion in Acyclic Digraphs. CoRR abs/1605.01866 (2016) - [i22]Stephan Kreutzer, Michal Pilipczuk, Roman Rabinovich, Sebastian Siebertz:
The Generalised Colouring Numbers on Classes of Bounded Expansion. CoRR abs/1606.08972 (2016) - [i21]Stephan Kreutzer, Roman Rabinovich, Sebastian Siebertz:
Polynomial Kernels and Wideness Properties of Nowhere Dense Graph Classes. CoRR abs/1608.05637 (2016) - [i20]Kord Eickmeyer, Archontia C. Giannopoulou, Stephan Kreutzer, O-joung Kwon, Michal Pilipczuk, Roman Rabinovich, Sebastian Siebertz:
Neighborhood complexity and kernelization for nowhere dense classes of graphs. CoRR abs/1612.08197 (2016) - 2015
- [c50]Ken-ichi Kawarabayashi, Stephan Kreutzer:
Towards the Graph Minor Theorems for Directed Graphs. ICALP (2) 2015: 3-10 - [c49]Saeed Akhoondian Amiri, Lukasz Kaiser, Stephan Kreutzer, Roman Rabinovich, Sebastian Siebertz:
Graph Searching Games and Width Measures for Directed Graphs. STACS 2015: 34-47 - [c48]Ken-ichi Kawarabayashi, Stephan Kreutzer:
The Directed Grid Theorem. STOC 2015: 655-664 - [c47]Martin Grohe, Stephan Kreutzer, Roman Rabinovich, Sebastian Siebertz, Konstantinos S. Stavropoulos:
Colouring and Covering Nowhere Dense Graphs. WG 2015: 325-338 - [e1]Stephan Kreutzer:
24th EACSL Annual Conference on Computer Science Logic, CSL 2015, September 7-10, 2015, Berlin, Germany. LIPIcs 41, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2015, ISBN 978-3-939897-90-3 [contents] - 2014
- [c46]Mikolaj Bojanczyk, Christoph Dittmann, Stephan Kreutzer:
Decomposition theorems and model-checking for the modal μ-calculus. CSL-LICS 2014: 17:1-17:10 - [c45]Stephan Kreutzer, Nicole Schweikardt:
On Hanf-equivalence and the number of embeddings of small induced subgraphs. CSL-LICS 2014: 60:1-60:10 - [c44]Saeed Akhoondian Amiri, Ali Golshani, Stephan Kreutzer, Sebastian Siebertz:
Vertex Disjoint Paths in Upward Planar Graphs. CSR 2014: 52-64 - [c43]Ken-ichi Kawarabayashi, Stephan Kreutzer:
An Excluded Grid Theorem for Digraphs with Forbidden Minors. SODA 2014: 72-81 - [c42]Ken-ichi Kawarabayashi, Yusuke Kobayashi, Stephan Kreutzer:
An excluded half-integral grid theorem for digraphs and the directed disjoint paths problem. STOC 2014: 70-78 - [c41]Martin Grohe, Stephan Kreutzer, Sebastian Siebertz:
Deciding first-order properties of nowhere dense graphs. STOC 2014: 89-98 - [i19]Mikolaj Bojanczyk, Christoph Dittmann, Stephan Kreutzer:
Decomposition Theorems and Model-Checking for the Modal $μ$-Calculus. CoRR abs/1405.2234 (2014) - [i18]Lukasz Kaiser, Stephan Kreutzer, Roman Rabinovich, Sebastian Siebertz:
Directed Width Measures and Monotonicity of Directed Graph Searching. CoRR abs/1408.4745 (2014) - [i17]Saeed Akhoondian Amiri, Stephan Kreutzer, Roman Rabinovich:
DAG-width is PSPACE-complete. CoRR abs/1411.2438 (2014) - [i16]Pål Grønås Drange, Markus S. Dregi, Fedor V. Fomin, Stephan Kreutzer, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Felix Reidl, Saket Saurabh, Fernando Sánchez Villaamil, Somnath Sikdar:
Kernelization and Sparseness: the case of Dominating Set. CoRR abs/1411.4575 (2014) - [i15]Ken-ichi Kawarabayashi, Stephan Kreutzer:
The Directed Grid Theorem. CoRR abs/1411.5681 (2014) - 2013
- [c40]Martin Grohe, Stephan Kreutzer, Sebastian Siebertz:
Characterisations of Nowhere Dense Graphs (Invited Talk). FSTTCS 2013: 21-40 - [c39]Stephan Kreutzer, Cristian Riveros:
Quantitative Monadic Second-Order Logic. LICS 2013: 113-122 - [c38]Kord Eickmeyer, Ken-ichi Kawarabayashi, Stephan Kreutzer:
Model Checking for Successor-Invariant First-Order Logic on Minor-Closed Graph Classes. LICS 2013: 134-142 - [c37]Ken-ichi Kawarabayashi, Daniel Král', Marek Krcál, Stephan Kreutzer:
Packing directed cycles through a specified vertex set. SODA 2013: 365-377 - [i14]Martin Grohe, Stephan Kreutzer, Sebastian Siebertz:
Deciding first-order properties of nowhere dense graphs. CoRR abs/1311.3899 (2013) - [i13]Saeed Akhoondian Amiri, Ali Golshani, Stephan Kreutzer, Sebastian Siebertz:
Vertex Disjoint Path in Upward Planar Graphs. CoRR abs/1312.1526 (2013) - 2012
- [j13]Stephan Kreutzer:
On the Parameterized Intractability of Monadic Second-Order Logic. Log. Methods Comput. Sci. 8(1) (2012) - [j12]Ken-ichi Kawarabayashi, Stephan Kreutzer, Bojan Mohar:
Linkless and Flat Embeddings in 3-Space. Discret. Comput. Geom. 47(4): 731-755 (2012) - [j11]Dietmar Berwanger, Anuj Dawar, Paul Hunter, Stephan Kreutzer, Jan Obdrzálek:
The dag-width of directed graphs. J. Comb. Theory B 102(4): 900-923 (2012) - [j10]Fedor V. Fomin, Pierre Fraigniaud, Stephan Kreutzer, Dimitrios M. Thilikos:
Foreword: Special Issue on Theory and Applications of Graph Searching Problems. Theor. Comput. Sci. 463: 1 (2012) - [c36]Viktor Engelmann, Stephan Kreutzer, Sebastian Siebertz:
First-Order and Monadic Second-Order Model-Checking on Ordered Structures. LICS 2012: 275-284 - [c35]Stephan Kreutzer, Siamak Tazari:
Directed nowhere dense classes of graphs. SODA 2012: 1552-1562 - [i12]Christoph Dittmann, Stephan Kreutzer, Alexandru I. Tomescu:
Graph Operations on Parity Games and Polynomial-Time Algorithms. CoRR abs/1208.1640 (2012) - 2011
- [j9]Fedor V. Fomin, Pierre Fraigniaud, Stephan Kreutzer, Dimitrios M. Thilikos:
Special Issue on "Theory and Applications of Graph Searching Problems". Theor. Comput. Sci. 412(24): 2699 (2011) - [j8]Stephan Kreutzer, Sebastian Ordyniak:
Digraph decompositions and monotonicity in digraph searching. Theor. Comput. Sci. 412(35): 4688-4703 (2011) - [p3]Stephan Kreutzer:
Algorithmic meta-theorems. Finite and Algorithmic Model Theory 2011: 177-270 - [p2]Stephan Kreutzer:
Graph searching games. Lectures in Game Theory for Computer Scientists 2011: 213-263 - [i11]Stephan Kreutzer, Siamak Tazari:
Directed Nowhere Dense Classes of Graphs. CoRR abs/1104.3808 (2011) - [i10]Fedor V. Fomin, Pierre Fraigniaud, Stephan Kreutzer, Dimitrios M. Thilikos:
Theory and Applications of Graph Searching Problems (GRASTA 2011) (Dagstuhl Seminar 11071). Dagstuhl Reports 1(2): 30-46 (2011) - 2010
- [c34]Ken-ichi Kawarabayashi, Stephan Kreutzer, Bojan Mohar:
Linkless and flat embeddings in 3-space and the unknot problem. SCG 2010: 97-106 - [c33]Stephan Kreutzer, Siamak Tazari:
Lower Bounds for the Complexity of Monadic Second-Order Logic. LICS 2010: 189-198 - [c32]Roland Axelsson, Matthew Hague, Stephan Kreutzer, Martin Lange, Markus Latte:
Extended Computation Tree Logic. LPAR (Yogyakarta) 2010: 67-81 - [c31]Stephan Kreutzer, Siamak Tazari:
On Brambles, Grid-Like Minors, and Parameterized Intractability of Monadic Second-Order Logic. SODA 2010: 354-364 - [i9]Stephan Kreutzer, Siamak Tazari:
Lower Bounds for the Complexity of Monadic Second-Order Logic. CoRR abs/1001.5019 (2010) - [i8]Roland Axelsson, Matthew Hague, Stephan Kreutzer, Martin Lange, Markus Latte:
Extended Computation Tree Logic. CoRR abs/1006.3709 (2010)
2000 – 2009
- 2009
- [c30]Martin Grohe, Stephan Kreutzer:
Methods for Algorithmic Meta Theorems. AMS-ASL Joint Special Session 2009: 181-206 - [c29]Christoph Haase, Stephan Kreutzer, Joël Ouaknine, James Worrell:
Reachability in Succinct and Parametric One-Counter Automata. CONCUR 2009: 369-383 - [c28]Stephan Kreutzer:
On the Parameterised Intractability of Monadic Second-Order Logic. CSL 2009: 348-363 - [c27]Stephan Kreutzer, Martin Lange:
A Note on the Relation between Inflationary Fixpoints and Least Fixpoints of Higher Order. FICS 2009: 54-60 - [c26]Anuj Dawar, Stephan Kreutzer:
Domination Problems in Nowhere-Dense Classes. FSTTCS 2009: 157-168 - [c25]Stephan Kreutzer, Sebastian Ordyniak:
Distance d-Domination Games. WG 2009: 308-319 - [i7]Stephan Kreutzer:
Algorithmic Meta-Theorems. CoRR abs/0902.3616 (2009) - [i6]Stephan Kreutzer:
On the Parameterised Intractability of Monadic Second-Order Logic. CoRR abs/0904.1302 (2009) - [i5]Stephan Kreutzer, Siamak Tazari:
On Brambles, Grid-Like Minors, and Parameterized Intractability of Monadic Second-Order Logic. CoRR abs/0907.3076 (2009) - [i4]Anuj Dawar, Stephan Kreutzer:
Domination Problems in Nowhere-Dense Classes of Graphs. CoRR abs/0907.4283 (2009) - [i3]Stephan Kreutzer:
Algorithmic Meta-Theorems. Electron. Colloquium Comput. Complex. TR09 (2009) - [i2]Stephan Kreutzer, Anuj Dawar:
Parameterized Complexity of First-Order Logic. Electron. Colloquium Comput. Complex. TR09 (2009) - 2008
- [j7]Paul Hunter, Stephan Kreutzer:
Digraph measures: Kelly decompositions, games, and orderings. Theor. Comput. Sci. 399(3): 206-219 (2008) - [c24]Stephan Kreutzer, Martin Lange:
Non-regular fixed-point logics and games. Logic and Automata 2008: 423-456 - [c23]Anuj Dawar, Stephan Kreutzer:
On Datalog vs. LFP. ICALP (2) 2008: 160-171 - [c22]Stephan Kreutzer:
Algorithmic Meta-theorems. IWPEC 2008: 10-12 - [c21]Isolde Adler, Martin Grohe, Stephan Kreutzer:
Computing excluded minors. SODA 2008: 641-650 - [c20]Stephan Kreutzer, Sebastian Ordyniak:
Digraph Decompositions and Monotonicity in Digraph Searching. WG 2008: 336-347 - [i1]Stephan Kreutzer, Sebastian Ordyniak:
Digraph Decompositions and Monotonicity in Digraph Searching. CoRR abs/0802.2228 (2008) - 2007
- [j6]Anuj Dawar, Stephan Kreutzer:
Generalising automaticity to modal properties of finite structures. Theor. Comput. Sci. 379(1-2): 266-285 (2007) - [c19]Stephan Kreutzer, Martin Otto, Nicole Schweikardt:
Boundedness of Monadic FO over Acyclic Structures. ICALP 2007: 571-582 - [c18]Anuj Dawar, Martin Grohe, Stephan Kreutzer, Nicole Schweikardt:
Model Theory Makes Formulas Large. ICALP 2007: 913-924 - [c17]Anuj Dawar, Martin Grohe, Stephan Kreutzer:
Locally Excluding a Minor. LICS 2007: 270-279 - [c16]Paul Hunter, Stephan Kreutzer:
Digraph measures: Kelly decompositions, games, and orderings. SODA 2007: 637-644 - 2006
- [j5]Anuj Dawar, Erich Grädel, Stephan Kreutzer:
Backtracking games and inflationary fixed points. Theor. Comput. Sci. 350(2-3): 174-187 (2006) - [c15]Anuj Dawar, Martin Grohe, Stephan Kreutzer, Nicole Schweikardt:
Approximation Schemes for First-Order Definable Optimisation Problems. LICS 2006: 411-420 - [c14]Dietmar Berwanger, Anuj Dawar, Paul Hunter, Stephan Kreutzer:
DAG-Width and Parity Games. STACS 2006: 524-536 - 2005