Sebastian Siebertz

Cited by

	All	Since 2017
Citations	1075	945
h-index	19	18
i10-index	31	30

260

130

195

201320142015201620172018201920202021202211 21 32 53 108 100 135 154 241 194

Public access

View all

41 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Stephan KreutzerProfessor of Computer Science, Technical University BerlinVerified email at tu-berlin.de
Roman RabinovichTechnische Universität BerlinVerified email at tu-berlin.de
Michał PilipczukUniversity of WarsawVerified email at mimuw.edu.pl
Jaroslav NešetřilCharles UniversityVerified email at kam.mff.cuni.cz
Szymon ToruńczykUniversity of WarsawVerified email at mimuw.edu.pl
Martin GroheProfessor of Computer Science, RWTH Aachen UniversityVerified email at informatik.rwth-aachen.de
Saeed Akhoondian AmiriUniversity of CologneVerified email at informatik.uni-koeln.de
Alexandre VignyBremen UniversitätVerified email at uni-bremen.de
Amer MouawadAmerican University of BeirutVerified email at aub.edu.lb
Stefan SchmidProfessor, Computer Science, TU Berlin & University of ViennaVerified email at tu-berlin.de
Jan van den HeuvelProfessor of Mathematics, London School of EconomicsVerified email at lse.ac.uk
Felix ReidlLecturer, 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
Naomi NishimuraUniversity of WaterlooVerified email at uwaterloo.ca
O-joung KwonHanyang UniversityVerified email at hanyang.ac.kr
Saket SaurabhProfessor at Institute of Mathematical SciencesVerified email at imsc.res.in
Fedor V. FominProfessor of Computer Science, University of BergenVerified email at uib.no
Fahad PanolanIndian Institute of Technology HyderabadVerified email at iith.ac.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	237	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	62	2018
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	58	2014
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	47*	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	46	2017
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	46	2016
Vertex cover reconfiguration and beyond AE Mouawad, N Nishimura, V Raman, S Siebertz Algorithms 11 (2), 20, 2018	44*	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	35	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	28	2021
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	27	2017
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	26*	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	25	2016
Characterisations of nowhere dense graphs (invited talk) M Grohe, S Kreutzer, S Siebertz IARCS Annual Conference on Foundations of Software Technology and …, 2013	25	2013
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	23	2016
Twin-width and permutations É Bonnet, J Nešetřil, PO de Mendez, S Siebertz, S Thomassé arXiv preprint arXiv:2102.06880, 2021	20	2021
Distributed dominating set approximations beyond planar graphs SA Amiri, S Schmid, S Siebertz ACM Transactions on Algorithms (TALG) 15 (3), 1-18, 2019	20*	2019
Dynamic definability E Grädel, S Siebertz Proceedings of the 15th International Conference on Database Theory, 236-248, 2012	20	2012
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	19	2018
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	19	2018
On low rank-width colorings O Kwon, M Pilipczuk, S Siebertz European Journal of Combinatorics 83, 103002, 2020	18	2020

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