Pascal Schweitzer
Impact in
- Computational Theory and Mathematics top 0.5%
- Advanced Graph Theory Research
- Complexity and Algorithms in Graphs
- Formal Methods in Verification
- Artificial Intelligence top 2%
- Advanced Graph Neural Networks
Papers in
-
- Advanced Graph Theory Research 48
- Complexity and Algorithms in Graphs 20
-
- Finite Group Theory Research 4
- Limits and Structures in Graph Theory 3
- Co-authors
- Karsten Borgwardt (1 shared paper)Erik Jan van Leeuwen (1 shared paper)Kurt Mehlhorn (5 shared papers)Martin Grohe (11 shared papers)Barbara Kordy (1 shared paper)Saša Radomirović (1 shared paper)Sjouke Mauw (1 shared paper)Ross M. McConnell (1 shared paper)
In The Last Decade
Pascal Schweitzer
70 papers receiving 2k citations
Pascal Schweitzer's Hit Papers
Peers
Comparison fields: 5 of 81
- Computational Theory and Mathematics 661
- Artificial Intelligence 812
- Discrete Mathematics and Combinatorics 67
- Computer Vision and Pattern Recognition 266
- Geometry and Topology 106
Countries citing papers authored by Pascal Schweitzer
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
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-authors
The 25 scholars most cited alongside Pascal Schweitzer, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 73 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | Weisfeiler-Lehman Graph Kernels Hit paper breakdown → | 2010 | 1088 |
| 2 | 2012 | 138 | |
| 3 | 2010 | 127 | |
| 4 | 2012 | 48 | |
| 5 | 2020 | 45 | |
| 6 | 2012 | 39 | |
| 7 | 2014 | 36 | |
| 8 | 2013 | 33 | |
| 9 | 2010 | 26 | |
| 10 | 2015 | 25 | |
| 11 | 2012 | 24 | |
| 12 | 2019 | 24 | |
| 13 | 2007 | 23 | |
| 14 | 2010 | 22 | |
| 15 | 2014 | 22 | |
| 16 | 2015 | 20 | |
| 17 | 2016 | 19 | |
| 18 | 2013 | 17 | |
| 19 | 2009 | 15 | |
| 20 | 2018 | 14 |
About Pascal Schweitzer
Pascal Schweitzer is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Geometry and Topology, Computer Vision and Pattern Recognition and Computer Networks and Communications, having authored 73 papers that have together received 2.1k indexed citations. Recurring topics across this work include Advanced Graph Theory Research (48 papers), Complexity and Algorithms in Graphs (20 papers), Graph Theory and Algorithms (12 papers), Advanced Topology and Set Theory (8 papers), Optimization and Search Problems (7 papers), Logic, programming, and type systems (4 papers), Finite Group Theory Research (4 papers) and Limits and Structures in Graph Theory (3 papers). The work is most often cited by research in Computational Theory and Mathematics (661 citations), Artificial Intelligence (812 citations), Discrete Mathematics and Combinatorics (67 citations), Computer Vision and Pattern Recognition (266 citations) and Geometry and Topology (106 citations). Pascal Schweitzer has collaborated with scholars based in Germany, Australia and Japan. Frequent co-authors include Karsten Borgwardt, Erik Jan van Leeuwen, Kurt Mehlhorn, Martin Grohe, Barbara Kordy, Saša Radomirović, Sjouke Mauw, Ross M. McConnell, Stefan Näher and Stefan Kratsch. Their work appears in journals such as Algorithmica, Journal of Graph Theory, Theoretical Computer Science, Logical Methods in Computer Science and SIAM Journal on Discrete Mathematics.
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.