Sebastian Siebertz

According to our database1, Sebastian Siebertz authored at least 50 papers between 2012 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Classes of graphs with low complexity: The case of classes with bounded linear rankwidth.
Eur. J. Comb., 2021

2020
First-Order Interpretations of Bounded Expansion Classes.
ACM Trans. Comput. Log., 2020

Model-Checking on Ordered Structures.
ACM Trans. Comput. Log., 2020

On low rank-width colorings.
Eur. J. Comb., 2020

Distributed domination on graph classes with bounded expansion.
CoRR, 2020

Towards an arboretum of monadically stable classes of graphs.
CoRR, 2020

Rankwidth meets stability.
CoRR, 2020

Regular partitions of gentle graphs.
CoRR, 2020

Linear rankwidth meets stability.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Elimination Distance to Bounded Degree on Planar Graphs.
Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

On the Parameterized Complexity of Reconfiguration of Connected Dominating Sets.
Proceedings of the 15th International Symposium on Parameterized and Exact Computation, 2020

2019
Polynomial Kernels and Wideness Properties of Nowhere Dense Graph Classes.
ACM Trans. Algorithms, 2019

Distributed Dominating Set Approximations beyond Planar Graphs.
ACM Trans. Algorithms, 2019

Lossy Kernels for Connected Dominating Set on Sparse Graphs.
SIAM J. Discret. Math., 2019

Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-wideness.
ACM J. Exp. Algorithmics, 2019

Greedy domination on biclique-free graphs.
Inf. Process. Lett., 2019

Nowhere dense graph classes and algorithmic applications. A tutorial at Highlights of Logic, Games and Automata 2019.
CoRR, 2019

Parameterized Distributed Complexity Theory: A logical approach.
CoRR, 2019

Algorithmic Properties of Sparse Digraphs.
Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science, 2019

Progressive Algorithms for Domination and Independence.
Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science, 2019

Polynomial bounds for centered colorings on proper minor-closed graph classes.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

2018
Coloring and Covering Nowhere Dense Graphs.
SIAM J. Discret. Math., 2018

Kernelization and approximation of distance-r independent sets on nowhere dense graphs.
CoRR, 2018

Parameterized circuit complexity of model checking first-order logic on sparse structures.
CoRR, 2018

Reconfiguration on Nowhere Dense Graph Classes.
Electron. J. Comb., 2018

Vertex Cover Reconfiguration and Beyond.
Algorithms, 2018

Distributed Domination on Graph Classes of Bounded Expansion.
Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, 2018

On the number of types in sparse graphs.
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

Parameterized circuit complexity of model-checking on sparse structures.
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

2017
Deciding First-Order Properties of Nowhere Dense Graphs.
J. ACM, 2017

On the generalised colouring numbers of graphs that exclude a fixed minor.
Eur. J. Comb., 2017

Lossy kernels for connected distance-$r$ domination on nowhere dense graph classes.
CoRR, 2017

On Wideness and Stability.
CoRR, 2017

Algorithmic Properties of Sparse Digraphs.
CoRR, 2017

Structural Properties and Constant Factor-Approximation of Strong Distance-r Dominating Sets in Sparse Directed Graphs.
Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017

Model-checking for successor-invariant first-order formulas on graph classes of bounded expansion.
Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

Neighborhood Complexity and Kernelization for Nowhere Dense Classes of Graphs.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

2016
A local constant factor approximation for the minimum dominating set problem on bounded genus graphs.
CoRR, 2016

Kernelization and Sparseness: the Case of Dominating Set.
Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

A Local Constant Factor MDS Approximation for Bounded Genus Graphs.
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016

The Generalised Colouring Numbers on Classes of Bounded Expansion.
Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

2015
On the generalised colouring numbers of graphs that exclude a fixed minor.
Electron. Notes Discret. Math., 2015

Colouring and Covering Nowhere Dense Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2015

Graph Searching Games and Width Measures for Directed Graphs.
Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, 2015

2014
Directed Width Measures and Monotonicity of Directed Graph Searching.
CoRR, 2014

Vertex Disjoint Paths in Upward Planar Graphs.
Proceedings of the Computer Science - Theory and Applications, 2014

2013
Vertex Disjoint Path in Upward Planar Graphs.
CoRR, 2013

Characterisations of Nowhere Dense Graphs (Invited Talk).
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2013

2012
First-Order and Monadic Second-Order Model-Checking on Ordered Structures.
Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, 2012

Dynamic definability.
Proceedings of the 15th International Conference on Database Theory, 2012


  Loading...