Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Cygan, Marek"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Parameterized complexity of firefighting
Cristina Bazgan
,
Morgan Chopin
,
Marek Cygan
,
Michael R. Fellows
,
Fedor V. Fomin
,
Erik Jan van Leeuwen
Journal of Computer and System Sciences
80
(7), 2014, pp. 1285-1297
Constant factor approximation for capacitated
k
-center with outliers
Marek Cygan
,
Tomasz Kociumaka
Leibniz International Proceedings in Informatics (LIPIcs)
25
, 2014, pp. 251-262
On cutwidth parameterized by vertex cover
Marek Cygan
,
Daniel Lokshtanov
,
Marcin Pilipczuk
,
Michaƚ Pilipczuk
,
Saket Saurabh
Algorithmica
68
(4), 2014, pp. 940-953
On the hardness of losing width
Marek Cygan
,
Daniel Lokshtanov
,
Marcin Pilipczuk
,
Michaƚ Plipczuk
,
Saket Saurabh
Theory of Computing Systems
54
(1), 2014, pp. 73-82
Parameterized complexity of Eulerian deletion problems
Marek Cygan
,
Dániel Marx
,
Marcin Pilipczuk
,
Michaƚ Pilipczuk
,
Ildikó Schlotter
Algorithmica
68
(1), 2014, pp. 41-61
Scheduling partially ordered jobs faster than
2^n
Marek Cygan
,
Marcin Pilipczuk
,
Michaƚ Pilipczuk
,
Jakub Onufry Wojtaszczyk
Algorithmica
68
(3), 2014, pp. 692-714
Solving the 2-disjoint connected subgraphs problem faster than
2^n
Marek Cygan
,
Marcin Pilipczuk
,
Michaƚ Pilipczuk
,
Jakub Onufry Wojtaszczyk
Algorithmica
70
(2), 2014, pp. 195-207
Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth
Hans L. Bodlaender
,
Marek Cygan
,
Stefan Kratsch
,
Jesper Nederlof
Lecture Notes in Computer Science
7965
, 2013, pp. 196-207
Tight kernel bounds for problems on graphs with small degeneracy
Marek Cygan
,
Fabrizio Grandoni
,
Danny Hermelin
Lecture Notes in Computer Science
8125
, 2013, pp. 361-372
On pairwise spanners
Marek Cygan
,
Fabrizio Grandoni
,
Telikepalli Kavitha
Leibniz International Proceedings in Informatics (LIPIcs)
20
, 2013, pp. 209-220
Steiner forest orientation problems
Marek Cygan
,
Guy Kortsarz
,
Zeev Nutov
SIAM Journal on Discrete Mathematics
27
(3), 2013, pp. 1503-1513
Fast Hamiltonicity checking via bases of perfect matchings
Marek Cygan
,
Stefan Kratsch
,
Jesper Nederlof
Proceedings of the 45th ACM Symposium on Theory of Computing, STOC'2013 (Palo Alto, California, USA, June 1-4, 2013)
, 2013, pp. 301-310
Subset feedback vertex set is fixed-parameter tractable
Marek Cygan
,
Marcin Pilipczuk
,
Michaƚ Pilipczuk
,
Jakub Onufry Wojtaszczyk
SIAM Journal on Discrete Mathematics
27
(1), 2013, pp. 290-309
Split Vertex Deletion
meets
Vertex Cover
: New fixed-parameter and exact exponential-time algorithms
Marek Cygan
,
Marcin Pilipczuk
Information Processing Letters
113
(5-6), 2013, pp. 179-182
Faster exponential-time algorithms in graphs of bounded average degree
Marek Cygan
,
Marcin Pilipczuk
Lecture Notes in Computer Science
7965
, 2013, pp. 364-375
Directed subset feedback vertex set is fixed-parameter tractable
Rajesh Chitnis
,
Marek Cygan
,
Mohammadtaghi Hajiaghayi
,
Dániel Marx
Lecture Notes in Computer Science
7391
, 2012, pp. 230-241
A path-decomposition theorem with applications to pricing and covering on trees
Marek Cygan
,
Fabrizio Grandoni
,
Stefano Leonardi
,
Marcin Pilipczuk
,
Piotr Sankowski
Lecture Notes in Computer Science
7501
, 2012, pp. 349-360
A Planar linear arboricity conjecture
Marek Cygan
,
Jian-Feng Hou
,
Łukasz Kowalik
,
Borut Luz̑ar
,
Jian-Liang Wu
Journal of Graph Theory
69
(4), 2012, pp. 403-425
Steiner forest orientation problems
Marek Cygan
,
Guy Kortsarz
,
Zeev Nutov
Lecture Notes in Computer Science
7501
, 2012, pp. 361-372
Clique cover and graph separation: New incompressibility results
Marek Cygan
,
Stefan Kratsch
,
Marcin Pilipczuk
,
Michaƚ Pilipczuk
,
Magnus Wahlström
Lecture Notes in Computer Science
7391
, 2012, pp. 254-265
An improved FPT algorithm and a quadratic kernel for
Pathwidth One Vertex Deletion
Marek Cygan
,
Marcin Pilipczuk
,
Michaƚ Pilipczuk
,
Jakub Onufry Wojtaszczyk
Algorithmica
64
(1), 2012, pp. 170-188
Sitting closer to friends than enemies, revisited
Marek Cygan
,
Marcin Pilipczuk
,
Michaƚ Pilipczuk
,
Jakub Onufry Wojtaszczyk
Lecture Notes in Computer Science
7464
, 2012, pp. 296-307
A polynomial algorithm for 3-compatible coloring and the stubborn list partition problem (the stubborn problem is stubborn no more)
Marek Cygan
,
Marcin Pilipczuk
,
Michal Pilipczuk
,
Jakub Wojtaszczyk
SIAM Journal on Computing
41
(4), 2012, pp. 815-828
On group feedback vertex set parameterized by the size of the cutset
Marek Cygan
,
Marcin Pilipczuk
,
Michaƚ Pilipczuk
Lecture Notes in Computer Science
7551
, 2012, pp. 194-205
On group feedback vertex set parameterized by the size of the cutset
Marek Cygan
,
Marcin Pilipczuk
,
Michaƚ Pilipczuk
Lecture Notes in Computer Science
7551
, 2012, pp. 194-205
Seiten 1
2
>