Marcin Pilipczuk

Cited by

	All	Since 2016
Citations	3844	2984
h-index	29	22
i10-index	60	46

940

470

235

705

200920102011201220132014201520162017201820192020202119 24 59 127 154 181 227 333 473 570 614 936 48

Co-authors

Michał PilipczukUniversity of WarsawVerified email at mimuw.edu.pl
Marek CyganUniversity of WarsawVerified email at mimuw.edu.pl
Daniel LokshtanovAssociate Professor in Computer Science, UCSBVerified email at ucsb.edu
Dániel MarxCISPA Helmholtz Center for Information SecurityVerified email at cispa.saarland
Saket SaurabhProfessor at Institute of Mathematical SciencesVerified email at imsc.res.in
Fedor V. FominProfessor of Computer Science, University of BergenVerified email at uib.no
Lukasz KowalikUniversity of WarsawVerified email at mimuw.edu.pl
Stefan KratschProfessor at Humboldt University BerlinVerified email at informatik.hu-berlin.de
Piotr SankowskiComputer Science, Warsaw UniversityVerified email at mimuw.edu.pl
Erik Jan van LeeuwenUtrecht University, The NetherlandsVerified email at uu.nl
Magnus WahlströmRoyal Holloway, University of LondonVerified email at rhul.ac.uk
Tomasz KociumakaUniversity of California, BerkeleyVerified email at berkeley.edu
Bart M. P. JansenAssistant Professor, Eindhoven University of TechnologyVerified email at tue.nl
Yngve VillangerUniversity of BergenVerified email at uib.no
Johan M. M. van RooijUtrecht University (20%) and VIQTOR DAVIS (80%)Verified email at uu.nl
Jesper NederlofUtrecht UniversityVerified email at uu.nl
Felix ReidlLecturer, Birkbeck UniversityVerified email at dcs.bbk.ac.uk
Sebastian SiebertzUniversität Bremen, AG Theoretische InformatikVerified email at uni-bremen.de
Marcin WrochnaDepartment of Computer Science, University of OxfordVerified email at mimuw.edu.pl
Rajesh ChitnisUniversity of BirminghamVerified email at bham.ac.uk

Marcin Pilipczuk

Instytut Informatyki, Uniwersytet Warszawski

Verified email at mimuw.edu.pl - Homepage

algorithms parameterized complexity


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Parameterized Algorithms M Cygan, FV Fomin, Ł Kowalik, D Lokshtanov, D Marx, M Pilipczuk, ... Springer, 2015	1466	2015
Solving connectivity problems parameterized by treewidth in single exponential time M Cygan, J Nederlof, M Pilipczuk, M Pilipczuk, JMM van Rooij, ... Foundations of Computer Science (FOCS), 2011 IEEE 52nd Annual Symposium on …, 2011	307	2011
On multiway cut parameterized above lower bounds M Cygan, M Pilipczuk, M Pilipczuk, JO Wojtaszczyk ACM Transactions on Computation Theory (TOCT) 5 (1), 3, 2013	116	2013
Faster deterministic feedback vertex set T Kociumaka, M Pilipczuk Information Processing Letters 114 (10), 556-560, 2014	88	2014
Tight bounds for Parameterized Complexity of Cluster Editing. FV Fomin, S Kratsch, M Pilipczuk, M Pilipczuk, Y Villanger STACS 20, 32-43, 2013	75*	2013
Subset feedback vertex set is fixed-parameter tractable M Cygan, M Pilipczuk, M Pilipczuk, JO Wojtaszczyk SIAM Journal on Discrete Mathematics 27 (1), 290-309, 2013	71	2013
Exact and approximate bandwidth M Cygan, M Pilipczuk Theoretical Computer Science 411 (40), 3701-3713, 2010	71	2010
Designing FPT Algorithms for Cut Problems Using Randomized Contractions R Chitnis, M Cygan, MT Hajiaghayi, M Pilipczuk, M Pilipczuk SIAM Journal on Computing 45 (4), 1171-1229, 2016	67*	2016
Known algorithms for EDGE CLIQUE COVER are probably optimal M Cygan, M Pilipczuk, M Pilipczuk SIAM Journal on Computing 45 (1), 67-83, 2016	60	2016
Minimum bisection is fixed parameter tractable M Cygan, D Lokshtanov, M Pilipczuk, M Pilipczuk, S Saurabh Proceedings of the 46th Annual ACM Symposium on Theory of Computing, 323-332, 2014	54*	2014
Fixed-parameter tractability of multicut in directed acyclic graphs S Kratsch, M Pilipczuk, M Pilipczuk, M Wahlström SIAM Journal on Discrete Mathematics 29 (1), 122-144, 2015	51	2015
The planar directed k-Vertex-Disjoint Paths problem is fixed-parameter tractable M Cygan, D Marx, M Pilipczuk, M Pilipczuk Foundations of Computer Science (FOCS), 2013 IEEE 54th Annual Symposium on …, 2013	51	2013
Clique cover and graph separation: New incompressibility results M Cygan, S Kratsch, M Pilipczuk, M Pilipczuk, M Wahlström ACM Transactions on Computation Theory (TOCT) 6 (2), 1-19, 2014	50	2014
A fast branching algorithm for cluster vertex deletion A Boral, M Cygan, T Kociumaka, M Pilipczuk Theory of Computing Systems 58 (2), 357-376, 2016	48*	2016
Kernelization hardness of connectivity problems in d-degenerate graphs M Cygan, M Pilipczuk, M Pilipczuk, JO Wojtaszczyk Discrete Applied Mathematics 160 (15), 2131-2141, 2012	48	2012
Fixed-parameter tractable canonization and isomorphism test for graphs of bounded treewidth D Lokshtanov, M Pilipczuk, M Pilipczuk, S Saurabh Foundations of Computer Science (FOCS), 2014 IEEE 55th Annual Symposium on …, 2014	47	2014
Kernelization and sparseness: the case of dominating set PG Drange, MS Dregi, FV Fomin, S Kreutzer, D Lokshtanov, M Pilipczuk, ... arXiv preprint arXiv:1411.4575, 2014	46	2014
Parameterized complexity of eulerian deletion problems M Cygan, D Marx, M Pilipczuk, M Pilipczuk, I Schlotter Algorithmica 68 (1), 41-61, 2014	46	2014
Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs M Pilipczuk, M Pilipczuk, P Sankowski, EJV Leeuwen ACM Transactions on Algorithms (TALG) 14 (4), 53, 2018	43*	2018
Polynomial-time algorithm for Maximum Weight Independent Set on P₆-free graphs A Grzesik, T Klimošová, M Pilipczuk, M Pilipczuk Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019	38	2019

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Upload PDF

Follow this author

Cited by

Co-authors