Marcin Pilipczuk
- Computational Theory and Mathematics top 0.2%
- Computer Networks and Communications top 2%
- Discrete Mathematics and Combinatorics top 2%
- Artificial Intelligence top 10%
- Electrical and Electronic Engineering
- Co-authors
- Marek CyganMichał PilipczukDaniel LokshtanovSaket SaurabhDániel MarxFedor V. FominŁukasz KowalikJakub Onufry Wojtaszczyk
- Topics
- Advanced Graph Theory Research (90 papers)Complexity and Algorithms in Graphs (71 papers)Limits and Structures in Graph Theory (22 papers)
In The Last Decade
Marcin Pilipczuk
90 papers receiving 1.4k citations
Hit Papers
Peers
Comparison fields: 5 of 66
- Computational Theory and Mathematics 1.2k
- Computer Networks and Communications 464
- Discrete Mathematics and Combinatorics 206
- Artificial Intelligence 196
- Electrical and Electronic Engineering 118
Countries citing papers authored by Marcin Pilipczuk
This map shows the geographic impact of Marcin Pilipczuk'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 Marcin Pilipczuk with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Marcin Pilipczuk more than expected).
Fields of papers citing papers by Marcin Pilipczuk
This network shows the impact of papers produced by Marcin Pilipczuk. 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 Marcin Pilipczuk. The network helps show where Marcin Pilipczuk may publish in the future.
Co-authorship network of co-authors of Marcin Pilipczuk
This figure shows the co-authorship network connecting the top 25 collaborators of Marcin Pilipczuk. A scholar is included among the top collaborators of Marcin Pilipczuk 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 Marcin Pilipczuk. Marcin Pilipczuk is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 0 | |
| 2 | 1 | |
| 3 | 6 | |
| 4 | 0 | |
| 5 | 1 | |
| 6 | 9 | |
| 7 | 1 | |
| 8 | 1 | |
| 9 | 2 | |
| 10 | 3 | |
| 11 | 5 | |
| 12 | 1 | |
| 13 | 8 | |
| 14 | 7 | |
| 15 | Dynamic Steiner Tree in Planar Graphs. | 2 |
| 16 | 6 | |
| 17 | 10 | |
| 18 | 12 | |
| 19 | 11 | |
| 20 | 27 |
About Marcin Pilipczuk
Marcin Pilipczuk is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics and Computer Networks and Communications, having authored 102 papers that have together received 1.5k indexed citations. Recurring topics across this work include Advanced Graph Theory Research (90 papers), Complexity and Algorithms in Graphs (71 papers) and Limits and Structures in Graph Theory (22 papers). The work is most often cited by research in Computational Theory and Mathematics (1.2k citations), Discrete Mathematics and Combinatorics (206 citations) and Computer Graphics and Computer-Aided Design (90 citations). Marcin Pilipczuk has collaborated with scholars based in Poland, Norway and Germany. Frequent co-authors include Marek Cygan, Michał Pilipczuk, Daniel Lokshtanov, Saket Saurabh, Dániel Marx, Fedor V. Fomin, Łukasz Kowalik, Jakub Onufry Wojtaszczyk, Tomasz Kociumaka and Jesper Nederlof. Their work appears in journals such as Artificial Intelligence, Journal of the ACM and SIAM Journal on Computing.
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.