Sebastian Siebertz
Scholar

Sebastian Siebertz

Google Scholar ID: B2g3quQAAAAJ
Universität Bremen, AG Theoretische Informatik
Theoretical computer sciencealgorithmic graph theorygraph theorycombinatoricslogic in computer science
Citations & Impact
All-time
Citations
1,416
 
H-index
22
 
i10-index
41
 
Publications
20
 
Co-authors
55
list available
Resume (English only)
Background
  • Research interests include Algorithmic Graph Structure Theory, especially the theory of sparse and structurally sparse graphs
  • Focuses on logical methods in computer science, particularly first-order model-checking, query evaluation, enumeration, and counting
  • Applies stability theory in finite structures
  • Aims to design efficient algorithms for graph problems on the most general graph classes, with emphasis on bounded expansion and nowhere dense graph classes
  • With Martin Grohe and Stephan Kreutzer, proved that first-order model-checking is fixed-parameter tractable on nowhere dense graph classes