Sebastian Siebertz

838 total citations
38 papers, 224 citations indexed

About

Sebastian Siebertz is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Computer Networks and Communications. According to data from OpenAlex, Sebastian Siebertz has authored 38 papers receiving a total of 224 indexed citations (citations by other indexed papers that have themselves been cited), including 37 papers in Computational Theory and Mathematics, 15 papers in Discrete Mathematics and Combinatorics and 6 papers in Computer Networks and Communications. Recurrent topics in Sebastian Siebertz's work include Advanced Graph Theory Research (30 papers), Complexity and Algorithms in Graphs (24 papers) and Limits and Structures in Graph Theory (15 papers). Sebastian Siebertz is often cited by papers focused on Advanced Graph Theory Research (30 papers), Complexity and Algorithms in Graphs (24 papers) and Limits and Structures in Graph Theory (15 papers). Sebastian Siebertz collaborates with scholars based in Germany, Poland and France. Sebastian Siebertz's co-authors include Stephan Kreutzer, Martin Grohe, Michał Pilipczuk, Szymon Toruńczyk, Patrice Ossona de Mendez, Jan van den Heuvel, Jaroslav Nešetřil, Erich Grädel, Konstantinos Stavropoulos and Amer E. Mouawad and has published in prestigious journals such as Journal of the ACM, Discrete Mathematics and Journal of Combinatorial Theory Series B.

In The Last Decade

Sebastian Siebertz

27 papers receiving 214 citations

Peers

Sebastian Siebertz

CTM

DMC

CNC

AI

GT

Rudini Sampaio Brazil

Jérémie Chalopin France

Dimitrios M. Thilikos France

Luérbio Faria Brazil

Holger Dell Germany

Vincent Bouchitté France

Somnath Sikdar Germany

Jakub Onufry Wojtaszczyk Poland

Fahad Panolan India

Min Chih Lin Argentina

Rudini Sampaio Brazil

Sebastian Siebertz

155 ×0.8

CTM

84 ×1.4

DMC

27 ×0.6

CNC

31 ×1.0

AI

24 ×0.9

GT

Citations per year, relative to Sebastian Siebertz Sebastian Siebertz (= 1×) peers Rudini Sampaio

Countries citing papers authored by Sebastian Siebertz

Since Specialization

Citations

This map shows the geographic impact of Sebastian Siebertz's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Sebastian Siebertz with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Sebastian Siebertz more than expected).

Fields of papers citing papers by Sebastian Siebertz

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Sebastian Siebertz. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Sebastian Siebertz. The network helps show where Sebastian Siebertz may publish in the future.

Co-authorship network of co-authors of Sebastian Siebertz

This figure shows the co-authorship network connecting the top 25 collaborators of Sebastian Siebertz. A scholar is included among the top collaborators of Sebastian Siebertz based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Sebastian Siebertz. Sebastian Siebertz is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

1.

Nešetřil, Jaroslav, et al.. (2025). Decomposition horizons and a characterization of stable hereditary classes of graphs. European Journal of Combinatorics. 129. 104130–104130.

2.

Mouawad, Amer E., et al.. (2025). Data reduction for directed feedback vertex set on graphs without long induced cycles. Acta Informatica. 62(2).

3.

Bonnet, Édouard, Jaroslav Nešetřil, Patrice Ossona de Mendez, Sebastian Siebertz, & Stéphan Thomassé. (2024). Twin-width and permutations. Logical Methods in Computer Science. Volume 20, Issue 3.

4.

Siebertz, Sebastian, et al.. (2024). Model Checking Disjoint-Paths Logic on Topological-Minor-Free Graph Classes. SPIRE - Sciences Po Institutional REpository. 1–12.

5.

Nešetřil, Jaroslav, et al.. (2023). Decomposition horizons: from graph sparsity to model-theoretic dividing lines. SPIRE - Sciences Po Institutional REpository. 216–222.

6.

Bonnet, Édouard, Jaroslav Nešetřil, Patrice Ossona de Mendez, Sebastian Siebertz, & Stéphan Thomassé. (2023). Twin-width and permutations. arXiv (Cornell University). 156–162. 1 indexed citations

7.

Siebertz, Sebastian, et al.. (2023). First-Order Model Checking on Structurally Sparse Graph Classes. 567–580. 9 indexed citations

8.

Siebertz, Sebastian, et al.. (2023). First-order Logic with Connectivity Operators. ACM Transactions on Computational Logic. 24(4). 1–23. 2 indexed citations

9.

Siebertz, Sebastian, et al.. (2021). Recursive Backdoors for SAT. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1 indexed citations

10.

Pilipczuk, Michał & Sebastian Siebertz. (2019). Polynomial bounds for centered colorings on proper minor-closed graph classes. Symposium on Discrete Algorithms. 1501–1520. 8 indexed citations

11.

Kreutzer, Stephan, et al.. (2018). First-Order Interpretations of Bounded Expansion Classes. arXiv (Cornell University). 18 indexed citations

12.

Pilipczuk, Marcin, et al.. (2018). Empirical Evaluation of Approximation Algorithms for Generalized Graph\n Coloring and Uniform Quasi-Wideness. arXiv (Cornell University). 2 indexed citations

13.

Pilipczuk, Michał, Sebastian Siebertz, & Szymon Toruńczyk. (2018). On the number of types in sparse graphs. 799–808. 10 indexed citations

14.

Mouawad, Amer E., Naomi Nishimura, Venkatesh Raman, & Sebastian Siebertz. (2018). Vertex Cover Reconfiguration and Beyond. Algorithms. 11(2). 20–20. 5 indexed citations

15.

Pilipczuk, Michał, Sebastian Siebertz, & Szymon Toruńczyk. (2018). Parameterized circuit complexity of model-checking on sparse structures. Zenodo (CERN European Organization for Nuclear Research). 789–798. 3 indexed citations

16.

Heuvel, Jan van den, et al.. (2017). Model-checking for successor-invariant first-order formulas on graph classes of bounded expansion. 1–11. 1 indexed citations

17.

Kreutzer, Stephan, et al.. (2017). Neighborhood Complexity and Kernelization for Nowhere Dense Classes of Graphs. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 14. 7 indexed citations

18.

Siebertz, Sebastian. (2016). Nowhere dense classes of graphs. DepositOnce.

19.

Heuvel, Jan van den, et al.. (2016). On the Generalised Colouring Numbers of Graphs that Exclude a Fixed Minor. arXiv (Cornell University). 17 indexed citations

20.

Grädel, Erich & Sebastian Siebertz. (2012). Dynamic definability. 236–248. 6 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact