The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Jochen Könemann: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Jochen Könemann, Goran Konjevod, Ojas Parekh, Amitabh Sinha
    Improved approximations for tour and tree covers. [Citation Graph (0, 0)][DBLP]
    APPROX, 2000, pp:184-193 [Conf]
  2. Fabrizio Grandoni, Jochen Könemann, Alessandro Panconesi
    Distributed Weighted Vertex Cover via Maximal Matchings. [Citation Graph (0, 0)][DBLP]
    COCOON, 2005, pp:839-848 [Conf]
  3. Christoph Burnikel, Jochen Könemann, Kurt Mehlhorn, Stefan Näher, Stefan Schirra, Christian Uhrig
    Exact Geometric Computation in LEDA. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1995, pp:0-0 [Conf]
  4. Jochen Könemann, Ojas Parekh, Danny Segev
    A Unified Approach to Approximating Partial Covering Problems. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:468-479 [Conf]
  5. Naveen Garg, Jochen Könemann
    Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems. [Citation Graph (0, 0)][DBLP]
    FOCS, 1998, pp:300-309 [Conf]
  6. Jochen Könemann, R. Ravi
    Quasi-polynomial Time Approximation Algorithm for Low-Degree Minimum-Cost Steiner Trees. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2003, pp:289-301 [Conf]
  7. Jochen Könemann, Stefano Leonardi, Guido Schäfer, Stefan van Zwam
    From Primal-Dual to Cost Shares and Back: A Stronger LP Relaxation for the Steiner Forest Problem. [Citation Graph (0, 0)][DBLP]
    ICALP, 2005, pp:930-942 [Conf]
  8. Roee Engelberg, Jochen Könemann, Stefano Leonardi, Joseph Naor
    Cut Problems in Graphs with a Budget Constraint. [Citation Graph (0, 0)][DBLP]
    LATIN, 2006, pp:435-446 [Conf]
  9. Fabrizio Grandoni, Jochen Könemann, Alessandro Panconesi, Mauro Sozio
    Primal-dual based distributed algorithms for vertex cover with semi-hard capacities. [Citation Graph (0, 0)][DBLP]
    PODC, 2005, pp:118-125 [Conf]
  10. Jochen Könemann, Asaf Levin, Amitabh Sinha
    Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 2003, pp:109-121 [Conf]
  11. Guy Even, Naveen Garg, Jochen Könemann, R. Ravi, Amitabh Sinha
    Covering Graphs Using Trees and Stars. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 2003, pp:24-35 [Conf]
  12. Luca Becchetti, Jochen Könemann, Stefano Leonardi, Martin Pál
    Sharing the cost more efficiently: improved approximation for multicommodity rent-or-buy. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:375-384 [Conf]
  13. Friedrich Eisenbrand, Stefan Funke, Naveen Garg, Jochen Könemann
    A combinatorial algorithm for computing a maximum independent set in a t-perfect graph. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:517-522 [Conf]
  14. Jochen Könemann, Stefano Leonardi, Guido Schäfer
    A group-strategyproof mechanism for Steiner forests. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:612-619 [Conf]
  15. Nikhil Bansal, Kedar Dhamdhere, Jochen Könemann, Amitabh Sinha
    Non-clairvoyant Scheduling for Minimizing Mean Slowdown. [Citation Graph (0, 0)][DBLP]
    STACS, 2003, pp:260-270 [Conf]
  16. Lisa Fleischer, Jochen Könemann, Stefano Leonardi, Guido Schäfer
    Simple cost sharing schemes for multicommodity rent-or-buy and stochastic Steiner tree. [Citation Graph (0, 0)][DBLP]
    STOC, 2006, pp:663-670 [Conf]
  17. Jochen Könemann, R. Ravi
    A matter of degree: improved approximation algorithms for degree-bounded minimum spanning trees. [Citation Graph (0, 0)][DBLP]
    STOC, 2000, pp:537-546 [Conf]
  18. Jochen Könemann, R. Ravi
    Primal-dual meets local search: approximating MST's with nonuniform degree bounds. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:389-395 [Conf]
  19. Jochen Könemann, Yanjun Li, Ojas Parekh, Amitabh Sinha
    Approximation Algorithms for Edge-Dilation k-Center Problems. [Citation Graph (0, 0)][DBLP]
    SWAT, 2002, pp:210-219 [Conf]
  20. Nikhil Bansal, Kedar Dhamdhere, Jochen Könemann, Amitabh Sinha
    Non-Clairvoyant Scheduling for Minimizing Mean Slowdown. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2004, v:40, n:4, pp:305-318 [Journal]
  21. Jochen Könemann, Goran Konjevod, Ojas Parekh, Amitabh Sinha
    Improved Approximations for Tour and Tree Covers. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2003, v:38, n:3, pp:441-449 [Journal]
  22. Jochen Könemann, Asaf Levin, Amitabh Sinha
    Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2004, v:41, n:2, pp:117-129 [Journal]
  23. Roee Engelberg, Jochen Könemann, Stefano Leonardi, Joseph Naor
    Cut problems in graphs with a budget constraint. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2007, v:5, n:2, pp:262-279 [Journal]
  24. Ernst Althaus, Stefan Funke, Sariel Har-Peled, Jochen Könemann, Edgar A. Ramos, Martin Skutella
    Approximating k-hop minimum-spanning trees. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2005, v:33, n:2, pp:115-120 [Journal]
  25. Guy Even, Naveen Garg, Jochen Könemann, R. Ravi, Amitabh Sinha
    Min-max tree covers of graphs. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2004, v:32, n:4, pp:309-315 [Journal]
  26. Jochen Könemann, Yanjun Li, Ojas Parekh, Amitabh Sinha
    An approximation algorithm for the edge-dilation k-center problem, . [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2004, v:32, n:5, pp:491-495 [Journal]
  27. Jochen Könemann, R. Ravi
    A Matter of Degree: Improved Approximation Algorithms for Degree-Bounded Minimum Spanning Trees. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2002, v:31, n:6, pp:1783-1793 [Journal]
  28. Jochen Könemann, R. Ravi
    Primal-Dual Meets Local Search: Approximating MSTs With Nonuniform Degree Bounds. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:34, n:3, pp:763-773 [Journal]
  29. Anupam Gupta, Jochen Könemann, Stefano Leonardi, R. Ravi, Guido Schäfer
    An efficient cost-sharing mechanism for the prize-collecting Steiner forest problem. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:1153-1162 [Conf]
  30. Naveen Garg, Jochen Könemann
    Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:37, n:2, pp:630-652 [Journal]
  31. Luca Becchetti, Jochen Könemann, Stefano Leonardi, Martin Pál
    Sharing the cost more efficiently: Improved approximation for multicommodity rent-or-buy. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2007, v:3, n:2, pp:- [Journal]

  32. Hypergraphic LP Relaxations for Steiner Trees. [Citation Graph (, )][DBLP]


  33. On Column-Restricted and Priority Covering Integer Programs. [Citation Graph (, )][DBLP]


  34. On Generalizations of Network Design Problems with Degree Bounds. [Citation Graph (, )][DBLP]


  35. Max-Weight Integral Multicommodity Flow in Spiders and High-Capacity Trees. [Citation Graph (, )][DBLP]


  36. A Partition-Based Relaxation For Steiner Trees [Citation Graph (, )][DBLP]


  37. Hypergraphic LP Relaxations for Steiner Trees [Citation Graph (, )][DBLP]


  38. On Column-restricted and Priority Covering Integer Programs [Citation Graph (, )][DBLP]


  39. On Generalizations of Network Design Problems with Degree Bounds [Citation Graph (, )][DBLP]


  40. Integrality Gap of the Hypergraphic Relaxation of Steiner Trees: a short proof of a 1.55 upper bound [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.304secs
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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002