Alexander Hall

	2008
28		Fedor V. Fomin, Petr A. Golovach, Alexander Hall, Matús Mihalák, Elias Vicari, Peter Widmayer: How to Guard a Graph?. ISAAC 2008: 318-329
27		Sándor P. Fekete, Alexander Hall, Ekkehard Köhler, Alexander Kröller: The Maximum Energy-Constrained Dynamic Flow Problem. SWAT 2008: 114-126
26		Mark Cieliebak, Alexander Hall, Riko Jacob, Marc Nunkesser: Sequential vector packing. Theor. Comput. Sci. 409(3): 351-363 (2008)
25		Henning 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
24		Mark Cieliebak, Alexander Hall, Riko Jacob, Marc Nunkesser: Sequential Vector Packing. ESCAPE 2007: 12-23
23		Thomas Erlebach, Alexander Hall, Matús Mihalák: Approximate Discovery of Random Graphs. SAGA 2007: 82-92
22		Henning Bruhn, Jakub Cerný, Alexander Hall, Petr Kolman: Single source multiroute flows and cuts on uniform capacity networks. SODA 2007: 855-863
21		Alexander Hall, Evdokia Nikolova, Christos H. Papadimitriou: Incentive-Compatible Interdomain Routing with Linear Utilities. WINE 2007: 232-244
20		Alexander Hall, Katharina Langkau, Martin Skutella: An FPTAS for Quickest Multicommodity Flows with Inflow-Dependent Transit Times. Algorithmica 47(3): 299-321 (2007)
19		Giuseppe 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)
17		Alexander Hall, Steffen Hippler, Martin Skutella: Multicommodity flows over time: Efficient algorithms and complexity. Theor. Comput. Sci. 379(3): 387-404 (2007)
	2006
16		Thomas Erlebach, Alexander Hall, Michael Hoffmann, Matús Mihalák: Network Discovery and Verification with Distance Queries. CIAC 2006: 69-80
15		Georg Baier, Thomas Erlebach, Alexander Hall, Ekkehard Köhler, Heiko Schilling, Martin Skutella: Length-Bounded Cuts and Flows. ICALP (1) 2006: 679-690
14		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. Research Results of the DICS Program 2006: 260-274
13		Zuzana 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
12		Alexander Hall, Heiko Schilling: Flows over Time: Towards a More Realistic and Computationally Tractable Model. ALENEX/ANALCO 2005: 55-67
11		Alexander Hall, Christos H. Papadimitriou: Approximating the Distortion. APPROX-RANDOM 2005: 111-122
10		Zuzana 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
9		Zuzana 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
8		Thomas 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
7		Thomas 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
6		Alexander Hall, Steffen Hippler, Martin Skutella: Multicommodity Flows over Time: Efficient Algorithms and Complexity. ICALP 2003: 397-409
5		Alexander Hall, Katharina Langkau, Martin Skutella: An FPTAS for Quickest Multicommodity Flows with Inflow-Dependent Transit Times. RANDOM-APPROX 2003: 71-82
4		Alexander Hall, Hanjo Täubig: Comparing Push- and Pull-Based Broadcasting. WEA 2003: 148-164
3		R. Sai Anand, Thomas Erlebach, Alexander Hall, Stamatis Stefanakos: Call control with k rejections. J. Comput. Syst. Sci. 67(4): 707-722 (2003)
	2002
2		Thomas Erlebach, Alexander Hall: NP-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow. SODA 2002: 194-202
1		R. Sai Anand, Thomas Erlebach, Alexander Hall, Stamatis Stefanakos: Call Control with k Rejections. SWAT 2002: 308-317

Coauthor Index

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

Colors in the list of coauthors