ProfessorsProfessors of Uniwersytet WarszawskiLukasz Kowalik

Lukasz Kowalik

Uniwersytet Warszawski

H-index: 22

Europe-Poland

About Lukasz Kowalik

Lukasz Kowalik, With an exceptional h-index of 22 and a recent h-index of 13 (since 2020), a distinguished researcher at Uniwersytet Warszawski, specializes in the field of algorithms, graph theory.

His recent articles reflect a diverse array of research interests and contributions to the field:

Edge-coloring sparse graphs with colors in quasilinear time

Detecting Points in Integer Cones of Polytopes is Double-Exponentially Hard

Partitioning edges of a planar graph into linear forests and a matching

Many visits TSP revisited

Graph-Theoretic Concepts in Computer Science: 47th International Workshop, WG 2021, Warsaw, Poland, June 23–25, 2021, Revised Selected Papers

The asymmetric travelling salesman problem in sparse digraphs

The PACE 2020 parameterized algorithms and computational experiments challenge: Treedepth

Lukasz Kowalik Information

University	Uniwersytet Warszawski
Position	___
Citations(all)	3770
Citations(since 2020)	2424
Cited By	2464
hIndex(all)	22
hIndex(since 2020)	13
i10Index(all)	39
i10Index(since 2020)	18
Email	Access Email
University Profile Page	Uniwersytet Warszawski
Google Scholar	View Google Scholar Profile

Lukasz Kowalik Skills & Research Interests

algorithms

graph theory

Top articles of Lukasz Kowalik

Title	Journal	Author(s)	Publication Date
Edge-coloring sparse graphs with colors in quasilinear time	arXiv preprint arXiv:2401.13839	Łukasz Kowalik	2024/1/24
Detecting Points in Integer Cones of Polytopes is Double-Exponentially Hard		Łukasz Kowalik Alexandra Lassota Konrad Majewski Michał Pilipczuk Marek Sokołowski	2024
Partitioning edges of a planar graph into linear forests and a matching	Journal of Graph Theory	Marthe Bonamy Jadwiga Czyżewska Łukasz Kowalik Michał Pilipczuk	2023/11
Many visits TSP revisited	Journal of Computer and System Sciences	Łukasz Kowalik Shaohua Li Wojciech Nadara Marcin Smulewicz Magnus Wahlström	2022
Graph-Theoretic Concepts in Computer Science: 47th International Workshop, WG 2021, Warsaw, Poland, June 23–25, 2021, Revised Selected Papers		Łukasz Kowalik Michał Pilipczuk Paweł Rzążewski	2021/9/20
The asymmetric travelling salesman problem in sparse digraphs		Łukasz Kowalik Konrad Majewski	2020/12/4
The PACE 2020 parameterized algorithms and computational experiments challenge: Treedepth		Łukasz Kowalik Marcin Mucha Wojciech Nadara Marcin Pilipczuk Manuel Sorge ...	2020