CV - Universitetet i Bergen

Personal information
Curriculum Vitæ
Name and surname Michał Pilipczuk
Date and place of birth 25 th June 1988, Warsaw
Address Institutt for Informatikk, Universitetet i Bergen, PB 7803,
5020 Bergen, Norway
E-mail michal.pilipczuk@ii.uib.no
Research interests
Computer science fixed parameter tractability;
automata and logic
Mathematics probabilistics
Education
since 2011 PhD Studies in Computer Science under supervision of prof. Fedor V. Fomin, University of Bergen,
Norway
2006 — 2011 Double Degree Program in Computer Science and Mathematics, Faculty of Mathematics,
Informatics and Mechanics, University of Warsaw, Poland
2003 — 2006 XIV Secondary School in Warsaw, mathematical-experimental program
Theses
Problems parameterized by treewidth tractable in single exponential time: a logical approach, master thesis in computer
science, supervised by prof. Mikołaj Bojańczyk;
Branching processes, bachelor thesis in mathematics, supervised prof. Krzysztof Oleszkiewicz;
Implementation of real-time computer game ’Starfighter’, bachelor thesis in computer science, prepared with Kamil
Herba, Marian Kędzierski and Krzysztof Niemkiewicz, supervised by Krzysztof Ciebiera.
1

Olympic experience
2012 Leader of the Polish team for the 1 st European Girls’ Mathematical Olympiad (Cambridge, UK)
2011 Deputy leader of the Polish team for the 52 nd International Mathematical Olympiad (Amsterdam, Netherlandes)
2011 Leader of the Polish team for the competition Romanian Master in Mathematics (Bucharest, Romania)
2010 Deputy leader of the Polish team for the 51 st International Mathematical Olympiad (Astana, Kazakhstan)
since 2009 Member of the Problem Selection Committee of the Polish Mathematical Olympiad
2009 – 2011 Member of the Polish Mathematical Olympiad Committee
2008 Deputy leader of the Polish team for the 49 th International Mathematical Olympiad (Madrid, Spain)
2007 – 2009 Informal member of the Problem Selection Committee of the Polish Mathematical Olympiad
since 2007 Member of the Jury of the Polish Olympiad in Informatics
Achievements in olympiads and championships
2011 7 th place in the second category at the 21 th Vojtěch Jarník International Mathematical Competition
(Ostrava, Czech Republic)
2010 Second prize at the 17 th International Mathematical Competition (Blagoevgrad, Bulgaria)
2010 7 th place in the second category at the 20 th Vojtěch Jarník International Mathematical Competition
(Ostrava, Czech Republic)
2010 Silver medal (8 th place) at the World Finals of ACM International Collegiate Programming Contest (Harbin, China)
2009 First place at the Central European Programming Contest (Wrocław, Poland)
2009 9 th place at the 14 th Collegiate Championship of Poland in Team Programming (Poznań, Poland)
2009 Second prize at 16 th the International Mathematical Competition (Budapest, Hungary)
2009 First place in the second category at the 19 th Vojtěch Jarník International Mathematical Competition
(Ostrava, Czech Republic)
2008 19 th place at the Central European Programming Contest (Wrocław, Poland)
2008 Second place at the 13 th Collegiate Championship of Poland in Team Programming (Poznań, Poland)
2008 First prize at the 15 th International Mathematical Competition (Blagoevgrad, Bulgaria)
2008 First place in the first category at the 19 th Vojtěch Jarník International Mathematical Competition
(Ostrava, Czech Republic)
2007 First prize at the 14 th International Mathematical Competition (Blagoevgrad, Bulgaria)
2006 9 th place at the Central European Programming Contest (Budapest, Hungary)
2006 6 th place at the 11 th Collegiate Championship of Poland in Team Programming (Poznań, Poland)
2006 Silver medal at the 18 th International Olympiad in Informatics (Merida, Mexico)
2006 Silver medal at the 47 th International Mathematical Olympiad (Ljubljana, Slovenia)
2006 Bronze medal at the 13 th Central European Olympiad in Informatics (Vrsar, Croatia)
2005 Bronze medal at the 46 th International Mathematical Olympiad (Merida, Mexico)
2004 Gold medal at the 45 th International Mathematical Olympiad (Athens, Greece)
2003 Third place at the 26 th Austrian-Polish Mathematical Competition (Graz, Austria)
2

