 | 2009 |
| 22 |  | Rok Erman,
Lukasz Kowalik,
Matjaz Krnc,
Tomasz Walen:
Improved Induced Matchings in Sparse Graphs.
IWPEC 2009: 134-148 |
| 21 |  | Lukasz Kowalik,
Marcin Mucha:
Two Approximation Algorithms for ATSP with Strengthened Triangle Inequality.
WADS 2009: 471-482 |
| 20 |  | Marek Cygan,
Lukasz Kowalik,
Marcin Mucha,
Marcin Pilipczuk,
Piotr Sankowski:
Fast Approximation in Subspaces by Doubling Metric Decomposition
CoRR abs/0911.1626: (2009) |
| 19 |  | Marek Cygan,
Lukasz Kowalik,
Mateusz Wykurz:
Exponential-time approximation of weighted set cover.
Inf. Process. Lett. 109(16): 957-961 (2009) |
| 18 |  | Lukasz Kowalik:
Improved edge-coloring with three colors.
Theor. Comput. Sci. 410(38-40): 3733-3742 (2009) |
| 17 |  | Lukasz Kowalik,
Marcin Mucha:
Deterministic 7/8-approximation for the metric maximum TSP.
Theor. Comput. Sci. 410(47-49): 5000-5009 (2009) |
| 2008 |
| 16 |  | Lukasz Kowalik,
Marcin Mucha:
Deterministic 7/8-Approximation for the Metric Maximum TSP.
APPROX-RANDOM 2008: 132-145 |
| 15 |  | Richard Cole,
Lukasz Kowalik:
New Linear-Time Algorithms for Edge-Coloring Planar Graphs.
Algorithmica 50(3): 351-368 (2008) |
| 14 |  | Marek Cygan,
Lukasz Kowalik,
Marcin Pilipczuk,
Mateusz Wykurz:
Exponential-Time Approximation of Hard Problems
CoRR abs/0810.4934: (2008) |
| 13 |  | Lukasz Kowalik,
Jean-Sébastien Sereni,
Riste Skrekovski:
Total-Coloring of Plane Graphs with Maximum Degree Nine.
SIAM J. Discrete Math. 22(4): 1462-1479 (2008) |
| 2007 |
| 12 |  | Lukasz Kowalik,
Marcin Mucha:
35/44-Approximation for Asymmetric Maximum TSP with Triangle Inequality.
WADS 2007: 589-600 |
| 11 |  | Lukasz Kowalik:
Adjacency queries in dynamic sparse graphs.
Inf. Process. Lett. 102(5): 191-195 (2007) |
| 10 |  | Richard Cole,
Lukasz Kowalik,
Riste Skrekovski:
A Generalization of Kotzig's Theorem and Its Application.
SIAM J. Discrete Math. 21(1): 93-106 (2007) |
| 2006 |
| 9 |  | Lukasz Kowalik:
Approximation Scheme for Lowest Outdegree Orientation and Graph Density Measures.
ISAAC 2006: 557-566 |
| 8 |  | Lukasz Kowalik:
Improved Edge-Coloring with Three Colors.
WG 2006: 90-101 |
| 7 |  | Lukasz Kowalik,
Maciej Kurowski:
Oracles for bounded-length shortest paths in planar graphs.
ACM Transactions on Algorithms 2(3): 335-363 (2006) |
| 6 |  | Marek Chrobak,
Christoph Dürr,
Wojciech Jawor,
Lukasz Kowalik,
Maciej Kurowski:
A Note on Scheduling Equal-Length Jobs to Maximize Throughput.
J. Scheduling 9(1): 71-73 (2006) |
| 2004 |
| 5 |  | Lukasz Kowalik:
Fast 3-Coloring Triangle-Free Planar Graphs.
ESA 2004: 436-447 |
| 4 |  | Marek Chrobak,
Christoph Dürr,
Wojciech Jawor,
Lukasz Kowalik,
Maciej Kurowski:
A Note on Scheduling Equal-Length Jobs to Maximize Throughput
CoRR cs.DS/0410046: (2004) |
| 2003 |
| 3 |  | Lukasz Kowalik,
Maciej Kurowski:
Short path queries in planar graphs in constant time.
STOC 2003: 143-148 |
| 2 |  | Lukasz Kowalik:
Short Cycles in Planar Graphs.
WG 2003: 284-296 |
| 2002 |
| 1 |  | Krzysztof Diks,
Lukasz Kowalik,
Maciej Kurowski:
A New 3-Color Criterion for Planar Graphs.
WG 2002: 138-149 |