Michał Pilipczuk

Cited by

	All	Since 2016
Citations	4987	4181
h-index	32	27
i10-index	74	67

1000

500

250

750

2011201220132014201520162017201820192020202133 99 146 188 260 366 544 635 690 991 869

Public access

View all

83 articles

2 articles

available

not available

Based on funding mandates

Co-authors

Marcin PilipczukInstytut Informatyki, Uniwersytet WarszawskiVerified email at mimuw.edu.pl
Marek CyganUniversity of WarsawVerified email at mimuw.edu.pl
Fedor V. FominProfessor of Computer Science, University of BergenVerified email at uib.no
Saket SaurabhProfessor at Institute of Mathematical SciencesVerified email at imsc.res.in
Dániel MarxCISPA Helmholtz Center for Information SecurityVerified email at cispa.saarland
Daniel LokshtanovAssociate Professor in Computer Science, UCSBVerified email at ucsb.edu
Sebastian SiebertzUniversität Bremen, AG Theoretische InformatikVerified email at uni-bremen.de
Lukasz KowalikUniversity of WarsawVerified email at mimuw.edu.pl
Marcin WrochnaInstitute of Informatics, University of WarsawVerified email at mimuw.edu.pl
Pål Grønås DrangeUniversity of Bergen, Department of InformaticsVerified email at ii.uib.no
Yngve VillangerUniversity of BergenVerified email at uib.no
Stephan KreutzerProfessor of Computer Science, Technical University BerlinVerified email at tu-berlin.de
Jesper NederlofUtrecht UniversityVerified email at uu.nl
Marthe BonamyLaBRI, CNRS, Université BordeauxVerified email at u-bordeaux.fr
Erik Jan van LeeuwenUtrecht University, The NetherlandsVerified email at uu.nl
Szymon ToruńczykUniversity of WarsawVerified email at mimuw.edu.pl
Stefan KratschProfessor at Humboldt University BerlinVerified email at informatik.hu-berlin.de
Roman RabinovichTechnische Universität BerlinVerified email at tu-berlin.de
Magnus WahlströmRoyal Holloway, University of LondonVerified email at rhul.ac.uk
Petr GolovachUniversity of BergenVerified email at ii.uib.no

Michał Pilipczuk

University of Warsaw

Verified email at mimuw.edu.pl - Homepage

Parameterized complexity graph theory


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 5 (4), 16, 2015	1764	2015
Solving connectivity problems parameterized by treewidth in single exponential time M Cygan, J Nederlof, M Pilipczuk, M Pilipczuk, JMM van Rooij, ... 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, 150-159, 2011	328	2011
A 5-Approximation Algorithm for Treewidth HL Bodlaender, PG Drange, MS Dregi, FV Fomin, D Lokshtanov, ... SIAM Journal on Computing 45 (2), 317-378, 2016	268	2016
On multiway cut parameterized above lower bounds M Cygan, M Pilipczuk, M Pilipczuk, JO Wojtaszczyk ACM Transactions on Computation Theory (TOCT) 5 (1), 1-11, 2013	126	2013
Tight bounds for parameterized complexity of cluster editing with a small number of clusters FV Fomin, S Kratsch, M Pilipczuk, M Pilipczuk, Y Villanger Journal of Computer and System Sciences 80 (7), 1430-1447, 2014	87*	2014
Optimal parameterized algorithms for planar facility location problems using Voronoi diagrams D Marx, M Pilipczuk Algorithms-ESA 2015, 865-877, 2015	81	2015
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	78*	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	78	2013
How to hunt an invisible rabbit on a graph TV Abramovskaya, FV Fomin, PA Golovach, M Pilipczuk European Journal of Combinatorics 52, 12-26, 2016	68	2016
Fully polynomial-time parameterized computations for graphs and matrices of low treewidth FV Fomin, D Lokshtanov, S Saurabh, M Pilipczuk, M Wrochna ACM Transactions on Algorithms (TALG) 14 (3), 1-45, 2018	67	2018
Everything you always wanted to know about the parameterized complexity of subgraph isomorphism (but were afraid to ask) D Marx, M Pilipczuk arXiv preprint arXiv:1307.2187, 2013	67	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	65	2016
The planar directed k-vertex-disjoint paths problem is fixed-parameter tractable M Cygan, D Marx, M Pilipczuk, M Pilipczuk 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 197-206, 2013	59	2013
Minimum bisection is fixed-parameter tractable M Cygan, D Lokshtanov, M Pilipczuk, M Pilipczuk, S Saurabh SIAM Journal on Computing 48 (2), 417-450, 2019	58	2019
Fixed-parameter tractable canonization and isomorphism test for graphs of bounded treewidth D Lokshtanov, M Pilipczuk, M Pilipczuk, S Saurabh SIAM Journal on Computing 46 (1), 161-189, 2017	53	2017
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	53	2015
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	53	2012
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), 1-73, 2018	51*	2018
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	51	2014
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	49	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

Follow this author

Cited by

Co-authors