Concepedia

Michał Pilipczuk

MP

65

Publications

2K

Citations

24

H-Index

2011

Active since

Affiliations

University of Warsaw(Current)

University of Bergen

Institute of Mathematical Sciences

Utrecht University

Max Planck Institute for Informatics

Michał Pilipczuk is an author at University of Warsaw specializing in graph theory, discrete mathematics, and computational complexity.

Top concepts

Graph TheoryDiscrete MathematicsEngineeringComputational ComplexityCombinatorial OptimizationComputer ScienceMathematical ProgrammingComputational GeometryNetwork AnalysisEducation

Publications per year

2011–2022

65

Publications

65

Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time

Marek Cygan, Jesper Nederlof, Marcin Pilipczuk et al. · 2011 · 231 citations

Mathematical Programming, Numerical Analysis, Computational Complexity Theory +22

A $c^k n$ 5-Approximation Algorithm for Treewidth

Hans L. Bodlaender, Pål Grønås Drange, Markus Sortland Dregi et al. · SIAM Journal on Computing · 2016 · 198 citations · Full text

On multiway cut parameterized above lower bounds

Marek Cygan, Marcin Pilipczuk, Michał Pilipczuk et al. · ACM Transactions on Computation Theory · 2013 · 91 citations

Mathematical Programming, Branch-and-bound Algorithm, Engineering +16

Designing FPT Algorithms for Cut Problems Using Randomized Contractions

Rajesh Chitnis, Marek Cygan, MohammadTaghi Hajiaghayi et al. · SIAM Journal on Computing · 2016 · 71 citations · Full text

Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time

Marek Cygan, Jesper Nederlof, Marcin Pilipczuk et al. · ACM Transactions on Algorithms · 2022 · 66 citations

Numerical Analysis, Mathematical Programming, Computational Complexity Theory +23

Rows per page

1–5 of 65