Nie jesteś zalogowany | Zaloguj się

Łukasz Kowalik

Liczba publikacji: 70

2024

Łukasz Kowalik , Alexandra Lassota, Konrad Majewski , Michał Pilipczuk , Marek Sokołowski , Detecting Points in Integer Cones of Polytopes is Double-Exponentially Hard, 7th Symposium on Simplicity in Algorithms, Alexandria, the United States of America, 8 stycznia 2024 - 10 stycznia 2024. Zobacz w PBN
Łukasz Kowalik , Edge-Coloring Sparse Graphs with Δ Colors in Quasilinear Time, 32nd Annual European Symposium on Algorithms, London, the United Kingdom of Great Britain and Northern Ireland, 2 września 2024 - 4 września 2024. Zobacz w PBN

2023

Marthe Bonamy, Jadwiga Czyżewska, Łukasz Kowalik , Michał Pilipczuk , Partitioning edges of a planar graph into linear forests and a matching, Journal of Graph Theory, 104 (3) 2023, s. 659-677. Zobacz w PBN

2022

Łukasz Kowalik , Shaohua Li, Wojciech Nadara , Marcin Smulewicz, Magnus Wahlström, Many-visits TSP revisited, Journal of Computer and System Sciences, 124 2022, s. 112-128. Zobacz w PBN

2021

Łukasz Kowalik , Michał Pilipczuk , Paweł Rzążewski , Graph-Theoretic Concepts in Computer Science : 47th International Workshop, WG 2021, Warsaw, Poland, June 23–25, 2021, Revised Selected Papers, 47th International Workshop on Graph-Theoretic Concepts in Computer Science WG 2021, Warszawa, Poland, 23 czerwca 2021 - 25 czerwca 2021. Zobacz w PBN

2020

Łukasz Kowalik , Shaohua Li, Wojciech Nadara , Marcin Smulewicz, Magnus Wahlström, Many Visits TSP Revisited, 28th Annual European Symposium on Algorithms, Pisa, Italy, 7 września 2020 - 9 września 2020. Zobacz w PBN
Łukasz Kowalik , Konrad Majewski , The Asymmetric Travelling Salesman Problem In Sparse Digraphs, 15th International Symposium on Parameterized and Exact Computation (IPEC 2020), Hong Kong, China, 14 grudnia 2020 - 18 grudnia 2020. Zobacz w PBN
Łukasz Kowalik , Marcin Mucha , Wojciech Nadara , Marcin Pilipczuk , Manuel Sorge, Piotr Wygocki , The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth, 15th International Symposium on Parameterized and Exact Computation (IPEC 2020), Hong Kong, China, 14 grudnia 2020 - 18 grudnia 2020. Zobacz w PBN

2019

Edouard Bonnet, Yoichi Iwata, Bart M. Jansen, Łukasz Kowalik , Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP, 27th Annual European Symposium on Algorithms (ESA 2019), Monachium, Germany, 9 września 2019 - 13 września 2019, 144 2019, s. 23:1--23:14. Zobacz w PBN
Marek Cygan , Łukasz Kowalik , Arkadiusz Socała, Improving TSP Tours Using Dynamic Programming over Tree Decompositions, ACM Transactions on Algorithms, 15 (4) 2019, s. 1-19. Zobacz w PBN
Marthe Bonamy, Łukasz Kowalik , Michał Pilipczuk , Arkadiusz Socała, Marcin Wrochna , Tight Lower Bounds for the Complexity of Multicoloring, ACM Transactions on Computation Theory, 11 (3) 2019, s. 1-19. Zobacz w PBN

2018

Marek Cygan , Łukasz Kowalik , Arkadiusz Socała, Krzysztof Sornat, Approximation and Parameterized Complexity of Minimax Approval Voting, Journal of Artificial Intelligence Research, 63 2018, s. 495 - 513. Zobacz w PBN
Marthe Bonamy, Łukasz Kowalik , Jesper Nederlof, Michał Pilipczuk , Arkadiusz Socała, Marcin Wrochna , On Directed Feedback Vertex Set Parameterized by Treewidth, 44th International Workshop on Graph-Theoretic Concepts in Computer, Cottbus, Germany, 27 czerwca 2018 - 29 czerwca 2018. Zobacz w PBN
Łukasz Kowalik , Juho Lauri, Arkadiusz Socała, On the Fine-Grained Complexity of Rainbow Coloring, SIAM JOURNAL ON DISCRETE MATHEMATICS, 32 (3) 2018, s. 1672–1705. Zobacz w PBN

2017

