( en | de | ru )

 

Disambiguation of "Kreutzer, Stephan"

Author of the publication

copydeleteadd this publication to your clipboard
Algorithmic Properties of Sparse Digraphs.

, , , , and . STACS, volume 126 of LIPIcs, page 46:1-46:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Stephan Kreutzer

Stephan Kreutzer

J Kreutzer

Franz Kreutzer

Leo Kreutzer

 

Other publications of authors with the same name

Decomposition theorems and model-checking for the modal μ-calculus., , and . CSL-LICS, page 17:1-17:10. ACM, (2014)Towards the Graph Minor Theorems for Directed Graphs., and . ICALP (2), volume 9135 of Lecture Notes in Computer Science, page 3-10. Springer, (2015)Coloring and Covering Nowhere Dense Graphs., , , , and . SIAM J. Discret. Math., 32 (4): 2467-2481 (2018)Directed Tangle Tree-Decompositions and Applications., , , and . SODA, page 377-405. SIAM, (2022)Colouring and Covering Nowhere Dense Graphs., , , , and . WG, volume 9224 of Lecture Notes in Computer Science, page 325-338. Springer, (2015)Graph searching games.. Lectures in Game Theory for Computer Scientists, Cambridge University Press, (2011)Methods for Algorithmic Meta Theorems., and . AMS-ASL Joint Special Session, volume 558 of Contemporary Mathematics, page 181-206. American Mathematical Society, (2009)Polynomial Kernels and Wideness Properties of Nowhere Dense Graph Classes., , and . ACM Trans. Algorithms, 15 (2): 24:1-24:19 (2019)Neighborhood complexity and kernelization for nowhere dense classes of graphs., , , , , , and . CoRR, (2016)Polynomial Planar Directed Grid Theorem., , and . SODA, page 1465-1484. SIAM, (2019)