Sebastian Siebertz

ORCID

Publication Activity (10 Years)

Years Active: 2012-2024
Publications (10 Years): 119

Top Venues

Publications

Mario Grobler, Stephanie Maaz, Nicole Megow, Amer E. Mouawad, Vijayaragunathan Ramamoorthi, Daniel Schmand, Sebastian Siebertz
Solution Discovery via Reconfiguration for Problems in P. ICALP (2024)
Nicolas Bousquet, Amer E. Mouawad, Naomi Nishimura, Sebastian Siebertz
A survey on the parameterized complexity of reconfiguration problems. Comput. Sci. Rev. 53 (2024)
Mario Grobler, Sebastian Siebertz
Deterministic Parikh automata on infinite words. CoRR (2024)
Valentin Bartier, Nicolas Bousquet, Jihad Hanna, Amer E. Mouawad, Sebastian Siebertz
Token Sliding on Graphs of Girth Five. Algorithmica 86 (2) (2024)
Nicole Schirrmacher, Sebastian Siebertz, Giannos Stamoulis, Dimitrios M. Thilikos, Alexandre Vigny
Model Checking Disjoint-Paths Logic on Topological-Minor-Free Graph Classes. LICS (2024)
Alexander Lindermayr, Sebastian Siebertz, Alexandre Vigny
Elimination Distance to Bounded Degree on Planar Graphs Preprint. Fundam. Informaticae 191 (2) (2024)
Édouard Bonnet, Jaroslav Nesetril, Patrice Ossona de Mendez, Sebastian Siebertz, Stéphan Thomassé
Twin-width and permutations. Log. Methods Comput. Sci. 20 (3) (2024)
Jona Dirks, Enna Gerhard, Mario Grobler, Amer E. Mouawad, Sebastian Siebertz
Data Reduction for Directed Feedback Vertex Set on Graphs Without Long Induced Cycles. SOFSEM (2024)
Mario Grobler, Leif Sabellek, Sebastian Siebertz
Remarks on Parikh-Recognizable Omega-languages. CSL (2024)
Mario Grobler, Yiting Jiang, Patrice Ossona de Mendez, Sebastian Siebertz, Alexandre Vigny
Discrepancy and sparsity. J. Comb. Theory B 169 (2024)
Jan Dreier, Nikolas Mählmann, Sebastian Siebertz, Szymon Torunczyk
Indiscernibles and Flatness in Monadically Stable and Monadically NIP Classes. ICALP (2023)
Jakub Gajarský, Nikolas Mählmann, Rose McCarty, Pierre Ohlmann, Michal Pilipczuk, Wojciech Przybyszewski, Sebastian Siebertz, Marek Sokolowski, Szymon Torunczyk
Flipper games for monadically stable graph classes. CoRR (2023)
Michael R. Fellows, Mario Grobler, Nicole Megow, Amer E. Mouawad, Vijayaragunathan Ramamoorthi, Frances A. Rosamond, Daniel Schmand, Sebastian Siebertz
On Solution Discovery via Reconfiguration. CoRR (2023)
Nicole Schirrmacher, Sebastian Siebertz, Giannos Stamoulis, Dimitrios M. Thilikos, Alexandre Vigny
Model Checking Disjoint-Paths Logic on Topological-Minor-Free Graph Classes. CoRR (2023)
Mario Grobler, Leif Sabellek, Sebastian Siebertz
Parikh Automata on Infinite Words. CoRR (2023)
Mario Grobler, Leif Sabellek, Sebastian Siebertz
Remarks on Parikh-recognizable omega-languages. CoRR (2023)
Jan Dreier, Nikolas Mählmann, Sebastian Siebertz
First-Order Model Checking on Structurally Sparse Graph Classes. CoRR (2023)
Michael R. Fellows, Mario Grobler, Nicole Megow, Amer E. Mouawad, Vijayaragunathan Ramamoorthi, Frances A. Rosamond, Daniel Schmand, Sebastian Siebertz
On Solution Discovery via Reconfiguration. ECAI (2023)
Mario Grobler, Sebastian Siebertz
Büchi-like characterizations for Parikh-recognizable omega-languages. CoRR (2023)
Mario Grobler, Stephanie Maaz, Nicole Megow, Amer E. Mouawad, Vijayaragunathan Ramamoorthi, Daniel Schmand, Sebastian Siebertz
Solution discovery via reconfiguration for problems in P. CoRR (2023)
Jakub Gajarský, Nikolas Mählmann, Rose McCarty, Pierre Ohlmann, Michal Pilipczuk, Wojciech Przybyszewski, Sebastian Siebertz, Marek Sokolowski, Szymon Torunczyk
Flipper Games for Monadically Stable Graph Classes. ICALP (2023)
Nicole Schirrmacher, Sebastian Siebertz, Alexandre Vigny
First-order Logic with Connectivity Operators. ACM Trans. Comput. Log. 24 (4) (2023)
Jona Dirks, Enna Gerhard, Mario Grobler, Amer E. Mouawad, Sebastian Siebertz
Data reduction for directed feedback vertex set on graphs without long induced cycles. CoRR (2023)
Jan Dreier, Nikolas Mählmann, Sebastian Siebertz
First-Order Model Checking on Structurally Sparse Graph Classes. STOC (2023)
Michal Pilipczuk, Patrice Ossona de Mendez, Sebastian Siebertz
Transducing paths in graph classes with unbounded shrubdepth. CoRR (2022)
Jan Dreier, Nikolas Mählmann, Amer E. Mouawad, Sebastian Siebertz, Alexandre Vigny
Combinatorial and Algorithmic Aspects of Monadic Stability. CoRR (2022)
Michal Pilipczuk, Nicole Schirrmacher, Sebastian Siebertz, Szymon Torunczyk, Alexandre Vigny
Algorithms and Data Structures for First-Order Logic with Connectivity Under Vertex Failures. ICALP (2022)
Nicolas Bousquet, Amer E. Mouawad, Naomi Nishimura, Sebastian Siebertz
A survey on the parameterized complexity of the independent set and (connected) dominating set reconfiguration problems. CoRR (2022)
Valentin Bartier, Nicolas Bousquet, Jihad Hanna, Amer E. Mouawad, Sebastian Siebertz
Token sliding on graphs of girth five. CoRR (2022)
Samuel Braunfeld, Jaroslav Nesetril, Patrice Ossona de Mendez, Sebastian Siebertz
On the first-order transduction quasiorder of hereditary classes of graphs. CoRR (2022)
Valentin Bartier, Nicolas Bousquet, Jihad Hanna, Amer E. Mouawad, Sebastian Siebertz
Token Sliding on Graphs of Girth Five. WG (2022)
Jan Dreier, Nikolas Mählmann, Sebastian Siebertz, Szymon Torunczyk
Indiscernibles and Wideness in Monadically Stable and Monadically NIP Classes. CoRR (2022)
Nicole Schirrmacher, Sebastian Siebertz, Alexandre Vigny
First-Order Logic with Connectivity Operators. CSL (2022)
Jarik Nesetril, Patrice Ossona de Mendez, Sebastian Siebertz
Modulo-Counting First-Order Logic on Bounded Expansion Classes. CoRR (2022)
Jaroslav Nesetril, Patrice Ossona de Mendez, Sebastian Siebertz
Structural Properties of the First-Order Transduction Quasiorder. CSL (2022)
Jan Dreier, Nikolas Mählmann, Amer E. Mouawad, Sebastian Siebertz, Alexandre Vigny
Combinatorial and Algorithmic Aspects of Monadic Stability. ISAAC (2022)
Samuel Braunfeld, Jaroslav Nesetril, Patrice Ossona de Mendez, Sebastian Siebertz
Decomposition horizons: from graph sparsity to model-theoretic dividing lines. CoRR (2022)
Ozan Heydt, Simeon Kublenz, Patrice Ossona de Mendez, Sebastian Siebertz, Alexandre Vigny
Distributed domination on sparse graph classes. CoRR (2022)
Daniel Lokshtanov, Amer E. Mouawad, Fahad Panolan, Sebastian Siebertz
On the Parameterized Complexity of Reconfiguration of Connected Dominating Sets. Algorithmica 84 (2) (2022)
Moritz Bergenthal, Jona Dirks, Thorben Freese, Jakob Gahde, Enna Gerhard, Mario Grobler, Sebastian Siebertz
PACE Solver Description: GraPA-JAVA. IPEC (2022)
Ozan Heydt, Sebastian Siebertz, Alexandre Vigny
Local Planar Domination Revisited. SIROCCO (2022)
Nikolas Mählmann, Sebastian Siebertz, Alexandre Vigny
Recursive Backdoors for SAT. CoRR (2021)
Mario Grobler, Patrice Ossona de Mendez, Sebastian Siebertz, Alexandre Vigny
On the discrepancy of set systems definable in sparse graph classes. CoRR (2021)
Michal Pilipczuk, Sebastian Siebertz
Kernelization and approximation of distance-r independent sets on nowhere dense graphs. Eur. J. Comb. 94 (2021)
Jaroslav Nesetril, Patrice Ossona de Mendez, Roman Rabinovich, Sebastian Siebertz
Classes of graphs with low complexity: The case of classes with bounded linear rankwidth. Eur. J. Comb. 91 (2021)
Simeon Kublenz, Sebastian Siebertz, Alexandre Vigny
Constant Round Distributed Domination on Graph Classes with Bounded Expansion. SIROCCO (2021)
Nikolas Mählmann, Sebastian Siebertz, Alexandre Vigny
Recursive Backdoors for SAT. MFCS (2021)
Jona Dirks, Mario Grobler, Roman Rabinovich, Yannik Schnaubelt, Sebastian Siebertz, Maximilian Sonneborn
PACE Solver Description: PACA-JAVA. IPEC (2021)
Jaroslav Nesetril, Patrice Ossona de Mendez, Michal Pilipczuk, Roman Rabinovich, Sebastian Siebertz
Rankwidth meets stability. SODA (2021)
Édouard Bonnet, Jaroslav Nesetril, Patrice Ossona de Mendez, Sebastian Siebertz, Stéphan Thomassé
Twin-width and permutations. CoRR (2021)
Ozan Heydt, Sebastian Siebertz, Alexandre Vigny
Local planar domination revisited. CoRR (2021)
Nicole Schrader, Sebastian Siebertz, Alexandre Vigny
First-Order Logic with Connectivity Operators. CoRR (2021)
Michal Pilipczuk, Sebastian Siebertz
Polynomial bounds for centered colorings on proper minor-closed graph classes. J. Comb. Theory, Ser. B 151 (2021)
Daniel Král', Michal Pilipczuk, Sebastian Siebertz, Blair D. Sullivan
Sparsity in Algorithms, Combinatorics and Logic (Dagstuhl Seminar 21391). Dagstuhl Reports 11 (8) (2021)
Michal Pilipczuk, Nicole Schirrmacher, Sebastian Siebertz, Szymon Torunczyk, Alexandre Vigny
Algorithms and data structures for first-order logic with connectivity under vertex failures. CoRR (2021)
Kord Eickmeyer, Jan van den Heuvel, Ken-ichi Kawarabayashi, Stephan Kreutzer, Patrice Ossona de Mendez, Michal Pilipczuk, Daniel A. Quiroz, Roman Rabinovich, Sebastian Siebertz
Model-Checking on Ordered Structures. ACM Trans. Comput. Log. 21 (2) (2020)
Daniel Lokshtanov, Amer E. Mouawad, Fahad Panolan, Sebastian Siebertz
On the Parameterized Complexity of Reconfiguration of Connected Dominating Sets. IPEC (2020)
Jaroslav Nesetril, Patrice Ossona de Mendez, Michal Pilipczuk, Roman Rabinovich, Sebastian Siebertz
Rankwidth meets stability. CoRR (2020)
Jakub Gajarský, Stephan Kreutzer, Jaroslav Nesetril, Patrice Ossona de Mendez, Michal Pilipczuk, Sebastian Siebertz, Szymon Torunczyk
First-Order Interpretations of Bounded Expansion Classes. ACM Trans. Comput. Log. 21 (4) (2020)
O-joung Kwon, Michal Pilipczuk, Sebastian Siebertz
On low rank-width colorings. Eur. J. Comb. 83 (2020)
Alexander Lindermayr, Sebastian Siebertz, Alexandre Vigny
Elimination distance to bounded degree on planar graphs. CoRR (2020)
Jaroslav Nesetril, Patrice Ossona de Mendez, Sebastian Siebertz
Towards an arboretum of monadically stable classes of graphs. CoRR (2020)
Alexander Lindermayr, Sebastian Siebertz, Alexandre Vigny
Elimination Distance to Bounded Degree on Planar Graphs. MFCS (2020)
Yiting Jiang, Jaroslav Nesetril, Patrice Ossona de Mendez, Sebastian Siebertz
Regular partitions of gentle graphs. CoRR (2020)
Simeon Kublenz, Sebastian Siebertz, Alexandre Vigny
Distributed domination on graph classes with bounded expansion. CoRR (2020)
Jaroslav Nesetril, Roman Rabinovich, Patrice Ossona de Mendez, Sebastian Siebertz
Linear rankwidth meets stability. SODA (2020)
Daniel Lokshtanov, Amer E. Mouawad, Fahad Panolan, Sebastian Siebertz
On the Parameterized Complexity of Reconfiguration of Connected Dominating Sets. CoRR (2019)
Wojciech Nadara, Marcin Pilipczuk, Roman Rabinovich, Felix Reidl, Sebastian Siebertz
Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-wideness. ACM J. Exp. Algorithmics 24 (1) (2019)
Saeed Akhoondian Amiri, Stefan Schmid, Sebastian Siebertz
Distributed Dominating Set Approximations beyond Planar Graphs. ACM Trans. Algorithms 15 (3) (2019)
Sebastian Siebertz
Parameterized Distributed Complexity Theory: A logical approach. CoRR (2019)
Grzegorz Fabianski, Michal Pilipczuk, Sebastian Siebertz, Szymon Torunczyk
Progressive Algorithms for Domination and Independence. STACS (2019)
Sebastian Siebertz
Nowhere dense graph classes and algorithmic applications. A tutorial at Highlights of Logic, Games and Automata 2019. CoRR (2019)
Jaroslav Nesetril, Patrice Ossona de Mendez, Roman Rabinovich, Sebastian Siebertz
Linear rankwidth meets stability. CoRR (2019)
Stephan Kreutzer, Irene Muzi, Patrice Ossona de Mendez, Roman Rabinovich, Sebastian Siebertz
Algorithmic Properties of Sparse Digraphs. STACS (2019)
Stephan Kreutzer, Roman Rabinovich, Sebastian Siebertz
Polynomial Kernels and Wideness Properties of Nowhere Dense Graph Classes. ACM Trans. Algorithms 15 (2) (2019)
Jaroslav Nesetril, Patrice Ossona de Mendez, Roman Rabinovich, Sebastian Siebertz
Classes of graphs with low complexity: the case of classes with bounded linear rankwidth. CoRR (2019)
Eduard Eiben, Mithilesh Kumar, Amer E. Mouawad, Fahad Panolan, Sebastian Siebertz
Lossy Kernels for Connected Dominating Set on Sparse Graphs. SIAM J. Discret. Math. 33 (3) (2019)
Sebastian Siebertz
Greedy domination on biclique-free graphs. Inf. Process. Lett. 145 (2019)
Michal Pilipczuk, Sebastian Siebertz
Polynomial bounds for centered colorings on proper minor-closed graph classes. SODA (2019)
Jakub Gajarský, Stephan Kreutzer, Jaroslav Nesetril, Patrice Ossona de Mendez, Michal Pilipczuk, Sebastian Siebertz, Szymon Torunczyk
First-Order Interpretations of Bounded Expansion Classes. ICALP (2018)
Michal Pilipczuk, Sebastian Siebertz, Szymon Torunczyk
On the number of types in sparse graphs. LICS (2018)
Michal Pilipczuk, Sebastian Siebertz, Szymon Torunczyk
Parameterized circuit complexity of model-checking on sparse structures. LICS (2018)
Sebastian Siebertz
Greedy domination on biclique-free graphs. CoRR (2018)
Michal Pilipczuk, Sebastian Siebertz, Szymon Torunczyk
Parameterized circuit complexity of model checking first-order logic on sparse structures. CoRR (2018)
Eduard Eiben, Mithilesh Kumar, Amer E. Mouawad, Fahad Panolan, Sebastian Siebertz
Lossy Kernels for Connected Dominating Set on Sparse Graphs. STACS (2018)
Grzegorz Fabianski, Michal Pilipczuk, Sebastian Siebertz, Szymon Torunczyk
Progressive Algorithms for Domination and Independence. CoRR (2018)
Jakub Gajarský, Stephan Kreutzer, Jaroslav Nesetril, Patrice Ossona de Mendez, Michal Pilipczuk, Sebastian Siebertz, Szymon Torunczyk
First-order interpretations of bounded expansion classes. CoRR (2018)
Michal Pilipczuk, Sebastian Siebertz
Polynomial bounds for centered colorings on proper minor-closed graph classes. CoRR (2018)
Saeed Akhoondian Amiri, Patrice Ossona de Mendez, Roman Rabinovich, Sebastian Siebertz
Distributed Domination on Graph Classes of Bounded Expansion. SPAA (2018)
Wojciech Nadara, Marcin Pilipczuk, Roman Rabinovich, Felix Reidl, Sebastian Siebertz
Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-Wideness. CoRR (2018)
Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman, Sebastian Siebertz
Vertex Cover Reconfiguration and Beyond. Algorithms 11 (2) (2018)
Kord Eickmeyer, Jan van den Heuvel, Ken-ichi Kawarabayashi, Stephan Kreutzer, Patrice Ossona de Mendez, Michal Pilipczuk, Daniel A. Quiroz, Roman Rabinovich, Sebastian Siebertz
Model-Checking on Ordered Structures. CoRR (2018)
Wojciech Nadara, Marcin Pilipczuk, Roman Rabinovich, Felix Reidl, Sebastian Siebertz
Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-Wideness. SEA (2018)
Sebastian Siebertz
Reconfiguration on Nowhere Dense Graph Classes. Electron. J. Comb. 25 (3) (2018)
Martin Grohe, Stephan Kreutzer, Roman Rabinovich, Sebastian Siebertz, Konstantinos S. Stavropoulos
Coloring and Covering Nowhere Dense Graphs. SIAM J. Discret. Math. 32 (4) (2018)
Michal Pilipczuk, Sebastian Siebertz
Kernelization and approximation of distance-r independent sets on nowhere dense graphs. CoRR (2018)
Sebastian Siebertz
Lossy kernels for connected distance-$r$ domination on nowhere dense graph classes. CoRR (2017)
Jan van den Heuvel, Stephan Kreutzer, Michal Pilipczuk, Daniel A. Quiroz, Roman Rabinovich, Sebastian Siebertz
Model-checking for successor-invariant first-order formulas on graph classes of bounded expansion. LICS (2017)
Stephan Kreutzer, Patrice Ossona de Mendez, Roman Rabinovich, Sebastian Siebertz
Algorithmic Properties of Sparse Digraphs. CoRR (2017)
Michal Pilipczuk, Sebastian Siebertz, Szymon Torunczyk
On Wideness and Stability. CoRR (2017)

Sebastian Siebertz.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Sebastian Siebertz