Marcin Pilipczuk

Has grant

University of Warsaw

Poland

Research Interests

Explore related searches

Professors in Poland Professors in Artificial Intelligence Artificial Intelligence professors in Poland

Contact this professor

Get a free first email built on one of their papers, ready for you to edit and send yourself.

Recent Grants

Grant: Close

CUTACOMBS

Open Date: 2017-03-01

Close Date: 2022-02-01

Grant: Close

Recent trends in kernelization: theory and experimantal evaluation

Open Date: 2016-11-11

Close Date: 2018-10-31

Grant: Close

Recent trends in kernelization: theory and experimantal evaluation

Open Date: 2016-01-11

Close Date: 2018-10-31

Articles (21)

Year:

2025

Year:

2025

Year:

2025

Year:

2025

Year:

2024

Year:

2024

Year:

2024

Year:

2024

Year:

2024

Year:

2024

Year:

2023

Year:

2022

Year:

2022

Year:

2022

Year:

2021

Year:

2021

Year:

2021

Year:

2021

Year:

2021

Year:

2021

Year:

2021

Collaborators (11)

Magnus Wahlström

Royal Holloway, University of London

UNITED KINGDOM

View details

Shaohua Li

GERMANY

View details

Nicolas Trotignon

CNRS Délégation Rhône-Auvergne

FRANCE

View details

Andrea Munaro

The Queen's University Belfast

UNITED KINGDOM

View details

Manuel Sorge

University of Warsaw

AUSTRIA

View details

Fabrizio Montecchiani

Associate Professor

Università degli Studi di Napoli Federico II

ITALY

View details

Blair Sullivan

Associate Professor

University of Utah

UNITED STATES

View details

Stéphan Thomassé

lip université de lyon lyon cedex 07 france

FRANCE

View details

Paweł Rzążewski

University of Warsaw

POLAND

View details

Tomáš Masařík

assistant professor

University of Warsaw

POLAND

View details

Stefan Kratsch

Professor

Humboldt-Universität zu Berlin

GERMANY

View details

ApplyKite TwinLearns as you apply

Make your next move.

Prepare your application

Review drafts before you send them.

Marcin Pilipczuk

Research Interests

Explore related searches

Contact this professor

Recent Grants

Articles (21)

Flow-Augmentation III: Complexity Dichotomy for Boolean CSPs Parameterized by the Number of Unsatisfied Constraints

Flow-augmentation I: Directed graphs

Polynomial-Time Approximation Schemes for Facility Location on Planar Graphs

The influence of dimensions on the complexity of computing decision trees

Flow-augmentation II: Undirected Graphs

On Weighted Graph Separation Problems and Flow Augmentation

Max Weight Independent Set in Graphs with No Long Claws: An Analog of the Gyárfás’ Path Argument

Induced Subgraphs of Bounded Treewidth and the Container Method

Quasi-Polynomial Time Approximation Schemes for the Maximum Weight Independent Set Problem in \(\boldsymbol{H}\)-Free Graphs

Taming Graphs with No Large Creatures and Skinny Ladders

Cluster Editing Parameterized above Modification-disjoint <i>P</i> <sub>3</sub> -packings

Constant Congestion Brambles in Directed Graphs

Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering

A Subexponential Parameterized Algorithm for Directed Subset Traveling Salesman Problem on Planar Graphs

Jones’ conjecture in subcubic graphs

(Theta, triangle)‐free and (even hole, K4)‐free graphs. Part 2: Bounds on treewidth

Covering Minimal Separators and Potential Maximal Cliques in $P_t$-Free Graphs

Polynomial Treedepth Bounds in Linear Colorings

A Deterministic Polynomial Kernel for Odd Cycle Transversal and Vertex Multiway Cut in Planar Graphs

Improved Bounds for the Excluded-Minor Approximation of Treedepth

Randomized Contractions Meet Lean Decompositions

Collaborators (11)

Magnus Wahlström

Shaohua Li

Nicolas Trotignon

Andrea Munaro

Manuel Sorge

Fabrizio Montecchiani

Blair Sullivan

Stéphan Thomassé

Paweł Rzążewski

Tomáš Masařík

Stefan Kratsch

Make your next move.