- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j16 |      | Lukasz Kowalik, Marcin Pilipczuk, Karol Suchan: Towards optimal kernel for connected vertex cover in planar graphs. Discrete Applied Mathematics 161(7-8): 1154-1161 (2013) |
| c16 | | |
| 2012 | ||
| j15 | | 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) |
| c15 | | Lukasz Kowalik: Nonblocker in H-Minor Free Graphs: Kernelization Meets Discharging. IPEC 2012: 61-72 |
| c14 | | Lukasz Kowalik, Marcin Mucha: A 9k Kernel for Nonseparating Independent Set in Planar Graphs. WG 2012: 160-171 |
| i9 | | Lukasz Kowalik, Marcin Mucha: A 9k kernel for nonseparating independent set in planar graphs. CoRR abs/1207.4666 (2012) |
| i8 | | Lukasz Kowalik: Nonblocker in H-minor free graphs: kernelization meets discharging. CoRR abs/1207.4681 (2012) |
| i7 | | Andreas Björklund, Petteri Kaski, Lukasz Kowalik: Probably Optimal Graph Motifs. CoRR abs/1209.1082 (2012) |
| i6 | | Marcin Kaminski, Lukasz Kowalik: Beyond the Vizing's bound for at most seven colors. CoRR abs/1211.5031 (2012) |
| 2011 | ||
| j14 | | Lukasz Kowalik, Marcin Mucha: 35/44-approximation for Asymmetric Maximum TSP with Triangle Inequality. Algorithmica 59(2): 240-255 (2011) |
| j13 | | Marek Cygan, Lukasz Kowalik: Channel assignment via fast zeta transform. Inf. Process. Lett. 111(15): 727-730 (2011) |
| i5 | | |
| i4 | | Lukasz Kowalik, Marcin Pilipczuk, Karol Suchan: Towards optimal kernel for connected vertex cover in planar graphs. CoRR abs/1110.1964 (2011) |
| 2010 | ||
| j12 | | |
| j11 | | Rok Erman, Lukasz Kowalik, Matjaz Krnc, Tomasz Walen: Improved induced matchings in sparse graphs. Discrete Applied Mathematics 158(18): 1994-2003 (2010) |
| j10 | | Lukasz Kowalik, Borut Luzar, Riste Skrekovski: An improved bound on the largest induced forests for triangle-free planar graphs. Discrete Mathematics & Theoretical Computer Science 12(1): 87-100 (2010) |
| c13 | | |
| c12 | | Marek Cygan, Lukasz Kowalik, Marcin Mucha, Marcin Pilipczuk, Piotr Sankowski: Fast Approximation in Subspaces by Doubling Metric Decomposition. ESA (1) 2010: 72-83 |
| c11 | | Marcin Kaminski, Lukasz Kowalik: Approximating the Maximum 3- and 4-Edge-Colorable Subgraph. SWAT 2010: 395-407 |
| 2009 | ||
| j9 | | Marek Cygan, Lukasz Kowalik, Mateusz Wykurz: Exponential-time approximation of weighted set cover. Inf. Process. Lett. 109(16): 957-961 (2009) |
| j8 | | Lukasz Kowalik: Improved edge-coloring with three colors. Theor. Comput. Sci. 410(38-40): 3733-3742 (2009) |
| j7 | | Lukasz Kowalik, Marcin Mucha: Deterministic 7/8-approximation for the metric maximum TSP. Theor. Comput. Sci. 410(47-49): 5000-5009 (2009) |
| c10 | | Rok Erman, Lukasz Kowalik, Matjaz Krnc, Tomasz Walen: Improved Induced Matchings in Sparse Graphs. IWPEC 2009: 134-148 |
| c9 | | Lukasz Kowalik, Marcin Mucha: Two Approximation Algorithms for ATSP with Strengthened Triangle Inequality. WADS 2009: 471-482 |
| i3 | | Marek Cygan, Lukasz Kowalik, Marcin Mucha, Marcin Pilipczuk, Piotr Sankowski: Fast Approximation in Subspaces by Doubling Metric Decomposition. CoRR abs/0911.1626 (2009) |
| 2008 | ||
| j6 | | Richard Cole, Lukasz Kowalik: New Linear-Time Algorithms for Edge-Coloring Planar Graphs. Algorithmica 50(3): 351-368 (2008) |
| j5 | | 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) |
| c8 | | Lukasz Kowalik, Marcin Mucha: Deterministic 7/8-Approximation for the Metric Maximum TSP. APPROX-RANDOM 2008: 132-145 |
| i2 | | Marek Cygan, Lukasz Kowalik, Marcin Pilipczuk, Mateusz Wykurz: Exponential-Time Approximation of Hard Problems. CoRR abs/0810.4934 (2008) |
| 2007 | ||
| j4 | | Lukasz Kowalik: Adjacency queries in dynamic sparse graphs. Inf. Process. Lett. 102(5): 191-195 (2007) |
| j3 | | Richard Cole, Lukasz Kowalik, Riste Skrekovski: A Generalization of Kotzig's Theorem and Its Application. SIAM J. Discrete Math. 21(1): 93-106 (2007) |
| c7 | | Lukasz Kowalik, Marcin Mucha: 35/44-Approximation for Asymmetric Maximum TSP with Triangle Inequality. WADS 2007: 589-600 |
| 2006 | ||
| j2 | | 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) |
| j1 | | Lukasz Kowalik, Maciej Kurowski: Oracles for bounded-length shortest paths in planar graphs. ACM Transactions on Algorithms 2(3): 335-363 (2006) |
| c6 | | Lukasz Kowalik: Approximation Scheme for Lowest Outdegree Orientation and Graph Density Measures. ISAAC 2006: 557-566 |
| c5 | | |
| 2004 | ||
| c4 | | |
| i1 | | 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 | ||
| c3 | | Lukasz Kowalik, Maciej Kurowski: Short path queries in planar graphs in constant time. STOC 2003: 143-148 |
| c2 | | |
| 2002 | ||
| c1 | | Krzysztof Diks, Lukasz Kowalik, Maciej Kurowski: A New 3-Color Criterion for Planar Graphs. WG 2002: 138-149 |
Colors in the list of coauthors
Last update Fri May 24 12:19:25 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page