Marek Cygan

	2012
52		Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk: Solving the 2-Disjoint Connected Subgraphs Problem Faster Than 2 n. LATIN 2012: 195-206
51		Marek Cygan, Marcin Pilipczuk: Even Faster Exact Bandwidth. ACM Transactions on Algorithms 8(1): 8 (2012)
50		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)
49		Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk: Sitting closer to friends than enemies, revisited CoRR abs/1201.1869: (2012)
48		Marek Cygan: Deterministic parameterized connected vertex cover CoRR abs/1202.6642: (2012)
47		Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk: Known algorithms for EDGE CLIQUE COVER are probably optimal CoRR abs/1203.1754: (2012)
46		Marek Cygan, Harold N. Gabow, Piotr Sankowski: Algorithmic Applications of Baur-Strassen's Theorem: Shortest Cycles, Diameter and Matchings CoRR abs/1204.1616: (2012)
45		Marek Cygan, Marcin Pilipczuk: Bandwidth and distortion revisited. Discrete Applied Mathematics 160(4-5): 494-504 (2012)
44		Marek Cygan, Jian-Feng Hou, Lukasz Kowalik, Borut Luzar, Jian-Liang Wu: A Planar linear arboricity conjecture. Journal of Graph Theory 69(4): 403-425 (2012)
	2011
43		Marek Cygan, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen: Polynomial-Time Approximation Algorithms for Weighted LCS Problem. CPM 2011: 455-466
42		Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk: Scheduling Partially Ordered Jobs Faster Than 2 n. ESA 2011: 299-310
41		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
40		Marek Cygan, Fabrizio Grandoni, Stefano Leonardi, Marcin Mucha, Marcin Pilipczuk, Piotr Sankowski: Approximation Algorithms for Union and Intersection Covering Problems. FSTTCS 2011: 28-40
39		Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk: Subset Feedback Vertex Set Is Fixed-Parameter Tractable. ICALP (1) 2011: 449-461
38		Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk: On Multiway Cut Parameterized above Lower Bounds. IPEC 2011: 1-12
37		Marek Cygan, Fedor V. Fomin, Erik Jan van Leeuwen: Parameterized Complexity of Firefighting Revisited. IPEC 2011: 13-26
36		Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh: On the Hardness of Losing Width. IPEC 2011: 159-168
35		Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh: On Cutwidth Parameterized by Vertex Cover. IPEC 2011: 246-258
34		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
33		Marek Cygan, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, Ildikó Schlotter: Parameterized Complexity of Eulerian Deletion Problems. WG 2011: 131-142
32		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)
31		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)
30		Marek Cygan, Lukasz Kowalik: Channel Assignment via Fast Zeta Transform CoRR abs/1103.2275: (2011)
29		Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk: On Multiway Cut parameterized above lower bounds CoRR abs/1107.1585: (2011)
28		Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk: Scheduling partially ordered jobs faster than 2^n CoRR abs/1108.0810: (2011)
27		Marek Cygan, Fedor V. Fomin, Erik Jan van Leeuwen: Parameterized Complexity of Firefighting Revisited CoRR abs/1109.4729: (2011)
26		Marek Cygan, Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Magnus Wahlström: Clique cover and graph separation: New incompressibility results CoRR abs/1111.0570: (2011)
25		Marek Cygan, Guy Kortsarz, Zeev Nutov: Steiner Forest Orientation Problems CoRR abs/1112.2273: (2011)
24		Marek Cygan, Holger Dell, Daniel Lokshtanov, Dániel Marx, Jesper Nederlof, Yoshio Okamoto, Ramamohan Paturi, Saket Saurabh, Magnus Wahlström: On Problems as Hard as CNFSAT CoRR abs/1112.2275: (2011)
23		Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk: On group feedback vertex set parameterized by the size of the cutset CoRR abs/1112.6255: (2011)
22		Marek Cygan, Lukasz Kowalik: Channel assignment via fast zeta transform. Inf. Process. Lett. 111(15): 727-730 (2011)
21		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 2n-barrier for Irredundance: Two lines of attack. J. Discrete Algorithms 9(3): 214-230 (2011)
20		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)
	2010
