( en | de | ru )

 

Disambiguation of "Siebertz, Sebastian"

Author of the publication

copydeleteadd this publication to your clipboard
Kernelization and Sparseness: the Case of Dominating Set.

, , , , , , , , , , , and . STACS, volume 47 of LIPIcs, page 31:1-31:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Ute Siebertz

Wolfgang Siebertz

Anna Siebertz

Johannes Siebertz

Ernst Siebertz

 

Other publications of authors with the same name

Lossy kernels for connected distance-$r$ domination on nowhere dense graph classes.. CoRR, (2017)On the Parameterized Complexity of Reconfiguration of Connected Dominating Sets., , , and . CoRR, (2019)Polynomial bounds for centered colorings on proper minor-closed graph classes., and . J. Comb. Theory, Ser. B, (2021)Modulo-Counting First-Order Logic on Bounded Expansion Classes., , and . CoRR, (2022)Classes of graphs with low complexity: The case of classes with bounded linear rankwidth., , , and . Eur. J. Comb., (2021)On the Parameterized Complexity of Reconfiguration of Connected Dominating Sets., , , and . Algorithmica, 84 (2): 482-509 (2022)Sparsity in Algorithms, Combinatorics and Logic (Dagstuhl Seminar 21391)., , , and . Dagstuhl Reports, 11 (8): 115-128 (2021)Algorithms and Data Structures for First-Order Logic with Connectivity Under Vertex Failures., , , , and . ICALP, volume 229 of LIPIcs, page 102:1-102:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Linear rankwidth meets stability., , , and . SODA, page 1180-1199. SIAM, (2020)First-Order Logic with Connectivity Operators., , and . CSL, volume 216 of LIPIcs, page 34:1-34:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)