default search action
Lukasz Kowalik
Łukasz Kowalik
Person information
- affiliation: University of Warsaw
- affiliation: Max Planck Institute for Informatics, Saarbrücken, Germany
- unicode name: Łukasz Kowalik
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [c36]Lukasz Kowalik:
Edge-Coloring Sparse Graphs with Δ Colors in Quasilinear Time. ESA 2024: 81:1-81:17 - [c35]Lukasz Kowalik, Alexandra Lassota, Konrad Majewski, Michal Pilipczuk, Marek Sokolowski:
Detecting Points in Integer Cones of Polytopes is Double-Exponentially Hard. SOSA 2024: 279-285 - [i29]Lukasz Kowalik:
Edge-coloring sparse graphs with Δ colors in quasilinear time. CoRR abs/2401.13839 (2024) - 2023
- [j31]Marthe Bonamy, Jadwiga Czyzewska
, Lukasz Kowalik
Partitioning edges of a planar graph into linear forests and a matching. J. Graph Theory 104(3): 659-677 (2023) - [i28]Marthe Bonamy, Jadwiga Czyzewska, Lukasz Kowalik, Michal Pilipczuk:
Partitioning edges of a planar graph into linear forests and a matching. CoRR abs/2302.13312 (2023) - [i27]Lukasz Kowalik, Alexandra Lassota, Konrad Majewski, Michal Pilipczuk, Marek Sokolowski:
Detecting Points in Integer Cones of Polytopes is Double-Exponentially Hard. CoRR abs/2307.00406 (2023) - 2022
- [j30]Lukasz Kowalik
Many-visits TSP revisited. J. Comput. Syst. Sci. 124: 112-128 (2022) - 2021
- [e1]Lukasz Kowalik
Graph-Theoretic Concepts in Computer Science - 47th International Workshop, WG 2021, Warsaw, Poland, June 23-25, 2021, Revised Selected Papers. Lecture Notes in Computer Science 12911, Springer 2021, ISBN 978-3-030-86837-6 [contents] - 2020
- [c34]Lukasz Kowalik
Many Visits TSP Revisited. ESA 2020: 66:1-66:22 - [c33]Lukasz Kowalik
The Asymmetric Travelling Salesman Problem In Sparse Digraphs. IPEC 2020: 23:1-23:18 - [c32]Lukasz Kowalik
The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth. IPEC 2020: 37:1-37:18 - [i26]Lukasz Kowalik, Shaohua Li, Wojciech Nadara, Marcin Smulewicz, Magnus Wahlström:
Many visits TSP revisited. CoRR abs/2005.02329 (2020) - [i25]Lukasz Kowalik, Konrad Majewski:
The Asymmetric Travelling Salesman Problem in Sparse Digraphs. CoRR abs/2007.12120 (2020)
2010 – 2019
- 2019
- [j29]Marek Cygan, Lukasz Kowalik
Improving TSP Tours Using Dynamic Programming over Tree Decompositions. ACM Trans. Algorithms 15(4): 54:1-54:19 (2019) - [j28]Marthe Bonamy, Lukasz Kowalik
Tight Lower Bounds for the Complexity of Multicoloring. ACM Trans. Comput. Theory 11(3): 13:1-13:19 (2019) - [c31]Édouard Bonnet, Yoichi Iwata, Bart M. P. Jansen
Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP. ESA 2019: 23:1-23:14 - [i24]Édouard Bonnet, Yoichi Iwata, Bart M. P. Jansen, Lukasz Kowalik:
Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP. CoRR abs/1908.09325 (2019) - 2018
- [j27]Marek Cygan, Lukasz Kowalik
Approximation and Parameterized Complexity of Minimax Approval Voting. J. Artif. Intell. Res. 63: 495-513 (2018) - [j26]Lukasz Kowalik
On the Fine-Grained Complexity of Rainbow Coloring. SIAM J. Discret. Math. 32(3): 1672-1705 (2018) - [c30]Lukasz Kowalik
Tight Lower Bounds for List Edge Coloring. SWAT 2018: 28:1-28:12 - [c29]Marthe Bonamy, Lukasz Kowalik, Jesper Nederlof, Michal Pilipczuk
On Directed Feedback Vertex Set Parameterized by Treewidth. WG 2018: 65-78 - [i23]Lukasz Kowalik, Arkadiusz Socala:
Tight Lower Bounds for List Edge Coloring. CoRR abs/1804.02537 (2018) - 2017
- [j25]Marthe Bonamy, Lukasz Kowalik
Linear Kernels for Outbranching Problems in Sparse Digraphs. Algorithmica 79(1): 159-188 (2017) - [j24]Andreas Björklund, Vikram Kamat, Lukasz Kowalik
Spotting Trees with Few Leaves. SIAM J. Discret. Math. 31(2): 687-713 (2017) - [j23]Andreas Björklund, Petteri Kaski, Lukasz Kowalik
Counting Thin Subgraphs via Packings Faster than Meet-in-the-Middle Time. ACM Trans. Algorithms 13(4): 48:1-48:26 (2017) - [c28]Marek Cygan, Lukasz Kowalik
Approximation and Parameterized Complexity of Minimax Approval Voting. AAAI 2017: 459-465 - [c27]Marthe Bonamy, Lukasz Kowalik
Tight Lower Bounds for the Complexity of Multicoloring. ESA 2017: 18:1-18:14 - [c26]Marek Cygan
Improving TSP Tours Using Dynamic Programming over Tree Decompositions. ESA 2017: 30:1-30:14 - [c25]Anna Palczewska, Jan Palczewski, Georgios Aivaliotis, Lukasz Kowalik
RobustSPAM for Inference from Noisy Longitudinal Data and Preservation of Privacy. ICMLA 2017: 344-351 - [i22]Marek Cygan, Lukasz Kowalik, Arkadiusz Socala:
Improving TSP tours using dynamic programming over tree decomposition. CoRR abs/1703.05559 (2017) - [i21]Marthe Bonamy, Lukasz Kowalik, Jesper Nederlof, Michal Pilipczuk, Arkadiusz Socala, Marcin Wrochna:
On Directed Feedback Vertex Set parameterized by treewidth. CoRR abs/1707.01470 (2017) - 2016
- [j22]Andreas Björklund, Petteri Kaski, Lukasz Kowalik
Constrained Multilinear Detection and Generalized Graph Motifs. Algorithmica 74(2): 947-967 (2016) - [j21]Lukasz Kowalik
Assigning Channels Via the Meet-in-the-Middle Approach. Algorithmica 74(4): 1435-1452 (2016) - [j20]Lukasz Kowalik
On finding rainbow and colorful paths. Theor. Comput. Sci. 628: 110-114 (2016) - [j19]Marthe Bonamy, Lukasz Kowalik
A 13k-kernel for planar feedback vertex set via region decomposition. Theor. Comput. Sci. 645: 25-40 (2016) - [c24]Lukasz Kowalik
On the Fine-Grained Complexity of Rainbow Coloring. ESA 2016: 58:1-58:16 - [i20]Lukasz Kowalik, Juho Lauri, Arkadiusz Socala:
On the fine-grained complexity of rainbow coloring. CoRR abs/1602.05608 (2016) - [i19]Marthe Bonamy, Lukasz Kowalik, Michal Pilipczuk, Arkadiusz Socala, Marcin Wrochna:
Tight lower bounds for the complexity of multicoloring. CoRR abs/1607.03432 (2016) - [i18]Marek Cygan, Lukasz Kowalik, Arkadiusz Socala, Krzysztof Sornat:
Approximation and Parameterized Complexity of Minimax Approval Voting. CoRR abs/1607.07906 (2016) - 2015
- [b1]Marek Cygan, Fedor V. Fomin, Lukasz Kowalik
Parameterized Algorithms. Springer 2015, ISBN 978-3-319-21274-6, pp. 3-555 - [c23]Andreas Björklund, Petteri Kaski, Lukasz Kowalik
Engineering Motif Search for Large Graphs. ALENEX 2015: 104-118 - [c22]Andreas Björklund, Vikram Kamat, Lukasz Kowalik, Meirav Zehavi
Spotting Trees with Few Leaves. ICALP (1) 2015: 243-255 - [c21]Marthe Bonamy, Lukasz Kowalik
Linear Kernels for Outbranching Problems in Sparse Digraphs. IPEC 2015: 199-211 - [i17]Andreas Björklund, Vikram Kamat, Lukasz Kowalik, Meirav Zehavi:
Spotting Trees with Few Leaves. CoRR abs/1501.00563 (2015) - [i16]Andreas Björklund, Petteri Kaski, Lukasz Kowalik:
Fast Witness Extraction Using a Decision Oracle. CoRR abs/1508.03572 (2015) - [i15]Marthe Bonamy, Lukasz Kowalik, Michal Pilipczuk, Arkadiusz Socala:
Linear kernels for outbranching problems in sparse digraphs. CoRR abs/1509.01675 (2015) - 2014
- [j18]Marcin Jakub Kaminski, Lukasz Kowalik
Beyond the Vizing's Bound for at Most Seven Colors. SIAM J. Discret. Math. 28(3): 1334-1362 (2014) - [j17]Lukasz Kowalik
A 9k kernel for nonseparating independent set in planar graphs. Theor. Comput. Sci. 516: 86-95 (2014) - [c20]Andreas Björklund, Petteri Kaski, Lukasz Kowalik:
Fast Witness Extraction Using a Decision Oracle. ESA 2014: 149-160 - [c19]Marthe Bonamy, Lukasz Kowalik:
A 14k -Kernel for Planar Feedback Vertex Set via Region Decomposition. IPEC 2014: 97-109 - [c18]Andreas Björklund, Petteri Kaski, Lukasz Kowalik
Counting Thin Subgraphs via Packings Faster Than Meet-in-the-Middle Time. SODA 2014: 594-603 - [c17]Lukasz Kowalik, Arkadiusz Socala:
Assigning Channels via the Meet-in-the-Middle Approach. SWAT 2014: 282-293 - [i14]Lukasz Kowalik, Arkadiusz Socala:
Assigning channels via the meet-in-the-middle approach. CoRR abs/1407.7161 (2014) - [i13]Marthe Bonamy, Lukasz Kowalik:
A 13k-kernel for Planar Feedback Vertex Set via Region Decomposition. CoRR abs/1410.8336 (2014) - 2013
- [j16]Lukasz Kowalik
Towards optimal kernel for connected vertex cover in planar graphs. Discret. Appl. Math. 161(7-8): 1154-1161 (2013) - [c16]Andreas Björklund, Petteri Kaski, Lukasz Kowalik
Probably Optimal Graph Motifs. STACS 2013: 20-31 - [i12]Andreas Björklund, Petteri Kaski, Lukasz Kowalik:
Counting thin subgraphs via packings faster than meet-in-the-middle time. CoRR abs/1306.4111 (2013) - [i11]Michal Farnik, Lukasz Kowalik, Arkadiusz Socala:
Beyond the Shannon's Bound. CoRR abs/1309.6069 (2013) - 2012
- [j15]Marek Cygan
A Planar linear arboricity conjecture. J. 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 - [i10]Lukasz Kowalik, Marcin Mucha:
A 9k kernel for nonseparating independent set in planar graphs. CoRR abs/1207.4666 (2012) - [i9]Lukasz Kowalik:
Nonblocker in H-minor free graphs: kernelization meets discharging. CoRR abs/1207.4681 (2012) - [i8]Andreas Björklund, Petteri Kaski, Lukasz Kowalik:
Probably Optimal Graph Motifs. CoRR abs/1209.1082 (2012) - [i7]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
Channel assignment via fast zeta transform. Inf. Process. Lett. 111(15): 727-730 (2011) - [i6]Marek Cygan, Lukasz Kowalik:
Channel Assignment via Fast Zeta Transform. CoRR abs/1103.2275 (2011) - [i5]Lukasz Kowalik, Marcin Pilipczuk, Karol Suchan:
Towards optimal kernel for connected vertex cover in planar graphs. CoRR abs/1110.1964 (2011) - 2010
- [j12]Lukasz Kowalik:
Fast 3-coloring Triangle-Free Planar Graphs. Algorithmica 58(3): 770-789 (2010) - [j11]Rok Erman, Lukasz Kowalik, Matjaz Krnc
Improved induced matchings in sparse graphs. Discret. Appl. Math. 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. Discret. Math. Theor. Comput. Sci. 12(1): 87-100 (2010) - [c13]Marek Cygan
A Planar Linear Arboricity Conjecture. CIAC 2010: 204-216 - [c12]Marek Cygan
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
2000 – 2009
- 2009
- [j9]Marek Cygan
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
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 - [i4]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. Discret. 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 - [i3]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 - [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. Discret. 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. Sched. 9(1): 71-73 (2006) - [j1]Lukasz Kowalik, Maciej Kurowski:
Oracles for bounded-length shortest paths in planar graphs. ACM Trans. Algorithms 2(3): 335-363 (2006) - [c6]Lukasz Kowalik:
Approximation Scheme for Lowest Outdegree Orientation and Graph Density Measures. ISAAC 2006: 557-566 - [c5]Lukasz Kowalik:
Improved Edge-Coloring with Three Colors. WG 2006: 90-101 - 2004
- [c4]Lukasz Kowalik:
Fast 3-Coloring Triangle-Free Planar Graphs. ESA 2004: 436-447 - [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]Lukasz Kowalik:
Short Cycles in Planar Graphs. WG 2003: 284-296 - 2002
- [c1]Krzysztof Diks, Lukasz Kowalik, Maciej Kurowski:
A New 3-Color Criterion for Planar Graphs. WG 2002: 138-149
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-26 01:01 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: