Wissenschaftsschwerpunkt der

SiebertzFoto
Prof. Sebastian Siebertz

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

Publikationen
Nov 2024 // journal-article

Discrepancy and sparsity

Journal of Combinatorial Theory, Series B

Mario Grobler; Yiting Jiang; Patrice Ossona de Mendez; Sebastian Siebertz; Alexandre Vigny

Oct 2023 // journal-article

First-order Logic with Connectivity Operators

ACM Transactions on Computational Logic

Nicole Schirrmacher; Sebastian Siebertz; Alexandre Vigny

Sep 2023 // book-chapter

On Solution Discovery via Reconfiguration

Michael R. Fellows; Mario Grobler; Nicole Megow; Amer E. Mouawad; Vijayaragunathan Ramamoorthi; Frances A. Rosamond; Daniel Schmand; Sebastian Siebertz

Jan 2021 // journal-article

Classes of graphs with low complexity: The case of classes with bounded linear rankwidth

European Journal of Combinatorics

Jaroslav Nešetřil; Patrice Ossona de Mendez; Roman Rabinovich; Sebastian Siebertz

2021 // book-chapter

Constant Round Distributed Domination on Graph Classes with Bounded Expansion

Simeon Kublenz; Sebastian Siebertz; Alexandre Vigny

2020 // journal-article

On low rank-width colorings

European Journal of Combinatorics

Kwon, O.-J.; Pilipczuk, M.; Siebertz, S.
DOI: 10.1016/j.ejc.2019.103002

Jan 2019 // journal-article

Lossy Kernels for Connected Dominating Set on Sparse Graphs

SIAM Journal on Discrete Mathematics

Eduard Eiben; Mithilesh Kumar; Amer E. Mouawad; Fahad Panolan; Sebastian Siebertz

2019 // journal-article

Polynomial Kernels and Wideness Properties of Nowhere Dense Graph Classes

ACM Trans. Algorithms

DOI: 10.1145/3274652

2019 // conference-paper

Polynomial bounds for centered colorings on proper minor-closed graph classes

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, San Diego, California, USA, January 6-9, 2019

DOI: 10.1137/1.9781611975482.91

2019 // conference-paper

Progressive Algorithms for Domination and Independence

36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, March 13-16, 2019, Berlin, Germany

DOI: 10.4230/LIPIcs.STACS.2019.27

2019 // conference-paper

Algorithmic Properties of Sparse Digraphs

36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, March 13-16, 2019, Berlin, Germany

DOI: 10.4230/LIPIcs.STACS.2019.46

2019 // journal-article

Distributed Dominating Set Approximations beyond Planar Graphs

ACM Transactions on Algorithms

Samiri, S.A.; Schmid, S.; Siebertz, S.
DOI: 10.1145/3326170

2019 // journal-article

Greedy domination on biclique-free graphs

Information Processing Letters

Siebertz, S.
DOI: 10.1016/j.ipl.2019.01.006

2018 // conference-paper

First-Order Interpretations of Bounded Expansion Classes

45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, July 9-13, 2018, Prague, Czech Republic

DOI: 10.4230/LIPIcs.ICALP.2018.126

2018 // conference-paper

Distributed Domination on Graph Classes of Bounded Expansion

Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, SPAA 2018, Vienna, Austria, July 16-18, 2018

DOI: 10.1145/3210377.3210383

2018 // journal-article

Reconfiguration on nowhere dense graph classes

Electronic Journal of Combinatorics

Siebertz, S.
DOI:

2018 // conference-paper

Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-Wideness

17th International Symposium on Experimental Algorithms, SEA 2018, June 27-29, 2018, L'Aquila, Italy

DOI: 10.4230/LIPIcs.SEA.2018.14

2018 // conference-paper

Parameterized circuit complexity of model-checking on sparse structures

Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2018, Oxford, UK, July 09-12, 2018

DOI: 10.1145/3209108.3209136

2018 // conference-paper

On the number of types in sparse graphs

Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2018, Oxford, UK, July 09-12, 2018

DOI: 10.1145/3209108.3209178

2018 // journal-article

Coloring and Covering Nowhere Dense Graphs

SIAM J. Discrete Math.

DOI: 10.1137/18M1168753

2018 // journal-article

Vertex Cover Reconfiguration and Beyond

Algorithms

DOI: 10.3390/a11020020

2018 // conference-paper

Lossy Kernels for Connected Dominating Set on Sparse Graphs

35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28 to March 3, 2018, Caen, France

DOI: 10.4230/LIPIcs.STACS.2018.29

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

DOI: 10.1007/978-3-319-68705-6\_28

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.
DOI:

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