Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Kowalik, Łukasz
196  Ergebnisse:
Personensuche X
?
1

Partitioning edges of a planar graph into linear forests an..:

Bonamy, Marthe ; Czyżewska, Jadwiga ; Kowalik, Łukasz.
Journal of Graph Theory.  104 (2023)  3 - p. 659-677 , 2023
Link: https://doi.org/10.1002/..
 
?
2

Correction to: Graph-Theoretic Concepts in Computer Science:

, In: Graph-Theoretic Concepts in Computer Science; Lecture Notes in Computer Science,
Kowalik, Łukasz ; Pilipczuk, Michał ; Rzążewski, Paweł - p. C2-C2 , 2023
Link: https://doi.org/10.1007/..
 
?
3

Many-visits TSP revisited:

Kowalik, Łukasz ; Li, Shaohua ; Nadara, Wojciech..
Journal of Computer and System Sciences.  124 (2022)  - p. 112-128 , 2022
Link: https://doi.org/10.1016/..
 
?
4

Graph-Theoretic Concepts in Computer Science: 47th Internat.. 

Theoretical Computer Science and General Issues, 12911
Kowalik, Łukasz ; Pilipczuk, Michał ; Rzążewski, Paweł - 1st ed. 2021 . , 2021
Link: https://doi.org/10.1007/..
 
?
5

Tight Lower Bounds for the Complexity of Multicoloring:

Bonamy, Marthe ; Kowalik, łUkasz ; Pilipczuk, Michał..
ACM Transactions on Computation Theory (TOCT).  11 (2019)  3 - p. 1-19 , 2019
Link: https://dl.acm.org/doi/1..
 
?
6

Improving TSP Tours Using Dynamic Programming over Tree Dec..:

Cygan, Marek ; Kowalik, Łukasz ; Socała, Arkadiusz
ACM Transactions on Algorithms.  15 (2019)  4 - p. 1-19 , 2019
Link: https://doi.org/10.1145/..
 
?
7

Tight Lower Bounds for the Complexity of Multicoloring:

Bonamy, Marthe ; Kowalik, łUkasz ; Pilipczuk, Michał..
ACM Transactions on Computation Theory.  11 (2019)  3 - p. 1-19 , 2019
Link: https://doi.org/10.1145/..
 
?
8

Improving TSP Tours Using Dynamic Programming over Tree Dec..:

Cygan, Marek ; Kowalik, Łukasz ; Socała, Arkadiusz
ACM Transactions on Algorithms (TALG).  15 (2019)  4 - p. 1-19 , 2019
Link: https://dl.acm.org/doi/1..
 
?
9

[P223] Treatment planing in brachytherapy HDR based on thre..:

Sawicki, Marcin ; Łyczek, Jarosław ; Kowalik, Łukasz.
Physica Medica.  52 (2018)  - p. 165 , 2018
Link: https://doi.org/10.1016/..
 
?
10

On Directed Feedback Vertex Set Parameterized by Treewidth:

, In: Graph-Theoretic Concepts in Computer Science; Lecture Notes in Computer Science,
Bonamy, Marthe ; Kowalik, Łukasz ; Nederlof, Jesper... - p. 65-78 , 2018
Link: https://doi.org/10.1007/..
 
?
11

[P166] Analysis of dose distribution in HDR endobronchial b..:

Sawicki, Marcin ; Łyczek, Jarosław ; Kowalik, Łukasz.
Physica Medica.  52 (2018)  - p. 146-147 , 2018
Link: https://doi.org/10.1016/..
 
?
12

On the Fine-Grained Complexity of Rainbow Coloring:

Kowalik, Łukasz ; Lauri, Juho ; Socała, Arkadiusz
SIAM Journal on Discrete Mathematics.  32 (2018)  3 - p. 1672-1705 , 2018
Link: https://doi.org/10.1137/..
 
?
13

Counting Thin Subgraphs via Packings Faster than Meet-in-th..:

Björklund, Andreas ; Kaski, Petteri ; Kowalik, Łukasz
ACM Transactions on Algorithms.  13 (2017)  4 - p. 1-26 , 2017
Link: https://doi.org/10.1145/..
 
?
14

Spotting Trees with Few Leaves:

Björklund, Andreas ; Kamat, Vikram ; Kowalik, Łukasz.
SIAM Journal on Discrete Mathematics.  31 (2017)  2 - p. 687-713 , 2017
Link: https://doi.org/10.1137/..
 
?
15

Counting Thin Subgraphs via Packings Faster than Meet-in-th..:

Björklund, Andreas ; Kaski, Petteri ; Kowalik, Łukasz
ACM Transactions on Algorithms (TALG).  13 (2017)  4 - p. 1-26 , 2017
Link: https://dl.acm.org/doi/1..
 
1-15