Marek Cygan , Łukasz Kowalik , Arkadiusz Socała, Krzysztof Sornat, Approximation and Parameterized Complexity of Minimax Approval Voting, 31st AAAI Conference on Artificial Intelligence, San Francisco, the United States of America, 4 lutego 2017 - 9 lutego 2017. Zobacz w PBN
Andreas Björklund, Petteri Kaski, Łukasz Kowalik , Counting Thin Subgraphs via Packings Faster than Meet-in-the-Middle Time, ACM Transactions on Algorithms, 13 (4) 2017, s. 1-26. Zobacz w PBN
Marek Cygan , Łukasz Kowalik , Arkadiusz Socała, Improving TSP Tours Using Dynamic Programming over Tree Decompositions, 25th Annual European Symposium on Algorithms, Vienna, Austria, 4 września 2017 - 6 września 2017. Zobacz w PBN
Marthe Bonamy, Łukasz Kowalik , Michał Pilipczuk , Arkadiusz Socała, Linear Kernels for Outbranching Problems in Sparse Digraphs, Algorithmica, 79 (1) 2017, s. 159–188. Zobacz w PBN
Anna Palczewska, Jan Palczewski, Georgios Aivaliotis, Łukasz Kowalik , RobustSPAM for Inference from Noisy Longitudinal Data and Preservation of Privacy, 16th IEEE International Conference On Machine Learning And Applications, Cancun, Mexico, 17 grudnia 2017 - 18 grudnia 2017. Zobacz w PBN
Andreas Björklund, Vikram Kamat, Łukasz Kowalik , Meirav Zehavi, Spotting Trees with Few Leaves, SIAM JOURNAL ON DISCRETE MATHEMATICS, 31 (2) 2017, s. 687–713. Zobacz w PBN
Marthe Bonamy, Łukasz Kowalik , Michał Pilipczuk , Arkadiusz Socała, Marcin Wrochna , Tight Lower Bounds for the Complexity of Multicoloring, 25th Annual European Symposium on Algorithms, Vienna, Austria, 4 września 2017 - 6 września 2017, 87 2017, s. 18:1--18:14. Zobacz w PBN

2016

Łukasz Kowalik , Marthe Bonamy, A 13k-kernel for planar feedback vertex set via region decomposition, Theoretical Computer Science, 645 2016, s. 25-40. Zobacz w PBN
Łukasz Kowalik , Arkadiusz Socała, Assigning Channels Via the Meet-in-the-Middle Approach, Algorithmica, 2016. Zobacz w PBN
Łukasz Kowalik , Andreas Bjorklund, Petteri Kaski, Constrained Multilinear Detection and Generalized Graph Motifs, Algorithmica, 74 (2) 2016, s. 947-967. Zobacz w PBN
Łukasz Kowalik , Juho Lauri, On finding rainbow and colorful paths, Theoretical Computer Science, 628 2016, s. 110-114. Zobacz w PBN
Łukasz Kowalik , Juho Lauri, Arkadiusz Socała, On the Fine-Grained Complexity of Rainbow Coloring, 2016. Zobacz w PBN

2015

Andreas Bjorklund, Petteri Kaski, Łukasz Kowalik , Juho Lauri, Engineering Motif Search for Large Graphs, Seventeenth Workshop on Algorithm Engineering and Experiments, ALENEX 2015, San Diego, the United States of America, 2015. Zobacz w PBN
Marthe Bonamy, Łukasz Kowalik , Arkadiusz Socała, Michał Pilipczuk , Linear Kernels for Outbranching Problems in Sparse Digraphs, 10th International Symposium on Parameterized and Exact Computation, Patras, Greece, 16 września 2015 - 18 września 2015. Zobacz w PBN
Marek Cygan , Fedor Fomin, Łukasz Kowalik , Daniel Lokshtanov, Daniel Marx, Marcin Pilipczuk , Michał Pilipczuk , Saket Saurabh, Parameterized Algorithms, 2015. Zobacz w PBN
Andreas Björklund, Vikram Kamat, Łukasz Kowalik , Meirav Zehavi, Spotting Trees with Few Leaves, Automata, Languages, and Programming - 42th International Colloquium, Kyoto, Japan, 6 lipca 2015 - 10 lipca 2015. Zobacz w PBN

2014

Marthe Bonamy, Łukasz Kowalik , A 14k -Kernel for Planar Feedback Vertex Set via Region Decomposition, 9th International Symposium on Parameterized and Exact Computation, IPEC 2014, 2014. Zobacz w PBN
Łukasz Kowalik , Marcin Mucha , A 9k kernel for nonseparating independent set in planar graphs, Theoretical Computer Science, 516 2014, s. 86-95. Zobacz w PBN
Łukasz Kowalik , Arkadiusz Socała, Assigning Channels via the Meet-in-the-Middle Approach, SWAT 2014 - 14th Scandinavian Symposium and Workshops on Algorithm Theory, 2014. Zobacz w PBN
Marcin Kamiński, Ł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
Andreas Bjorklund, Petteri Kaski, Łukasz Kowalik , Counting Thin Subgraphs via Packings Faster Than Meet-in-the-Middle Time, 2014. Zobacz w PBN
Andreas Bjorklund, Petteri Kaski, Łukasz Kowalik , Fast Witness Extraction Using a Decision Oracle, 22th Annual European Symposium on Algorithms - ESA 2014, 2014. Zobacz w PBN

2013

Andreas Bjorklund, Petteri Kaski, Łukasz Kowalik , Probably Optimal Graph Motifs, 30th International Symposium on Theoretical Aspects of Computer Science, Kiel, Germany, 27 lutego 2013 - 2 marca 2013. Zobacz w PBN
Łukasz Kowalik , Marcin Pilipczuk , Karol Suchan, Towards optimal kernel for connected vertex cover in planar graphs, Discrete Applied Mathematics, 2013. Zobacz w PBN

