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="Kowalik, {\L}ukasz"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Fast witness extraction using a decision oracle
Andreas Björklund
,
Petteri Kaski
,
Łukasz Kowalik
Lecture Notes in Computer Science
8737
, 2014, pp. 149-160
Beyond the Vizing's bound for at most seven colors
Marcin Kamiński
,
Łukasz Kowalik
SIAM Journal on Discrete Mathematics
28
(3), 2014, pp. 1334-1362
A
9k
kernel for nonseparating independent set in planar graphs
Łukasz Kowalik
,
Marcin Mucha
Theoretical Computer Science
516
, 2014, pp. 86-95
Assigning channels via the meet-in-the-middle approach
Łukasz Kowalik
,
Arkadiusz Socaƚa
Lecture Notes in Computer Science
8503
, 2014, pp. 282-293
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
A
9k
kernel for nonseparating independent set in planar graphs
Łukasz Kowalik
,
Marcin Mucha
Lecture Notes in Computer Science
7551
, 2012, pp. 160-171
A
9k
kernel for nonseparating independent set in planar graphs
Łukasz Kowalik
,
Marcin Mucha
Lecture Notes in Computer Science
7551
, 2012, pp. 160-171
Channel assignment via fast zeta transform
Marek Cygan
,
Łukasz Kowalik
Information Processing Letters
111
(15), 2011, pp. 727-730
A planar linear arboricity conjecture
Marek Cygan
,
Łukasz Kowalik
,
Borut Luz̑ar
Lecture Notes in Computer Science
6078
, 2010, pp. 204-216
Approximating the maximum 3- and 4-edge-colorable subgraph
Marcin Kamiński
,
Łukasz Kowalik
Lecture Notes in Computer Science
6139
, 2010, pp. 395-407
Exponential-time approximation of weighted set cover
Marek Cygan
,
Łukasz Kowalik
,
Mateusz Wykurz
Information Processing Letters
109
(16), 2009, pp. 957-961
Two approximation algorithms for ATSP with strengthened triangle inequality
Łukasz Kowalik
,
Marcin Mucha
Lecture Notes in Computer Science
5664
, 2009, pp. 471-482
Deterministic 7/8-approximation for the metric maximum TSP
Łukasz Kowalik
,
Marcin Mucha
Theoretical Computer Science
410
(47-49), 2009, pp. 5000-5009
Improved edge-coloring with three colors
Łukasz Kowalik
Theoretical Computer Science
410
(38-40), 2009, pp. 3733-3742
New linear-time algorithms for edge-coloring planar graphs
Richard Cole
,
Łukasz Kowalik
Algorithmica
50
(3), 2008, pp. 351-368
Total-coloring of plane graphs with maximum degree nine
Łukasz Kowalik
,
Jean-Sébastien Sereni
,
Riste S̑krekovski
SIAM Journal on Discrete Mathematics
22
(4), 2008, pp. 1462-1479
A generalization of Kotzig's theorem and its application
Richard Cole
,
Łukasz Kowalik
,
Riste S̑krekovski
SIAM Journal on Discrete Mathematics
21
(1), 2007, pp. 93-106
35/44-approximation for asymmetric maximum TSP with triangle inequality
Łukasz Kowalik
,
Marcin Mucha
Lecture Notes in Computer Science
4619
, 2007, pp. 589-600
Adjacency queries in dynamic sparse graphs
Łukasz Kowalik
Information Processing Letters
102
(5), 2007, pp. 191-195
Improved edge-coloring with three colors
Łukasz Kowalik
Lecture Notes in Computer Science
4271
, 2006, pp. 90-101
Approximation scheme for lowest outdegree orientation and graph density measures
Łukasz Kowalik
Lecture Notes in Computer Science
4288
, 2006, pp. 557-566
Fast 3-coloring triangle-free planar graphs
Łukasz Kowalik
Lecture Notes in Computer Science
3221
, 2004, pp. 436-447
Short path queries in planar graphs in constant time
Łukasz Kowalik
,
Maciej Kurowski
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, STOC'2003 (San Diego, California, USA, June 9-11, 2003)
, 2003, pp. 143-148
Short cycles in planar graphs
Łukasz Kowalik
Lecture Notes in Computer Science
2880
, 2003, pp. 284-296