Wissenschaftsschwerpunkt der

logo-mmm-w
logo-mmm-w
SiebertzFoto
Prof. Sebastian Siebertz
  • Fachbereich: Fachbereich 3 - Mathematik & Informatik
  • Fachgebiet: Theoretical math - Logic in computer science, Algorithmic graph structure theory, Parameterized complexity theory, Finite model theory
  • Büro: MZH 3160

Weitere Informationen:

Arbeitsgruppe Theoretische Informatik

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

Ökosystem

Mitglied des Wissenschaftsschwerpunkts "Minds, Media, Machines"
Mitglied des Data Science Center (DSC)
Leiter der Arbeitsgruppe: Theoretische Informatik
Publikationen
2018 // Journal article

Vertex Cover Reconfiguration and Beyond

Algorithms

https://doi.org/10.3390/a11020020
2017 // Journal article

Deciding First-Order Properties of Nowhere Dense Graphs

J. ACM

https://doi.org/10.1145/3051095
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

https://doi.org/10.1109/LICS.2017.8005115
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

https://doi.org/10.4230/LIPIcs.ICALP.2017.63
2017 // Conference paper

On Low Rank-Width Colorings

Graph-Theoretic Concepts in Computer Science - 43rd International Workshop, WG 2017, Eindhoven, The Netherlands, June 21-23, 2017, Revised Selected Papers

https://doi.org/10.1007/978-3-319-68705-6\_28
2017 // Journal article

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

Eur. J. Comb.

https://doi.org/10.1016/j.ejc.2017.06.019
2017 // Conference paper

Polynomial kernels and wideness properties of nowhere dense graph classes

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Kreutzer, S.; Rabinovich, R.; Siebertz, S.
http://www.scopus.com/inward/record.url?eid=2-s2.0-85016185118&partnerID=MN8TOARS
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

https://doi.org/10.4230/LIPIcs.STACS.2017.48
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

https://doi.org/10.1145/2933057.2933084
2016 // Book

Colouring 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.
https://doi.org/10.1007/978-3-662-53174-7_23
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

https://doi.org/10.4230/LIPIcs.STACS.2016.31
2016 // Conference paper

The Generalised 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

https://doi.org/10.4230/LIPIcs.MFCS.2016.85
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

https://doi.org/10.4230/LIPIcs.STACS.2015.34
2015 // Journal article

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

Electronic Notes in Discrete Mathematics

https://doi.org/10.1016/j.endm.2015.06.072
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

https://doi.org/10.1145/2591796.2591851
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

https://doi.org/10.1007/978-3-319-06686-8\_5
2013 // Conference paper

Characterisations 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

https://doi.org/10.4230/LIPIcs.FSTTCS.2013.21
2012 // Conference paper

Dynamic definability

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

https://doi.org/10.1145/2274576.2274601
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

https://doi.org/10.1109/LICS.2012.38