DBLP: Marcin Pilipczuk

	2013
j15		Lukasz Kowalik, Marcin Pilipczuk, Karol Suchan: Towards optimal kernel for connected vertex cover in planar graphs. Discrete Applied Mathematics 161(7-8): 1154-1161 (2013)
j14		Marek Cygan, Marcin Pilipczuk, Riste Skrekovski: A bound on the number of perfect matchings in Klee-graphs. Discrete Mathematics & Theoretical Computer Science 15(1): 37-54 (2013)
j13		Marek Cygan, Marcin Pilipczuk: Split Vertex Deletion meets Vertex Cover: New fixed-parameter and exact exponential-time algorithms. Inf. Process. Lett. 113(5-6): 179-182 (2013)
j12		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)
c28		Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk: Known algorithms for EDGE CLIQUE COVER are probably optimal. SODA 2013: 1044-1053
c27		Fedor V. Fomin, Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Yngve Villanger: Tight bounds for Parameterized Complexity of Cluster Editing. STACS 2013: 32-43
c26		Marcin Pilipczuk, Michal Pilipczuk, Piotr Sankowski, Erik Jan van Leeuwen: Subexponential-Time Parameterized Algorithm for Steiner Tree on Planar Graphs. STACS 2013: 353-364
i24		Marek Cygan, Marcin Pilipczuk: Faster exponential-time algorithms in graphs of bounded average degree. CoRR abs/1302.3763 (2013)
i23		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)
	2012
j11		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)
j10		Marek Cygan, Marcin Pilipczuk: Bandwidth and distortion revisited. Discrete Applied Mathematics 160(4-5): 494-504 (2012)
j9		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)
j8		Marcin Pilipczuk, Michal Pilipczuk, Riste Skrekovski: Some results on Vizing's conjecture and related problems. Discrete Applied Mathematics 160(16-17): 2484-2490 (2012)
j7		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)
j6		Marek Cygan, Marcin Pilipczuk: Even Faster Exact Bandwidth. ACM Transactions on Algorithms 8(1): 8 (2012)
c25		Marek Cygan, Fabrizio Grandoni, Stefano Leonardi, Marcin Pilipczuk, Piotr Sankowski: A Path-Decomposition Theorem with Applications to Pricing and Covering on Trees. ESA 2012: 349-360
c24		Rajesh Hemant Chitnis, Marek Cygan, MohammadTaghi Hajiaghayi, Marcin Pilipczuk, Michal Pilipczuk: Designing FPT Algorithms for Cut Problems Using Randomized Contractions. FOCS 2012: 460-469
c23		Marek Cygan, Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Magnus Wahlström: Clique Cover and Graph Separation: New Incompressibility Results. ICALP (1) 2012: 254-265
c22		Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Magnus Wahlström: Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs. ICALP (1) 2012: 581-593
c21		Marcin Pilipczuk, Michal Pilipczuk: Finding a Maximum Induced Degenerate Subgraph Faster Than 2 n. IPEC 2012: 3-12
c20		Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk: Solving the 2-Disjoint Connected Subgraphs Problem Faster Than 2 n. LATIN 2012: 195-206
c19		Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk: Sitting Closer to Friends Than Enemies, Revisited. MFCS 2012: 296-307
c18		Stefan Kratsch, Marcin Pilipczuk, Ashutosh Rai, Venkatesh Raman: Kernel Lower Bounds Using Co-nondeterminism: Finding Induced Hereditary Subgraphs. SWAT 2012: 364-375
c17		Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk: On Group Feedback Vertex Set Parameterized by the Size of the Cutset. WG 2012: 194-205
i22		Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk: Sitting closer to friends than enemies, revisited. CoRR abs/1201.1869 (2012)
i21		Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Magnus Wahlström: Fixed-parameter tractability of multicut in directed acyclic graphs. CoRR abs/1202.5749 (2012)
i20		Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk: Known algorithms for EDGE CLIQUE COVER are probably optimal. CoRR abs/1203.1754 (2012)
i19		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)
i18		Marek Cygan, Marcin Pilipczuk: On fixed-parameter algorithms for Split Vertex Deletion. CoRR abs/1208.1248 (2012)
i17		Marcin Pilipczuk, Michal Pilipczuk: Finding a maximum induced degenerate subgraph faster than 2^n. CoRR abs/1208.4449 (2012)
	2011
