Pascal Schweitzer
Impact in
-
- Computational Geometry and Mesh Generation
-
- Advanced Graph Theory Research
- Complexity and Algorithms in Graphs
- Formal Methods in Verification
- Graph Labeling and Dimension Problems
Papers in
-
- Advanced Graph Theory Research 31
- Complexity and Algorithms in Graphs 16
- semigroups and automata theory 7
- Graph Labeling and Dimension Problems 5
-
- Optimization and Search Problems 8
- Co-authors
- Kurt Mehlhorn (5 shared papers)Martin Grohe (7 shared papers)Saša Radomirović (1 shared paper)Sjouke Mauw (1 shared paper)Barbara Kordy (1 shared paper)Ross M. McConnell (1 shared paper)Nicole Megow (2 shared papers)Seok-Hee Hong (5 shared papers)
In The Last Decade
Pascal Schweitzer
49 papers receiving 738 citations
Peers
Comparison fields: 5 of 66
- Computer Graphics and Computer-Aided Design 98
- Computational Theory and Mathematics 400
- Discrete Mathematics and Combinatorics 73
- Software 69
- Computer Networks and Communications 270
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 52 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2012 | 121 | |
| 2 | 2010 | 121 | |
| 3 | 2012 | 42 | |
| 4 | 2012 | 39 | |
| 5 | 2020 | 38 | |
| 6 | 2014 | 31 | |
| 7 | 2013 | 29 | |
| 8 | 2010 | 24 | |
| 9 | 2007 | 22 | |
| 10 | 2010 | 20 | |
| 11 | 2015 | 20 | |
| 12 | 2019 | 19 | |
| 13 | 2014 | 17 | |
| 14 | 2016 | 16 | |
| 15 | 2013 | 16 | |
| 16 | 2015 | 13 | |
| 17 | 2018 | 12 | |
| 18 | 2011 | 12 | |
| 19 | 2009 | 11 | |
| 20 | 2013 | 11 |
About Pascal Schweitzer
Pascal Schweitzer is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications, Discrete Mathematics and Combinatorics, Computer Graphics and Computer-Aided Design and Artificial Intelligence, having authored 52 papers that have together received 764 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (31 papers), Complexity and Algorithms in Graphs (16 papers), Computational Geometry and Mesh Generation (9 papers), Optimization and Search Problems (8 papers), Limits and Structures in Graph Theory (8 papers), semigroups and automata theory (7 papers), Software Testing and Debugging Techniques (6 papers) and Graph Labeling and Dimension Problems (5 papers). The work is most often cited by research in Computer Graphics and Computer-Aided Design (98 citations), Computational Theory and Mathematics (400 citations), Discrete Mathematics and Combinatorics (73 citations), Software (69 citations) and Computer Networks and Communications (270 citations). Pascal Schweitzer has collaborated with scholars based in Germany, Australia and Japan. Frequent co-authors include Kurt Mehlhorn, Martin Grohe, Saša Radomirović, Sjouke Mauw, Barbara Kordy, Ross M. McConnell, Nicole Megow, Seok-Hee Hong, Giuseppe Liotta and Yusuke Suzuki. Their work appears in journals such as Algorithmica, Journal of the ACM, Theoretical Computer Science, SIAM Journal on Discrete Mathematics and Lecture notes in computer science.
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.