![]() | ![]() |
| 2011 | ||
|---|---|---|
| 34 | Fedor V. Fomin, Petr A. Golovach, Alexander Hall, Matús Mihalák, Elias Vicari, Peter Widmayer: How to Guard a Graph? Algorithmica 61(4): 839-856 (2011) | |
| 2010 | ||
| 33 | Georg Baier, Thomas Erlebach, Alexander Hall, Ekkehard Köhler, Petr Kolman, Ondrej Pangrác, Heiko Schilling, Martin Skutella: Length-bounded cuts and flows. ACM Transactions on Algorithms 7(1): 4 (2010) | |
| 2009 | ||
| 32 | Pavel Ghosh, Arunabha Sen, Alexander Hall: Energy efficient application mapping to NoC processing elements operating at multiple voltage levels. NOCS 2009: 80-85 | |
| 2008 | ||
| 31 | 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 | |
| 30 | Sándor P. Fekete, Alexander Hall, Ekkehard Köhler, Alexander Kröller: The Maximum Energy-Constrained Dynamic Flow Problem. SWAT 2008: 114-126 | |
| 29 | Alexander Hall, Evdokia Nikolova, Christos H. Papadimitriou: Incentive-Compatible Interdomain Routing with Linear Utilities. Internet Mathematics 5(4): 395-410 (2008) | |
| 28 | Mark Cieliebak, Alexander Hall, Riko Jacob, Marc Nunkesser: Sequential vector packing. Theor. Comput. Sci. 409(3): 351-363 (2008) | |
| 27 | 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 | ||
| 26 | Mark Cieliebak, Alexander Hall, Riko Jacob, Marc Nunkesser: Sequential Vector Packing. ESCAPE 2007: 12-23 | |
| 25 | Thomas Erlebach, Alexander Hall, Matús Mihalák: Approximate Discovery of Random Graphs. SAGA 2007: 82-92 | |
| 24 | Alexander Hall, C. Pomm, Peter Widmayer: A Combinatorial Approach to Multi-Domain Sketch Recognition. SBM 2007: 7-14 | |
| 23 | Henning Bruhn, Jakub Cerný, Alexander Hall, Petr Kolman: Single source multiroute flows and cuts on uniform capacity networks. SODA 2007: 855-863 | |
| 22 | Alexander Hall, Evdokia Nikolova, Christos H. Papadimitriou: Incentive-Compatible Interdomain Routing with Linear Utilities. WINE 2007: 232-244 | |
| 21 | Alexander Hall, Katharina Langkau, Martin Skutella: An FPTAS for Quickest Multicommodity Flows with Inflow-Dependent Transit Times. Algorithmica 47(3): 299-321 (2007) | |
| 20 | 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) | |
| 19 | Thomas Erlebach, Alexander Hall, Alessandro Panconesi, Danica Vukadinovic: Cuts and Disjoint Paths in the Valley-Free Model. Internet Mathematics 3(3): 333-359 (2007) | |
| 18 | Alexander Hall, Steffen Hippler, Martin Skutella: Multicommodity flows over time: Efficient algorithms and complexity. Theor. Comput. Sci. 379(3): 387-404 (2007) | |
| 17 | Alexander Hall: Scheduling and flow-related problems in networks: algorithms and complexity. ETH Zurich 2007: 1-143 | |
| 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 | |
Colors in the list of coauthors
Last update Fri Jun 1 15:44:53 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page