| ||
| 1. | A Planar linear arboricity conjecture
JOURNAL OF DISCRETE ALGORITHMS Tom 69 Nr 4 r. 2012, str. 403-425 (Artyku) Marek Cygan, Jian-Feng Hou, ukasz Kowalik, Borut Luzar, Jian-Liang Wu | |
| 2. | 35/44-approximation for Asymmetric Maximum TSP with Triangle Inequality
ALGORITHMICA Tom 59 Nr 2 r. 2011, str. 240-255 (Artyku) ukasz Kowalik, Marcin Mucha | |
| 3. | Channel Assignment via Fast Zeta Transform
INFORMATION PROCESSING LETTERS Tom 111 Nr 15 r. 2011, str. 727-730 (Artyku) Marek Cygan, ukasz Kowalik | |
| 4. | A Planar Linear Arboricity Conjecture
LECTURE NOTES IN COMPUTER SCIENCE Tom 6078 r. 2010, str. 204-216 (Artyku) Marek Cygan, ukasz Kowalik, Borut Luzar | |
| 5. | An improved bound on the largest induced forests for triangle-free planar graphs
DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE Tom 12 Nr 1 r. 2010, str. 87-100 (Artyku) ukasz Kowalik, Borut Luzar, Riste Skrekovski | |
| 6. | Approximating the Maximum 3- and 4-Edge-Colorable Subgraph
LECTURE NOTES IN COMPUTER SCIENCE Tom 6139 r. 2010, str. 395-407 (Artyku) Marcin Kamiski, ukasz Kowalik | |
| 7. | Fast 3-coloring Triangle-Free Planar Graphs
ALGORITHMICA Tom 58 Nr 3 r. 2010, str. 770-789 (Artyku) ukasz Kowalik | |
| 8. | Fast Approximation in Subspaces by Doubling Metric Decomposition
LECTURE NOTES IN COMPUTER SCIENCE Tom 6346 r. 2010, str. 72-83 (Artyku) Marek Cygan, ukasz Kowalik, Marcin Mucha, Marcin Pilipczuk, Piotr Sankowski | |
| 9. | Improved induced matchings in sparse graphs
DISCRETE APPLIED MATHEMATICS Tom 158 Nr 18 r. 2010, str. 1994-2003 (Artyku) Rok Erman, ukasz Kowalik, Matjaz Krnc, Tomasz Wale | |
| 10. | Deterministic 7/8-approximation for the Metric Maximum TSP
THEORETICAL COMPUTER SCIENCE Tom 410 r. 2009, str. 5000-5009 (Artyku) ukasz Kowalik, Marcin Mucha | |
| 11. | Exponential-time approximation of weighted set cover
INFORMATION PROCESSING LETTERS Tom 109 Nr 16 r. 2009, str. 957-961 (Artyku) Marek Cygan, ukasz Kowalik, Mateusz Wykurz | |
| 12. | Improved edge-coloring with three colors
THEORETICAL COMPUTER SCIENCE Tom 410 Nr 38-40 r. 2009, str. 3733-3742 (Artyku) ukasz Kowalik | |
| 13. | Improved Induced Matchings in Sparse Graphs
LECTURE NOTES IN COMPUTER SCIENCE Tom 5917 r. 2009, str. 134-148 (Artyku) Rok Erman, ukasz Kowalik, Matjaz Krnc, Tomasz Wale | |
| 14. | Two Approximation Algorithms for ATSP with Strengthened Triangle Inequality
LECTURE NOTES IN COMPUTER SCIENCE Tom 5664 r. 2009, str. 471-482 (Artyku) ukasz Kowalik, Marcin Mucha | |
| 15. | Exponential-Time Approximation of Hard Problems
COMPUTING RESEARCH REPOSITORY Tom abs/0810.4934 r. 2008, str. (Artyku) Marek Cygan, ukasz Kowalik, Marcin Pilipczuk, Mateusz Wykurz | |
| 16. | New Linear-Time Algortihms for Edge-Coloring Planar Graphs
ALGORITHMICA Tom 50 Nr 3 r. 2008, str. 351-368 (Artyku) Richard Cole, ukasz Kowalik | |
| 17. | Total colouring of plane graphs with maximum degree nine
SIAM JOURNAL ON DISCRETE MATHEMATICS Tom 22 Nr 4 r. 2008, str. 1462--1479 (Artyku) Jean-Sebastien Sereni, ukasz Kowalik, Riste Skrekovski | |
| 18. | 35/44-Approximation for Asymmetric Maximum TSP with Triangle Inequality
LECTURE NOTES IN COMPUTER SCIENCE Tom 4619 r. 2007, str. 589-600 (Artyku konferencyjny) ukasz Kowalik, Marcin Mucha | |
| 19. | A Generalization of Kotzig's Theorem and its Application
SIAM JOURNAL ON DISCRETE MATHEMATICS Tom 21 Nr 1 r. 2007, str. 93-106 (Artyku) Richard Cole, ukasz Kowalik, Riste Skrekovski | |
| 20. | Adjacency Queries in Dynamic Sparse Graphs
INFORMATION PROCESSING LETTERS Tom 102 Nr 5 r. 2007, str. 191-195 (Artyku) ukasz Kowalik | |
| 21. | A Note on Scheduling Equal-Length Jobs to Maximize Throughput
JOURNAL OF SCHEDULING Tom 9 Nr 1 r. 2006, str. 71-73 (Artyku) Marek Chrobak, C. Durr, W. Jawor, ukasz Kowalik, Maciej Kurowski | |
| 22. | Approximation Scheme for Lowest Outdegree Orientation and Graph Density Measures
LECTURE NOTES IN COMPUTER SCIENCE Tom 4288 r. 2006, str. 557-566 (Artyku konferencyjny) ukasz Kowalik | |
| 23. | Improved Edge Coloring with Three Colors
LECTURE NOTES IN COMPUTER SCIENCE Tom 4271 r. 2006, str. 90-101 (Artyku konferencyjny) ukasz Kowalik | |
| 24. | Oracles for Bounded Length Shortest Paths in Planar Graphs
ACM TRANSACTIONS ON ALGORITHMS Tom 2 Nr 3 r. 2006, str. 335-363 (Artyku) ukasz Kowalik, Maciej Kurowski | |
| 25. | Fast 3-Coloring Triangle-Free Planar Graphs
LECTURE NOTES IN COMPUTER SCIENCE Tom 3221 r. 2004, str. 436-447 (Artyku konferencyjny) ukasz Kowalik | |