Alex Hall |
|
| alex.hall@gmail.com | |
| Address |
Alex Hall Google Switzerland GmbH Brandschenkestrasse 110 8002 Zurich Switzerland |
| Phone | - |
Photo: (c) Paul Yonchek
|
Photo: (c) Paul Yonchek |
PhD Thesis |
||
 | Alexander Hall: Scheduling and Flow-Related Problems in Networks. ETH Zurich, TIK-Schriftenreihe No. 57, Diss. ETH Zurich No. 15386, December 2003. | Thesis (pdf), Thesis (ps.gz) |
Conference Proceedings |
||
| Sandor P. Fekete, Alexander Hall, Ekkehard K\"ohler, and Alexander Kr\"oller: The Maximum Energy-Constrained Dynamic Flow Problem. To be submitted to: 13th Conference of Integer Programming and Combinatorial Optimization (IPCO08). | |
| Alexander Hall, Evdokia Nikolova, and Christos Papadimitriou: Incentive-Compatible Interdomain Routing with Linear Utilities. Proceedings of the 3rd International Workshop On Internet And Network Economics (WINE 2007), LNCS 4858, Springer Verlag, San Diego, USA, pages 232-244, December 2007. | BGPRoutingHNP07 (pdf) |
| Thomas Erlebach, Alexander Hall, and Matus Mihalak: Approximate Discovery of Random Graphs. Proceedings of the 4th Symposium on Stochastic Algorithms, Foundations, and Applications (SAGA07), LNCS 4665, Springer-Verlag, Zurich, Switzerland, pages 82-92, September 2007. | GnpDiscovEHM07 (pdf), springerlink.com |
| Alexander Hall, Conrad Pomm, and Peter Widmayer: A Combinatorial Approach to Multi-Domain Sketch Recognition. Proceedings of the 4th Eurographics Workshop on Sketch-Based Interfaces and Modeling (SBIM07), to appear, August 2007. | SketchHPW07 (pdf) |
| Mark Cieliebak, Alexander Hall, Riko Jacob, and Marc Nunkesser: Sequential Vector Packing. Proceedings of the International Symposium on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies (ESCAPE 07), LNCS 4614, Springer-Verlag, Hangzhou, China, pages 12-23, April 2007. | SVPackCHJN06 (pdf), springerlink.com |
| Henning Bruhn, Jakub Cerny, Alexander Hall, and Petr Kolman: Single Source Multiroute Flows and Cuts on Uniform Capacity Networks. Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 07), ACM-SIAM, New Orleans, USA, pages 855-863, January 2007. | HFlowsBCHK07 (pdf), portal.acm.org |
| Georg Baier, Thomas Erlebach, Alexander Hall, Ekkehard K\"ohler, Heiko Schilling, and Martin Skutella: Length-Bounded Cuts and Flows. Proceedings of the 33rd International Colloquium on Automata, Languages and Programming (ICALP 06), LNCS 4051, Springer-Verlag, Venice, Italy, pages 679-690, July 2006. | full version (pdf), springerlink.com |
| Thomas Erlebach, Alexander Hall, Michael Hoffmann, and Matus Mihalak: Network Discovery and Verification with Distance Queries. Proceedings of the 6th International Conference on Algorithms and Complexity (CIAC 06), LNCS 3998, Springer-Verlag, Rome, Italy, pages 69-80, May 2006. | full version (pdf), springerlink.com |
| Alexander Hall and Christos Papadimitriou: Approximating the Distortion. Proceedings of the 8th Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 05), LNCS 3624, Springer-Verlag, Berkeley, USA, pages 111-122, August 2005. | full version (pdf), springerlink.com |
| Zuzana Beerliova, Felix Eberhard, Thomas Erlebach, Alexander Hall, Michael Hoffmann, Matus Mihalak, and L. Shankar Ram: Network Discovery and Verification. Proceedings of the 31st International Workshop on Graph-Theoretic Concepts in Computer Science (WG 05), LNCS 3787, Springer-Verlag, Metz, France, pages 127-138, June 2005. | DiscovBEEHHMR05 (pdf), springerlink.com |
| Alexander Hall and Heiko Schilling: Flows over Time: Towards a more Realistic and Computationally Tractable Model. Proceedings of the 7th Workshop on Algorithm Engineering and Experiments (ALENEX 05), SIAM, Vancouver, Canada, pages 55-67, January 2005. | FlowsRealisticHS05 (pdf) |
| Thomas Erlebach, Alexander Hall, Alessandro Panconesi, and Danica Vukadinovic: Cuts and Disjoint Paths in the Valley-Free Path Model of Internet BGP Routing. Proceedings of the 1st Workshop on Combinatorial and Algorithmic Aspects of Networking (CAAN 04), LNCS 3405, Springer-Verlag, pages 49-62, August 2004. | ValleyFreeEHPV04 (pdf), springerlink.com |
| Alexander Hall, Katharina Langkau, and Martin Skutella: An FPTAS for Quickest Multicommodity Flows with Inflow-Dependent Transit Times. Proceedings of the 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 03), LNCS 2764, Springer-Verlag, Princeton, USA, pages 71-82, August 2003. | full version (pdf), springerlink.com |
| Alexander Hall, Steffen Hippler, and Martin Skutella: Multicommodity Flows Over Time: Efficient Algorithms and Complexity. Proceedings of the 13th International Colloquium on Automata, Languages and Programming (ICALP 03), LNCS 2719, Springer-Verlag, Eindhoven, Netherlands, pages 397-409, June 2003. | full version (pdf), springerlink.com |
| Alexander Hall and Hanjo T\"aubig: Comparing Push- and Pull-Based Broadcasting. Or: Would ``Microsoft Watches'' Profit from a Transmitter?. Proceedings of the 2nd International Workshop on Experimental and Efficient Algorithms (WEA 03), LNCS 2647, Springer-Verlag, Ascona, Switzerland, pages 148-164, January 2003. | PushPullHT03 (pdf), springerlink.com |
| Thomas Erlebach, Alexander Hall, and Thomas Schank: Classifying Customer-Provider Relationships in the Internet. IASTED International Conference on Communications and Computer Networks (CCN 02), pages 538-545, November 2002. | ClasifEHS02 (pdf) |
| Sai Anand, Thomas Erlebach, Alexander Hall, and Stamatis Stefanakos: Call Control with k Rejections. Proceedings of the 8th Scandinavian Workshop on Algorithm Theory (SWAT 02), LNCS 2368, Springer-Verlag, Turku, Finland, pages 308-317, July 2002. | CallControlAEHS02 (pdf), springerlink.com |
| Thomas Erlebach and Alexander Hall: NP-Hardness of Broadcast Scheduling and Inapproximability of Single-Source Unsplittable Min-Cost Flow. Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 02), ACM-SIAM, San Francisco, USA, pages 194-202, January 2002. | BroadcastEH02 (pdf), portal.acm.org |
Journals |
||
| Thomas Erlebach, Alexander Hall, Alessandro Panconesi, and Danica Vukadinovic: Cuts and Disjoint Paths in the Valley-Free Path Model. Journal of Internet Mathematics, A K Peters, to appear. | prelim (pdf) |
| Alexander Hall, Steffen Hippler, and Martin Skutella: Multicommodity Flows Over Time: Efficient Algorithms and Complexity. Theoretical Computer Science, Vol. 379(3), pages 387-404, June 2007. | prelim (pdf), sciencedirect.com |
| Guiseppe Di Battista, Thomas Erlebach, Alexander Hall, Maurizio Patrignani, Maurizio Pizzonia, and Thomas Schank: Computing the Types of the Relationships between Autonomous Systems. IEEE/ACM Transactions on Networking, Vol. 15(2), pages 267-280, April 2007. | prelim (pdf), ieeexplore |
| Alexander Hall, Katharina Langkau, and Martin Skutella: An FPTAS for Quickest Multicommodity Flows with Inflow-Dependent Transit Times. Algorithmica, Elsevier, Vol. 47(3), pages 299-321, April 2007. | prelim (pdf), springerlink.com |
| Zuzana Beerliova, Felix Eberhard, Thomas Erlebach, Alexander Hall, Michael Hoffmann, Matus Mihalak, and L. Shankar Ram: Network Discovery and Verification. IEEE Journal on Selected Areas in Communications, Vol. 24(12), pages 2168-2181, December 2006. | prelim (pdf), ieeexplore |
| Thomas Erlebach and Alexander Hall: NP-Hardness of Broadcast Scheduling and Inapproximability of Single-Source Unsplittable Min-Cost Flow. Journal of Scheduling, Kluwer Academic Publishers, Vol. 7, pages 223-241, July 2004. | prelim (pdf), kluweronline.com |
| Sai Anand, Thomas Erlebach, Alexander Hall, and Stamatis Stefanakos: Call control with k Rejections. Journal of Computer and System Sciences, Elsevier, Vol. 67(4), pages 707-722, December 2003. | prelim (pdf), sciencedirect.com |
Technical Reports |
||
| Alain Barrat, Alexander Hall, and Matus Mihalak: Network Discovery on Snapshots of the Internet Graph. DELIS Technical Report 0465, December 2006. | |
| Mark Cieliebak, Alexander Hall, Riko Jacob, and Marc Nunkesser: Sequential Vector Packing. DELIS Technical Report 0335, August 2006. | SVPackCHJN06 (pdf) |
| Alexander Hall and Heiko Schilling: Flows over Time: Towards a more Realistic and Computationally Tractable Model. TU-Berlin COGA Technical Report 035-2004, December 2004. | Report-035-2004 (pdf), Report-035-2004 (ps.gz) |
| Thomas Erlebach, Alexander Hall, Alessandro Panconesi, and Danica Vukadinovic: Cuts and Disjoint Paths in the Valley-Free Path Model. TIK Report Nr. 180, September 2003. | TIK-Report180 (pdf), TIK-Report180 (ps.gz) |
| Alexander Hall, Katharina Langkau, and Martin Skutella: An FPTAS for Quickest Multicommodity Flows with Inflow-Dependent Transit Times. TU-Berlin COGA Technical Report 024-2003, May 2003. | Techn. Report (pdf), Techn. Report (ps.gz) |
| Thomas Erlebach, Alexander Hall, and Thomas Schank: Classifying Customer-Provider Relationships in the Internet. TIK Report Nr. 145, July 2002. | TIK-Report145 (pdf), TIK-Report145 (ps.gz) |
| Thomas Erlebach and Alexander Hall: NP-Hardness of Broadcast Scheduling and Inapproximability of Single-Source Unsplittable Min-Cost Flow. TIK Report Nr. 121, August 2001. | TIK-Report121 (pdf), TIK-Report121 (ps.gz) |