j5		Vesna Andova, Saso Bogoev, Darko Dimitrov, Marcin Pilipczuk, Riste Skrekovski: On the Zagreb index inequality of graphs with prescribed vertex degrees. Discrete Applied Mathematics 159(8): 852-858 (2011)
j4		Marek Cygan, Marcin Pilipczuk, Jakub Onufry Wojtaszczyk: Capacitated domination faster than O(n²). Inf. Process. Lett. 111(23-24): 1099-1103 (2011)
j3		Daniel Binkele-Raible, Ljiljana Brankovic, Marek Cygan, Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Marcin Pilipczuk, Peter Rossmanith, Jakub Onufry Wojtaszczyk: Breaking the 2ⁿ-barrier for Irredundance: Two lines of attack. J. Discrete Algorithms 9(3): 214-230 (2011)
j2		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)
c16		Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk: Scheduling Partially Ordered Jobs Faster Than 2 n. ESA 2011: 299-310
c15		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
c14		Marek Cygan, Fabrizio Grandoni, Stefano Leonardi, Marcin Mucha, Marcin Pilipczuk, Piotr Sankowski: Approximation Algorithms for Union and Intersection Covering Problems. FSTTCS 2011: 28-40
c13		Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk: Subset Feedback Vertex Set Is Fixed-Parameter Tractable. ICALP (1) 2011: 449-461
c12		Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk: On Multiway Cut Parameterized above Lower Bounds. IPEC 2011: 1-12
c11		Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh: On the Hardness of Losing Width. IPEC 2011: 159-168
c10		Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh: On Cutwidth Parameterized by Vertex Cover. IPEC 2011: 246-258
c9		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
c8		Marek Cygan, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, Ildikó Schlotter: Parameterized Complexity of Eulerian Deletion Problems. WG 2011: 131-142
i16		Marek Cygan, Fabrizio Grandoni, Stefano Leonardi, Marcin Mucha, Marcin Pilipczuk, Piotr Sankowski: Approximation Algorithms for Union and Intersection Covering Problems. CoRR abs/1102.5105 (2011)
i15		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)
i14		Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk: On Multiway Cut parameterized above lower bounds. CoRR abs/1107.1585 (2011)
i13		Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk: Scheduling partially ordered jobs faster than 2^n. CoRR abs/1108.0810 (2011)
i12		Lukasz Kowalik, Marcin Pilipczuk, Karol Suchan: Towards optimal kernel for connected vertex cover in planar graphs. CoRR abs/1110.1964 (2011)
i11		Marek Cygan, Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Magnus Wahlström: Clique cover and graph separation: New incompressibility results. CoRR abs/1111.0570 (2011)
i10		Fedor V. Fomin, Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Yngve Villanger: Subexponential fixed-parameter tractability of cluster editing. CoRR abs/1112.4419 (2011)
i9		Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk: On group feedback vertex set parameterized by the size of the cutset. CoRR abs/1112.6255 (2011)
	2010
j1		Marek Cygan, Marcin Pilipczuk: Exact and approximate bandwidth. Theor. Comput. Sci. 411(40-42): 3701-3713 (2010)
c7		Marek Cygan, Marcin Pilipczuk, Jakub Onufry Wojtaszczyk: Irredundant Set Faster Than O(2ⁿ). CIAC 2010: 288-298
c6		Marek Cygan, Lukasz Kowalik, Marcin Mucha, Marcin Pilipczuk, Piotr Sankowski: Fast Approximation in Subspaces by Doubling Metric Decomposition. ESA (1) 2010: 72-83
c5		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
c4		Marek Cygan, Marcin Pilipczuk, Jakub Onufry Wojtaszczyk: Capacitated Domination Faster Than O(2ⁿ). SWAT 2010: 74-80
c3		Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk: Kernelization Hardness of Connectivity Problems in d-Degenerate Graphs. WG 2010: 147-158
i8		Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk: Subset feedback vertex set is fixed parameter tractable. CoRR abs/1004.2972 (2010)
i7		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)
i6		Marek Cygan, Marcin Pilipczuk: Bandwidth and Distortion Revisited. CoRR abs/1004.5012 (2010)
i5		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)
	2009
c2		Marek Cygan, Marcin Pilipczuk: Exact and Approximate Bandwidth. ICALP (1) 2009: 304-315
i4		Marek Cygan, Marcin Pilipczuk: Even Faster Exact Bandwidth. CoRR abs/0902.1661 (2009)
i3		Marek Cygan, Marcin Pilipczuk, Jakub Onufry Wojtaszczyk: Beyond O*(2^n) in domination-type problems. CoRR abs/0909.4021 (2009)
i2		Marek Cygan, Lukasz Kowalik, Marcin Mucha, Marcin Pilipczuk, Piotr Sankowski: Fast Approximation in Subspaces by Doubling Metric Decomposition. CoRR abs/0911.1626 (2009)
	2008
c1		Marek Cygan, Marcin Pilipczuk: Faster Exact Bandwidth. WG 2008: 101-109
i1		Marek Cygan, Lukasz Kowalik, Marcin Pilipczuk, Mateusz Wykurz: Exponential-Time Approximation of Hard Problems. CoRR abs/0810.4934 (2008)

2013

j15

Lukasz Kowalik, Marcin Pilipczuk, Karol Suchan: Towards optimal kernel for connected vertex cover in planar graphs. Discrete Applied Mathematics 161(7-8): 1154-1161 (2013)

j14

Marek Cygan, Marcin Pilipczuk, Riste Skrekovski: A bound on the number of perfect matchings in Klee-graphs. Discrete Mathematics & Theoretical Computer Science 15(1): 37-54 (2013)

j13

Marek Cygan, Marcin Pilipczuk: Split Vertex Deletion meets Vertex Cover: New fixed-parameter and exact exponential-time algorithms. Inf. Process. Lett. 113(5-6): 179-182 (2013)

j12

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)

c28

Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk: Known algorithms for EDGE CLIQUE COVER are probably optimal. SODA 2013: 1044-1053

c27

Fedor V. Fomin, Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Yngve Villanger: Tight bounds for Parameterized Complexity of Cluster Editing. STACS 2013: 32-43

c26

Marcin Pilipczuk, Michal Pilipczuk, Piotr Sankowski, Erik Jan van Leeuwen: Subexponential-Time Parameterized Algorithm for Steiner Tree on Planar Graphs. STACS 2013: 353-364

i24

Marek Cygan, Marcin Pilipczuk: Faster exponential-time algorithms in graphs of bounded average degree. CoRR abs/1302.3763 (2013)

i23

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)

2012

j11

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)

j10

Marek Cygan, Marcin Pilipczuk: Bandwidth and distortion revisited. Discrete Applied Mathematics 160(4-5): 494-504 (2012)

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)

Marcin Pilipczuk, Michal Pilipczuk, Riste Skrekovski: Some results on Vizing's conjecture and related problems. Discrete Applied Mathematics 160(16-17): 2484-2490 (2012)

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)

Marek Cygan, Marcin Pilipczuk: Even Faster Exact Bandwidth. ACM Transactions on Algorithms 8(1): 8 (2012)

c25

Marek Cygan, Fabrizio Grandoni, Stefano Leonardi, Marcin Pilipczuk, Piotr Sankowski: A Path-Decomposition Theorem with Applications to Pricing and Covering on Trees. ESA 2012: 349-360

c24

Rajesh Hemant Chitnis, Marek Cygan, MohammadTaghi Hajiaghayi, Marcin Pilipczuk, Michal Pilipczuk: Designing FPT Algorithms for Cut Problems Using Randomized Contractions. FOCS 2012: 460-469

c23

Marek Cygan, Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Magnus Wahlström: Clique Cover and Graph Separation: New Incompressibility Results. ICALP (1) 2012: 254-265

c22

Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Magnus Wahlström: Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs. ICALP (1) 2012: 581-593

c21

Marcin Pilipczuk, Michal Pilipczuk: Finding a Maximum Induced Degenerate Subgraph Faster Than 2 n. IPEC 2012: 3-12

c20

Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk: Solving the 2-Disjoint Connected Subgraphs Problem Faster Than 2 n. LATIN 2012: 195-206

c19

Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk: Sitting Closer to Friends Than Enemies, Revisited. MFCS 2012: 296-307

c18

Stefan Kratsch, Marcin Pilipczuk, Ashutosh Rai, Venkatesh Raman: Kernel Lower Bounds Using Co-nondeterminism: Finding Induced Hereditary Subgraphs. SWAT 2012: 364-375

c17

Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk: On Group Feedback Vertex Set Parameterized by the Size of the Cutset. WG 2012: 194-205

i22

Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk: Sitting closer to friends than enemies, revisited. CoRR abs/1201.1869 (2012)

i21

Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Magnus Wahlström: Fixed-parameter tractability of multicut in directed acyclic graphs. CoRR abs/1202.5749 (2012)

i20

Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk: Known algorithms for EDGE CLIQUE COVER are probably optimal. CoRR abs/1203.1754 (2012)

i19

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)

i18

Marek Cygan, Marcin Pilipczuk: On fixed-parameter algorithms for Split Vertex Deletion. CoRR abs/1208.1248 (2012)

i17

Marcin Pilipczuk, Michal Pilipczuk: Finding a maximum induced degenerate subgraph faster than 2^n. CoRR abs/1208.4449 (2012)

2011

Vesna Andova, Saso Bogoev, Darko Dimitrov, Marcin Pilipczuk, Riste Skrekovski: On the Zagreb index inequality of graphs with prescribed vertex degrees. Discrete Applied Mathematics 159(8): 852-858 (2011)

Marek Cygan, Marcin Pilipczuk, Jakub Onufry Wojtaszczyk: Capacitated domination faster than O(n²). Inf. Process. Lett. 111(23-24): 1099-1103 (2011)

Daniel Binkele-Raible, Ljiljana Brankovic, Marek Cygan, Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Marcin Pilipczuk, Peter Rossmanith, Jakub Onufry Wojtaszczyk: Breaking the 2ⁿ-barrier for Irredundance: Two lines of attack. J. Discrete Algorithms 9(3): 214-230 (2011)

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)

c16

Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk: Scheduling Partially Ordered Jobs Faster Than 2 n. ESA 2011: 299-310

c15

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

c14

Marek Cygan, Fabrizio Grandoni, Stefano Leonardi, Marcin Mucha, Marcin Pilipczuk, Piotr Sankowski: Approximation Algorithms for Union and Intersection Covering Problems. FSTTCS 2011: 28-40

c13

Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk: Subset Feedback Vertex Set Is Fixed-Parameter Tractable. ICALP (1) 2011: 449-461

c12

Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk: On Multiway Cut Parameterized above Lower Bounds. IPEC 2011: 1-12

c11

Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh: On the Hardness of Losing Width. IPEC 2011: 159-168

c10

Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh: On Cutwidth Parameterized by Vertex Cover. IPEC 2011: 246-258

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

Marek Cygan, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, Ildikó Schlotter: Parameterized Complexity of Eulerian Deletion Problems. WG 2011: 131-142

i16

Marek Cygan, Fabrizio Grandoni, Stefano Leonardi, Marcin Mucha, Marcin Pilipczuk, Piotr Sankowski: Approximation Algorithms for Union and Intersection Covering Problems. CoRR abs/1102.5105 (2011)

i15

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)

i14

Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk: On Multiway Cut parameterized above lower bounds. CoRR abs/1107.1585 (2011)

i13

Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk: Scheduling partially ordered jobs faster than 2^n. CoRR abs/1108.0810 (2011)

i12

Lukasz Kowalik, Marcin Pilipczuk, Karol Suchan: Towards optimal kernel for connected vertex cover in planar graphs. CoRR abs/1110.1964 (2011)

i11

Marek Cygan, Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Magnus Wahlström: Clique cover and graph separation: New incompressibility results. CoRR abs/1111.0570 (2011)

i10

Fedor V. Fomin, Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Yngve Villanger: Subexponential fixed-parameter tractability of cluster editing. CoRR abs/1112.4419 (2011)

Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk: On group feedback vertex set parameterized by the size of the cutset. CoRR abs/1112.6255 (2011)

2010

Marek Cygan, Marcin Pilipczuk: Exact and approximate bandwidth. Theor. Comput. Sci. 411(40-42): 3701-3713 (2010)

Marek Cygan, Marcin Pilipczuk, Jakub Onufry Wojtaszczyk: Irredundant Set Faster Than O(2ⁿ). CIAC 2010: 288-298

Marek Cygan, Lukasz Kowalik, Marcin Mucha, Marcin Pilipczuk, Piotr Sankowski: Fast Approximation in Subspaces by Doubling Metric Decomposition. ESA (1) 2010: 72-83

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

Marek Cygan, Marcin Pilipczuk, Jakub Onufry Wojtaszczyk: Capacitated Domination Faster Than O(2ⁿ). SWAT 2010: 74-80

Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk: Kernelization Hardness of Connectivity Problems in d-Degenerate Graphs. WG 2010: 147-158

Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk: Subset feedback vertex set is fixed parameter tractable. CoRR abs/1004.2972 (2010)

Marek Cygan, Marcin Pilipczuk: Bandwidth and Distortion Revisited. CoRR abs/1004.5012 (2010)

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)

