Michal Pilipczuk

Identifiers

• name variant Michal Pilipczuk 0.60 · backfill

Papers (7)

1. Strong immersion is a well-quasi-ordering for semi-complete digraphs cs.DM · 2017 · author #3
2. Hardness of approximation for H-free edge modification problems cs.DS · 2016 · author #4
3. Lower bounds for the parameterized complexity of Minimum Fill-in and other completion problems cs.CC · 2015 · author #5
4. Fast Algorithms for Parameterized Problems with Relaxed Disjointness Constraints cs.DS · 2014 · author #3
5. Preprocessing Subgraph and Minor Problems: When Does a Small Vertex Cover Help? cs.DS · 2012 · author #3
6. The stubborn problem is stubborn no more (a polynomial algorithm for 3-compatible colouring and the stubborn list partition problem) cs.DS · 2010 · author #3
7. Subset feedback vertex set is fixed parameter tractable cs.DS · 2010 · author #3

Mentions

• 1411.6756 #3 · backfill · confidence 0.70 Michal Pilipczuk
• 1206.4912 #3 · backfill · confidence 0.70 Michal Pilipczuk
• 1004.5010 #3 · backfill · confidence 0.70 Michal Pilipczuk
• 1004.2972 #3 · backfill · confidence 0.70 Michal Pilipczuk

Frequent Coauthors

• Marek Cygan 4 shared papers
• Ivan Bliznets 2 shared papers
• Jakub Onufry Wojtaszczyk 2 shared papers
• Marcin Pilipczuk 2 shared papers
• Pawel Komosa 2 shared papers
• Ariel Gabizon 1 shared papers
• Bart M. P. Jansen 1 shared papers
• Christophe Paul 1 shared papers
• Daniel Lokshtanov 1 shared papers
• Fedor V. Fomin 1 shared papers
• Florian Barbero 1 shared papers
• Lukas Mach 1 shared papers