Sledovat
Sebastian Siebertz
Sebastian Siebertz
Universität Bremen, AG Theoretische Informatik
E-mailová adresa ověřena na: uni-bremen.de - Domovská stránka
Název
Citace
Citace
Rok
Deciding first-order properties of nowhere dense graphs
M Grohe, S Kreutzer, S Siebertz
Journal of the ACM (JACM) 64 (3), 1-32, 2017
2782017
Coloring and covering nowhere dense graphs
M Grohe, S Kreutzer, R Rabinovich, S Siebertz, K Stavropoulos
SIAM Journal on Discrete Mathematics 32 (4), 2467-2481, 2018
772018
First-Order Interpretations of Bounded Expansion Classes
P Ossona de Mendez, J Gajarsky, S Kreutzer, J Nešetřil, PO De Mendez, ...
ACM Transactions on Computational Logic 21 (4), 1-41, 2020
70*2020
Kernelization and sparseness: the case of dominating set
PG Drange, MS Dregi, FV Fomin, S Kreutzer, D Lokshtanov, M Pilipczuk, ...
33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016,, 31:1 …, 2014
632014
On the generalised colouring numbers of graphs that exclude a fixed minor
J Van Den Heuvel, PO de Mendez, D Quiroz, R Rabinovich, S Siebertz
European Journal of Combinatorics 66, 129-144, 2017
602017
Neighborhood complexity and kernelization for nowhere dense classes of graphs
K Eickmeyer, AC Giannopoulou, S Kreutzer, O Kwon, M Pilipczuk, ...
44th International Colloquium on Automata, Languages, and Programming, ICALP …, 2016
562016
Vertex cover reconfiguration and beyond
AE Mouawad, N Nishimura, V Raman, S Siebertz
Algorithms 11 (2), 20, 2018
53*2018
Twin-width and permutations
É Bonnet, J Nešetřil, PO de Mendez, S Siebertz, S Thomassé
arXiv preprint arXiv:2102.06880, 2021
452021
Polynomial kernels and wideness properties of nowhere dense graph classes
S Kreutzer, R Rabinovich, S Siebertz
ACM Transactions on Algorithms (TALG) 15 (2), 1-19, 2018
422018
Polynomial bounds for centered colorings on proper minor-closed graph classes
M Pilipczuk, S Siebertz
Journal of Combinatorial Theory, Series B 151, 111-147, 2021
402021
On the number of types in sparse graphs
M Pilipczuk, S Siebertz, S Toruńczyk
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer …, 2018
35*2018
Lossy kernels for connected dominating set on sparse graphs
E Eiben, M Kumar, AE Mouawad, F Panolan, S Siebertz
35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, 29:1 …, 2017
352017
Rankwidth meets stability
J Nešetřil, PO Mendez, M Pilipczuk, R Rabinovich, S Siebertz
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021
342021
Characterisations of nowhere dense graphs (invited talk)
M Grohe, S Kreutzer, S Siebertz
IARCS Annual Conference on Foundations of Software Technology and …, 2013
282013
A local constant factor MDS approximation for bounded genus graphs
S Akhoondian Amiri, S Schmid, S Siebertz
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing …, 2016
272016
Distributed dominating set approximations beyond planar graphs
SA Amiri, S Schmid, S Siebertz
ACM Transactions on Algorithms (TALG) 15 (3), 1-18, 2019
25*2019
Progressive Algorithms for Domination and Independence
G Fabiański, M Pilipczuk, S Siebertz, S Toruńczyk
36th International Symposium on Theoretical Aspects of Computer Science …, 2018
252018
Classes of graphs with low complexity: the case of classes with bounded linear rankwidth
J Nešetřil, P Ossona de Mendez, R Rabinovich, S Siebertz
European Journal of Combinatorics, 103223, 2020
242020
The generalised colouring numbers on classes of bounded expansion
S Kreutzer, M Pilipczuk, R Rabinovich, S Siebertz
41st International Symposium on Mathematical Foundations of Computer Science …, 2016
242016
Distributed domination on graph classes of bounded expansion
S Akhoondian Amiri, P Ossona de Mendez, R Rabinovich, S Siebertz
Proceedings of the 30th on Symposium on Parallelism in Algorithms and …, 2018
222018
Systém momentálně nemůže danou operaci provést. Zkuste to znovu později.
Články 1–20