Obserwuj
Lukasz Kowalik
Lukasz Kowalik
University of Warsaw
Zweryfikowany adres z mimuw.edu.pl - Strona główna
Tytuł
Cytowane przez
Cytowane przez
Rok
Parameterized algorithms
M Cygan, FV Fomin, Ł Kowalik, D Lokshtanov, D Marx, M Pilipczuk, ...
Springer, 2015
30342015
Exponential-time approximation of weighted set cover
M Cygan, Ł Kowalik, M Wykurz
Information Processing Letters 109 (16), 957-961, 2009
1142009
Total-coloring of plane graphs with maximum degree nine
Ł Kowalik, JS Sereni, R Škrekovski
SIAM Journal on Discrete Mathematics 22 (4), 1462-1479, 2008
912008
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
622006
Approximation scheme for lowest outdegree orientation and graph density measures
Ł Kowalik
International Symposium on Algorithms and Computation, 557-566, 2006
472006
Constrained multilinear detection and generalized graph motifs
A Björklund, P Kaski, Ł Kowalik
Algorithmica, 2016
452016
Deterministic 7/8-approximation for the metric maximum TSP
Ł Kowalik, M Mucha
Theoretical Computer Science 410 (47), 5000-5009, 2009
392009
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
382003
Adjacency queries in dynamic sparse graphs
Ł Kowalik
Information Processing Letters 102 (5), 191-195, 2007
372007
Oracles for bounded-length shortest paths in planar graphs
L Kowalik, M Kurowski
ACM Transactions on Algorithms (TALG) 2 (3), 335-363, 2006
362006
Probably optimal graph motifs
A Björklund, P Kaski, L Kowalik
30th International Symposium on Theoretical Aspects of Computer Science …, 2013
352013
A Planar Linear Arboricity Conjecture
M Cygan, JF Hou, Ł Kowalik, B Lužar, JL Wu
Journal of Graph Theory 69 (4), 403-425, 2012
352012
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
342017
New linear-time algorithms for edge-coloring planar graphs
R Cole, Ł Kowalik
Algorithmica 50 (3), 351-368, 2008
332008
Fast 3-coloring triangle-free planar graphs
L Kowalik
Algorithmica 58 (3), 770-789, 2010
32*2010
Exponential-time approximation of hard problems
M Cygan, L Kowalik, M Pilipczuk, M Wykurz
arXiv preprint arXiv:0810.4934, 2008
282008
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
272018
35/44-approximation for asymmetric maximum TSP with triangle inequality
L Kowalik, M Mucha
Algorithmica 59 (2), 240-255, 2011
25*2011
A new 3-color criterion for planar graphs
K Diks, L Kowalik, M Kurowski
Graph-Theoretic Concepts in Computer Science: 28th International Workshop …, 2002
252002
Spotting trees with few leaves
A Bjorklund, V Kamat, Ł Kowalik, M Zehavi
SIAM Journal on Discrete Mathematics 31 (2), 687-713, 2017
232017
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20