| 2026 | WG | The Planar Edge-Coloring Theorem of Vizing in O(nlog n) Time. | Patryk Jedrzejczak, Lukasz Kowalik |
| 2024 | ESA | Edge-Coloring Sparse Graphs with Δ Colors in Quasilinear Time. | Lukasz Kowalik |
| 2020 | ESA | Many Visits TSP Revisited. | Lukasz Kowalik, Shaohua Li, Wojciech Nadara, Marcin Smulewicz, Magnus Wahlstrm |
| 2019 | ESA | Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP. | douard Bonnet, Yoichi Iwata, Bart M. P. Jansen, Lukasz Kowalik |
| 2018 | WG | On Directed Feedback Vertex Set Parameterized by Treewidth. | Marthe Bonamy, Lukasz Kowalik, Jesper Nederlof, Michal Pilipczuk, Arkadiusz Socala, Marcin Wrochna |
| 2017 | AAAI | Approximation and Parameterized Complexity of Minimax Approval Voting. | Marek Cygan, Lukasz Kowalik, Arkadiusz Socala, Krzysztof Sornat |
| 2017 | ESA | Tight Lower Bounds for the Complexity of Multicoloring. | Marthe Bonamy, Lukasz Kowalik, Michal Pilipczuk, Arkadiusz Socala, Marcin Wrochna |
| 2017 | ESA | Improving TSP Tours Using Dynamic Programming over Tree Decompositions. | Marek Cygan, Lukasz Kowalik, Arkadiusz Socala |
| 2017 | ICMLA | RobustSPAM for Inference from Noisy Longitudinal Data and Preservation of Privacy. | Anna Palczewska, Jan Palczewski, Georgios Aivaliotis, Lukasz Kowalik |
| 2016 | ESA | On the Fine-Grained Complexity of Rainbow Coloring. | Lukasz Kowalik, Juho Lauri, Arkadiusz Socala |
| 2015 | ALENEX | Engineering Motif Search for Large Graphs. | Andreas Bjrklund, Petteri Kaski, Lukasz Kowalik, Juho Lauri |
| 2015 | ICALP | Spotting Trees with Few Leaves. | Andreas Bjrklund, Vikram Kamat, Lukasz Kowalik, Meirav Zehavi |
| 2014 | ESA | Fast Witness Extraction Using a Decision Oracle. | Andreas Bjrklund, Petteri Kaski, Lukasz Kowalik |
| 2014 | SODA | Counting Thin Subgraphs via Packings Faster Than Meet-in-the-Middle Time. | Andreas Bjrklund, Petteri Kaski, Lukasz Kowalik |
| 2013 | STACS | Probably Optimal Graph Motifs. | Andreas Bjrklund, Petteri Kaski, Lukasz Kowalik |
| 2012 | WG | A 9k Kernel for Nonseparating Independent Set in Planar Graphs. | Lukasz Kowalik, Marcin Mucha |
| 2010 | CIAC | A Planar Linear Arboricity Conjecture. | Marek Cygan, Lukasz Kowalik, Borut Luzar |
| 2010 | ESA | Fast Approximation in Subspaces by Doubling Metric Decomposition. | Marek Cygan, Lukasz Kowalik, Marcin Mucha, Marcin Pilipczuk, Piotr Sankowski |
| 2009 | WADS | Two Approximation Algorithms for ATSP with Strengthened Triangle Inequality. | Lukasz Kowalik, Marcin Mucha |
| 2007 | WADS | 35/44-Approximation for Asymmetric Maximum TSP with Triangle Inequality. | Lukasz Kowalik, Marcin Mucha |
| 2006 | ISAAC | Approximation Scheme for Lowest Outdegree Orientation and Graph Density Measures. | Lukasz Kowalik |
| 2006 | WG | Improved Edge-Coloring with Three Colors. | Lukasz Kowalik |
| 2004 | ESA | Fast 3-Coloring Triangle-Free Planar Graphs. | Lukasz Kowalik |
| 2003 | STOC | Short path queries in planar graphs in constant time. | Lukasz Kowalik, Maciej Kurowski |
| 2003 | WG | Short Cycles in Planar Graphs. | Lukasz Kowalik |
| 2002 | WG | A New 3-Color Criterion for Planar Graphs. | Krzysztof Diks, Lukasz Kowalik, Maciej Kurowski |