Marcin Pilipczuk

Cited by

	All	Since 2018
Citations	6202	4467
h-index	33	25
i10-index	88	75

980

490

245

735

2010201120122013201420152016201720182019202020212022202318 54 123 157 184 226 346 481 541 573 789 743 848 962

Public access

View all

65 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
Saket SaurabhProfessor at Institute of Mathematical SciencesVerified email at imsc.res.in
Dániel MarxCISPA Helmholtz Center for Information SecurityVerified email at cispa.saarland
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
Piotr SankowskiIDEAS NCBR, MIM Solutions, Warsaw UniversityVerified email at mimuw.edu.pl
Erik Jan van LeeuwenUtrecht University, The NetherlandsVerified email at uu.nl
Tomasz KociumakaMax Planck Institute for Informatics, Saarland Informatics CampusVerified email at mpi-inf.mpg.de
Tomáš MasaříkUniversity of WarsawVerified email at mimuw.edu.pl
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	2609	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	383*	2022
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	141	2013
Faster deterministic feedback vertex set T Kociumaka, M Pilipczuk Information Processing Letters 114 (10), 556-560, 2014	118	2014
Tight bounds for Parameterized Complexity of Cluster Editing. FV Fomin, S Kratsch, M Pilipczuk, M Pilipczuk, Y Villanger STACS 20, 32-43, 2013	101*	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	96	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	96*	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	92	2016
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	92	2013
Exact and approximate bandwidth M Cygan, M Pilipczuk Theoretical Computer Science 411 (40), 3701-3713, 2010	85	2010
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	81	2022
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	72	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	71	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	67	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	65*	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	61	2014
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	58	2014
Parameterized complexity of eulerian deletion problems M Cygan, D Marx, M Pilipczuk, M Pilipczuk, I Schlotter Algorithmica 68 (1), 41-61, 2014	58	2014
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	56	2012
Sitting closer to friends than enemies, revisited M Cygan, M Pilipczuk, M Pilipczuk, JO Wojtaszczyk Theory of computing systems 56 (2), 394-405, 2015	50	2015

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