Pascal Schweitzer

1.4k total citations
38 papers, 415 citations indexed

About

Pascal Schweitzer is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Discrete Mathematics and Combinatorics. According to data from OpenAlex, Pascal Schweitzer has authored 38 papers receiving a total of 415 indexed citations (citations by other indexed papers that have themselves been cited), including 30 papers in Computational Theory and Mathematics, 13 papers in Computer Networks and Communications and 9 papers in Discrete Mathematics and Combinatorics. Recurrent topics in Pascal Schweitzer's work include Advanced Graph Theory Research (25 papers), Complexity and Algorithms in Graphs (12 papers) and Limits and Structures in Graph Theory (7 papers). Pascal Schweitzer is often cited by papers focused on Advanced Graph Theory Research (25 papers), Complexity and Algorithms in Graphs (12 papers) and Limits and Structures in Graph Theory (7 papers). Pascal Schweitzer collaborates with scholars based in Germany, Australia and Japan. Pascal Schweitzer's co-authors include Martin Grohe, Kurt Mehlhorn, Barbara Kordy, Sjouke Mauw, Saša Radomirović, Ross M. McConnell, Weifa Liang, Zichuan Xu, Nicole Megow and Giuseppe Liotta and has published in prestigious journals such as Communications of the ACM, Journal of the ACM and IEEE Transactions on Computers.

In The Last Decade

Pascal Schweitzer

37 papers receiving 396 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Pascal Schweitzer Germany 11 207 140 86 61 51 38 415
Vladimir Gurvich United States 15 431 2.1× 107 0.8× 196 2.3× 30 0.5× 43 0.8× 63 730
Ryan Hayward Canada 13 357 1.7× 120 0.9× 264 3.1× 26 0.4× 81 1.6× 57 681
Justin Ward United Kingdom 12 194 0.9× 151 1.1× 142 1.7× 14 0.2× 44 0.9× 26 366
Desh Ranjan United States 10 187 0.9× 186 1.3× 182 2.1× 27 0.4× 21 0.4× 30 500
Hiromu Ariyoshi Japan 4 268 1.3× 109 0.8× 98 1.1× 29 0.5× 57 1.1× 13 436
Shlomi Rubinstein Israel 10 166 0.8× 108 0.8× 53 0.6× 21 0.3× 13 0.3× 14 314
Clemens Heuberger Austria 13 339 1.6× 43 0.3× 159 1.8× 110 1.8× 57 1.1× 71 640
Stasys Jukna Germany 9 397 1.9× 111 0.8× 245 2.8× 20 0.3× 76 1.5× 42 571
Magnus Wahlström United Kingdom 14 384 1.9× 135 1.0× 96 1.1× 10 0.2× 62 1.2× 49 510
Yuval Filmus Israel 10 157 0.8× 78 0.6× 122 1.4× 9 0.1× 59 1.2× 53 300

Countries citing papers authored by Pascal Schweitzer

Since Specialization
Citations

This map shows the geographic impact of Pascal Schweitzer'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 Pascal Schweitzer with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Pascal Schweitzer more than expected).

Fields of papers citing papers by Pascal Schweitzer

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Pascal Schweitzer. 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 Pascal Schweitzer. The network helps show where Pascal Schweitzer may publish in the future.

Co-authorship network of co-authors of Pascal Schweitzer

This figure shows the co-authorship network connecting the top 25 collaborators of Pascal Schweitzer. A scholar is included among the top collaborators of Pascal Schweitzer 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 Pascal Schweitzer. Pascal Schweitzer is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Grohe, Martin, et al.. (2023). Compressing CFI Graphs and Lower Bounds for the Weisfeiler-Leman Refinements. 798–809. 2 indexed citations
2.
Schweitzer, Pascal, et al.. (2022). Choiceless Polynomial Time with Witnessed Symmetric Choice. 1–13.
3.
Schweitzer, Pascal, et al.. (2021). Resolution with Symmetry Rule Applied to Linear Equations. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1 indexed citations
4.
Schweitzer, Pascal, et al.. (2021). Parallel Computation of Combinatorial Symmetries.. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 18. 1 indexed citations
5.
Grohe, Martin & Pascal Schweitzer. (2020). The graph isomorphism problem. Communications of the ACM. 63(11). 128–134. 30 indexed citations
6.
Schweitzer, Pascal, et al.. (2019). Upper Bounds on the Quantifier Depth for Graph Differentiation in First-Order Logic.. Logical Methods in Computer Science. 15. 4 indexed citations
7.
Grohe, Martin, et al.. (2018). A Faster Isomorphism Test for Graphs of Small Degree. 107. 89–100. 10 indexed citations
8.
Schweitzer, Pascal, et al.. (2017). Benchmark Graphs for Practical Graph Isomorphism. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 14. 3 indexed citations
9.
Schweitzer, Pascal, et al.. (2017). Canonizing Graphs of Bounded Tree Width in Logspace. 9(3). 1–29. 4 indexed citations
10.
Grohe, Martin & Pascal Schweitzer. (2015). Computing with Tangles. 683–692. 1 indexed citations
11.
McKay, Brendan D., Pascal Schweitzer, & Patrick Schweitzer. (2014). Competition Numbers, Quasi-line Graphs, and Holes. SIAM Journal on Discrete Mathematics. 28(1). 77–91. 3 indexed citations
12.
Schweitzer, Pascal. (2013). Iterated open neighborhood graphs and generalizations. Discrete Applied Mathematics. 161(10-11). 1598–1609. 1 indexed citations
13.
Eades, Peter, Seok-Hee Hong, Naoki Katoh, et al.. (2013). A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system. Theoretical Computer Science. 513. 65–76. 17 indexed citations
14.
Angelopoulos, Spyros & Pascal Schweitzer. (2013). Paging and list update under bijective analysis. Journal of the ACM. 60(2). 1–18. 3 indexed citations
15.
Eades, Peter, Seok-Hee Hong, Naoki Katoh, et al.. (2012). Testing Maximal 1-Planarity of Graphs with a Rotation System in Linear Time - (Extended Abstract).. 339–345. 1 indexed citations
16.
Megow, Nicole, Kurt Mehlhorn, & Pascal Schweitzer. (2012). Online graph exploration: New results on old and new algorithms. Theoretical Computer Science. 463. 62–72. 28 indexed citations
17.
Alkassar, Eyad, et al.. (2011). An Introduction to Certifying Algorithms. it - Information Technology. 53(6). 287–293. 2 indexed citations
18.
Schweitzer, Pascal, et al.. (2010). Homomorphism–homogeneous graphs. Journal of Graph Theory. 65(3). 253–261. 20 indexed citations
19.
Angelopoulos, Spyros & Pascal Schweitzer. (2009). Paging and List Update under Bijective Analysis. 1136–1145. 3 indexed citations
20.
Cameron, Peter J‎., Daniel Johannsen, Thomas Prellberg, & Pascal Schweitzer. (2008). Counting Defective Parking Functions. The Electronic Journal of Combinatorics. 15(1). 7 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

Rankless by CCL
2026