Sebastian Siebertz

Cited by

	All	Since 2019
Citations	1642	1272
h-index	22	20
i10-index	40	37

300

150

225

2013201420152016201720182019202020212022202320249 20 27 58 108 110 144 135 208 231 242 293

Public access

View all

33 articles

1 article

available

not available

Based on funding mandates

Co-authors

Stephan KreutzerProfessor of Computer Science, Technical University BerlinVerified email at tu-berlin.de
Michał PilipczukUniversity of WarsawVerified email at mimuw.edu.pl
Roman RabinovichTechnische Universität BerlinVerified email at tu-berlin.de
Jaroslav NešetřilCharles UniversityVerified email at kam.mff.cuni.cz
Szymon ToruńczykUniversity of WarsawVerified email at mimuw.edu.pl
Alexandre VignyBremen UniversitätVerified email at uni-bremen.de
Amer MouawadAmerican University of BeirutVerified email at aub.edu.lb
Martin GroheProfessor of Computer Science, RWTH Aachen UniversityVerified email at informatik.rwth-aachen.de
Saeed AmiriAlgorithm Engineer at DeliveryheroVerified email at deliveryhero.com
Mario GroblerUniversity of BremenVerified email at uni-bremen.de
Jan van den HeuvelProfessor of Mathematics, London School of EconomicsVerified email at lse.ac.uk
Nikolas MählmannUniversity of BremenVerified email at uni-bremen.de
Stefan SchmidProfessor, Computer Science, TU Berlin & Weizenbaum Institute & Fraunhofer SITVerified email at tu-berlin.de
Naomi NishimuraUniversity of WaterlooVerified email at uwaterloo.ca
Jakub GajarskyAssistant professor, University of WarsawVerified email at mimuw.edu.pl
Felix ReidlSenior Lecturer, Birkbeck UniversityVerified email at dcs.bbk.ac.uk
Marcin PilipczukInstytut Informatyki, Uniwersytet WarszawskiVerified email at mimuw.edu.pl
Daniel LokshtanovProfessor of Computer Science, UCSBVerified email at ucsb.edu
Daniel A. QuirozAssociate Professor, Instituto de Ingeniería Matemática, Universidad de ValparaisoVerified email at uv.cl
Saket SaurabhProfessor at Institute of Mathematical SciencesVerified email at imsc.res.in

Sebastian Siebertz

Universität Bremen, AG Theoretische Informatik

Verified email at uni-bremen.de - Homepage

Theoretical computer science algorithmic graph theory graph theory combinatorics logic in computer science


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Deciding first-order properties of nowhere dense graphs M Grohe, S Kreutzer, S Siebertz Journal of the ACM (JACM) 64 (3), 1-32, 2017	298	2017
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	79	2018
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	76*	2020
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	67	2017
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	67	2014
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	64	2016
Twin-width and permutations É Bonnet, J Nešetřil, PO de Mendez, S Siebertz, S Thomassé Logical Methods in Computer Science 20, 2024	55	2024
Vertex cover reconfiguration and beyond AE Mouawad, N Nishimura, V Raman, S Siebertz Algorithms 11 (2), 20, 2018	54*	2018
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	48	2018
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	45	2021
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	40	2021
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	39*	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	36	2017
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	28	2018
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	28	2016
Characterisations of nowhere dense graphs (invited talk) M Grohe, S Kreutzer, S Siebertz IARCS Annual Conference on Foundations of Software Technology and …, 2013	28	2013
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	26	2020
On low rank-width colorings O Kwon, M Pilipczuk, S Siebertz European Journal of Combinatorics 83, 103002, 2020	26	2020
Distributed dominating set approximations beyond planar graphs SA Amiri, S Schmid, S Siebertz ACM Transactions on Algorithms (TALG) 15 (3), 1-18, 2019	26*	2019
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	24	2016

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors