9 citations · 32 across the 24 of their papers we have counts for
63 papers
Parameterized Approximation for Maximum Weight Independent Set of Rectangles and Segments
Jana Cslovjecsek, Michał Pilipczuk, Karol Węgrzycki
In the Maximum Weight Independent Set of Rectangles problem (MWISR) we are given a weighted set of axis-parallel rectangles in the plane. The task is to find a subset of pairwi…
Fixed-parameter tractability of Graph Isomorphism in graphs with an excluded minor
Daniel Lokshtanov, Marcin Pilipczuk, Michał Pilipczuk +1
We prove that Graph Isomorphism and Canonization in graphs excluding a fixed graph as a minor can be solved by an algorithm working in time , where is s…
Highly unbreakable graph with a fixed excluded minor are almost rigid
Daniel Lokshtanov, Marcin Pilipczuk, Michał Pilipczuk +1
A set in a graph is -unbreakable if every separation of order at most in satisfies or . In this…
On Rational Recursive Sequences
Lorenzo Clemente, Maria Donten-Bury, Filip Mazowiecki +1
We study the class of rational recursive sequences (ratrec) over the rational numbers. A ratrec sequence is defined via a system of sequences using mutually recursive equations of…
Independence number of intersection graphs of axis-parallel segments
Marco Caoduro, Jana Cslovjecsek, Michał Pilipczuk +1
We prove that for any triangle-free intersection graph of axis-parallel segments in the plane, the independence number of this graph is at least . W…
Computing treedepth in polynomial space and linear fpt time
Wojciech Nadara, Michał Pilipczuk, Marcin Smulewicz
The treedepth of a graph is the least possible depth of an elimination forest of : a rooted forest on the same vertex set where every pair of vertices adjacent in is bou…