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

Search the dblp DataBase

Title:
Author:
Alexander Hall: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Alexander Hall, Heiko Schilling
    Flows over Time: Towards a More Realistic and Computationally Tractable Model. [Citation Graph (0, 0)][DBLP]
    ALENEX/ANALCO, 2005, pp:55-67 [Conf]
  2. Alexander Hall, Christos H. Papadimitriou
    Approximating the Distortion. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2005, pp:111-122 [Conf]
  3. Thomas Erlebach, Alexander Hall, Alessandro Panconesi, Danica Vukadinovic
    Cuts and Disjoint Paths in the Valley-Free Path Model of Internet BGP Routing. [Citation Graph (0, 0)][DBLP]
    CAAN, 2004, pp:49-62 [Conf]
  4. Thomas Erlebach, Alexander Hall, Michael Hoffmann 0002, Matús Mihalák
    Network Discovery and Verification with Distance Queries. [Citation Graph (0, 0)][DBLP]
    CIAC, 2006, pp:69-80 [Conf]
  5. Zuzana Beerliova, Felix Eberhard, Thomas Erlebach, Alexander Hall, Michael Hoffmann 0002, Matús Mihalák, L. Shankar Ram
    Network Discovery and Verification. [Citation Graph (0, 0)][DBLP]
    Algorithms for Optimization with Incomplete Information, 2005, pp:- [Conf]
  6. Georg Baier, Thomas Erlebach, Alexander Hall, Ekkehard Köhler, Heiko Schilling, Martin Skutella
    Length-Bounded Cuts and Flows. [Citation Graph (0, 0)][DBLP]
    ICALP (1), 2006, pp:679-690 [Conf]
  7. Alexander Hall, Steffen Hippler, Martin Skutella
    Multicommodity Flows over Time: Efficient Algorithms and Complexity. [Citation Graph (0, 0)][DBLP]
    ICALP, 2003, pp:397-409 [Conf]
  8. Alexander Hall, Katharina Langkau, Martin Skutella
    An FPTAS for Quickest Multicommodity Flows with Inflow-Dependent Transit Times. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 2003, pp:71-82 [Conf]
  9. Thomas Erlebach, Alexander Hall
    NP-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:194-202 [Conf]
  10. R. Sai Anand, Thomas Erlebach, Alexander Hall, Stamatis Stefanakos
    Call Control with k Rejections. [Citation Graph (0, 0)][DBLP]
    SWAT, 2002, pp:308-317 [Conf]
  11. Alexander Hall, Hanjo Täubig
    Comparing Push- and Pull-Based Broadcasting. [Citation Graph (0, 0)][DBLP]
    WEA, 2003, pp:148-164 [Conf]
  12. Zuzana Beerliova, Felix Eberhard, Thomas Erlebach, Alexander Hall, Michael Hoffmann 0002, Matús Mihalák, L. Shankar Ram
    Network Discovery and Verification. [Citation Graph (0, 0)][DBLP]
    WG, 2005, pp:127-138 [Conf]
  13. Thomas Erlebach, Alexander Hall, Linda S. Moonen, Alessandro Panconesi, Frits C. R. Spieksma, Danica Vukadinovic
    Robustness of the Internet at the Topology and Routing Level. [Citation Graph (0, 0)][DBLP]
    Research Results of the DICS Program, 2006, pp:260-274 [Conf]
  14. R. Sai Anand, Thomas Erlebach, Alexander Hall, Stamatis Stefanakos
    Call control with k rejections. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2003, v:67, n:4, pp:707-722 [Journal]
  15. Thomas Erlebach, Alexander Hall
    NP-Hardness of Broadcast Scheduling and Inapproximability of Single-Source Unsplittable Min-Cost Flow. [Citation Graph (0, 0)][DBLP]
    J. Scheduling, 2004, v:7, n:3, pp:223-241 [Journal]
  16. Thomas Erlebach, Alexander Hall, Matús Mihalák
    Approximate Discovery of Random Graphs. [Citation Graph (0, 0)][DBLP]
    SAGA, 2007, pp:82-92 [Conf]
  17. Henning Bruhn, Jakub Cerný, Alexander Hall, Petr Kolman
    Single source multiroute flows and cuts on uniform capacity networks. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:855-863 [Conf]
  18. Mark Cieliebak, Alexander Hall, Riko Jacob, Marc Nunkesser
    Sequential Vector Packing. [Citation Graph (0, 0)][DBLP]
    ESCAPE, 2007, pp:12-23 [Conf]
  19. Alexander Hall, Katharina Langkau, Martin Skutella
    An FPTAS for Quickest Multicommodity Flows with Inflow-Dependent Transit Times. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2007, v:47, n:3, pp:299-321 [Journal]
  20. Alexander Hall, Steffen Hippler, Martin Skutella
    Multicommodity flows over time: Efficient algorithms and complexity. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:379, n:3, pp:387-404 [Journal]
  21. Giuseppe Di Battista, Thomas Erlebach, Alexander Hall, Maurizio Patrignani, Maurizio Pizzonia, Thomas Schank
    Computing the types of the relationships between autonomous systems. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Netw., 2007, v:15, n:2, pp:267-280 [Journal]

  22. How to Guard a Graph?. [Citation Graph (, )][DBLP]


  23. The Maximum Energy-Constrained Dynamic Flow Problem. [Citation Graph (, )][DBLP]


  24. Incentive-Compatible Interdomain Routing with Linear Utilities. [Citation Graph (, )][DBLP]


  25. Energy efficient application mapping to NoC processing elements operating at multiple voltage levels. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.303secs
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