Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Kowalik, Łukasz - Instytut Informatyki, Uniwersytet Warszawski
Adjacency Queries in Dynamic Sparse Graphs Lukasz Kowalik #
Approximation Scheme for Lowest Outdegree Orientation and Graph Density Measures
Short Cycles in Planar Graphs ukasz Kowalik ?
New Linear-Time Algorithms for Edge-Coloring Planar Graphs
Short Path Queries in Planar Graphs in Constant Time [Extended Abstract]
Deterministic 7/8-approximation for the Metric Maximum TSP
A New 3-color Criterion for Planar Graphs (extended abstract)
Oracles for Bounded Length Shortest Paths in Planar Graphs
New LinearTime Algorithms for EdgeColoring Planar Graphs
Improved Edge-Coloring with Three Colors$ Lukasz Kowalika,b
Improved induced matchings in sparse graphs , Lukasz Kowalik2
35/44-approximation for Asymmetric Maximum TSP with Triangle Inequality
Approximation Scheme for Lowest Outdegree Orientation and Graph Density Measures
Exponential-Time Approximation of Weighted Set Cover Marek Cygan, Lukasz Kowalik and Mateusz Wykurz
A Planar Linear Arboricity Conjecture Marek Cygan1
An improved bound on the largest induced forests for triangle-free planar graphs
Fast 3-coloring Triangle-Free Planar Graphs Lukasz Kowalik
Adjacency Queries in Dynamic Sparse Graphs Lukasz Kowalik
Short Path Queries in Planar Graphs in Constant Time [Extended Abstract]
A Generalization of Kotzig's Theorem and its Application
35/44-approximation for Asymmetric Maximum TSP with Triangle Inequality [Extended
More on Light Graphs in 3-Connected Plane Graphs Without Triangular or Quadrangular Faces
Total-colouring of plane graphs with maximum degree nine
35/44approximation for Asymmetric Maximum TSP with Triangle Inequality [Extended
