Wydział Matematyki, Informatyki i Mechaniki Uniwersytetu Warszawskiego
Publications
Łukasz Kowalik
2018
- Łukasz Kowalik, Juho Lauri and Arkadiusz Aleksander Socała, On the Fine-Grained Complexity of Rainbow Coloring, Siam Journal On Discrete Mathematics 32 (3) 2018, p. 1672–1705.see in PBN
- Łukasz Kowalik and Arkadiusz Aleksander Socała, Tight Lower Bounds for List Edge Coloring, in: 16th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT, 2018, June 18-20, 2018, Malmo, Sweden, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018, p. 28:1––28:12.see in PBN
- Marthe Bonamy, Łukasz Kowalik, Jesper Nederlof, Michał Pilipczuk, Arkadiusz Aleksander Socała and Marcin Wrochna, On Directed Feedback Vertex Set Parameterized by Treewidth, in: Graph-Theoretic Concepts in Computer Science - 44th International Workshop, WG 2018, Cottbus, Germany, June 27-29, 2018, Proceedings, Springer, 2018, p. 65–78.see in PBN
- Marek Adam Cygan, Łukasz Kowalik, Arkadiusz Aleksander Socała and Krzysztof Sornat, Approximation and Parameterized Complexity of Minimax Approval Voting, Journal Of Artificial Intelligence Research 63 2018, p. 495–513.see in PBN
2017
- Marek Adam Cygan, Łukasz Kowalik, Arkadiusz Aleksander Socała and Krzysztof Sornat, Approximation and Parameterized Complexity of Minimax Approval Voting, in: Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, February 4-9, 2017, San Francisco, California, USA., 2017, p. 459–465.see in PBN
- Marek Adam Cygan, Łukasz Kowalik and Arkadiusz Aleksander Socała, Improving TSP Tours Using Dynamic Programming over Tree Decompositions, in: 25th Annual European Symposium on Algorithms, ESA 2017, September 4-6, 2017, Vienna, Austria, 2017, p. 30:1–30:14.see in PBN
- Marthe Bonamy, Łukasz Kowalik, Michał Pilipczuk and Arkadiusz Aleksander Socała, Linear Kernels for Outbranching Problems in Sparse Digraphs, Algorithmica 79 (1) 2017, p. 159–188.see in PBN
- Marthe Bonamy, Łukasz Kowalik, Michał Pilipczuk, Arkadiusz Aleksander Socała and Marcin Wrochna, Tight Lower Bounds for the Complexity of Multicoloring, in: 25th Annual European Symposium on Algorithms, ESA 2017, September 4-6, 2017, Vienna, Austria, 2017, p. 18:1–18:14.see in PBN
- Andreas Björklund, Vikram Kamat, Łukasz Kowalik and Meirav Zehavi, Spotting Trees with Few Leaves, Siam Journal On Discrete Mathematics 31 (2) 2017, p. 687–713.see in PBN
- Andreas Björklund, Petteri Kaski and Łukasz Kowalik, Counting Thin Subgraphs via Packings Faster than Meet-in-the-Middle Time, Acm Transactions On Algorithms 13 (4) 2017, p. 48:1–48:26.see in PBN
- Anna Palczewska, Jan Palczewski, Georgios Aivaliotis and Łukasz Kowalik, RobustSPAM for Inference from Noisy Longitudinal Data and Preservation of Privacy, in: 6th IEEE International Conference on Machine Learning and Applications, 2017, p. 344–351.see in PBN
2016
- Łukasz Kowalik and Arkadiusz Aleksander Socała, Assigning Channels Via the Meet-in-the-Middle Approach, Algorithmica 74 (4) 2016, p. 1435–1452.see in PBN
- Łukasz Kowalik, Juho Lauri and Arkadiusz Aleksander Socała, On the Fine-Grained Complexity of Rainbow Coloring, in: 24th Annual European Symposium on Algorithms, ESA 2016, August 22-24, 2016, Aarhus, Denmark, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2016, p. 58:1–58:16.see in PBN
- Andreas Bjorklund, Petteri Kaski and Łukasz Kowalik, Constrained Multilinear Detection and Generalized Graph Motifs, Algorithmica 74 (2) 2016, p. 947–967.see in PBN
- Łukasz Kowalik and Juho Lauri, On finding rainbow and colorful paths, Theoretical Computer Science 628 2016, p. 110–114.see in PBN
- Marthe Bonamy and Łukasz Kowalik, A 13k-kernel for planar feedback vertex set via region decomposition, Theoretical Computer Science 645 2016, p. 25–40.see in PBN
2015
- Andreas Bjorklund, Petteri Kaski, Łukasz Kowalik and Juho Lauri, Engineering Motif Search for Large Graphs, in: Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments, ALENEX 2015, 2015.see in PBN
- Marek Adam Cygan, Fedor Fomin, Łukasz Kowalik, Daniel Lokshtanov, Daniel Marx, Marcin Pilipczuk, Michał Pilipczuk and Saket Saurabh, Parameterized Algorithms, Springer, 2015.see in PBN
- Andreas Björklund, Vikram Kamat, Łukasz Kowalik and Meirav Zehavi, Spotting Trees with Few Leaves, in: Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Springer, 2015.see in PBN
- Marthe Bonamy, Łukasz Kowalik, Arkadiusz Aleksander Socała and Michał Pilipczuk, Linear Kernels for Outbranching Problems in Sparse Digraphs, in: 10th International Symposium on Parameterized and Exact Computation, IPEC 2015, 2015, p. 199–211.see in PBN
2014
- Łukasz Kowalik and Marcin Ireneusz Mucha, A 9k kernel for nonseparating independent set in planar graphs, Theoretical Computer Science 2014.see in PBN
- Andreas Bjorklund, Petteri Kaski and Łukasz Kowalik, Counting Thin Subgraphs via Packings Faster Than Meet-in-the-Middle Time, in: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014, Portland, Oregon, USA, 2014.see in PBN
- Łukasz Kowalik and Arkadiusz Aleksander Socała, Assigning Channels via the Meet-in-the-Middle Approach, in: Algorithm Theory - SWAT 2014 - 14th Scandinavian Symposium and Workshops, 2014.see in PBN
- Marthe Bonamy and Łukasz Kowalik, A 14k -Kernel for Planar Feedback Vertex Set via Region Decomposition, in: 9th International Symposium on Parameterized and Exact Computation (IPEC 2014), 2014.see in PBN
- Andreas Bjorklund, Petteri Kaski and Łukasz Kowalik, Fast Witness Extraction Using a Decision Oracle, in: Algorithms - ESA 2014 - 22th Annual European Symposium, 2014.see in PBN
- Marcin Kamiński and Łukasz Kowalik, Beyond the Vizing's Bound for at Most Seven Colors, Siam Journal On Discrete Mathematics 28 (3) 2014, p. 1334–1362.see in PBN
2013
- Łukasz Kowalik, Marcin Pilipczuk and Karol Suchan, Towards optimal kernel for connected vertex cover in planar graphs, Discrete Applied Mathematics 161 2013, p. 1154–1161.see in PBN
- Andreas Bjorklund, Petteri Kaski and Łukasz Kowalik, Probably Optimal Graph Motifs, in: 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013), Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany 2013.see in PBN
2012
- Marek Cygan, Jian-Feng Hou, Łukasz Kowalik, Borut Luzar and Jian-Liang Wu, A Planar linear arboricity conjecture, Journal Of Graph Theory 69 (4) 2012, p. 403–425.see in PBN
- Łukasz Kowalik and Marcin Ireneusz Mucha, A 9k Kernel for Nonseparating Independent Set in Planar Graphs, in: Graph-Theoretic Concepts in Computer Science - 38th International Workshop, Springer, 2012.see in PBN
- Łukasz Kowalik, Nonblocker in H-Minor Free Graphs: Kernelization Meets Discharging, in: 7th International Symposium on Parameterized and Exact Computation (IPEC 2012), Springer, 2012, p. 61–72.see in PBN
2010
- Marek Cygan, Łukasz Kowalik and Borut Luzar, A Planar Linear Arboricity Conjecture, Lecture Notes In Computer Science 6078 2010, p. 204–216.see in PBN
- Marek Cygan, Łukasz Kowalik, Marcin Mucha, Marcin Pilipczuk and Piotr Sankowski, Fast Approximation in Subspaces by Doubling Metric Decomposition, Lecture Notes In Computer Science 6346 2010, p. 72–83.see in PBN
- Marcin Kamiński and Łukasz Kowalik, Approximating the Maximum 3- and 4-Edge-Colorable Subgraph, Lecture Notes In Computer Science 6139 2010, p. 395–407.see in PBN
- Łukasz Kowalik, Fast 3-coloring Triangle-Free Planar Graphs, Algorithmica 58 (3) 2010, p. 770–789.see in PBN
- Rok Erman, Łukasz Kowalik, Matjaz Krnc and Tomasz Waleń, Improved induced matchings in sparse graphs, Discrete Applied Mathematics 158 (18) 2010, p. 1994–2003.see in PBN
- Łukasz Kowalik, Borut Luzar and Riste Skrekovski, An improved bound on the largest induced forests for triangle-free planar graphs, Discrete Mathematics And Theoretical Computer Science 12 (1) 2010, p. 87–100.see in PBN
2009
- Łukasz Kowalik and Marcin Mucha, Deterministic 7/8-approximation for the Metric Maximum TSP, Theoretical Computer Science 410 2009, p. 5000–5009.see in PBN
- Rok Erman, Łukasz Kowalik, Matjaz Krnc and Tomasz Waleń, Improved Induced Matchings in Sparse Graphs, Lecture Notes In Computer Science 5917 2009, p. 134–148.see in PBN
- Łukasz Kowalik and Marcin Mucha, Two Approximation Algorithms for ATSP with Strengthened Triangle Inequality, Lecture Notes In Computer Science 5664 2009, p. 471–482.see in PBN
- Marek Cygan, Łukasz Kowalik and Mateusz Wykurz, Exponential-time approximation of weighted set cover, Information Processing Letters 109 (16) 2009, p. 957–961.see in PBN
- Łukasz Kowalik, Improved edge-coloring with three colors, Theoretical Computer Science 410 (38-40) 2009, p. 3733–3742.see in PBN
2008
- Richard Cole and Łukasz Kowalik, New Linear-Time Algortihms for Edge-Coloring Planar Graphs, Algorithmica 50 (3) 2008, p. 351–368.see in PBN
- Łukasz Kowalik and Marcin Mucha, Deterministic 7/8-Approximation for the Metric Maximum TSP, in: APPROX-RANDOM, 2008.see in PBN
- Jean-Sebastien Sereni, Łukasz Kowalik and Riste Skrekovski, Total colouring of plane graphs with maximum degree nine, Siam Journal On Discrete Mathematics 22 (4) 2008, p. 1462––1479.see in PBN
2007
- Łukasz Kowalik, Adjacency Queries in Dynamic Sparse Graphs, Information Processing Letters 102 (5) 2007, p. 191–195.see in PBN
- Richard Cole, Łukasz Kowalik and Riste Skrekovski, A Generalization of Kotzig's Theorem and its Application, Siam Journal On Discrete Mathematics 21 (1) 2007, p. 93–106.see in PBN
- Łukasz Kowalik and Marcin Mucha, 35/44-Approximation for Asymmetric Maximum TSP with Triangle Inequality, Lecture Notes In Computer Science 4619 2007, p. 589–600.see in PBN
2006
- Marek Chrobak, C. Durr, W. Jawor, Łukasz Kowalik and Maciej Kurowski, A Note on Scheduling Equal-Length Jobs to Maximize Throughput, Journal Of Scheduling 9 (1) 2006, p. 71–73.see in PBN
- Łukasz Kowalik, Improved Edge Coloring with Three Colors, Lecture Notes In Computer Science 4271 2006, p. 90–101.see in PBN
- Łukasz Kowalik, Approximation Scheme for Lowest Outdegree Orientation and Graph Density Measures, Lecture Notes In Computer Science 4288 2006, p. 557–566.see in PBN
- Łukasz Kowalik and Maciej Kurowski, Oracles for Bounded Length Shortest Paths in Planar Graphs, Acm Transactions On Algorithms 2 (3) 2006, p. 335–363.see in PBN
2003
- Łukasz Kowalik, Short Cycles in Planar Graphs, Lecture Notes In Computer Science 2880 2003, p. 284–296.see in PBN
- Łukasz Kowalik, Opracowanie zadania "Przemytnicy", in: X Olimpiada Informatyczna 2002/2003, Komitet Główny Olimpiady Informatycznej, Warszawa 2003.see in PBN
- Łukasz Kowalik and Maciej Kurowski, Short Path Queries in Planar Graphs in Constant Time, Symposium On Theory Of Computing 35 2003, p. 143–148.see in PBN
You are not logged in | log in
