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="Wojtaszczyk, Jakub Onufry"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
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
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
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
Approximation schemes for capacitated geometric network design
Anna Adamaszek
,
Artur Czumaj
,
Andrzej Lingas
,
Jakub Onufry Wojtaszczyk
Lecture Notes in Computer Science
6755
, 2011, pp. 25-36
Dominating set is fixed parameter tractable in claw-free graphs
Marek Cygan
,
Geevarghese Philip
,
Marcin Pilipczuk
,
Michaƚ Pilipczuk
,
Jakub Onufry Wojtaszczyk
Theoretical Computer Science
412
(50), 2011, pp. 6982-7000
Subset feedback vertex set is fixed-parameter tractable
Marek Cygan
,
Marcin Pilipczuk
,
Michaƚ Pilipczuk
,
Jakub Onufry Wojtaszczyk
Lecture Notes in Computer Science
6755
, 2011, pp. 449-461
Scheduling partially ordered jobs faster than
2^n
Marek Cygan
,
Marcin Pilipczuk
,
Michaƚ Pilipczuk
,
Jakub Onufry Wojtaszczyk
Lecture Notes in Computer Science
6942
, 2011, pp. 299-310
Capacitated domination faster than
O(2^n)
Marek Cygan
,
Marcin Pilipczuk
,
Jakub Onufry Wojtaszczyk
Information Processing Letters
111
(23-24), 2011, pp. 1099-1103
Kernelization hardness of connectivity problems in
d
-degenerate graphs
Marek Cygan
,
Marcin Pilipczuk
,
Michaƚ Pilipczuk
,
Jakub Onufry Wojtaszczyk
Lecture Notes in Computer Science
6410
, 2010, pp. 147-158
Irredundant set faster than
O(2^n)
Marek Cygan
,
Marcin Pilipczuk
,
Jakub Onufry Wojtaszczyk
Lecture Notes in Computer Science
6078
, 2010, pp. 288-298
Capacitated domination faster than
O(2^n)
Marek Cygan
,
Marcin Pilipczuk
,
Jakub Onufry Wojtaszczyk
Lecture Notes in Computer Science
6139
, 2010, pp. 74-80
Multivariate integration in
C^\infty([0,1]^d)
is not strongly tractable
Jakub Onufry Wojtaszczyk
Journal of Complexity
19
(5), 2003, pp. 638-643