19		Marek Cygan, Lukasz Kowalik, Borut Luzar: A Planar Linear Arboricity Conjecture. CIAC 2010: 204-216
18		Marek Cygan, Marcin Pilipczuk, Jakub Onufry Wojtaszczyk: Irredundant Set Faster Than O(2n). CIAC 2010: 288-298
17		Maxime Crochemore, Marek Cygan, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen: Algorithms for Three Versions of the Shortest Common Superstring Problem. CPM 2010: 299-309
16		Marek Cygan, Lukasz Kowalik, Marcin Mucha, Marcin Pilipczuk, Piotr Sankowski: Fast Approximation in Subspaces by Doubling Metric Decomposition. ESA (1) 2010: 72-83
15		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
14		Marek Cygan, Marcin Pilipczuk, Jakub Onufry Wojtaszczyk: Capacitated Domination Faster Than O(2n). SWAT 2010: 74-80
13		Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk: Kernelization Hardness of Connectivity Problems in d-Degenerate Graphs. WG 2010: 147-158
12		Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk: Subset feedback vertex set is fixed parameter tractable CoRR abs/1004.2972: (2010)
11		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)
10		Marek Cygan, Marcin Pilipczuk: Bandwidth and Distortion Revisited CoRR abs/1004.5012: (2010)
9		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)
8		Marek Cygan, Marcin Pilipczuk: Exact and approximate bandwidth. Theor. Comput. Sci. 411(40-42): 3701-3713 (2010)
	2009
7		Marek Cygan, Marcin Pilipczuk: Exact and Approximate Bandwidth. ICALP (1) 2009: 304-315
6		Marek Cygan, Marcin Pilipczuk: Even Faster Exact Bandwidth CoRR abs/0902.1661: (2009)
5		Marek Cygan, Marcin Pilipczuk, Jakub Onufry Wojtaszczyk: Beyond O*(2^n) in domination-type problems CoRR abs/0909.4021: (2009)
4		Marek Cygan, Lukasz Kowalik, Marcin Mucha, Marcin Pilipczuk, Piotr Sankowski: Fast Approximation in Subspaces by Doubling Metric Decomposition CoRR abs/0911.1626: (2009)
3		Marek Cygan, Lukasz Kowalik, Mateusz Wykurz: Exponential-time approximation of weighted set cover. Inf. Process. Lett. 109(16): 957-961 (2009)
	2008
2		Marek Cygan, Marcin Pilipczuk: Faster Exact Bandwidth. WG 2008: 101-109
1		Marek Cygan, Lukasz Kowalik, Marcin Pilipczuk, Mateusz Wykurz: Exponential-Time Approximation of Hard Problems CoRR abs/0810.4934: (2008)

Coauthor Index

1	Daniel Binkele-Raible (Daniel Raible)	[21]
2	Ljiljana Brankovic	[21]
3	Maxime Crochemore	[17]
4	Holger Dell	[24]
5	Henning Fernau	[21]
6	Fedor V. Fomin	[27] [37]
7	Harold N. Gabow	[46]
8	Fabrizio Grandoni	[32] [40]
9	Jian-Feng Hou	[44]
10	Costas S. Iliopoulos	[17]
11	Joachim Kneis	[21]
12	Guy Kortsarz	[25]
13	Lukasz Kowalik	[1] [3] [4] [16] [19] [22] [30] [44]
14	Dieter Kratsch	[21]
15	Stefan Kratsch	[26]
16	Marcin Kubica	[17] [43]
17	Alexander Langer	[21]
18	Erik Jan van Leeuwen	[27] [37]
19	Stefano Leonardi	[32] [40]
20	Mathieu Liedloff	[21]
21	Daniel Lokshtanov	[24] [35] [36]
22	Borut Luzar	[19] [44]
23	Dániel Marx	[24] [33]
24	Marcin Mucha	[4] [16] [32] [40]
25	Jesper Nederlof	[24] [31] [41]
26	Zeev Nutov	[25]
27	Yoshio Okamoto	[24]
28	Ramamohan Paturi	[24]
29	Geevarghese Philip	[9] [20]
30	Marcin Pilipczuk	[1] [2] [4] [5] [6] [7] [8] [9] [10] [11] [12] [13] [14] [15] [16] [18] [20] [21] [23] [26] [28] [29] [31] [32] [33] [34] [35] [36] [38] [39] [40] [41] [42] [45] [47] [49] [50] [51] [52]
31	Michal Pilipczuk	[9] [11] [12] [13] [15] [20] [23] [26] [28] [29] [31] [33] [34] [35] [36] [38] [39] [41] [42] [47] [49] [50] [52]
32	Jakub Radoszewski	[17] [43]
33	Johan M. M. van Rooij	[31] [41]
34	Peter Rossmanith	[21]
35	Wojciech Rytter	[17] [43]
36	Piotr Sankowski	[4] [16] [32] [40] [46]
37	Saket Saurabh	[24] [35] [36]
38	Ildikó Schlotter	[33]
39	Magnus Wahlström	[24] [26]
40	Tomasz Walen	[17] [43]
41	Jakub Onufry Wojtaszczyk	[5] [9] [11] [12] [13] [14] [15] [18] [20] [21] [28] [29] [31] [34] [38] [39] [41] [42] [49] [50] [52]
42	Jian-Liang Wu	[44]
43	Mateusz Wykurz	[1] [3]

Colors in the list of coauthors

Last update Tue May 29 01:28:40 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page