Sebastian Siebertz

From MaRDI portal
Person:322315

Available identifiers

zbMath Open siebertz.sebastianMaRDI QIDQ322315

List of research outcomes





PublicationDate of PublicationType
Indiscernibles and flatness in monadically stable and monadically NIP classes2024-11-14Paper
Flipper games for monadically stable graph classes2024-11-14Paper
Nowhere dense classes of graphs2024-11-05Paper
Discrepancy and sparsity2024-10-08Paper
Transducing paths in graph classes with unbounded shrubdepth2024-10-07Paper
Distributed domination on sparse graph classes2024-10-07Paper
Combinatorial and algorithmic aspects of monadic stability2024-09-11Paper
Twin-width and permutations2024-09-04Paper
Elimination distance to bounded degree on planar graphs preprint2024-08-27Paper
Algorithms and data structures for first-order logic with connectivity under vertex failures2024-06-24Paper
Structural Properties of the First-Order Transduction Quasiorder2024-04-10Paper
First-Order Logic with Connectivity Operators2024-04-10Paper
https://portal.mardi4nfdi.de/entity/Q61925072024-02-12Paper
Token sliding on graphs of girth five2024-01-25Paper
https://portal.mardi4nfdi.de/entity/Q61473762024-01-15Paper
Solution discovery via reconfiguration for problems in P2023-11-22Paper
https://portal.mardi4nfdi.de/entity/Q60896712023-11-13Paper
First-order Logic with Connectivity Operators2023-11-03Paper
https://portal.mardi4nfdi.de/entity/Q61684932023-08-08Paper
Token sliding on graphs of girth five2023-05-05Paper
First-Order Model Checking on Structurally Sparse Graph Classes2023-02-07Paper
Flipper games for monadically stable graph classes2023-01-31Paper
Local planar domination revisited2022-11-11Paper
Modulo-Counting First-Order Logic on Bounded Expansion Classes2022-11-07Paper
On the first-order transduction quasiorder of hereditary classes of graphs2022-08-30Paper
https://portal.mardi4nfdi.de/entity/Q50904972022-07-18Paper
https://portal.mardi4nfdi.de/entity/Q50904762022-07-18Paper
Elimination Distance to Bounded Degree on Planar Graphs2022-07-18Paper
Combinatorial and Algorithmic Aspects of Monadic Stability2022-06-29Paper
Indiscernibles and Flatness in Monadically Stable and Monadically NIP Classes2022-06-28Paper
A survey on the parameterized complexity of the independent set and (connected) dominating set reconfiguration problems2022-04-22Paper
Transducing paths in graph classes with unbounded shrubdepth2022-03-31Paper
On the parameterized complexity of reconfiguration of connected dominating sets2022-03-25Paper
Constant round distributed domination on graph classes with bounded expansion2022-03-22Paper
Algorithms and data structures for first-order logic with connectivity under vertex failures2021-11-05Paper
Polynomial bounds for centered colorings on proper minor-closed graph classes2021-09-16Paper
https://portal.mardi4nfdi.de/entity/Q50028122021-07-28Paper
Discrepancy and Sparsity2021-05-08Paper
Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-wideness2021-04-21Paper
Kernelization and approximation of distance-\(r\) independent sets on nowhere dense graphs2021-04-14Paper
Classes of graphs with low complexity: the case of classes with bounded linear rankwidth2021-02-08Paper
Linear rankwidth meets stability2021-02-02Paper
On the number of types in sparse graphs2021-01-20Paper
Parameterized circuit complexity of model-checking on sparse structures2021-01-20Paper
https://portal.mardi4nfdi.de/entity/Q51446622021-01-19Paper
Regular partitions of gentle graphs2020-12-18Paper
Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-Wideness2020-12-16Paper
First-Order Interpretations of Bounded Expansion Classes2020-09-11Paper
Model-Checking on Ordered Structures2020-09-11Paper
Lossy Kernels for Connected Dominating Set on Sparse Graphs2020-08-05Paper
Neighborhood complexity and kernelization for nowhere dense classes of graphs2020-05-27Paper
On low rank-width colorings2019-11-28Paper
Distributed Dominating Set Approximations beyond Planar Graphs2019-11-25Paper
Polynomial bounds for centered colorings on proper minor-closed graph classes2019-10-15Paper
On the Parameterized Complexity of Reconfiguration of Connected Dominating Sets2019-10-01Paper
Lossy Kernels for Connected Dominating Set on Sparse Graphs2019-09-30Paper
Polynomial Kernels and Wideness Properties of Nowhere Dense Graph Classes2019-03-28Paper
Greedy domination on biclique-free graphs2019-03-11Paper
Progressive Algorithms for Domination and Independence2018-11-16Paper
Coloring and Covering Nowhere Dense Graphs2018-10-31Paper
Reconfiguration on nowhere dense graph classes2018-08-15Paper
Polynomial Kernels and Wideness Properties of Nowhere Dense Graph Classes2018-07-16Paper
Deciding First-Order Properties of Nowhere Dense Graphs2018-05-17Paper
https://portal.mardi4nfdi.de/entity/Q46366492018-04-19Paper
The Generalised Colouring Numbers on Classes of Bounded Expansion2018-03-21Paper
On low rank-width colorings2018-01-04Paper
A Local Constant Factor MDS Approximation for Bounded Genus Graphs2017-09-29Paper
On the generalised colouring numbers of graphs that exclude a fixed minor2017-09-11Paper
First-Order and Monadic Second-Order Model-Checking on Ordered Structures2017-05-16Paper
https://portal.mardi4nfdi.de/entity/Q29638952017-02-21Paper
https://portal.mardi4nfdi.de/entity/Q29549822017-01-24Paper
Colouring and Covering Nowhere Dense Graphs2016-10-21Paper
On the generalised colouring numbers of graphs that exclude a fixed minor2016-10-14Paper
Deciding First-Order Properties of Nowhere Dense Graphs2015-06-26Paper
Directed Width Measures and Monotonicity of Directed Graph Searching2014-08-20Paper
Vertex Disjoint Paths in Upward Planar Graphs2014-06-24Paper
Decomposition horizons and a characterization of stable hereditary classes of graphsN/APaper
Twin-width and permutationsN/APaper

Research outcomes over time

This page was built for person: Sebastian Siebertz