×

zbMATH — the first resource for mathematics

Kowalik, Łukasz

Compute Distance To:
Author ID: kowalik.lukasz Recent zbMATH articles by "Kowalik, Łukasz"
Published as: Kowalik, Lukasz; Kowalik, Ukasz; Kowalik, Łukasz
Documents Indexed: 58 Publications since 2002, including 1 Book

Publications by Year

Citations contained in zbMATH Open

40 Publications have been cited 509 times in 480 Documents Cited by Year
Parameterized algorithms. Zbl 1334.90001
Cygan, Marek; Fomin, Fedor V.; Kowalik, Łukasz; Lokshtanov, Daniel; Marx, Dániel; Pilipczuk, Marcin; Pilipczuk, Michał; Saurabh, Saket
302
2015
Total-coloring of plane graphs with maximum degree nine. Zbl 1184.05046
Kowalik, Ukasz; Sereni, Jean-Sébastien; Škrekovski, Riste
38
2008
Exponential-time approximation of weighted set cover. Zbl 1202.68482
Cygan, Marek; Kowalik, Łukasz; Wykurz, Mateusz
18
2009
A note on scheduling equal-length jobs to maximize throughput. Zbl 1154.90430
Chrobak, Marek; Dürr, Christoph; Jawor, Wojciech; Kowalik, Łukasz; Kurowski, Maciej
14
2006
Constrained multilinear detection and generalized graph motifs. Zbl 1336.68115
Björklund, Andreas; Kaski, Petteri; Kowalik, Łukasz
11
2016
Probably optimal graph motifs. Zbl 1354.68108
Björklund, Andreas; Kaski, Petteri; Kowalik, Łukasz
11
2013
A planar linear arboricity conjecture. Zbl 1242.05064
Cygan, Marek; Hou, Jian-Feng; Kowalik, Łukasz; Lužar, Borut; Wu, Jian-Liang
11
2012
Oracles for bounded-length shortest paths in planar graphs. Zbl 1321.05271
Kowalik, Lukasz; Kurowski, Maciej
8
2006
Towards optimal kernel for connected vertex cover in planar graphs. Zbl 1263.05021
Kowalik, Łukasz; Pilipczuk, Marcin; Suchan, Karol
6
2013
An improved bound on the largest induced forests for triangle-free planar graphs. Zbl 1250.05041
Kowalik, Lukasz; Lužar, Borut; Škrekovski, Riste
6
2010
Approximation scheme for lowest outdegree orientation and graph density measures. Zbl 1135.68642
Kowalik, Łukasz
6
2006
Short path queries in planar graphs in constant time. Zbl 1192.05164
Kowalik, Lukasz; Kurowski, Maciej
6
2003
Spotting trees with few leaves. Zbl 1441.68066
Björklund, Andreas; Kamat, Vikram; Kowalik, Łukasz; Zehavi, Meirav
5
2015
Deterministic 7/8-approximation for the metric maximum TSP. Zbl 1209.90359
Kowalik, Łukasz; Mucha, Marcin
5
2009
Adjacency queries in dynamic sparse graphs. Zbl 1184.68202
Kowalik, Łukasz
5
2007
Fast 3-coloring triangle-free planar graphs. Zbl 1111.68589
Kowalik, Łukasz
5
2004
Fast witness extraction using a decision oracle. Zbl 1423.68203
Björklund, Andreas; Kaski, Petteri; Kowalik, Łukasz
4
2014
Improved induced matchings in sparse graphs. Zbl 1215.05129
Erman, Rok; Kowalik, Łukasz; Krnc, Matjaž; Waleń, Tomasz
4
2010
Improved edge-coloring with three colors. Zbl 1171.68031
Kowalik, Łukasz
4
2009
35/44-approximation for asymmetric maximum TSP with triangle inequality. (Extended abstract). Zbl 1209.68646
Kowalik, Łukasz; Mucha, Marcin
4
2007
A new 3-color criterion for planar graphs. (Extended abstract). Zbl 1022.05500
Diks, Krzysztof; Kowalik, Lukasz; Kurowski, Maciej
4
2002
Channel assignment via fast zeta transform. Zbl 1260.68170
Cygan, Marek; Kowalik, Łukasz
3
2011
Fast 3-coloring triangle-free planar graphs. Zbl 1200.05230
Kowalik, Lukasz
3
2010
A generalization of Kotzig’s theorem and its application. Zbl 1138.05059
Cole, Richard; Kowalik, Łukasz; Škrekovski, Riste
3
2007
Approximation and parameterized complexity of minimax approval voting. Zbl 1451.68130
Cygan, Marek; Kowalik, Łukasz; Socała, Arkadiusz; Sornat, Krzysztof
2
2018
On the fine-grained complexity of rainbow coloring. Zbl 1397.68102
Kowalik, Łukasz; Lauri, Juho; Socala, Arkadiusz
2
2016
On finding rainbow and colorful paths. Zbl 1338.68110
Kowalik, Łukasz; Lauri, Juho
2
2016
Beyond the Vizing’s bound for at most seven colors. Zbl 1305.05079
Kamiński, Marcin; Kowalik, Łukasz
2
2014
Nonblocker in \(H\)-minor free graphs: kernelization meets discharging. Zbl 1375.68069
Kowalik, Łukasz
2
2012
35/44-approximation for asymmetric maximum TSP with triangle inequality. Zbl 1206.68367
Kowalik, Lukasz; Mucha, Marcin
2
2011
Short cycles in planar graphs. Zbl 1255.05187
Kowalik, Łukasz
2
2003
Tight lower bounds for the complexity of multicoloring. Zbl 1434.68186
Bonamy, Marthe; Kowalik, Łukasz; Pilipczuk, Michał; Socała, Arkadiusz; Wrochna, Marcin
1
2017
Spotting trees with few leaves. Zbl 1362.05078
Björklund, Andreas; Kamat, Vikram; Kowalik, Łukasz; Zehavi, Meirav
1
2017
Linear kernels for outbranching problems in sparse digraphs. Zbl 1378.68062
Bonamy, Marthe; Kowalik, Łukasz; Pilipczuk, Michał; Socała, Arkadiusz
1
2015
Counting thin subgraphs via packings faster than meet-in-the-middle time. Zbl 1420.68155
Bjöurklund, Andreas; Kaski, Petteri; Kowalik, Lukasz
1
2014
A \(9k\) kernel for nonseparating independent set in planar graphs. Zbl 1277.68096
Kowalik, Łukasz; Mucha, Marcin
1
2014
Approximating the maximum 3- and 4-edge-colorable subgraph (extended abstract). Zbl 1285.68213
Kamiński, Marcin; Kowalik, Łukasz
1
2010
A planar linear arboricity conjecture. Zbl 1284.05211
Cygan, Marek; Kowalik, Łukasz; Lužar, Borut
1
2010
Deterministic 7/8-approximation for the metric maximum TSP. (Extended abstract). Zbl 1159.68669
Kowalik, Łukasz; Mucha, Marcin
1
2008
New linear-time algorithms for edge-coloring planar graphs. Zbl 1141.68050
Cole, Richard; Kowalik, Łukasz
1
2008
Approximation and parameterized complexity of minimax approval voting. Zbl 1451.68130
Cygan, Marek; Kowalik, Łukasz; Socała, Arkadiusz; Sornat, Krzysztof
2
2018
Tight lower bounds for the complexity of multicoloring. Zbl 1434.68186
Bonamy, Marthe; Kowalik, Łukasz; Pilipczuk, Michał; Socała, Arkadiusz; Wrochna, Marcin
1
2017
Spotting trees with few leaves. Zbl 1362.05078
Björklund, Andreas; Kamat, Vikram; Kowalik, Łukasz; Zehavi, Meirav
1
2017
Constrained multilinear detection and generalized graph motifs. Zbl 1336.68115
Björklund, Andreas; Kaski, Petteri; Kowalik, Łukasz
11
2016
On the fine-grained complexity of rainbow coloring. Zbl 1397.68102
Kowalik, Łukasz; Lauri, Juho; Socala, Arkadiusz
2
2016
On finding rainbow and colorful paths. Zbl 1338.68110
Kowalik, Łukasz; Lauri, Juho
2
2016
Parameterized algorithms. Zbl 1334.90001
Cygan, Marek; Fomin, Fedor V.; Kowalik, Łukasz; Lokshtanov, Daniel; Marx, Dániel; Pilipczuk, Marcin; Pilipczuk, Michał; Saurabh, Saket
302
2015
Spotting trees with few leaves. Zbl 1441.68066
Björklund, Andreas; Kamat, Vikram; Kowalik, Łukasz; Zehavi, Meirav
5
2015
Linear kernels for outbranching problems in sparse digraphs. Zbl 1378.68062
Bonamy, Marthe; Kowalik, Łukasz; Pilipczuk, Michał; Socała, Arkadiusz
1
2015
Fast witness extraction using a decision oracle. Zbl 1423.68203
Björklund, Andreas; Kaski, Petteri; Kowalik, Łukasz
4
2014
Beyond the Vizing’s bound for at most seven colors. Zbl 1305.05079
Kamiński, Marcin; Kowalik, Łukasz
2
2014
Counting thin subgraphs via packings faster than meet-in-the-middle time. Zbl 1420.68155
Bjöurklund, Andreas; Kaski, Petteri; Kowalik, Lukasz
1
2014
A \(9k\) kernel for nonseparating independent set in planar graphs. Zbl 1277.68096
Kowalik, Łukasz; Mucha, Marcin
1
2014
Probably optimal graph motifs. Zbl 1354.68108
Björklund, Andreas; Kaski, Petteri; Kowalik, Łukasz
11
2013
Towards optimal kernel for connected vertex cover in planar graphs. Zbl 1263.05021
Kowalik, Łukasz; Pilipczuk, Marcin; Suchan, Karol
6
2013
A planar linear arboricity conjecture. Zbl 1242.05064
Cygan, Marek; Hou, Jian-Feng; Kowalik, Łukasz; Lužar, Borut; Wu, Jian-Liang
11
2012
Nonblocker in \(H\)-minor free graphs: kernelization meets discharging. Zbl 1375.68069
Kowalik, Łukasz
2
2012
Channel assignment via fast zeta transform. Zbl 1260.68170
Cygan, Marek; Kowalik, Łukasz
3
2011
35/44-approximation for asymmetric maximum TSP with triangle inequality. Zbl 1206.68367
Kowalik, Lukasz; Mucha, Marcin
2
2011
An improved bound on the largest induced forests for triangle-free planar graphs. Zbl 1250.05041
Kowalik, Lukasz; Lužar, Borut; Škrekovski, Riste
6
2010
Improved induced matchings in sparse graphs. Zbl 1215.05129
Erman, Rok; Kowalik, Łukasz; Krnc, Matjaž; Waleń, Tomasz
4
2010
Fast 3-coloring triangle-free planar graphs. Zbl 1200.05230
Kowalik, Lukasz
3
2010
Approximating the maximum 3- and 4-edge-colorable subgraph (extended abstract). Zbl 1285.68213
Kamiński, Marcin; Kowalik, Łukasz
1
2010
A planar linear arboricity conjecture. Zbl 1284.05211
Cygan, Marek; Kowalik, Łukasz; Lužar, Borut
1
2010
Exponential-time approximation of weighted set cover. Zbl 1202.68482
Cygan, Marek; Kowalik, Łukasz; Wykurz, Mateusz
18
2009
Deterministic 7/8-approximation for the metric maximum TSP. Zbl 1209.90359
Kowalik, Łukasz; Mucha, Marcin
5
2009
Improved edge-coloring with three colors. Zbl 1171.68031
Kowalik, Łukasz
4
2009
Total-coloring of plane graphs with maximum degree nine. Zbl 1184.05046
Kowalik, Ukasz; Sereni, Jean-Sébastien; Škrekovski, Riste
38
2008
Deterministic 7/8-approximation for the metric maximum TSP. (Extended abstract). Zbl 1159.68669
Kowalik, Łukasz; Mucha, Marcin
1
2008
New linear-time algorithms for edge-coloring planar graphs. Zbl 1141.68050
Cole, Richard; Kowalik, Łukasz
1
2008
Adjacency queries in dynamic sparse graphs. Zbl 1184.68202
Kowalik, Łukasz
5
2007
35/44-approximation for asymmetric maximum TSP with triangle inequality. (Extended abstract). Zbl 1209.68646
Kowalik, Łukasz; Mucha, Marcin
4
2007
A generalization of Kotzig’s theorem and its application. Zbl 1138.05059
Cole, Richard; Kowalik, Łukasz; Škrekovski, Riste
3
2007
A note on scheduling equal-length jobs to maximize throughput. Zbl 1154.90430
Chrobak, Marek; Dürr, Christoph; Jawor, Wojciech; Kowalik, Łukasz; Kurowski, Maciej
14
2006
Oracles for bounded-length shortest paths in planar graphs. Zbl 1321.05271
Kowalik, Lukasz; Kurowski, Maciej
8
2006
Approximation scheme for lowest outdegree orientation and graph density measures. Zbl 1135.68642
Kowalik, Łukasz
6
2006
Fast 3-coloring triangle-free planar graphs. Zbl 1111.68589
Kowalik, Łukasz
5
2004
Short path queries in planar graphs in constant time. Zbl 1192.05164
Kowalik, Lukasz; Kurowski, Maciej
6
2003
Short cycles in planar graphs. Zbl 1255.05187
Kowalik, Łukasz
2
2003
A new 3-color criterion for planar graphs. (Extended abstract). Zbl 1022.05500
Diks, Krzysztof; Kowalik, Lukasz; Kurowski, Maciej
4
2002
all top 5

