Lukasz Kowalik

Publication Activity (10 Years)

Years Active: 2002-2024
Publications (10 Years): 37

Top Topics

Tree Decomposition

Top Venues

SIAM J. Discret. Math.

Publications

Lukasz Kowalik, Alexandra Lassota, Konrad Majewski, Michal Pilipczuk, Marek Sokolowski
Detecting Points in Integer Cones of Polytopes is Double-Exponentially Hard. SOSA (2024)
Lukasz Kowalik
Edge-coloring sparse graphs with Δ colors in quasilinear time. CoRR (2024)
Lukasz Kowalik, Alexandra Lassota, Konrad Majewski, Michal Pilipczuk, Marek Sokolowski
Detecting Points in Integer Cones of Polytopes is Double-Exponentially Hard. CoRR (2023)
Marthe Bonamy, Jadwiga Czyzewska, Lukasz Kowalik, Michal Pilipczuk
Partitioning edges of a planar graph into linear forests and a matching. J. Graph Theory 104 (3) (2023)
Marthe Bonamy, Jadwiga Czyzewska, Lukasz Kowalik, Michal Pilipczuk
Partitioning edges of a planar graph into linear forests and a matching. CoRR (2023)
Lukasz Kowalik, Shaohua Li, Wojciech Nadara, Marcin Smulewicz, Magnus Wahlström
Many-visits TSP revisited. J. Comput. Syst. Sci. 124 (2022)
Lukasz Kowalik, Shaohua Li, Wojciech Nadara, Marcin Smulewicz, Magnus Wahlström
Many Visits TSP Revisited. ESA (2020)
Lukasz Kowalik, Konrad Majewski
The Asymmetric Travelling Salesman Problem In Sparse Digraphs. IPEC (2020)
Lukasz Kowalik, Marcin Mucha, Wojciech Nadara, Marcin Pilipczuk, Manuel Sorge, Piotr Wygocki
The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth. IPEC (2020)
Lukasz Kowalik, Shaohua Li, Wojciech Nadara, Marcin Smulewicz, Magnus Wahlström
Many visits TSP revisited. CoRR (2020)
Lukasz Kowalik, Konrad Majewski
The Asymmetric Travelling Salesman Problem in Sparse Digraphs. CoRR (2020)
Édouard Bonnet, Yoichi Iwata, Bart M. P. Jansen, Lukasz Kowalik
Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP. CoRR (2019)
Édouard Bonnet, Yoichi Iwata, Bart M. P. Jansen, Lukasz Kowalik
Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP. ESA (2019)
Marthe Bonamy, Lukasz Kowalik, Michal Pilipczuk, Arkadiusz Socala, Marcin Wrochna
Tight Lower Bounds for the Complexity of Multicoloring. ACM Trans. Comput. Theory 11 (3) (2019)
Marek Cygan, Lukasz Kowalik, Arkadiusz Socala
Improving TSP Tours Using Dynamic Programming over Tree Decompositions. ACM Trans. Algorithms 15 (4) (2019)
Lukasz Kowalik, Arkadiusz Socala
Tight Lower Bounds for List Edge Coloring. SWAT (2018)
Marek Cygan, Lukasz Kowalik, Arkadiusz Socala, Krzysztof Sornat
Approximation and Parameterized Complexity of Minimax Approval Voting. J. Artif. Intell. Res. 63 (2018)
Lukasz Kowalik, Arkadiusz Socala
Tight Lower Bounds for List Edge Coloring. CoRR (2018)
Marthe Bonamy, Lukasz Kowalik, Jesper Nederlof, Michal Pilipczuk, Arkadiusz Socala, Marcin Wrochna
On Directed Feedback Vertex Set Parameterized by Treewidth. WG (2018)
Lukasz Kowalik, Juho Lauri, Arkadiusz Socala
On the Fine-Grained Complexity of Rainbow Coloring. SIAM J. Discret. Math. 32 (3) (2018)
Andreas Björklund, Petteri Kaski, Lukasz Kowalik
Counting Thin Subgraphs via Packings Faster than Meet-in-the-Middle Time. ACM Trans. Algorithms 13 (4) (2017)
Andreas Björklund, Vikram Kamat, Lukasz Kowalik, Meirav Zehavi
Spotting Trees with Few Leaves. SIAM J. Discret. Math. 31 (2) (2017)
Marthe Bonamy, Lukasz Kowalik, Michal Pilipczuk, Arkadiusz Socala
Linear Kernels for Outbranching Problems in Sparse Digraphs. Algorithmica 79 (1) (2017)
Marthe Bonamy, Lukasz Kowalik, Michal Pilipczuk, Arkadiusz Socala, Marcin Wrochna
Tight Lower Bounds for the Complexity of Multicoloring. ESA (2017)
Anna Palczewska, Jan Palczewski, Georgios Aivaliotis, Lukasz Kowalik
RobustSPAM for Inference from Noisy Longitudinal Data and Preservation of Privacy. ICMLA (2017)
Marthe Bonamy, Lukasz Kowalik, Jesper Nederlof, Michal Pilipczuk, Arkadiusz Socala, Marcin Wrochna
On Directed Feedback Vertex Set parameterized by treewidth. CoRR (2017)
Marek Cygan, Lukasz Kowalik, Arkadiusz Socala
Improving TSP Tours Using Dynamic Programming over Tree Decompositions. ESA (2017)
Marek Cygan, Lukasz Kowalik, Arkadiusz Socala
Improving TSP tours using dynamic programming over tree decomposition. CoRR (2017)
Marek Cygan, Lukasz Kowalik, Arkadiusz Socala, Krzysztof Sornat
Approximation and Parameterized Complexity of Minimax Approval Voting. AAAI (2017)
Lukasz Kowalik, Arkadiusz Socala
Assigning Channels Via the Meet-in-the-Middle Approach. Algorithmica 74 (4) (2016)
Marthe Bonamy, Lukasz Kowalik
A 13k-kernel for planar feedback vertex set via region decomposition. Theor. Comput. Sci. 645 (2016)
Lukasz Kowalik, Juho Lauri, Arkadiusz Socala
On the Fine-Grained Complexity of Rainbow Coloring. ESA (2016)
Marek Cygan, Lukasz Kowalik, Arkadiusz Socala, Krzysztof Sornat
Approximation and Parameterized Complexity of Minimax Approval Voting. CoRR (2016)
Lukasz Kowalik, Juho Lauri, Arkadiusz Socala
On the fine-grained complexity of rainbow coloring. CoRR (2016)
Marthe Bonamy, Lukasz Kowalik, Michal Pilipczuk, Arkadiusz Socala, Marcin Wrochna
Tight lower bounds for the complexity of multicoloring. CoRR (2016)
Andreas Björklund, Petteri Kaski, Lukasz Kowalik
Constrained Multilinear Detection and Generalized Graph Motifs. Algorithmica 74 (2) (2016)
Lukasz Kowalik, Juho Lauri
On finding rainbow and colorful paths. Theor. Comput. Sci. 628 (2016)
Andreas Björklund, Petteri Kaski, Lukasz Kowalik
Fast Witness Extraction Using a Decision Oracle. CoRR (2015)
Andreas Björklund, Vikram Kamat, Lukasz Kowalik, Meirav Zehavi
Spotting Trees with Few Leaves. CoRR (2015)
Andreas Björklund, Vikram Kamat, Lukasz Kowalik, Meirav Zehavi
Spotting Trees with Few Leaves. ICALP (1) (2015)
Andreas Björklund, Petteri Kaski, Lukasz Kowalik, Juho Lauri
Engineering Motif Search for Large Graphs. ALENEX (2015)
Marthe Bonamy, Lukasz Kowalik, Michal Pilipczuk, Arkadiusz Socala
Linear Kernels for Outbranching Problems in Sparse Digraphs. IPEC (2015)
Marthe Bonamy, Lukasz Kowalik, Michal Pilipczuk, Arkadiusz Socala
Linear kernels for outbranching problems in sparse digraphs. CoRR (2015)
Lukasz Kowalik, Arkadiusz Socala
Assigning channels via the meet-in-the-middle approach. CoRR (2014)
Lukasz Kowalik, Marcin Mucha
A 9k kernel for nonseparating independent set in planar graphs. Theor. Comput. Sci. 516 (2014)
Andreas Björklund, Petteri Kaski, Lukasz Kowalik
Counting Thin Subgraphs via Packings Faster Than Meet-in-the-Middle Time. SODA (2014)
Marcin Jakub Kaminski, Lukasz Kowalik
Beyond the Vizing's Bound for at Most Seven Colors. SIAM J. Discret. Math. 28 (3) (2014)
Marthe Bonamy, Lukasz Kowalik
A 14k -Kernel for Planar Feedback Vertex Set via Region Decomposition. IPEC (2014)
Andreas Björklund, Petteri Kaski, Lukasz Kowalik
Fast Witness Extraction Using a Decision Oracle. ESA (2014)
Marthe Bonamy, Lukasz Kowalik
A 13k-kernel for Planar Feedback Vertex Set via Region Decomposition. CoRR (2014)
Lukasz Kowalik, Arkadiusz Socala
Assigning Channels via the Meet-in-the-Middle Approach. SWAT (2014)
Andreas Björklund, Petteri Kaski, Lukasz Kowalik
Probably Optimal Graph Motifs. STACS (2013)
Michal Farnik, Lukasz Kowalik, Arkadiusz Socala
Beyond the Shannon's Bound. CoRR (2013)
Andreas Björklund, Petteri Kaski, Lukasz Kowalik
Counting thin subgraphs via packings faster than meet-in-the-middle time. CoRR (2013)
Lukasz Kowalik, Marcin Pilipczuk, Karol Suchan
Towards optimal kernel for connected vertex cover in planar graphs. Discret. Appl. Math. 161 (7-8) (2013)
Lukasz Kowalik
Nonblocker in H-minor free graphs: kernelization meets discharging CoRR (2012)
Andreas Björklund, Petteri Kaski, Lukasz Kowalik
Probably Optimal Graph Motifs CoRR (2012)
Lukasz Kowalik, Marcin Mucha
A 9k kernel for nonseparating independent set in planar graphs CoRR (2012)
Marcin Kaminski, Lukasz Kowalik
Beyond the Vizing's bound for at most seven colors CoRR (2012)
Lukasz Kowalik
Nonblocker in H-Minor Free Graphs: Kernelization Meets Discharging. IPEC (2012)
Marek Cygan, Jianfeng Hou, Lukasz Kowalik, Borut Luzar, Jian-Liang Wu
A Planar linear arboricity conjecture. J. Graph Theory 69 (4) (2012)
Lukasz Kowalik, Marcin Mucha
A 9k Kernel for Nonseparating Independent Set in Planar Graphs. WG (2012)
Lukasz Kowalik, Marcin Pilipczuk, Karol Suchan
Towards optimal kernel for connected vertex cover in planar graphs CoRR (2011)
Marek Cygan, Lukasz Kowalik
Channel Assignment via Fast Zeta Transform CoRR (2011)
Lukasz Kowalik, Marcin Mucha
35/44-approximation for Asymmetric Maximum TSP with Triangle Inequality. Algorithmica 59 (2) (2011)
Marek Cygan, Lukasz Kowalik
Channel assignment via fast zeta transform. Inf. Process. Lett. 111 (15) (2011)
Marek Cygan, Lukasz Kowalik, Borut Luzar
A Planar Linear Arboricity Conjecture. CIAC (2010)
Lukasz Kowalik
Fast 3-coloring Triangle-Free Planar Graphs. Algorithmica 58 (3) (2010)
Lukasz Kowalik, Borut Luzar, Riste Skrekovski
An improved bound on the largest induced forests for triangle-free planar graphs. Discret. Math. Theor. Comput. Sci. 12 (1) (2010)
Marcin Kaminski, Lukasz Kowalik
Approximating the Maximum 3- and 4-Edge-Colorable Subgraph. SWAT (2010)
Rok Erman, Lukasz Kowalik, Matjaz Krnc, Tomasz Walen
Improved induced matchings in sparse graphs. Discret. Appl. Math. 158 (18) (2010)
Marek Cygan, Lukasz Kowalik, Marcin Mucha, Marcin Pilipczuk, Piotr Sankowski
Fast Approximation in Subspaces by Doubling Metric Decomposition. ESA (1) (2010)
Marek Cygan, Lukasz Kowalik, Marcin Mucha, Marcin Pilipczuk, Piotr Sankowski
Fast Approximation in Subspaces by Doubling Metric Decomposition CoRR (2009)
Rok Erman, Lukasz Kowalik, Matjaz Krnc, Tomasz Walen
Improved Induced Matchings in Sparse Graphs. IWPEC (2009)
Lukasz Kowalik
Improved edge-coloring with three colors. Theor. Comput. Sci. 410 (38-40) (2009)
Lukasz Kowalik, Marcin Mucha
Deterministic 7/8-approximation for the metric maximum TSP. Theor. Comput. Sci. 410 (47-49) (2009)
Marek Cygan, Lukasz Kowalik, Mateusz Wykurz
Exponential-time approximation of weighted set cover. Inf. Process. Lett. 109 (16) (2009)
Lukasz Kowalik, Marcin Mucha
Two Approximation Algorithms for ATSP with Strengthened Triangle Inequality. WADS (2009)
Lukasz Kowalik, Marcin Mucha
Deterministic 7/8-Approximation for the Metric Maximum TSP. APPROX-RANDOM (2008)
Lukasz Kowalik, Jean-Sébastien Sereni, Riste Skrekovski
Total-Coloring of Plane Graphs with Maximum Degree Nine. SIAM J. Discret. Math. 22 (4) (2008)
Richard Cole, Lukasz Kowalik
New Linear-Time Algorithms for Edge-Coloring Planar Graphs. Algorithmica 50 (3) (2008)
Fedor V. Fomin, Kazuo Iwama, Dieter Kratsch, Petteri Kaski, Mikko Koivisto, Lukasz Kowalik, Yoshio Okamoto, Johan M. M. van Rooij, Ryan Williams
08431 Open Problems - Moderately Exponential Time Algorithms. Moderately Exponential Time Algorithms (2008)
Marek Cygan, Lukasz Kowalik, Marcin Pilipczuk, Mateusz Wykurz
Exponential-Time Approximation of Hard Problems CoRR (2008)
Lukasz Kowalik, Marcin Mucha
35/44-Approximation for Asymmetric Maximum TSP with Triangle Inequality. WADS (2007)
Richard Cole, Lukasz Kowalik, Riste Skrekovski
A Generalization of Kotzig's Theorem and Its Application. SIAM J. Discret. Math. 21 (1) (2007)
Lukasz Kowalik
Adjacency queries in dynamic sparse graphs. Inf. Process. Lett. 102 (5) (2007)
Lukasz Kowalik, Maciej Kurowski
Oracles for bounded-length shortest paths in planar graphs. ACM Trans. Algorithms 2 (3) (2006)
Marek Chrobak, Christoph Dürr, Wojciech Jawor, Lukasz Kowalik, Maciej Kurowski
A Note on Scheduling Equal-Length Jobs to Maximize Throughput. J. Sched. 9 (1) (2006)
Lukasz Kowalik
Approximation Scheme for Lowest Outdegree Orientation and Graph Density Measures. ISAAC (2006)
Lukasz Kowalik
Improved Edge-Coloring with Three Colors. WG (2006)
Marek Chrobak, Christoph Dürr, Wojciech Jawor, Lukasz Kowalik, Maciej Kurowski
A Note on Scheduling Equal-Length Jobs to Maximize Throughput CoRR (2004)
Lukasz Kowalik
Fast 3-Coloring Triangle-Free Planar Graphs. ESA (2004)
Lukasz Kowalik
Short Cycles in Planar Graphs. WG (2003)
Lukasz Kowalik, Maciej Kurowski
Short path queries in planar graphs in constant time. STOC (2003)
Krzysztof Diks, Lukasz Kowalik, Maciej Kurowski
A New 3-Color Criterion for Planar Graphs. WG (2002)