2012

Łukasz Kowalik , Marcin Mucha , A 9k Kernel for Nonseparating Independent Set in Planar Graphs, 2012. Zobacz w PBN
Marek Cygan , Jian-Feng Hou, Łukasz Kowalik , Borut Luzar, Jian-Liang Wu, A Planar linear arboricity conjecture, Journal of Graph Theory, 2012. Zobacz w PBN
Łukasz Kowalik , Nonblocker in H-Minor Free Graphs: Kernelization Meets Discharging, Parameterized and Exact Computation - 7th International Symposium, 2012. Zobacz w PBN

2011

Łukasz Kowalik , Marcin Mucha , 35/44-approximation for Asymmetric Maximum TSP with Triangle Inequality, Algorithmica, 2011. Zobacz w PBN
Marek Cygan, Łukasz Kowalik , Channel assignment via fast zeta transform, Information Processing Letters, 2011. Zobacz w PBN

2010

Marek Cygan, Łukasz Kowalik , Borut Luzar, A Planar Linear Arboricity Conjecture, Lecture Notes in Computer Science, 2010. Zobacz w PBN
Łukasz Kowalik , Borut Luzar, Riste Skrekovski, An improved bound on the largest induced forests for triangle-free planar graphs, 2010. Zobacz w PBN
Marcin Kamiński, Łukasz Kowalik , Approximating the Maximum 3- and 4-Edge-Colorable Subgraph, Lecture Notes in Computer Science, 2010. Zobacz w PBN
Łukasz Kowalik , Fast 3-coloring Triangle-Free Planar Graphs, Algorithmica, 2010. Zobacz w PBN
Marek Cygan, Łukasz Kowalik , Marcin Mucha , Marcin Pilipczuk, Piotr Sankowski , Fast Approximation in Subspaces by Doubling Metric Decomposition, Lecture Notes in Computer Science, 2010. Zobacz w PBN
Rok Erman, Łukasz Kowalik , Matjaz Krnc, Tomasz Waleń , Improved induced matchings in sparse graphs, Discrete Applied Mathematics, 2010. Zobacz w PBN

2009

Łukasz Kowalik , Marcin Mucha , Deterministic 7/8-approximation for the Metric Maximum TSP, Theoretical Computer Science, 2009. Zobacz w PBN
Marek Cygan, Łukasz Kowalik , Mateusz Wykurz, Exponential-time approximation of weighted set cover, Information Processing Letters, 2009. Zobacz w PBN
Łukasz Kowalik , Improved edge-coloring with three colors, Theoretical Computer Science, 2009. Zobacz w PBN
Rok Erman, Łukasz Kowalik , Matjaz Krnc, Tomasz Waleń , Improved Induced Matchings in Sparse Graphs, Lecture Notes in Computer Science, 2009. Zobacz w PBN
Łukasz Kowalik , Marcin Mucha , Two Approximation Algorithms for ATSP with Strengthened Triangle Inequality, Lecture Notes in Computer Science, 2009. Zobacz w PBN

2008

Łukasz Kowalik , Marcin Mucha , Deterministic 7/8-Approximation for the Metric Maximum TSP, 2008. Zobacz w PBN
Richard Cole, Łukasz Kowalik , New Linear-Time Algortihms for Edge-Coloring Planar Graphs, Algorithmica, 2008. Zobacz w PBN
Łukasz Kowalik , Jean-Sebastien Sereni, Riste Skrekovski, Total colouring of plane graphs with maximum degree nine, SIAM JOURNAL ON DISCRETE MATHEMATICS, 2008. Zobacz w PBN

2007

Łukasz Kowalik , Marcin Mucha , 35/44-Approximation for Asymmetric Maximum TSP with Triangle Inequality, Lecture Notes in Computer Science, 2007. Zobacz w PBN
Richard Cole, Łukasz Kowalik , Riste Skrekovski, A Generalization of Kotzig's Theorem and its Application, SIAM JOURNAL ON DISCRETE MATHEMATICS, 2007. Zobacz w PBN
Łukasz Kowalik , Adjacency Queries in Dynamic Sparse Graphs, Information Processing Letters, 2007. Zobacz w PBN

2006

Marek Chrobak, C. Durr, W. Jawor, Łukasz Kowalik , Maciej Kurowski, A Note on Scheduling Equal-Length Jobs to Maximize Throughput, Journal of Scheduling, 2006. Zobacz w PBN
Łukasz Kowalik , Approximation Scheme for Lowest Outdegree Orientation and Graph Density Measures, Lecture Notes in Computer Science, 2006. Zobacz w PBN
Łukasz Kowalik , Improved Edge Coloring with Three Colors, Lecture Notes in Computer Science, 2006. Zobacz w PBN
Łukasz Kowalik , Maciej Kurowski, Oracles for Bounded Length Shortest Paths in Planar Graphs, ACM Transactions on Algorithms, 2006. Zobacz w PBN