2009

Marek Cygan, Marcin Pilipczuk: Exact and Approximate Bandwidth. ICALP (1) 2009: 304-315

Marek Cygan, Marcin Pilipczuk: Even Faster Exact Bandwidth. CoRR abs/0902.1661 (2009)

Marek Cygan, Marcin Pilipczuk, Jakub Onufry Wojtaszczyk: Beyond O*(2^n) in domination-type problems. CoRR abs/0909.4021 (2009)

Marek Cygan, Lukasz Kowalik, Marcin Mucha, Marcin Pilipczuk, Piotr Sankowski: Fast Approximation in Subspaces by Doubling Metric Decomposition. CoRR abs/0911.1626 (2009)

2008

Marek Cygan, Marcin Pilipczuk: Faster Exact Bandwidth. WG 2008: 101-109

Marek Cygan, Lukasz Kowalik, Marcin Pilipczuk, Mateusz Wykurz: Exponential-Time Approximation of Hard Problems. CoRR abs/0810.4934 (2008)

1	Vesna Andova	[j5]
2	Daniel Binkele-Raible (Daniel Raible)	[j3]
3	Saso Bogoev	[j5]
4	Ljiljana Brankovic	[j3]
5	Rajesh Hemant Chitnis	[c24] [i19]
6	Marek Cygan	[j14] [j13] [j12] [c28] [i24] [i23] [j11] [j10] [j9] [j7] [j6] [c25] [c24] [c23] [c20] [c19] [c17] [i22] [i20] [i19] [i18] [j4] [j3] [j2] [c16] [c15] [c14] [c13] [c12] [c11] [c10] [c9] [c8] [i16] [i15] [i14] [i13] [i11] [i9] [j1] [c7] [c6] [c5] [c4] [c3] [i8] [i7] [i6] [i5] [c2] [i4] [i3] [i2] [c1] [i1]
7	Darko Dimitrov	[j5]
8	Henning Fernau	[j3]
9	Fedor V. Fomin	[c27] [i10]
10	Fabrizio Grandoni	[c25] [c14] [i16]
11	Mohammad Taghi Hajiaghayi (MohammadTaghi Hajiaghayi)	[c24] [i19]
12	Joachim Kneis	[j3]
13	Lukasz Kowalik	[j15] [i12] [c6] [i2] [i1]
14	Dieter Kratsch	[j3]
15	Stefan Kratsch	[c27] [c23] [c22] [c18] [i21] [i11] [i10]
16	Alexander Langer	[j3]
17	Erik Jan van Leeuwen	[c26]
18	Stefano Leonardi	[c25] [c14] [i16]
19	Mathieu Liedloff	[j3]
20	Daniel Lokshtanov	[c11] [c10]
21	Dániel Marx	[i23] [c8]
22	Marcin Mucha	[c14] [i16] [c6] [i2]
23	Jesper Nederlof	[c15] [i15]
24	Geevarghese Philip	[j2] [i5]
25	Michal Pilipczuk	[j12] [c28] [c27] [c26] [i23] [j11] [j9] [j8] [j7] [c24] [c23] [c22] [c21] [c20] [c19] [c17] [i22] [i21] [i20] [i19] [i17] [j2] [c16] [c15] [c13] [c12] [c11] [c10] [c9] [c8] [i15] [i14] [i13] [i11] [i10] [i9] [c5] [c3] [i8] [i7] [i5]
26	Ashutosh Rai	[c18]
27	Venkatesh Raman	[c18]
28	Johan M. M. van Rooij	[c15] [i15]
29	Peter Rossmanith	[j3]
30	Piotr Sankowski	[c26] [c25] [c14] [i16] [c6] [i2]
31	Saket Saurabh	[c11] [c10]
32	Ildikó Schlotter	[c8]
33	Riste Skrekovski	[j14] [j8] [j5]
34	Karol Suchan	[j15] [i12]
35	Yngve Villanger	[c27] [i10]
36	Magnus Wahlström	[c23] [c22] [i21] [i11]
37	Jakub Onufry Wojtaszczyk	[j12] [j11] [j9] [j7] [c20] [c19] [i22] [j4] [j3] [j2] [c16] [c15] [c13] [c12] [c9] [i15] [i14] [i13] [c7] [c5] [c4] [c3] [i8] [i7] [i5] [i3]
38	Mateusz Wykurz	[i1]

Marcin Pilipczuk

Coauthor Index