A New 3-Color Criterion for Planar Graphs. - Krzysztof Diks; Lukasz Kowalik; Maciej Kurowski (WG, 2002)

Short path queries in planar graphs in constant time. - Lukasz Kowalik; Maciej Kurowski (STOC, 2003)

Short Cycles in Planar Graphs. - Lukasz Kowalik (WG, 2003)

Approximation Scheme for Lowest Outdegree Orientation and Graph Density Measures. - Lukasz Kowalik (ISAAC, 2006)

A Note on Scheduling Equal-Length Jobs to Maximize Throughput. - Marek Chrobak; Christoph Dürr; Wojciech Jawor; Lukasz Kowalik; Maciej Kurowski (J. Sched., 2006)

Oracles for bounded-length shortest paths in planar graphs. - Lukasz Kowalik; Maciej Kurowski (ACM Trans. Algorithms, 2006)

Adjacency queries in dynamic sparse graphs. - Lukasz Kowalik (Inf. Process. Lett., 2007)

A Generalization of Kotzig's Theorem and Its Application. - Richard Cole 001; Lukasz Kowalik; Riste Skrekovski (SIAM J. Discret. Math., 2007)

08431 Open Problems - Moderately Exponential Time Algorithms. - Fedor V. Fomin; Kazuo Iwama; Dieter Kratsch; Petteri Kaski; Mikko Koivisto; Lukasz Kowalik; Yoshio Okamoto; Johan M. M. van Rooij; Ryan Williams 001 (Moderately Exponential Time Algorithms, 2008)

New Linear-Time Algorithms for Edge-Coloring Planar Graphs. - Richard Cole 001; Lukasz Kowalik (Algorithmica, 2008)

Exponential-Time Approximation of Hard Problems - Marek Cygan; Lukasz Kowalik; Marcin Pilipczuk; Mateusz Wykurz (CoRR, 2008)

Total-Coloring of Plane Graphs with Maximum Degree Nine. - Lukasz Kowalik; Jean-Sébastien Sereni; Riste Skrekovski (SIAM J. Discret. Math., 2008)

Two Approximation Algorithms for ATSP with Strengthened Triangle Inequality. - Lukasz Kowalik; Marcin Mucha (WADS, 2009)

Exponential-time approximation of weighted set cover. - Marek Cygan; Lukasz Kowalik; Mateusz Wykurz (Inf. Process. Lett., 2009)

Improved edge-coloring with three colors. - Lukasz Kowalik (Theor. Comput. Sci., 2009)

Deterministic 7/8-approximation for the metric maximum TSP. - Lukasz Kowalik; Marcin Mucha (Theor. Comput. Sci., 2009)

A Planar Linear Arboricity Conjecture. - Marek Cygan; Lukasz Kowalik; Borut Luzar (CIAC, 2010)

Fast Approximation in Subspaces by Doubling Metric Decomposition. - Marek Cygan; Lukasz Kowalik; Marcin Mucha; Marcin Pilipczuk; Piotr Sankowski (ESA (1), 2010)

Approximating the Maximum 3- and 4-Edge-Colorable Subgraph. - Marcin Kaminski 001; Lukasz Kowalik (SWAT, 2010)

Fast 3-coloring Triangle-Free Planar Graphs. - Lukasz Kowalik (Algorithmica, 2010)

Improved induced matchings in sparse graphs. - Rok Erman; Lukasz Kowalik; Matjaz Krnc; Tomasz Walen (Discret. Appl. Math., 2010)

An improved bound on the largest induced forests for triangle-free planar graphs. - Lukasz Kowalik; Borut Luzar; Riste Skrekovski (Discret. Math. Theor. Comput. Sci., 2010)

35/44-approximation for Asymmetric Maximum TSP with Triangle Inequality. - Lukasz Kowalik; Marcin Mucha (Algorithmica, 2011)

Channel assignment via fast zeta transform. - Marek Cygan; Lukasz Kowalik (Inf. Process. Lett., 2011)

Nonblocker in H-Minor Free Graphs: Kernelization Meets Discharging. - Lukasz Kowalik (IPEC, 2012)

A Planar linear arboricity conjecture. - Marek Cygan; Jianfeng Hou; Lukasz Kowalik; Borut Luzar; Jian-Liang Wu 001 (J. Graph Theory, 2012)

Probably Optimal Graph Motifs. - Andreas Björklund; Petteri Kaski; Lukasz Kowalik (STACS, 2013)

Beyond the Shannon's Bound. - Michal Farnik; Lukasz Kowalik; Arkadiusz Socala (CoRR, 2013)

Towards optimal kernel for connected vertex cover in planar graphs. - Lukasz Kowalik; Marcin Pilipczuk; Karol Suchan (Discret. Appl. Math., 2013)

Fast Witness Extraction Using a Decision Oracle. - Andreas Björklund; Petteri Kaski; Lukasz Kowalik (ESA, 2014)

A 14k -Kernel for Planar Feedback Vertex Set via Region Decomposition. - Marthe Bonamy; Lukasz Kowalik (IPEC, 2014)

