The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Lukasz Kowalik: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Lukasz Kowalik
    Fast 3-Coloring Triangle-Free Planar Graphs. [Citation Graph (0, 0)][DBLP]
    ESA, 2004, pp:436-447 [Conf]
  2. Lukasz Kowalik
    Approximation Scheme for Lowest Outdegree Orientation and Graph Density Measures. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2006, pp:557-566 [Conf]
  3. Lukasz Kowalik, Maciej Kurowski
    Short path queries in planar graphs in constant time. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:143-148 [Conf]
  4. Krzysztof Diks, Lukasz Kowalik, Maciej Kurowski
    A New 3-Color Criterion for Planar Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 2002, pp:138-149 [Conf]
  5. Lukasz Kowalik
    Short Cycles in Planar Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 2003, pp:284-296 [Conf]
  6. Lukasz Kowalik
    Improved Edge-Coloring with Three Colors. [Citation Graph (0, 0)][DBLP]
    WG, 2006, pp:90-101 [Conf]
  7. Marek Chrobak, Christoph Dürr, Wojciech Jawor, Lukasz Kowalik, Maciej Kurowski
    A Note on Scheduling Equal-Length Jobs to Maximize Throughput [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  8. Lukasz Kowalik
    Adjacency queries in dynamic sparse graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2007, v:102, n:5, pp:191-195 [Journal]
  9. Marek Chrobak, Christoph Dürr, Wojciech Jawor, Lukasz Kowalik, Maciej Kurowski
    A Note on Scheduling Equal-Length Jobs to Maximize Throughput. [Citation Graph (0, 0)][DBLP]
    J. Scheduling, 2006, v:9, n:1, pp:71-73 [Journal]
  10. Lukasz Kowalik, Maciej Kurowski
    Oracles for bounded-length shortest paths in planar graphs. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2006, v:2, n:3, pp:335-363 [Journal]
  11. Lukasz Kowalik, Marcin Mucha
    35/44-Approximation for Asymmetric Maximum TSP with Triangle Inequality. [Citation Graph (0, 0)][DBLP]
    WADS, 2007, pp:589-600 [Conf]

  12. Deterministic 7/8-Approximation for the Metric Maximum TSP. [Citation Graph (, )][DBLP]


  13. A Planar Linear Arboricity Conjecture. [Citation Graph (, )][DBLP]


  14. Fast Approximation in Subspaces by Doubling Metric Decomposition. [Citation Graph (, )][DBLP]


  15. Improved Induced Matchings in Sparse Graphs. [Citation Graph (, )][DBLP]


  16. Approximating the Maximum 3- and 4-Edge-Colorable Subgraph. [Citation Graph (, )][DBLP]


  17. Two Approximation Algorithms for ATSP with Strengthened Triangle Inequality. [Citation Graph (, )][DBLP]


  18. New Linear-Time Algorithms for Edge-Coloring Planar Graphs. [Citation Graph (, )][DBLP]


  19. Exponential-Time Approximation of Hard Problems [Citation Graph (, )][DBLP]


  20. Fast Approximation in Subspaces by Doubling Metric Decomposition [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002