Marcin Pilipczuk

Cited by

	All	Since 2019
Citations	7011	4693
h-index	36	28
i10-index	96	78

980

490

245

735

20102011201220132014201520162017201820192020202120222023202418 67 124 158 171 228 344 481 567 589 753 724 787 971 854

Public access

View all

74 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Michał PilipczukUniversity of WarsawVerified email at mimuw.edu.pl
Marek CyganUniversity of WarsawVerified email at mimuw.edu.pl
Daniel LokshtanovProfessor of 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
Magnus WahlströmRoyal Holloway, University of LondonVerified email at rhul.ac.uk
Paweł RzążewskiWarsaw University of Technology, Faculty of Mathematics and Information ScienceVerified email at mini.pw.edu.pl
Manuel SorgeTU WienVerified email at ac.tuwien.ac.at
Erik Jan van LeeuwenUtrecht University, The NetherlandsVerified email at uu.nl
Piotr SankowskiIDEAS NCBR, MIM Solutions, Warsaw UniversityVerified email at mimuw.edu.pl
Tomáš MasaříkUniversity of WarsawVerified email at mimuw.edu.pl
Tomasz KociumakaMax Planck Institute for Informatics, Saarland Informatics CampusVerified email at mpi-inf.mpg.de
Bart M. P. JansenAssociate Professor, Eindhoven University of TechnologyVerified email at tue.nl
Johan M. M. van RooijUtrecht University (20%) and Valcon (80%)Verified email at uu.nl
Jesper NederlofUtrecht UniversityVerified email at uu.nl
Yngve VillangerUniversity of BergenVerified email at uib.no
Marcin WrochnaInstitute of Informatics, University of WarsawVerified email at mimuw.edu.pl

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	2977	2015
Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time M Cygan, J Nederlof, M Pilipczuk, M Pilipczuk, JMM Van Rooij, ... ACM Transactions on Algorithms (TALG) 18 (2), 1-31, 2022	409*	2022
Faster deterministic feedback vertex set T Kociumaka, M Pilipczuk Information Processing Letters 114 (10), 556-560, 2014	127	2014
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	109	2013
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	108	2016
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	106*	2016
Tight bounds for Parameterized Complexity of Cluster Editing. FV Fomin, S Kratsch, M Pilipczuk, M Pilipczuk, Y Villanger STACS 20, 32-43, 2013	102*	2013
Polynomial-time Algorithm for Maximum Weight Independent Set on P₆-free Graphs A Grzesik, T Klimošová, M Pilipczuk, M Pilipczuk ACM Transactions on Algorithms (TALG) 18 (1), 1-57, 2022	99	2022
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	98	2013
Known algorithms for EDGE CLIQUE COVER are probably optimal M Cygan, M Pilipczuk, M Pilipczuk SIAM Journal on Computing 45 (1), 67-83, 2016	93	2016
Exact and approximate bandwidth M Cygan, M Pilipczuk Theoretical Computer Science 411 (40), 3701-3713, 2010	92	2010
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	82	2014
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	81	2013
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	73	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	69*	2018
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	66	2014
On the Maximum Weight Independent Set Problem in graphs without induced cycles of length at least five M Chudnovsky, M Pilipczuk, M Pilipczuk, S Thomassé arXiv preprint arXiv:1903.04761, 2019	62*	2019
Parameterized complexity of eulerian deletion problems M Cygan, D Marx, M Pilipczuk, M Pilipczuk, I Schlotter Algorithmica 68 (1), 41-61, 2014	59	2014
On multiway cut parameterized above lower bounds M Cygan, M Pilipczuk, M Pilipczuk, JO Wojtaszczyk Parameterized and Exact Computation: 6th International Symposium, IPEC 2011 …, 2012	59	2012
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	57	2014

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

Follow

Cited by

Co-authors