Other
Languages Polish (mother tongue),
English (fluent, CAE in 2003, CPE in 2005),
German (basic),
Norwegian (basic),
Russian (basic)
Hobbies mountain trekking, fantasy and sci-fi literature
Papers
Marek Cygan, Marcin Pilipczuk, Michał Pilipczuk,
On group feedback vertex set parameterized by the size of the cutset,
unpublished, accepted to WG 2012 (best student paper award)
Petr Golovach, Pinar Heggernes, Pim van’t Hof, Fredrik Manne, Daniël Paulusma, Michał Pilipczuk,
How to eliminate a graph,
unpublished, accepted to WG 2012
Marek Cygan, Stefan Kratsch, Marcin Pilipczuk, Michał Pilipczuk, Magnus Wahlström,
Clique cover and graph separation: New incompressibility results,
unpublished, accepted to ICALP 2012 (track A)
Stefan Kratsch, Marcin Pilipczuk, Michał Pilipczuk, Magnus Wahlström,
Fixed-parameter tractability of multicut in directed acyclic graphs,
unpublished, accepted to ICALP 2012 (track A)
Fedor V. Fomin, Petr Golovach, Jesper Nederlof, Michał Pilipczuk,
Minimizing Rosenthal potential in multicast games,
unpublished, accepted to ICALP 2012 (track C)
Marek Cygan, Marcin Pilipczuk, Michał Pilipczuk, Jakub Onufry Wojtaszczyk,
Solving the 2-Disjoint Connected Subgraphs problem faster than 2 n ,
LATIN 2012
Marek Cygan, Marcin Pilipczuk, Michał Pilipczuk, Jakub Onufry Wojtaszczyk,
Scheduling partially ordered jobs faster than 2 n ,
ESA 2011
Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michał Pilipczuk, Saket Saurabh,
On the hardness of losing width,
IPEC 2011
Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michał Pilipczuk, Saket Saurabh,
On cutwidth parameterized by vertex cover,
IPEC 2011
Marek Cygan, Marcin Pilipczuk, Michał Pilipczuk, Jakub Onufry Wojtaszczyk,
On Multiway Cut parameterized above lower bounds,
IPEC 2011
Marek Cygan, Michał Pilipczuk, Riste Škrekovski,
On the inequality between radius and Randić index for graphs,
MATCH Commun. Math. Comput. Chem., Volume 67 (2012) number 2
3

Marek Cygan, Dániel Marx, Marcin Pilipczuk, Michał Pilipczuk, Ildikó Schlotter,
Parameterized Complexity of Eulerian Deletion Problems,
WG 2011
Michał Pilipczuk,
Problems parameterized by treewidth tractable in single exponential time: a logical approach,
MFCS 2011
Marek Cygan, Jesper Nederlof, Marcin Pilipczuk, Michał Pilipczuk, Johan M. M. van Rooij, Jakub Onufry Wojtaszczyk,
Solving connectivity problems parameterized by treewidth in single exponential time,
FOCS 2011
Marek Cygan, Geevarghese Philip, Marcin Pilipczuk, Michał Pilipczuk, Jakub Onufry Wojtaszczyk,
Dominating Set is Fixed Parameter Tractable in Claw free Graphs,
TCS 412(50)
Marek Cygan, Michał Pilipczuk, Riste Škrekovski,
Relation between Randiæ index and average distance of trees,
MATCH Commun. Math. Comput. Chem., Volume 66 (2011) number 2
Marek Cygan, Marcin Pilipczuk, Michał Pilipczuk, Jakub Onufry Wojtaszczyk,
The stubborn problem is stubborn no more (a polynomial algorithm for 3-compatible colouring and the stubborn
list partition problem),
SODA 2011
Marek Cygan, Marcin Pilipczuk, Michał Pilipczuk, Jakub Onufry Wojtaszczyk,
Subset feedback vertex set is fixed parameter tractable,
ICALP 2011 (track A)
Marek Cygan, Marcin Pilipczuk, Michał Pilipczuk, Jakub Onufry Wojtaszczyk,
Improved FPT algorithm and quadratic kernel for Pathwidth One Vertex Deletion,
IPEC 2010, journal version to appear in Algorithmica
Marek Cygan, Marcin Pilipczuk, Michał Pilipczuk, Jakub Onufry Wojtaszczyk,
Kernelization hardness of connectivity problems in d-degenerate graphs,
WG 2010
4