Michał Pilipczuk

Michał Pilipczuk

Uniwersytet Warszawski

H-index: 37

Europe-Poland

About Michał Pilipczuk

Michał Pilipczuk, With an exceptional h-index of 37 and a recent h-index of 29 (since 2020), a distinguished researcher at Uniwersytet Warszawski, specializes in the field of Parameterized complexity, graph theory.

His recent articles reflect a diverse array of research interests and contributions to the field:

Sparse induced subgraphs in P6-free graphs

Parameterized algorithms for block-structured integer programs with large entries

Parameterized and approximation algorithms for coverings points with segments in the plane

Detecting Points in Integer Cones of Polytopes is Double-Exponentially Hard

Fully dynamic approximation schemes on planar and apex-minor-free graphs

Parameterized dynamic data structure for Split Completion

A polynomial-time OPTɛ-approximation algorithm for maximum independent set of connected subgraphs in a planar graph

Elementary first-order model checking for sparse graphs

Michał Pilipczuk Information

University

Position

___

Citations(all)

7231

Citations(since 2020)

4819

Cited By

4554

hIndex(all)

37

hIndex(since 2020)

29

i10Index(all)

103

i10Index(since 2020)

85

Email

University Profile Page

Uniwersytet Warszawski

Google Scholar

View Google Scholar Profile

Michał Pilipczuk Skills & Research Interests

Parameterized complexity

graph theory

Top articles of Michał Pilipczuk

Title

Journal

Author(s)

Publication Date

Sparse induced subgraphs in P6-free graphs

Maria Chudnovsky

Rose McCarty

Marcin Pilipczuk

Michał Pilipczuk

Paweł Rzążewski

2024

Parameterized algorithms for block-structured integer programs with large entries

Jana Cslovjecsek

Martin Koutecký

Alexandra Lassota

Michał Pilipczuk

Adam Polak

2024

Parameterized and approximation algorithms for coverings points with segments in the plane

arXiv preprint arXiv:2402.16466

Katarzyna Kowalska

Michał Pilipczuk

2024/2/26

Detecting Points in Integer Cones of Polytopes is Double-Exponentially Hard

Łukasz Kowalik

Alexandra Lassota

Konrad Majewski

Michał Pilipczuk

Marek Sokołowski

2024

Fully dynamic approximation schemes on planar and apex-minor-free graphs

Tuukka Korhonen

Wojciech Nadara

Michał Pilipczuk

Marek Sokołowski

2024

Parameterized dynamic data structure for Split Completion

arXiv preprint arXiv:2402.08816

Konrad Majewski

Michał Pilipczuk

Anna Zych-Pawlewicz

2024/2/13

A polynomial-time OPTɛ-approximation algorithm for maximum independent set of connected subgraphs in a planar graph

Jana Cslovjecsek

Michał Pilipczuk

Karol Węgrzycki

2024

Elementary first-order model checking for sparse graphs

arXiv preprint arXiv:2401.16230

Jakub Gajarský

Michał Pilipczuk

Marek Sokołowski

Giannos Stamoulis

Szymon Toruńczyk

2024/1/29

Simple and tight complexity lower bounds for solving Rabin games

Antonio Casares

Marcin Pilipczuk

Michał Pilipczuk

Uéverton S Souza

KS Thejaswini

2024

ACM Transactions on

ACM Transactions on

Edith Cohen

Susanne Albers

Glencora Borradaile

Andrei A Bulatov

Keren Censor-Hillel

...

2023

Minor Containment and Disjoint Paths in almost-linear time

arXiv preprint arXiv:2404.03958

Tuukka Korhonen

Michał Pilipczuk

Giannos Stamoulis

2024/4/5

Cliquewidth and dimension

Gwenaël Joret

Piotr Micek

Michał Pilipczuk

Bartosz Walczak

2024

Shortest Disjoint Paths on a Grid

Mathieu Mari

Anish Mukherjee

Michał Pilipczuk

Piotr Sankowski

2024

Quasi-Polynomial Time Approximation Schemes for the Maximum Weight Independent Set Problem in -Free Graphs

SIAM Journal on Computing

Maria Chudnovsky

Marcin Pilipczuk

Michał Pilipczuk

Stéphan Thomassé

2024/2/29

A Parameterized Approximation Scheme for the Geometric Knapsack Problem with Wide Items

Mathieu Mari

Timothé Picavet

Michał Pilipczuk

2023

Space-efficient parameterized algorithms on graphs of low shrubdepth

arXiv preprint arXiv:2307.01285

Benjamin Bergougnoux

Vera Chekan

Robert Ganian

Mamadou Moustapha Kanté

Matthias Mnich

...

2023/7/3

Partitioning edges of a planar graph into linear forests and a matching

Journal of Graph Theory

Marthe Bonamy

Jadwiga Czyżewska

Łukasz Kowalik

Michał Pilipczuk

2023/11

Maintaining CMSO₂ properties on dynamic structures with bounded feedback vertex number

Konrad Majewski

Michał Pilipczuk

Marek Sokołowski

2023

Graphs of bounded twin-width are quasi-polynomially χ-bounded

Journal of Combinatorial Theory, Series B

Michał Pilipczuk

Marek Sokołowski

2023/7/1

Hamiltonian cycle parameterized by treedepth in single exponential time and polynomial space

SIAM Journal on Discrete Mathematics

Jesper Nederlof

Michał Pilipczuk

Céline MF Swennenhuis

Karol Węgrzycki

2023/9/30

See List of Professors in Michał Pilipczuk University(Uniwersytet Warszawski)

Co-Authors

H-index: 69
Hans L. Bodlaender

Hans L. Bodlaender

Universiteit Utrecht

H-index: 61
Fedor V. Fomin

Fedor V. Fomin

Universitetet i Bergen

H-index: 52
Daniel Lokshtanov

Daniel Lokshtanov

University of California, Santa Barbara

H-index: 34
Marek Cygan

Marek Cygan

Uniwersytet Warszawski

H-index: 33
Marcin Pilipczuk

Marcin Pilipczuk

Uniwersytet Warszawski

H-index: 30
Stefan Kratsch

Stefan Kratsch

Humboldt-Universität zu Berlin

academic-engine