Beyond the Vizing's Bound for at Most Seven Colors. - Marcin Jakub Kaminski; Lukasz Kowalik (SIAM J. Discret. Math., 2014)

A 9k kernel for nonseparating independent set in planar graphs. - Lukasz Kowalik; Marcin Mucha (Theor. Comput. Sci., 2014)

Parameterized Algorithms - Marek Cygan; Fedor V. Fomin; Lukasz Kowalik; Daniel Lokshtanov; Dániel Marx; Marcin Pilipczuk; Michal Pilipczuk; Saket Saurabh 001 (Springer, 2015)

Engineering Motif Search for Large Graphs. - Andreas Björklund; Petteri Kaski; Lukasz Kowalik; Juho Lauri (ALENEX, 2015)

Constrained Multilinear Detection and Generalized Graph Motifs. - Andreas Björklund; Petteri Kaski; Lukasz Kowalik (Algorithmica, 2016)

Assigning Channels Via the Meet-in-the-Middle Approach. - Lukasz Kowalik; Arkadiusz Socala (Algorithmica, 2016)

A 13k-kernel for planar feedback vertex set via region decomposition. - Marthe Bonamy; Lukasz Kowalik (Theor. Comput. Sci., 2016)

On finding rainbow and colorful paths. - Lukasz Kowalik; Juho Lauri (Theor. Comput. Sci., 2016)

RobustSPAM for Inference from Noisy Longitudinal Data and Preservation of Privacy. - Anna Palczewska; Jan Palczewski; Georgios Aivaliotis; Lukasz Kowalik (ICMLA, 2017)

Linear Kernels for Outbranching Problems in Sparse Digraphs. - Marthe Bonamy; Lukasz Kowalik; Michal Pilipczuk; Arkadiusz Socala (Algorithmica, 2017)

Improving TSP tours using dynamic programming over tree decomposition. - Marek Cygan; Lukasz Kowalik; Arkadiusz Socala (CoRR, 2017)

Spotting Trees with Few Leaves. - Andreas Björklund; Vikram Kamat; Lukasz Kowalik; Meirav Zehavi (SIAM J. Discret. Math., 2017)

Counting Thin Subgraphs via Packings Faster than Meet-in-the-Middle Time. - Andreas Björklund; Petteri Kaski; Lukasz Kowalik (ACM Trans. Algorithms, 2017)

Tight Lower Bounds for List Edge Coloring. - Lukasz Kowalik; Arkadiusz Socala (SWAT, 2018)

On Directed Feedback Vertex Set Parameterized by Treewidth. - Marthe Bonamy; Lukasz Kowalik; Jesper Nederlof; Michal Pilipczuk; Arkadiusz Socala; Marcin Wrochna (WG, 2018)

Approximation and Parameterized Complexity of Minimax Approval Voting. - Marek Cygan; Lukasz Kowalik; Arkadiusz Socala; Krzysztof Sornat (J. Artif. Intell. Res., 2018)

On the Fine-Grained Complexity of Rainbow Coloring. - Lukasz Kowalik; Juho Lauri; Arkadiusz Socala (SIAM J. Discret. Math., 2018)

Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP. - Édouard Bonnet; Yoichi Iwata; Bart M. P. Jansen; Lukasz Kowalik (ESA, 2019)

Improving TSP Tours Using Dynamic Programming over Tree Decompositions. - Marek Cygan; Lukasz Kowalik; Arkadiusz Socala (ACM Trans. Algorithms, 2019)

Tight Lower Bounds for the Complexity of Multicoloring. - Marthe Bonamy; Lukasz Kowalik; Michal Pilipczuk; Arkadiusz Socala; Marcin Wrochna (ACM Trans. Comput. Theory, 2019)

The Asymmetric Travelling Salesman Problem In Sparse Digraphs. - Lukasz Kowalik; Konrad Majewski (IPEC, 2020)

The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth. - Lukasz Kowalik; Marcin Mucha; Wojciech Nadara; Marcin Pilipczuk; Manuel Sorge; Piotr Wygocki (IPEC, 2020)

Many-visits TSP revisited. - Lukasz Kowalik; Shaohua Li 005; Wojciech Nadara; Marcin Smulewicz; Magnus Wahlström (J. Comput. Syst. Sci., 2022)

Partitioning edges of a planar graph into linear forests and a matching. - Marthe Bonamy; Jadwiga Czyzewska; Lukasz Kowalik; Michal Pilipczuk (J. Graph Theory, 2023)

Edge-Coloring Sparse Graphs with Δ Colors in Quasilinear Time. - Lukasz Kowalik (ESA, 2024)

Detecting Points in Integer Cones of Polytopes is Double-Exponentially Hard. - Lukasz Kowalik; Alexandra Lassota; Konrad Majewski; Michal Pilipczuk; Marek Sokolowski 001 (SOSA, 2024)

The planar edge-coloring theorem of Vizing in O(n log n) time. - Patryk Jedrzejczak; Lukasz Kowalik (CoRR, 2025)