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