Prof. Sebastian Siebertz

Further information:

Working Group Theoretical Computer Science

Google Scholar Profile

Methods:

Combinatorial Methods
Graph Theory
Logic

Projects:

Foundations of Algorithmic Stability Theory (FAST), DFG

Unifying Theories for Multivariate Algorithms (UTMA), ANR/DFG (Dimitrios Thilikos, Montpellier, France)

Graph Classes with Low Twin-width Covers, ZF Fokus Projekt Uni Bremen none

Ecosystem

Member of the research focus "Minds, Media, Machines"

Member of the Data Science Center (DSC)

Head of the working group: Theoretical Computer Science

Publications

2017 // conference-paper

Neighborhood Complexity and Kernelization for Nowhere Dense Classes of Graphs

44th International Colloquium on Automata, Languages, and Programming, ICALP 2017, July 10-14, 2017, Warsaw, Poland

DOI: 10.4230/LIPIcs.ICALP.2017.63

2017 // journal-article

Deciding First-Order Properties of Nowhere Dense Graphs

J. ACM

DOI: 10.1145/3051095

2017 // conference-paper

Structural Properties and Constant Factor Approximation of Strong Distance-r Dominating Sets in Sparse Directed Graphs

34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany

DOI: 10.4230/LIPIcs.STACS.2017.48

2017 // journal-article

On the generalized colouring numbers of graphs that exclude a fixed minor

Eur. J. Comb.

DOI: 10.1016/j.ejc.2017.06.019

2017 // conference-paper

Model-checking for successor-invariant first-order formulas on graph classes of bounded expansion

32nd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2017, Reykjavik, Iceland, June 20-23, 2017

DOI: 10.1109/LICS.2017.8005115

2016 // conference-paper

A Local Constant Factor MDS Approximation for Bounded Genus Graphs

Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, PODC 2016, Chicago, IL, USA, July 25-28, 2016

DOI: 10.1145/2933057.2933084

2016 // conference-paper

The Generalized Colouring Numbers on Classes of Bounded Expansion

41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016, August 22-26, 2016 - Kraków, Poland

DOI: 10.4230/LIPIcs.MFCS.2016.85

2016 // conference-paper

Kernelization and Sparseness: the Case of Dominating Set

33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016, February 17-20, 2016, Orléans, France

DOI: 10.4230/LIPIcs.STACS.2016.31

2016 // book

Coloring and covering nowhere dense graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Grohe, M.; Kreutzer, S.; Rabinovich, R.; Siebertz, S.; Stavropoulos, K.

DOI: 10.1007/978-3-662-53174-7_23

2015 // journal-article

On the generalized colouring numbers of graphs that exclude a fixed minor

Electronic Notes in Discrete Mathematics

DOI: 10.1016/j.endm.2015.06.072

2015 // conference-paper

Graph Searching Games and Width Measures for Directed Graphs

32nd International Symposium on Theoretical Aspects of Computer Science, STACS 2015, March 4-7, 2015, Garching, Germany

DOI: 10.4230/LIPIcs.STACS.2015.34

2014 // conference-paper

Vertex Disjoint Paths in Upward Planar Graphs

Computer Science - Theory and Applications - 9th International Computer Science Symposium in Russia, CSR 2014, Moscow, Russia, June 7-11, 2014 Proceedings

DOI: 10.1007/978-3-319-06686-8\_5

2014 // conference-paper

Deciding first-order properties of nowhere dense graphs

Symposium on Theory of Computing, STOC 2014, New York, NY, USA, May 31 - June 03, 2014

DOI: 10.1145/2591796.2591851

2013 // conference-paper

Characterizations of Nowhere Dense Graphs (Invited Talk)

IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2013, December 12-14, 2013, Guwahati, India

DOI: 10.4230/LIPIcs.FSTTCS.2013.21

2012 // conference-paper

First-Order and Monadic Second-Order Model-Checking on Ordered Structures

Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, LICS 2012, Dubrovnik, Croatia, June 25-28, 2012

DOI: 10.1109/LICS.2012.38

2012 // conference-paper

Dynamic definability

15th International Conference on Database Theory, ICDT '12, Berlin, Germany, March 26-29, 2012

DOI: 10.1145/2274576.2274601

<<<2 / 2>>>

Prof. Sebastian Siebertz

Ecosystem

Publications

Neighborhood Complexity and Kernelization for Nowhere Dense Classes of Graphs

Deciding First-Order Properties of Nowhere Dense Graphs

Structural Properties and Constant Factor Approximation of Strong Distance-r Dominating Sets in Sparse Directed Graphs

On the generalized colouring numbers of graphs that exclude a fixed minor

Model-checking for successor-invariant first-order formulas on graph classes of bounded expansion

A Local Constant Factor MDS Approximation for Bounded Genus Graphs

The Generalized Colouring Numbers on Classes of Bounded Expansion

Kernelization and Sparseness: the Case of Dominating Set

Coloring and covering nowhere dense graphs

On the generalized colouring numbers of graphs that exclude a fixed minor

Graph Searching Games and Width Measures for Directed Graphs

Vertex Disjoint Paths in Upward Planar Graphs

Deciding first-order properties of nowhere dense graphs

Characterizations of Nowhere Dense Graphs (Invited Talk)

First-Order and Monadic Second-Order Model-Checking on Ordered Structures

Dynamic definability

Please feel free to mail us, if you have any further questions

Please feel free to mail us, if you have any further questions