Spremljaj
Lukasz Kowalik
Lukasz Kowalik
University of Warsaw
Preverjeni e-poštni naslov na mimuw.edu.pl - Domača stran
Naslov
Navedeno
Navedeno
Leto
Parameterized algorithms
M Cygan, FV Fomin, Ł Kowalik, D Lokshtanov, D Marx, M Pilipczuk, ...
Springer 5 (4), 16, 2015
23682015
Exponential-time approximation of weighted set cover
M Cygan, Ł Kowalik, M Wykurz
Information Processing Letters 109 (16), 957-961, 2009
1022009
Total-coloring of plane graphs with maximum degree nine
Ł Kowalik, JS Sereni, R Škrekovski
SIAM Journal on Discrete Mathematics 22 (4), 1462-1479, 2008
882008
Probably Optimal Graph Motifs
A Björklund, P Kaski, Ł Kowalik
STACS 2013 - 30th International Symposium on Theoretical Aspects of Computer …, 2012
71*2012
A note on scheduling equal-length jobs to maximize throughput
M Chrobak, C Durr, W Jawor, L Kowalik, M Kurowski
Journal of Scheduling 9, pages71–73, 2006
612006
Approximation scheme for lowest outdegree orientation and graph density measures
Ł Kowalik
Algorithms and Computation: 17th International Symposium, ISAAC 2006 …, 2006
422006
Short path queries in planar graphs in constant time
L Kowalik, M Kurowski
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing …, 2003
372003
A Planar Linear Arboricity Conjecture
M Cygan, JF Hou, Ł Kowalik, B Lužar, JL Wu
Journal of Graph Theory 69 (4), 403-425, 2012
342012
Deterministic 7/8-approximation for the metric maximum TSP
Ł Kowalik, M Mucha
Theoretical Computer Science 410 (47), 5000-5009, 2009
342009
Adjacency queries in dynamic sparse graphs
Ł Kowalik
Information Processing Letters 102 (5), 191-195, 2007
332007
Counting thin subgraphs via packings faster than meet-in-the-middle time
A Björklund, P Kaski, Ł Kowalik
ACM Transactions on Algorithms (TALG) 13 (4), 1-26, 2017
322017
Fast 3-coloring triangle-free planar graphs
L Kowalik
Algorithmica 58 (3), 770-789, 2010
31*2010
Oracles for bounded-length shortest paths in planar graphs
L Kowalik, M Kurowski
ACM Transactions on Algorithms (TALG) 2 (3), 335-363, 2006
312006
Exponential-time approximation of hard problems
M Cygan, L Kowalik, M Pilipczuk, M Wykurz
arXiv preprint arXiv:0810.4934, 2008
242008
New linear-time algorithms for edge-coloring planar graphs
R Cole, Ł Kowalik
Algorithmica 50 (3), 351-368, 2008
242008
35/44-approximation for asymmetric maximum TSP with triangle inequality
L Kowalik, M Mucha
Algorithmica 59 (2), 240-255, 2011
23*2011
On directed feedback vertex set parameterized by treewidth
M Bonamy, Ł Kowalik, J Nederlof, M Pilipczuk, A Socała, M Wrochna
Graph-Theoretic Concepts in Computer Science: 44th International Workshop …, 2018
222018
Spotting trees with few leaves
A Bjorklund, V Kamat, Ł Kowalik, M Zehavi
SIAM Journal on Discrete Mathematics 31 (2), 687-713, 2017
212017
On finding rainbow and colorful paths
Ł Kowalik, J Lauri
Theoretical Computer Science 628, 110-114, 2016
212016
Improved edge-coloring with three colors
Ł Kowalik
Theoretical Computer Science 410 (38), 3733-3742, 2009
212009
Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.
Članki 1–20