List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Detecting points in integer cones of polytopes is double-exponentially hard j=' ' a=' ' j#=6 a#=6 | 2024-05-29 | Paper |
| The Asymmetric Travelling Salesman Problem In Sparse Digraphs. j=' ' a=' ' j#=6 a#=6 | 2023-11-13 | Paper |
| The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth. j=' ' a=' ' j#=6 a#=6 | 2023-11-13 | Paper |
| Partitioning edges of a planar graph into linear forests and a matching Journal of Graph Theory j='Journal of Graph Theory' a=' ' j#=23 a#=6 | 2023-10-05 | Paper |
| Many Visits TSP Revisited j=' ' a=' ' j#=6 a#=6 | 2023-02-07 | Paper |
| Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP j=' ' a=' ' j#=6 a#=6 | 2022-05-11 | Paper |
| Many-visits TSP revisited Journal of Computer and System Sciences j='Journal of Computer and System Sciences' a=' ' j#=39 a#=6 | 2021-11-25 | Paper |
| Tight lower bounds for list edge coloring j=' ' a=' ' j#=6 a#=6 | 2020-08-25 | Paper |
| Tight lower bounds for the complexity of multicoloring j=' ' a=' ' j#=6 a#=6 | 2020-05-27 | Paper |
| Improving TSP tours using dynamic programming over tree decompositions j=' ' a=' ' j#=6 a#=6 | 2020-05-27 | Paper |
| Tight lower bounds for the complexity of multicoloring ACM Transactions on Computation Theory j='ACM Transactions on Computation Theory' a=' ' j#=38 a#=6 | 2019-12-16 | Paper |
| Improving TSP Tours Using Dynamic Programming over Tree Decompositions ACM Transactions on Algorithms j='ACM Transactions on Algorithms' a=' ' j#=30 a#=6 | 2019-12-02 | Paper |
| Engineering Motif Search for Large Graphs 2015 Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments (ALENEX) j='2015 Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments (ALENEX)' a=' ' j#=94 a#=6 | 2019-09-12 | Paper |
| Counting thin subgraphs via packings faster than meet-in-the-middle time Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms j='Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms' a=' ' j#=80 a#=6 | 2019-06-20 | Paper |
| Approximation and parameterized complexity of minimax approval voting Journal of Artificial Intelligence Research j='Journal of Artificial Intelligence Research' a=' ' j#=43 a#=6 | 2018-11-30 | Paper |
| On directed feedback vertex set parameterized by treewidth j=' ' a=' ' j#=6 a#=6 | 2018-11-22 | Paper |
| Counting thin subgraphs via packings faster than meet-in-the-middle time ACM Transactions on Algorithms j='ACM Transactions on Algorithms' a=' ' j#=30 a#=6 | 2018-11-12 | Paper |
| On the fine-grained complexity of rainbow coloring SIAM Journal on Discrete Mathematics j='SIAM Journal on Discrete Mathematics' a=' ' j#=36 a#=6 | 2018-07-18 | Paper |
| On the fine-grained complexity of rainbow coloring j=' ' a=' ' j#=6 a#=6 | 2018-03-02 | Paper |
| Linear kernels for outbranching problems in sparse digraphs Algorithmica j='Algorithmica' a=' ' j#=12 a#=6 | 2017-10-10 | Paper |
| scientific article; zbMATH DE number 6784970 (Why is no real title available?) j=' ' a=' ' j#=6 a#=6 | 2017-09-29 | Paper |
| Spotting trees with few leaves SIAM Journal on Discrete Mathematics j='SIAM Journal on Discrete Mathematics' a=' ' j#=36 a#=6 | 2017-05-24 | Paper |
| Probably optimal graph motifs j=' ' a=' ' j#=6 a#=6 | 2017-01-30 | Paper |
| A \(13k\)-kernel for planar feedback vertex set via region decomposition Theoretical Computer Science j='Theoretical Computer Science' a=' ' j#=28 a#=6 | 2016-08-31 | Paper |
| Assigning channels via the meet-in-the-middle approach Algorithmica j='Algorithmica' a=' ' j#=12 a#=6 | 2016-05-31 | Paper |
| On finding rainbow and colorful paths Theoretical Computer Science j='Theoretical Computer Science' a=' ' j#=28 a#=6 | 2016-04-13 | Paper |
| Constrained multilinear detection and generalized graph motifs Algorithmica j='Algorithmica' a=' ' j#=12 a#=6 | 2016-03-29 | Paper |
| Spotting trees with few leaves Automata, Languages, and Programming j='Automata, Languages, and Programming' a=' ' j#=36 a#=6 | 2015-10-27 | Paper |
| A \(14k\)-kernel for planar feedback vertex set via region decomposition Parameterized and Exact Computation j='Parameterized and Exact Computation' a=' ' j#=35 a#=6 | 2015-09-15 | Paper |
| Oracles for bounded-length shortest paths in planar graphs ACM Transactions on Algorithms j='ACM Transactions on Algorithms' a=' ' j#=30 a#=6 | 2015-09-02 | Paper |
| Parameterized algorithms j=' ' a=' ' j#=6 a#=6 | 2015-08-17 | Paper |
| Beyond the Vizing's bound for at most seven colors SIAM Journal on Discrete Mathematics j='SIAM Journal on Discrete Mathematics' a=' ' j#=36 a#=6 | 2014-12-22 | Paper |
| Fast witness extraction using a decision oracle Algorithms - ESA 2014 j='Algorithms - ESA 2014' a=' ' j#=21 a#=6 | 2014-10-08 | Paper |
| Assigning channels via the meet-in-the-middle approach Algorithm Theory – SWAT 2014 j='Algorithm Theory – SWAT 2014' a=' ' j#=30 a#=6 | 2014-09-02 | Paper |
| A \(9k\) kernel for nonseparating independent set in planar graphs Theoretical Computer Science j='Theoretical Computer Science' a=' ' j#=28 a#=6 | 2013-12-13 | Paper |
| Beyond the Shannon's Bound j=' ' a=' ' j#=6 a#=6 | 2013-09-24 | Paper |
| Towards optimal kernel for connected vertex cover in planar graphs Discrete Applied Mathematics j='Discrete Applied Mathematics' a=' ' j#=28 a#=6 | 2013-04-25 | Paper |
| Channel assignment via fast zeta transform Information Processing Letters j='Information Processing Letters' a=' ' j#=30 a#=6 | 2013-04-04 | Paper |
| Nonblocker in \(H\)-minor free graphs: kernelization meets discharging Parameterized and Exact Computation j='Parameterized and Exact Computation' a=' ' j#=35 a#=6 | 2013-01-07 | Paper |
| A \(9k\) kernel for nonseparating independent set in planar graphs Graph-Theoretic Concepts in Computer Science j='Graph-Theoretic Concepts in Computer Science' a=' ' j#=44 a#=6 | 2012-11-06 | Paper |
| A planar linear arboricity conjecture Journal of Graph Theory j='Journal of Graph Theory' a=' ' j#=23 a#=6 | 2012-06-13 | Paper |
| 35/44-approximation for asymmetric maximum TSP with triangle inequality Algorithmica j='Algorithmica' a=' ' j#=12 a#=6 | 2011-03-02 | Paper |
| Improved induced matchings in sparse graphs Discrete Applied Mathematics j='Discrete Applied Mathematics' a=' ' j#=28 a#=6 | 2010-11-25 | Paper |
| Fast 3-coloring triangle-free planar graphs Algorithmica j='Algorithmica' a=' ' j#=12 a#=6 | 2010-09-27 | Paper |
| Fast approximation in subspaces by doubling metric decomposition Algorithms – ESA 2010 j='Algorithms – ESA 2010' a=' ' j#=23 a#=6 | 2010-09-06 | Paper |
| Exponential-time approximation of weighted set cover Information Processing Letters j='Information Processing Letters' a=' ' j#=30 a#=6 | 2010-08-20 | Paper |
| Short path queries in planar graphs in constant time Proceedings of the thirty-fifth annual ACM symposium on Theory of computing j='Proceedings of the thirty-fifth annual ACM symposium on Theory of computing' a=' ' j#=75 a#=6 | 2010-08-16 | Paper |
| An improved bound on the largest induced forests for triangle-free planar graphs j=' ' a=' ' j#=6 a#=6 | 2010-07-27 | Paper |
| Approximating the maximum 3- and 4-edge-colorable subgraph (extended abstract) Lecture Notes in Computer Science j='Lecture Notes in Computer Science' a=' ' j#=33 a#=6 | 2010-06-22 | Paper |
| A planar linear arboricity conjecture Lecture Notes in Computer Science j='Lecture Notes in Computer Science' a=' ' j#=33 a#=6 | 2010-05-28 | Paper |
| Adjacency queries in dynamic sparse graphs Information Processing Letters j='Information Processing Letters' a=' ' j#=30 a#=6 | 2010-01-29 | Paper |
| Improved induced matchings in sparse graphs Parameterized and Exact Computation j='Parameterized and Exact Computation' a=' ' j#=35 a#=6 | 2010-01-14 | Paper |
| Short cycles in planar graphs. Lecture Notes in Computer Science j='Lecture Notes in Computer Science' a=' ' j#=33 a#=6 | 2010-01-12 | Paper |
| Total-Coloring of Plane Graphs with Maximum Degree Nine SIAM Journal on Discrete Mathematics j='SIAM Journal on Discrete Mathematics' a=' ' j#=36 a#=6 | 2009-11-27 | Paper |
| Deterministic 7/8-approximation for the metric maximum TSP Theoretical Computer Science j='Theoretical Computer Science' a=' ' j#=28 a#=6 | 2009-11-06 | Paper |
| Two Approximation Algorithms for ATSP with Strengthened Triangle Inequality Lecture Notes in Computer Science j='Lecture Notes in Computer Science' a=' ' j#=33 a#=6 | 2009-10-20 | Paper |
| Improved edge-coloring with three colors Theoretical Computer Science j='Theoretical Computer Science' a=' ' j#=28 a#=6 | 2009-09-10 | Paper |
| 35/44-Approximation for Asymmetric Maximum TSP with Triangle Inequality Lecture Notes in Computer Science j='Lecture Notes in Computer Science' a=' ' j#=33 a#=6 | 2009-02-17 | Paper |
| Deterministic 7/8-Approximation for the Metric Maximum TSP Lecture Notes in Computer Science j='Lecture Notes in Computer Science' a=' ' j#=33 a#=6 | 2008-11-27 | Paper |
| Improved Edge-Coloring with Three Colors Graph-Theoretic Concepts in Computer Science j='Graph-Theoretic Concepts in Computer Science' a=' ' j#=44 a#=6 | 2008-09-04 | Paper |
| Approximation Scheme for Lowest Outdegree Orientation and Graph Density Measures Algorithms and Computation j='Algorithms and Computation' a=' ' j#=26 a#=6 | 2008-04-24 | Paper |
| New linear-time algorithms for edge-coloring planar graphs Algorithmica j='Algorithmica' a=' ' j#=12 a#=6 | 2008-04-03 | Paper |
| A Generalization of Kotzig’s Theorem and Its Application SIAM Journal on Discrete Mathematics j='SIAM Journal on Discrete Mathematics' a=' ' j#=36 a#=6 | 2008-03-28 | Paper |
| A note on scheduling equal-length jobs to maximize throughput Journal of Scheduling j='Journal of Scheduling' a=' ' j#=21 a#=6 | 2007-05-15 | Paper |
| Algorithms – ESA 2004 Lecture Notes in Computer Science j='Lecture Notes in Computer Science' a=' ' j#=33 a#=6 | 2005-08-18 | Paper |
| scientific article; zbMATH DE number 1953089 (Why is no real title available?) j=' ' a=' ' j#=6 a#=6 | 2003-07-25 | Paper |
Research outcomes over time
This page was built for person: Łukasz Kowalik
