default search action
Sebastian Siebertz
Person information
- affiliation: University of Bremen, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
- [j27]Patrice Ossona de Mendez, Michal Pilipczuk, Sebastian Siebertz:
Transducing paths in graph classes with unbounded shrubdepth. Eur. J. Comb. 123: 103660 (2025) - [j26]Ozan Heydt, Simeon Kublenz, Patrice Ossona de Mendez, Sebastian Siebertz, Alexandre Vigny:
Distributed domination on sparse graph classes. Eur. J. Comb. 123: 103773 (2025) - [j25]Daniel Král', Michal Pilipczuk, Sebastian Siebertz, Blair D. Sullivan:
Preface. Eur. J. Comb. 123: 103881 (2025) - 2024
- [j24]Valentin Bartier, Nicolas Bousquet, Jihad Hanna, Amer E. Mouawad, Sebastian Siebertz:
Token Sliding on Graphs of Girth Five. Algorithmica 86(2): 638-655 (2024) - [j23]Nicolas Bousquet, Amer E. Mouawad
, Naomi Nishimura, Sebastian Siebertz:
A survey on the parameterized complexity of reconfiguration problems. Comput. Sci. Rev. 53: 100663 (2024) - [j22]Alexander Lindermayr, Sebastian Siebertz, Alexandre Vigny:
Elimination Distance to Bounded Degree on Planar Graphs Preprint. Fundam. Informaticae 191(2): 129-140 (2024) - [j21]Mario Grobler, Yiting Jiang, Patrice Ossona de Mendez, Sebastian Siebertz
Discrepancy and sparsity. J. Comb. Theory B 169: 96-133 (2024) - [j20]Édouard Bonnet, Jaroslav Nesetril, Patrice Ossona de Mendez, Sebastian Siebertz, Stéphan Thomassé:
Twin-width and permutations. Log. Methods Comput. Sci. 20(3) (2024) - [c48]Mario Grobler, Leif Sabellek, Sebastian Siebertz:
Remarks on Parikh-Recognizable Omega-languages. CSL 2024: 31:1-31:21 - [c47]Sebastian Siebertz, Alexandre Vigny:
Advances in Algorithmic Meta Theorems (Invited Paper). FSTTCS 2024: 2:1-2:29 - [c46]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: 76:1-76:20 - [c45]Mario Grobler, Stephanie Maaz, Amer E. Mouawad, Naomi Nishimura, Vijayaragunathan Ramamoorthi, Sebastian Siebertz:
Kernelization Complexity of Solution Discovery Problems. ISAAC 2024: 36:1-36:17 - [c44]Nicole Schirrmacher
Model Checking Disjoint-Paths Logic on Topological-Minor-Free Graph Classes. LICS 2024: 68:1-68:12 - [c43]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: 183-197 - [i61]Mario Grobler, Sebastian Siebertz:
Deterministic Parikh automata on infinite words. CoRR abs/2401.14737 (2024) - [i60]Mario Grobler, Stephanie Maaz, Amer E. Mouawad, Naomi Nishimura, Vijayaragunathan Ramamoorthi, Sebastian Siebertz:
Kernelization Complexity of Solution Discovery Problems. CoRR abs/2409.17250 (2024) - 2023
- [j19]Nicole Schirrmacher
First-order Logic with Connectivity Operators. ACM Trans. Comput. Log. 24(4): 30:1-30:23 (2023) - [c42]Michael R. Fellows
On Solution Discovery via Reconfiguration. ECAI 2023: 700-707 - [c41]Jan Dreier
Indiscernibles and Flatness in Monadically Stable and Monadically NIP Classes. ICALP 2023: 125:1-125:18 - [c40]Jakub Gajarský, Nikolas Mählmann, Rose McCarty
Flipper Games for Monadically Stable Graph Classes. ICALP 2023: 128:1-128:16 - [c39]Jan Dreier
First-Order Model Checking on Structurally Sparse Graph Classes. STOC 2023: 567-580 - [i59]Mario Grobler, Leif Sabellek, Sebastian Siebertz:
Parikh Automata on Infinite Words. CoRR abs/2301.08969 (2023) - [i58]Jakub Gajarský, Nikolas Mählmann, Rose McCarty
Flipper games for monadically stable graph classes. CoRR abs/2301.13735 (2023) - [i57]Jan Dreier
First-Order Model Checking on Structurally Sparse Graph Classes. CoRR abs/2302.03527 (2023) - [i56]Mario Grobler, Sebastian Siebertz:
Büchi-like characterizations for Parikh-recognizable omega-languages. CoRR abs/2302.04087 (2023) - [i55]Nicole Schirrmacher, Sebastian Siebertz, Giannos Stamoulis, Dimitrios M. Thilikos, Alexandre Vigny:
Model Checking Disjoint-Paths Logic on Topological-Minor-Free Graph Classes. CoRR abs/2302.07033 (2023) - [i54]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 abs/2304.14295 (2023) - [i53]Mario Grobler, Leif Sabellek, Sebastian Siebertz:
Remarks on Parikh-recognizable omega-languages. CoRR abs/2307.07238 (2023) - [i52]Jona Dirks, Enna Gerhard
Data reduction for directed feedback vertex set on graphs without long induced cycles. CoRR abs/2308.15900 (2023) - [i51]Mario Grobler, Stephanie Maaz, Nicole Megow, Amer E. Mouawad, Vijayaragunathan Ramamoorthi, Daniel Schmand
Solution discovery via reconfiguration for problems in P. CoRR abs/2311.13478 (2023) - 2022
- [j18]Daniel Lokshtanov, Amer E. Mouawad
On the Parameterized Complexity of Reconfiguration of Connected Dominating Sets. Algorithmica 84(2): 482-509 (2022) - [c38]Jaroslav Nesetril, Patrice Ossona de Mendez, Sebastian Siebertz:
Structural Properties of the First-Order Transduction Quasiorder. CSL 2022: 31:1-31:16 - [c37]Nicole Schirrmacher, Sebastian Siebertz, Alexandre Vigny:
First-Order Logic with Connectivity Operators. CSL 2022: 34:1-34:17 - [c36]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: 102:1-102:18 - [c35]Jan Dreier
Combinatorial and Algorithmic Aspects of Monadic Stability. ISAAC 2022: 11:1-11:17 - [c34]Moritz Bergenthal
PACE Solver Description: GraPA-JAVA. IPEC 2022: 30:1-30:4 - [c33]Ozan Heydt, Sebastian Siebertz, Alexandre Vigny:
Local Planar Domination Revisited. SIROCCO 2022: 154-173 - [c32]Valentin Bartier, Nicolas Bousquet
Token Sliding on Graphs of Girth Five. WG 2022: 56-69 - [i50]Michal Pilipczuk, Patrice Ossona de Mendez, Sebastian Siebertz:
Transducing paths in graph classes with unbounded shrubdepth. CoRR abs/2203.16900 (2022) - [i49]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 abs/2204.10526 (2022) - [i48]Valentin Bartier, Nicolas Bousquet, Jihad Hanna, Amer E. Mouawad, Sebastian Siebertz:
Token sliding on graphs of girth five. CoRR abs/2205.01009 (2022) - [i47]Jan Dreier
Indiscernibles and Wideness in Monadically Stable and Monadically NIP Classes. CoRR abs/2206.13765 (2022) - [i46]Jan Dreier
Combinatorial and Algorithmic Aspects of Monadic Stability. CoRR abs/2206.14509 (2022) - [i45]Ozan Heydt, Simeon Kublenz, Patrice Ossona de Mendez, Sebastian Siebertz, Alexandre Vigny:
Distributed domination on sparse graph classes. CoRR abs/2207.02669 (2022) - [i44]Samuel Braunfeld
On the first-order transduction quasiorder of hereditary classes of graphs. CoRR abs/2208.14412 (2022) - [i43]Samuel Braunfeld
Decomposition horizons: from graph sparsity to model-theoretic dividing lines. CoRR abs/2209.11229 (2022) - [i42]Jarik Nesetril, Patrice Ossona de Mendez, Sebastian Siebertz:
Modulo-Counting First-Order Logic on Bounded Expansion Classes. CoRR abs/2211.03704 (2022) - 2021
- [j17]Jaroslav Nesetril
Classes of graphs with low complexity: The case of classes with bounded linear rankwidth. Eur. J. Comb. 91: 103223 (2021) - [j16]Michal Pilipczuk, Sebastian Siebertz:
Kernelization and approximation of distance-r independent sets on nowhere dense graphs. Eur. J. Comb. 94: 103309 (2021) - [j15]Michal Pilipczuk, Sebastian Siebertz:
Polynomial bounds for centered colorings on proper minor-closed graph classes. J. Comb. Theory B 151: 111-147 (2021) - [c31]Jona Dirks, Mario Grobler, Roman Rabinovich, Yannik Schnaubelt, Sebastian Siebertz, Maximilian Sonneborn:
PACE Solver Description: PACA-JAVA. IPEC 2021: 30:1-30:4 - [c30]Nikolas Mählmann, Sebastian Siebertz, Alexandre Vigny:
Recursive Backdoors for SAT. MFCS 2021: 73:1-73:18 - [c29]Simeon Kublenz, Sebastian Siebertz
Constant Round Distributed Domination on Graph Classes with Bounded Expansion. SIROCCO 2021: 334-351 - [c28]Jaroslav Nesetril, Patrice Ossona de Mendez, Michal Pilipczuk, Roman Rabinovich, Sebastian Siebertz:
Rankwidth meets stability. SODA 2021: 2014-2033 - [i41]Nikolas Mählmann, Sebastian Siebertz, Alexandre Vigny:
Recursive Backdoors for SAT. CoRR abs/2102.04707 (2021) - [i40]Édouard Bonnet, Jaroslav Nesetril, Patrice Ossona de Mendez, Sebastian Siebertz, Stéphan Thomassé:
Twin-width and permutations. CoRR abs/2102.06880 (2021) - [i39]Mario Grobler, Patrice Ossona de Mendez, Sebastian Siebertz, Alexandre Vigny:
On the discrepancy of set systems definable in sparse graph classes. CoRR abs/2105.03693 (2021) - [i38]Nicole Schrader, Sebastian Siebertz, Alexandre Vigny:
First-Order Logic with Connectivity Operators. CoRR abs/2107.05928 (2021) - [i37]Michal Pilipczuk, Nicole Schirrmacher, Sebastian Siebertz, Szymon Torunczyk, Alexandre Vigny:
Algorithms and data structures for first-order logic with connectivity under vertex failures. CoRR abs/2111.03725 (2021) - [i36]Ozan Heydt, Sebastian Siebertz, Alexandre Vigny:
Local planar domination revisited. CoRR abs/2111.14506 (2021) - [i35]Daniel Král', Michal Pilipczuk, Sebastian Siebertz, Blair D. Sullivan:
Sparsity in Algorithms, Combinatorics and Logic (Dagstuhl Seminar 21391). Dagstuhl Reports 11(8): 115-128 (2021) - 2020
- [j14]O-joung Kwon
On low rank-width colorings. Eur. J. Comb. 83 (2020) - [j13]Kord Eickmeyer
Model-Checking on Ordered Structures. ACM Trans. Comput. Log. 21(2): 11:1-11:28 (2020) - [j12]Jakub Gajarský
First-Order Interpretations of Bounded Expansion Classes. ACM Trans. Comput. Log. 21(4): 29:1-29:41 (2020) - [c27]Daniel Lokshtanov, Amer E. Mouawad, Fahad Panolan
On the Parameterized Complexity of Reconfiguration of Connected Dominating Sets. IPEC 2020: 24:1-24:15 - [c26]Alexander Lindermayr
Elimination Distance to Bounded Degree on Planar Graphs. MFCS 2020: 65:1-65:12 - [c25]Jaroslav Nesetril, Roman Rabinovich, Patrice Ossona de Mendez
Linear rankwidth meets stability. SODA 2020: 1180-1199 - [i34]Yiting Jiang, Jaroslav Nesetril, Patrice Ossona de Mendez, Sebastian Siebertz:
Regular partitions of gentle graphs. CoRR abs/2003.11692 (2020) - [i33]Alexander Lindermayr, Sebastian Siebertz, Alexandre Vigny:
Elimination distance to bounded degree on planar graphs. CoRR abs/2007.02413 (2020) - [i32]Jaroslav Nesetril, Patrice Ossona de Mendez, Michal Pilipczuk, Roman Rabinovich, Sebastian Siebertz:
Rankwidth meets stability. CoRR abs/2007.07857 (2020) - [i31]Jaroslav Nesetril, Patrice Ossona de Mendez, Sebastian Siebertz:
Towards an arboretum of monadically stable classes of graphs. CoRR abs/2010.02607 (2020) - [i30]Simeon Kublenz, Sebastian Siebertz, Alexandre Vigny:
Distributed domination on graph classes with bounded expansion. CoRR abs/2012.02701 (2020)
2010 – 2019
- 2019
- [j11]Sebastian Siebertz
Greedy domination on biclique-free graphs. Inf. Process. Lett. 145: 64-67 (2019) - [j10]Wojciech Nadara
Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-wideness. ACM J. Exp. Algorithmics 24(1): 2.6:1-2.6:34 (2019) - [j9]Eduard Eiben, Mithilesh Kumar
Lossy Kernels for Connected Dominating Set on Sparse Graphs. SIAM J. Discret. Math. 33(3): 1743-1771 (2019) - [j8]Stephan Kreutzer, Roman Rabinovich, Sebastian Siebertz
Polynomial Kernels and Wideness Properties of Nowhere Dense Graph Classes. ACM Trans. Algorithms 15(2): 24:1-24:19 (2019) - [j7]Saeed Akhoondian Amiri, Stefan Schmid
Distributed Dominating Set Approximations beyond Planar Graphs. ACM Trans. Algorithms 15(3): 39:1-39:18 (2019) - [c24]Michal Pilipczuk, Sebastian Siebertz
Polynomial bounds for centered colorings on proper minor-closed graph classes. SODA 2019: 1501-1520 - [c23]Grzegorz Fabianski
Progressive Algorithms for Domination and Independence. STACS 2019: 27:1-27:16 - [c22]Stephan Kreutzer, Irene Muzi, Patrice Ossona de Mendez, Roman Rabinovich, Sebastian Siebertz
Algorithmic Properties of Sparse Digraphs. STACS 2019: 46:1-46:20 - [i29]Sebastian Siebertz:
Parameterized Distributed Complexity Theory: A logical approach. CoRR abs/1903.00505 (2019) - [i28]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 abs/1909.01564 (2019) - [i27]Sebastian Siebertz:
Nowhere dense graph classes and algorithmic applications. A tutorial at Highlights of Logic, Games and Automata 2019. CoRR abs/1909.06752 (2019) - [i26]Daniel Lokshtanov, Amer E. Mouawad, Fahad Panolan, Sebastian Siebertz:
On the Parameterized Complexity of Reconfiguration of Connected Dominating Sets. CoRR abs/1910.00581 (2019) - [i25]Jaroslav Nesetril, Patrice Ossona de Mendez, Roman Rabinovich, Sebastian Siebertz:
Linear rankwidth meets stability. CoRR abs/1911.07748 (2019) - 2018
- [j6]Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman, Sebastian Siebertz
Vertex Cover Reconfiguration and Beyond. Algorithms 11(2): 20 (2018) - [j5]Sebastian Siebertz:
Reconfiguration on Nowhere Dense Graph Classes. Electron. J. Comb. 25(3): 3 (2018) - [j4]Martin Grohe, Stephan Kreutzer, Roman Rabinovich, Sebastian Siebertz
Coloring and Covering Nowhere Dense Graphs. SIAM J. Discret. Math. 32(4): 2467-2481 (2018) - [c21]Jakub Gajarský, Stephan Kreutzer, Jaroslav Nesetril, Patrice Ossona de Mendez
First-Order Interpretations of Bounded Expansion Classes. ICALP 2018: 126:1-126:14 - [c20]Michal Pilipczuk
Parameterized circuit complexity of model-checking on sparse structures. LICS 2018: 789-798 - [c19]Michal Pilipczuk
On the number of types in sparse graphs. LICS 2018: 799-808 - [c18]Saeed Akhoondian Amiri, Patrice Ossona de Mendez
Distributed Domination on Graph Classes of Bounded Expansion. SPAA 2018: 143-151 - [c17]Eduard Eiben, Mithilesh Kumar
Lossy Kernels for Connected Dominating Set on Sparse Graphs. STACS 2018: 29:1-29:15 - [c16]Wojciech Nadara, Marcin Pilipczuk, Roman Rabinovich, Felix Reidl
Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-Wideness. SEA 2018: 14:1-14:16 - [i24]Wojciech Nadara, Marcin Pilipczuk, Roman Rabinovich, Felix Reidl, Sebastian Siebertz:
Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-Wideness. CoRR abs/1802.09801 (2018) - [i23]Michal Pilipczuk, Sebastian Siebertz, Szymon Torunczyk:
Parameterized circuit complexity of model checking first-order logic on sparse structures. CoRR abs/1805.03488 (2018) - [i22]Sebastian Siebertz:
Greedy domination on biclique-free graphs. CoRR abs/1806.02590 (2018) - [i21]Michal Pilipczuk, Sebastian Siebertz:
Polynomial bounds for centered colorings on proper minor-closed graph classes. CoRR abs/1807.03683 (2018) - [i20]Michal Pilipczuk, Sebastian Siebertz:
Kernelization and approximation of distance-r independent sets on nowhere dense graphs. CoRR abs/1809.05675 (2018) - [i19]Jakub Gajarský, Stephan Kreutzer, Jaroslav Nesetril, Patrice Ossona de Mendez, Michal Pilipczuk, Sebastian Siebertz, Szymon Torunczyk:
First-order interpretations of bounded expansion classes. CoRR abs/1810.02389 (2018) - [i18]Grzegorz Fabianski, Michal Pilipczuk, Sebastian Siebertz, Szymon Torunczyk:
Progressive Algorithms for Domination and Independence. CoRR abs/1811.06799 (2018) - [i17]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 abs/1812.08003 (2018) - 2017
- [j3]Jan van den Heuvel
On the generalised colouring numbers of graphs that exclude a fixed minor. Eur. J. Comb. 66: 129-144 (2017) - [j2]Martin Grohe
Deciding First-Order Properties of Nowhere Dense Graphs. J. ACM 64(3): 17:1-17:32 (2017) - [c15]Kord Eickmeyer
Neighborhood Complexity and Kernelization for Nowhere Dense Classes of Graphs. ICALP 2017: 63:1-63:14 - [c14]Jan van den Heuvel, Stephan Kreutzer, Michal Pilipczuk
Model-checking for successor-invariant first-order formulas on graph classes of bounded expansion. LICS 2017: 1-11 - [c13]Stephan Kreutzer, Roman Rabinovich, Sebastian Siebertz
Polynomial Kernels and Wideness Properties of Nowhere Dense Graph Classes. SODA 2017: 1533-1545 - [c12]Stephan Kreutzer, Roman Rabinovich, Sebastian Siebertz
Structural Properties and Constant Factor-Approximation of Strong Distance-r Dominating Sets in Sparse Directed Graphs. STACS 2017: 48:1-48:15 - [c11]O-joung Kwon
On Low Rank-Width Colorings. WG 2017: 372-385 - [i16]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. CoRR abs/1701.08516 (2017) - [i15]Saeed Akhoondian Amiri, Patrice Ossona de Mendez, Roman Rabinovich, Sebastian Siebertz:
Distributed Domination on Graph Classes of Bounded Expansion. CoRR abs/1702.02848 (2017) - [i14]O-joung Kwon, Michal Pilipczuk, Sebastian Siebertz:
On low rank-width colorings. CoRR abs/1703.03304 (2017) - [i13]Michal Pilipczuk, Sebastian Siebertz, Szymon Torunczyk:
On Wideness and Stability. CoRR abs/1705.09336 (2017) - [i12]Saeed Akhoondian Amiri, Stefan Schmid, Sebastian Siebertz:
Distributed Dominating Set Approximations beyond Planar Graphs. CoRR abs/1705.09617 (2017) - [i11]Stephan Kreutzer, Patrice Ossona de Mendez, Roman Rabinovich, Sebastian Siebertz:
Algorithmic Properties of Sparse Digraphs. CoRR abs/1707.01701 (2017) - [i10]Sebastian Siebertz:
Reconfiguration on nowhere dense graph classes. CoRR abs/1707.06775 (2017) - [i9]Sebastian Siebertz:
Lossy kernels for connected distance-$r$ domination on nowhere dense graph classes. CoRR abs/1707.09819 (2017) - 2016
- [b1]Sebastian Siebertz:
Nowhere dense classes of graphs (characterisations and algorithmic meta-theorems) (Nowhere Dense Klassen von Graphen) (Charakterisierungen und algorithmische Meta-Sätze). TU Berlin, Germany, 2016 - [c10]Stephan Kreutzer, Michal Pilipczuk
The Generalised Colouring Numbers on Classes of Bounded Expansion. MFCS 2016: 85:1-85:13 - [c9]Saeed Akhoondian Amiri, Stefan Schmid
A Local Constant Factor MDS Approximation for Bounded Genus Graphs. PODC 2016: 227-233 - [c8]Pål Grønås Drange, Markus Sortland Dregi, Fedor V. Fomin
Kernelization and Sparseness: the Case of Dominating Set. STACS 2016: 31:1-31:14 - [i8]Saeed Akhoondian Amiri, Stefan Schmid, Sebastian Siebertz:
A local constant factor approximation for the minimum dominating set problem on bounded genus graphs. CoRR abs/1602.02991 (2016) - [i7]Jan van den Heuvel, Patrice Ossona de Mendez, Daniel Quiroz, Roman Rabinovich, Sebastian Siebertz:
On the Generalised Colouring Numbers of Graphs that Exclude a Fixed Minor. CoRR abs/1602.09052 (2016) - [i6]Stephan Kreutzer, Michal Pilipczuk, Roman Rabinovich, Sebastian Siebertz:
The Generalised Colouring Numbers on Classes of Bounded Expansion. CoRR abs/1606.08972 (2016) - [i5]Stephan Kreutzer, Roman Rabinovich, Sebastian Siebertz:
Polynomial Kernels and Wideness Properties of Nowhere Dense Graph Classes. CoRR abs/1608.05637 (2016) - [i4]Kord Eickmeyer, Archontia C. Giannopoulou, Stephan Kreutzer, O-joung Kwon, Michal Pilipczuk, Roman Rabinovich, Sebastian Siebertz:
Neighborhood complexity and kernelization for nowhere dense classes of graphs. CoRR abs/1612.08197 (2016) - 2015
- [j1]Jan van den Heuvel, Patrice Ossona de Mendez
On the generalised colouring numbers of graphs that exclude a fixed minor. Electron. Notes Discret. Math. 49: 523-530 (2015) - [c7]Saeed Akhoondian Amiri, Lukasz Kaiser, Stephan Kreutzer, Roman Rabinovich, Sebastian Siebertz
Graph Searching Games and Width Measures for Directed Graphs. STACS 2015: 34-47 - [c6]Martin Grohe, Stephan Kreutzer, Roman Rabinovich, Sebastian Siebertz
Colouring and Covering Nowhere Dense Graphs. WG 2015: 325-338 - 2014
- [c5]Saeed Akhoondian Amiri, Ali Golshani, Stephan Kreutzer, Sebastian Siebertz:
Vertex Disjoint Paths in Upward Planar Graphs. CSR 2014: 52-64 - [c4]Martin Grohe
Deciding first-order properties of nowhere dense graphs. STOC 2014: 89-98 - [i3]Lukasz Kaiser, Stephan Kreutzer, Roman Rabinovich, Sebastian Siebertz:
Directed Width Measures and Monotonicity of Directed Graph Searching. CoRR abs/1408.4745 (2014) - 2013
- [c3]Martin Grohe
Characterisations of Nowhere Dense Graphs (Invited Talk). FSTTCS 2013: 21-40 - [i2]Martin Grohe, Stephan Kreutzer, Sebastian Siebertz:
Deciding first-order properties of nowhere dense graphs. CoRR abs/1311.3899 (2013) - [i1]Saeed Akhoondian Amiri, Ali Golshani, Stephan Kreutzer, Sebastian Siebertz:
Vertex Disjoint Path in Upward Planar Graphs. CoRR abs/1312.1526 (2013) - 2012
- [c2]Erich Grädel, Sebastian Siebertz
Dynamic definability. ICDT 2012: 236-248 - [c1]Viktor Engelmann, Stephan Kreutzer, Sebastian Siebertz
First-Order and Monadic Second-Order Model-Checking on Ordered Structures. LICS 2012: 275-284
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 20:49 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: