Alexander Hall

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

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

Coauthor Index

1R. Sai Anand [1] [3]
2Georg Baier [15]
3Giuseppe Di Battista [19]
4Zuzana Beerliova [9] [10] [13]
5Henning Bruhn [22] [25]
6Jakub Cerný [22] [25]
7Mark Cieliebak [24]
8Felix Eberhard [9] [10] [13]
9Thomas Erlebach [1] [2] [3] [7] [8] [9] [10] [13] [14] [15] [16] [18] [19] [23]
10Sándor P. Fekete [26]
11Steffen Hippler [6] [17]
12Michael Hoffmann [9] [10] [13] [16]
13Riko Jacob [24]
14Ekkehard Köhler [15] [26]
15Petr Kolman [22] [25]
16Alexander Kröller (Alexander Kroeller) [26]
17Katharina Langkau [5] [20]
18Matús Mihalák [9] [10] [13] [16] [23]
19Linda S. Moonen [14]
20Evdokia Nikolova [21]
21Marc Nunkesser [24]
22Alessandro Panconesi [8] [14] [18]
23Christos H. Papadimitriou [11] [21]
24Maurizio Patrignani [19]
25Maurizio Pizzonia [19]
26L. Shankar Ram [9] [10] [13]
27Thomas Schank [19]
28Heiko Schilling [12] [15]
29Jiri Sgall [25]
30Martin Skutella [5] [6] [15] [17] [20]
31Frits C. R. Spieksma [14]
32Stamatis Stefanakos [1] [3]
33Hanjo Täubig [4]
34Danica Vukadinovic [8] [14] [18]

Colors in the list of coauthors

Copyright © Wed Jul 23 13:04:14 2008 by Michael Ley (ley@uni-trier.de)