Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Michal Pilipczuk
2010 – today
- 2013
[j7]Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk: Subset Feedback Vertex Set Is Fixed-Parameter Tractable. SIAM J. Discrete Math. 27(1): 290-309 (2013)- [j6]Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk: On multiway cut parameterized above lower bounds. TOCT 5(1): 3 (2013)
- [c26]Fedor V. Fomin, Michal Pilipczuk: Jungles, bundles, and fixed parameter tractability. SODA 2013: 396-413
- [c25]Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk: Known algorithms for EDGE CLIQUE COVER are probably optimal. SODA 2013: 1044-1053
- [c24]Fedor V. Fomin, Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Yngve Villanger: Tight bounds for Parameterized Complexity of Cluster Editing. STACS 2013: 32-43
- [c23]Michal Pilipczuk: Computing cutwidth and pathwidth of semi-complete digraphs via degree orderings. STACS 2013: 197-208
- [c22]Marcin Pilipczuk, Michal Pilipczuk, Piotr Sankowski, Erik Jan van Leeuwen: Subexponential-Time Parameterized Algorithm for Steiner Tree on Planar Graphs. STACS 2013: 353-364
- [i21]Fedor V. Fomin, Michal Pilipczuk: Subexponential parameterized algorithm for computing the cutwidth of a semi-complete digraph. CoRR abs/1301.7314 (2013)
- [i20]Marek Cygan, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk: The planar directed k-Vertex-Disjoint Paths problem is fixed-parameter tractable. CoRR abs/1304.4207 (2013)
- [i19]Hans L. Bodlaender, Pål G. Drange, Markus S. Dregi, Fedor V. Fomin, Daniel Lokshtanov, Michal Pilipczuk: A O(c^k n) 5-Approximation Algorithm for Treewidth. CoRR abs/1304.6321 (2013)
- 2012
- [j5]Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk: An Improved FPT Algorithm and a Quadratic Kernel for Pathwidth One Vertex Deletion. Algorithmica 64(1): 170-188 (2012)
- [j4]Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk: Kernelization hardness of connectivity problems in d-degenerate graphs. Discrete Applied Mathematics 160(15): 2131-2141 (2012)
- [j3]Marcin Pilipczuk, Michal Pilipczuk, Riste Skrekovski: Some results on Vizing's conjecture and related problems. Discrete Applied Mathematics 160(16-17): 2484-2490 (2012)
- [j2]Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk: A Polynomial Algorithm for 3-Compatible Coloring and the Stubborn List Partition Problem (The Stubborn Problem Is Stubborn No More). SIAM J. Comput. 41(4): 815-828 (2012)
- [c21]Rajesh Hemant Chitnis, Marek Cygan, MohammadTaghi Hajiaghayi, Marcin Pilipczuk, Michal Pilipczuk: Designing FPT Algorithms for Cut Problems Using Randomized Contractions. FOCS 2012: 460-469
- [c20]Marek Cygan, Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Magnus Wahlström: Clique Cover and Graph Separation: New Incompressibility Results. ICALP (1) 2012: 254-265
- [c19]Fedor V. Fomin, Petr A. Golovach, Jesper Nederlof, Michal Pilipczuk: Minimizing Rosenthal Potential in Multicast Games. ICALP (2) 2012: 525-536
- [c18]Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Magnus Wahlström: Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs. ICALP (1) 2012: 581-593
- [c17]Marcin Pilipczuk, Michal Pilipczuk: Finding a Maximum Induced Degenerate Subgraph Faster Than 2 n. IPEC 2012: 3-12
- [c16]Fedor V. Fomin, Bart M. P. Jansen, Michal Pilipczuk: Preprocessing Subgraph and Minor Problems: When Does a Small Vertex Cover Help? IPEC 2012: 97-108
- [c15]Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk: Solving the 2-Disjoint Connected Subgraphs Problem Faster Than 2 n. LATIN 2012: 195-206
- [c14]Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk: Sitting Closer to Friends Than Enemies, Revisited. MFCS 2012: 296-307
- [c13]Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk: On Group Feedback Vertex Set Parameterized by the Size of the Cutset. WG 2012: 194-205
- [c12]Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Fredrik Manne, Daniël Paulusma, Michal Pilipczuk: How to Eliminate a Graph. WG 2012: 320-331
- [i18]Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk: Sitting closer to friends than enemies, revisited. CoRR abs/1201.1869 (2012)
- [i17]Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Magnus Wahlström: Fixed-parameter tractability of multicut in directed acyclic graphs. CoRR abs/1202.5749 (2012)
- [i16]Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk: Known algorithms for EDGE CLIQUE COVER are probably optimal. CoRR abs/1203.1754 (2012)
- [i15]Fedor V. Fomin, Bart M. P. Jansen, Michal Pilipczuk: Preprocessing Subgraph and Minor Problems: When Does a Small Vertex Cover Help? CoRR abs/1206.4912 (2012)
- [i14]Rajesh Hemant Chitnis, Marek Cygan, MohammadTaghi Hajiaghayi, Marcin Pilipczuk, Michal Pilipczuk: Designing FPT algorithms for cut problems using randomized contractions. CoRR abs/1207.4079 (2012)
- [i13]Marcin Pilipczuk, Michal Pilipczuk: Finding a maximum induced degenerate subgraph faster than 2^n. CoRR abs/1208.4449 (2012)
- [i12]Michal Pilipczuk: Computing cutwidth and pathwidth of semi-complete digraphs via degree orderings. CoRR abs/1210.5363 (2012)
- 2011
- [j1]Marek Cygan, Geevarghese Philip, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk: Dominating set is fixed parameter tractable in claw-free graphs. Theor. Comput. Sci. 412(50): 6982-7000 (2011)
- [c11]Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk: Scheduling Partially Ordered Jobs Faster Than 2 n. ESA 2011: 299-310
- [c10]Marek Cygan, Jesper Nederlof, Marcin Pilipczuk, Michal Pilipczuk, Johan M. M. van Rooij, Jakub Onufry Wojtaszczyk: Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time. FOCS 2011: 150-159
- [c9]Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk: Subset Feedback Vertex Set Is Fixed-Parameter Tractable. ICALP (1) 2011: 449-461
- [c8]Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk: On Multiway Cut Parameterized above Lower Bounds. IPEC 2011: 1-12
- [c7]Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh: On the Hardness of Losing Width. IPEC 2011: 159-168
- [c6]Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh: On Cutwidth Parameterized by Vertex Cover. IPEC 2011: 246-258
- [c5]Michal Pilipczuk: Problems Parameterized by Treewidth Tractable in Single Exponential Time: A Logical Approach. MFCS 2011: 520-531
- [c4]Marek Cygan, Marcin Pilipczuk, Michal 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: 1666-1674
- [c3]Marek Cygan, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, Ildikó Schlotter: Parameterized Complexity of Eulerian Deletion Problems. WG 2011: 131-142
- [i11]Marek Cygan, Jesper Nederlof, Marcin Pilipczuk, Michal Pilipczuk, Johan M. M. van Rooij, Jakub Onufry Wojtaszczyk: Solving connectivity problems parameterized by treewidth in single exponential time. CoRR abs/1103.0534 (2011)
- [i10]Michal Pilipczuk: Problems parameterized by treewidth tractable in single exponential time: a logical approach. CoRR abs/1104.3057 (2011)
- [i9]Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk: On Multiway Cut parameterized above lower bounds. CoRR abs/1107.1585 (2011)
- [i8]Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk: Scheduling partially ordered jobs faster than 2^n. CoRR abs/1108.0810 (2011)
- [i7]Marek Cygan, Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Magnus Wahlström: Clique cover and graph separation: New incompressibility results. CoRR abs/1111.0570 (2011)
- [i6]Fedor V. Fomin, Michal Pilipczuk: Jungles, bundles, and fixed parameter tractability. CoRR abs/1112.1538 (2011)
- [i5]Fedor V. Fomin, Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Yngve Villanger: Subexponential fixed-parameter tractability of cluster editing. CoRR abs/1112.4419 (2011)
- [i4]Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk: On group feedback vertex set parameterized by the size of the cutset. CoRR abs/1112.6255 (2011)
- 2010
- [c2]Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk: An Improved FPT Algorithm and Quadratic Kernel for Pathwidth One Vertex Deletion. IPEC 2010: 95-106
- [c1]Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk: Kernelization Hardness of Connectivity Problems in d-Degenerate Graphs. WG 2010: 147-158
- [i3]Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk: Subset feedback vertex set is fixed parameter tractable. CoRR abs/1004.2972 (2010)
- [i2]Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk: The stubborn problem is stubborn no more (a polynomial algorithm for 3-compatible colouring and the stubborn list partition problem). CoRR abs/1004.5010 (2010)
- [i1]Marek Cygan, Geevarghese Philip, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk: Dominating Set is Fixed Parameter Tractable in Claw-free Graphs. CoRR abs/1011.6239 (2010)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-06 20:14 CEST by the dblp team