Cited by 668 Authors

34 Saurabh, Saket
25 Zehavi, Meirav
21 Wu, Jian-Liang
20 Kowalik, Łukasz
18 Golovach, Petr A.
17 Sau, Ignasi
15 Niedermeier, Rolf
14 Fomin, Fedor V.
14 Gutin, Gregory Z.
14 Wang, Huijuan
13 Paschos, Vangelis Th.
13 Raman, Venkatesh
12 Komusiewicz, Christian
11 Ganian, Robert
11 Pilipczuk, Marcin
11 Sorge, Manuel
11 Wang, Jianxin
10 Krithika, R.
10 Ordyniak, Sebastian
9 Agrawal, Akanksha
9 Kratsch, Stefan
9 Lampis, Michael
9 Ono, Hirotaka
9 Panolan, Fahad
9 Ramanujan, M. S.
9 Tale, Prafullkumar
9 van Bevern, René
8 Eiben, Eduard
8 Feng, Qilong
8 Liu, Bin
8 Lokshtanov, Daniel
8 Thilikos, Dimitrios M.
8 Wahlström, Magnus
7 Bredereck, Robert
7 Kratsch, Dieter
7 Majumdar, Diptapriyo
7 Mnich, Matthias
7 Pilipczuk, Michał
7 Wang, Yingqian
6 Bodlaender, Hans L.
6 Cygan, Marek
6 Fluschnik, Till
6 Hermelin, Danny
6 Jansen, Bart M. P.
6 Knop, Dušan
6 Lauri, Juho
6 Liedloff, Mathieu
6 Marx, Dániel
6 Misra, Neeldhara
6 Otachi, Yota
6 Rzążewski, Paweł
6 Van Leeuwen, Erik Jan
6 Zhang, Xin
5 Baste, Julien
5 Chen, Jian-er
5 Escoffier, Bruno
5 Fernau, Henning
5 Gupta, Sushmita
5 Hanaka, Tesshu
5 Kolay, Sudeshna
5 Li, Wenjun
5 Molter, Hendrik
5 Nichterlein, André
5 Shachnai, Hadas
5 Shen, Lan
5 Socała, Arkadiusz
5 Suchý, Ondřej
5 van der Zanden, Tom C.
5 Wang, Bing
5 Wu, Lidong
5 Xu, Renyu
5 Yang, Yongjie
4 Angelini, Patrizio
4 Belmonte, Rémy
4 Björklund, Andreas
4 Bonnet, Edouard
4 Bourgeois, Nicolas
4 Chen, Jiehua
4 Chitnis, Rajesh Hemant
4 Cohen, Nathann
4 Feldmann, Andreas Emil
4 Froese, Vincent
4 Junosza-Szaniawski, Konstanty
4 Kanesh, Lawqueen
4 Kanj, Iyad A.
4 Kelk, Steven
4 Kisfaludi-Bak, Sándor
4 Kwon, Ojoung
4 Liu, Guizhen
4 Meeks, Kitty
4 Mertzios, George B.
4 Paul, Christophe
4 Pinter, Ron Yair
4 Reidl, Felix
4 Roy, Sanjukta
4 Skowron, Piotr
4 Wu, Weili
3 Araújo, Júlio César Silva
3 Asahiro, Yuichi
3 Banik, Aritra
...and 568 more Authors
all top 5

Cited in 56 Serials

76 Theoretical Computer Science
65 Algorithmica
40 Discrete Applied Mathematics
30 Journal of Computer and System Sciences
24 SIAM Journal on Discrete Mathematics
23 Information Processing Letters
16 Journal of Combinatorial Optimization
15 Discrete Mathematics
9 Journal of Scheduling
8 Theory of Computing Systems
7 SIAM Journal on Computing
6 Information and Computation
6 Journal of Graph Algorithms and Applications
5 Graphs and Combinatorics
5 Journal of Discrete Algorithms
4 Artificial Intelligence
4 Annals of Operations Research
4 Acta Mathematica Sinica. English Series
4 Discrete Optimization
4 Optimization Letters
3 Journal of Combinatorial Theory. Series B
3 Journal of Graph Theory
2 European Journal of Combinatorics
2 Computational Geometry
2 Journal of Global Optimization
2 European Journal of Operational Research
2 Discussiones Mathematicae. Graph Theory
2 Central European Journal of Mathematics
2 Science China. Mathematics
1 ACM Computing Surveys
1 Acta Informatica
1 Applied Mathematics and Computation
1 Operations Research
1 Moscow University Computational Mathematics and Cybernetics
1 Mathematical Social Sciences
1 Social Choice and Welfare
1 Acta Mathematicae Applicatae Sinica. English Series
1 Optimization
1 Computers & Operations Research
1 Journal of Automated Reasoning
1 Applied Mathematics Letters
1 Science in China. Series A
1 Historia Mathematica
1 Distributed Computing
1 The Electronic Journal of Combinatorics
1 The Journal of Artificial Intelligence Research (JAIR)
1 Annals of Mathematics and Artificial Intelligence
1 Discrete Dynamics in Nature and Society
1 Bulletin of the Malaysian Mathematical Sciences Society. Second Series
1 4OR
1 Sibirskie Èlektronnye Matematicheskie Izvestiya
1 Journal of Industrial and Management Optimization
1 Advances and Applications in Discrete Mathematics
1 Ars Mathematica Contemporanea
1 Mathematical Sciences
1 Computer Science Review

Citations by Year