Marcin Pilipczuk

5.4k total citations · 1 hit paper
102 papers, 1.5k citations indexed

About

Marcin Pilipczuk is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Discrete Mathematics and Combinatorics. According to data from OpenAlex, Marcin Pilipczuk has authored 102 papers receiving a total of 1.5k indexed citations (citations by other indexed papers that have themselves been cited), including 93 papers in Computational Theory and Mathematics, 36 papers in Computer Networks and Communications and 22 papers in Discrete Mathematics and Combinatorics. Recurrent topics in Marcin Pilipczuk's work include Advanced Graph Theory Research (90 papers), Complexity and Algorithms in Graphs (71 papers) and Limits and Structures in Graph Theory (22 papers). Marcin Pilipczuk is often cited by papers focused on Advanced Graph Theory Research (90 papers), Complexity and Algorithms in Graphs (71 papers) and Limits and Structures in Graph Theory (22 papers). Marcin Pilipczuk collaborates with scholars based in Poland, Norway and Germany. Marcin Pilipczuk's 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 and has published in prestigious journals such as Artificial Intelligence, Journal of the ACM and SIAM Journal on Computing.

In The Last Decade

Marcin Pilipczuk

90 papers receiving 1.4k citations

Hit Papers

align trajectories

What are hit papers?

Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the same subfield and year (this is the minimum needed to enter the top 1%, not the average within it), or reaches the top citation threshold in at least one of its specific research topics.

Parameterized Algorithms

2015 745 citations Marek Cygan, Fedor V. Fomin et al. profile →

Peers

Countries citing papers authored by Marcin Pilipczuk

Since Specialization

Citations

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

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

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

20 of 20 papers shown

#	Work	Indexed citations
1	Planar and Minor-Free Metrics Embed into Metrics of Polylogarithmic Treewidth with Expected Multiplicative Distortion Arbitrarily Close to 1* 2023 ·Vincent Cohen-Addad, Hung Lê, Marcin Pilipczuk, Michał Pilipczuk	0
2	Proving a directed analogue of the Gyárfás-Sumner conjecture for orientations of P4 2023 ·Linda S. Cook, (unknown), Marcin Pilipczuk, (unknown), Uéverton S. Souza	1
3	The Influence of Dimensions on the Complexity of Computing Decision Trees 2023 ·Proceedings of the AAAI Conference on Artificial Intelligence ·Stephen Kobourov, Maarten Löffler, Fabrizio Montecchiani, Marcin Pilipczuk, Ignaz Rutter, Raimund Seidel, Manuel Sorge, (unknown)	6
4	Close Relatives (Of Feedback Vertex Set), Revisited 2021 ·DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) ·(unknown), (unknown), (unknown), Marcin Pilipczuk	0
5	The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth 2020 ·DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) ·Łukasz Kowalik, Marcin Mucha, (unknown), Marcin Pilipczuk, Manuel Sorge, (unknown)	1
6	Polynomial-time algorithm for maximum weight independent set on P6-free graphs 2019 ·Symposium on Discrete Algorithms ·Andrzej Grzesik, (unknown), Marcin Pilipczuk, Michał Pilipczuk	9
7	Finding Hamiltonian Cycle in Graphs of Bounded Treewidth: Experimental Evaluation 2018 ·DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) ·(unknown), Marcin Pilipczuk	1
8	A deterministic polynomial kernel for Odd Cycle Transversal and Vertex\n Multiway Cut in planar graphs 2018 ·arXiv (Cornell University) ·Bart M. P. Jansen, Marcin Pilipczuk, Erik Jan van Leeuwen	1
9	Empirical Evaluation of Approximation Algorithms for Generalized Graph\n Coloring and Uniform Quasi-Wideness 2018 ·arXiv (Cornell University) ·(unknown), Marcin Pilipczuk, (unknown), Felix Reidl, Sebastian Siebertz	2
10	Approximation and kernelization for chordal vertex deletion 2017 ·Symposium on Discrete Algorithms ·Bart M. P. Jansen, Marcin Pilipczuk	3
11	Subexponential parameterized algorithm for interval completion 2016 ·arXiv (Cornell University) ·(unknown), Fedor V. Fomin, Marcin Pilipczuk, Michał Pilipczuk	5
12	On Routing Disjoint Paths in Bounded Treewidth Graphs 2016 ·DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) ·Alina Ene, Matthias Mnich, Marcin Pilipczuk, Andrej Risteski	1
13	Faster exponential-time algorithms in graphs of bounded average degree 2014 ·Information and Computation ·Marek Cygan, Marcin Pilipczuk	8
14	Sitting Closer to Friends than Enemies, Revisited 2014 ·Theory of Computing Systems ·Marek Cygan, Marcin Pilipczuk, Michał Pilipczuk, Jakub Onufry Wojtaszczyk	7
15	Dynamic Steiner Tree in Planar Graphs. 2013 ·arXiv (Cornell University) ·Jakub Łącki, (unknown), Marcin Pilipczuk, Piotr Sankowski, (unknown)	2
16	Towards optimal kernel for connected vertex cover in planar graphs 2012 ·Discrete Applied Mathematics ·Łukasz Kowalik, Marcin Pilipczuk, Karol Suchan	6
17	Breaking the 2n-barrier for Irredundance: Two lines of attack 2011 ·Journal of Discrete Algorithms ·(unknown), Ljiljana Branković, Marek Cygan, Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Marcin Pilipczuk, Peter Rossmanith, Jakub Onufry Wojtaszczyk	10
18	Dominating set is fixed parameter tractable in claw-free graphs 2011 ·Theoretical Computer Science ·Marek Cygan, Geevarghese Philip, Marcin Pilipczuk, Michał Pilipczuk, Jakub Onufry Wojtaszczyk	12
19	On the Zagreb index inequality of graphs with prescribed vertex degrees 2011 ·Discrete Applied Mathematics ·(unknown), (unknown), Darko Dimitrov, Marcin Pilipczuk, Riste Škrekovski	11
20	Exact and approximate bandwidth 2010 ·Theoretical Computer Science ·Marek Cygan, Marcin Pilipczuk	27

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