The SCEAS System
Navigation Menu

Search the dblp DataBase


Sören Laue: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Friedrich Eisenbrand, Sören Laue
    A Faster Algorithm for Two-Variable Integer Programming. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2003, pp:290-299 [Conf]
  2. Stefan Funke, Sören Laue
    Bounded-Hop Energy-Efficient Broadcast in Low-Dimensional Metrics Via Coresets. [Citation Graph (0, 0)][DBLP]
    STACS, 2007, pp:272-283 [Conf]
  3. Friedrich Eisenbrand, Sören Laue
    A linear algorithm for integer programming in the plane. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2005, v:102, n:2, pp:249-259 [Journal]
  4. Sören Laue, Domagoj Matijevic
    Approximating k-hop Minimum Spanning Trees in Euclidean Metrics. [Citation Graph (0, 0)][DBLP]
    CCCG, 2007, pp:117-120 [Conf]
  5. Stefan Funke, Sören Laue, Rouven Naujoks
    Minimum-Energy Broadcast with Few Senders. [Citation Graph (0, 0)][DBLP]
    DCOSS, 2007, pp:404-416 [Conf]
  6. Stefan Funke, Sören Laue, Zvi Lotker, Rouven Naujoks
    Power Assignment Problems in Wireless Communication [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]

  7. Power Assignment Problems in Wireless Communication: Covering Points by Disks, Reaching few Receivers Quickly, and Energy-Efficient Travelling Salesman Tours. [Citation Graph (, )][DBLP]

  8. Approximating Parameterized Convex Optimization Problems. [Citation Graph (, )][DBLP]

  9. Geometric Set Cover and Hitting Sets for Polytopes in R3. [Citation Graph (, )][DBLP]

  10. Geometric Set Cover and Hitting Sets for Polytopes in $R^3$ [Citation Graph (, )][DBLP]

Search in 0.002secs, Finished in 0.003secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
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 [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002