Stop the war!
Остановите войну!
for scientists:
default search action
BibTeX records: Alexander Hall
@article{DBLP:journals/pvldb/KipfCHBA20, author = {Andreas Kipf and Damian Chromejko and Alexander Hall and Peter A. Boncz and David G. Andersen}, title = {Cuckoo Index: {A} Lightweight Secondary Index Structure}, journal = {Proc. {VLDB} Endow.}, volume = {13}, number = {13}, pages = {3559--3572}, year = {2020}, url = {http://www.vldb.org/pvldb/vol13/p3559-kipf.pdf}, doi = {10.14778/3424573.3424577}, timestamp = {Tue, 23 Mar 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/pvldb/KipfCHBA20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/edbt/HeuleNH13, author = {Stefan Heule and Marc Nunkesser and Alexander Hall}, editor = {Giovanna Guerrini and Norman W. Paton}, title = {HyperLogLog in practice: algorithmic engineering of a state of the art cardinality estimation algorithm}, booktitle = {Joint 2013 {EDBT/ICDT} Conferences, {EDBT} '13 Proceedings, Genoa, Italy, March 18-22, 2013}, pages = {683--692}, publisher = {{ACM}}, year = {2013}, url = {https://doi.org/10.1145/2452376.2452456}, doi = {10.1145/2452376.2452456}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/edbt/HeuleNH13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/pvldb/HallBBGN12, author = {Alexander Hall and Olaf Bachmann and Robert B{\"{u}}ssow and Silviu Ganceanu and Marc Nunkesser}, title = {Processing a Trillion Cells per Mouse Click}, journal = {Proc. {VLDB} Endow.}, volume = {5}, number = {11}, pages = {1436--1446}, year = {2012}, url = {http://vldb.org/pvldb/vol5/p1436\_alexanderhall\_vldb2012.pdf}, doi = {10.14778/2350229.2350259}, timestamp = {Sat, 25 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/pvldb/HallBBGN12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1208-0225, author = {Alexander Hall and Olaf Bachmann and Robert B{\"{u}}ssow and Silviu Ganceanu and Marc Nunkesser}, title = {Processing a Trillion Cells per Mouse Click}, journal = {CoRR}, volume = {abs/1208.0225}, year = {2012}, url = {http://arxiv.org/abs/1208.0225}, eprinttype = {arXiv}, eprint = {1208.0225}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1208-0225.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/FominGHMVW11, author = {Fedor V. Fomin and Petr A. Golovach and Alexander Hall and Mat{\'{u}}s Mihal{\'{a}}k and Elias Vicari and Peter Widmayer}, title = {How to Guard a Graph?}, journal = {Algorithmica}, volume = {61}, number = {4}, pages = {839--856}, year = {2011}, url = {https://doi.org/10.1007/s00453-009-9382-4}, doi = {10.1007/S00453-009-9382-4}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/FominGHMVW11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/talg/BaierEHKKPSS10, author = {Georg Baier and Thomas Erlebach and Alexander Hall and Ekkehard K{\"{o}}hler and Petr Kolman and Ondrej Pangr{\'{a}}c and Heiko Schilling and Martin Skutella}, title = {Length-bounded cuts and flows}, journal = {{ACM} Trans. Algorithms}, volume = {7}, number = {1}, pages = {4:1--4:27}, year = {2010}, url = {https://doi.org/10.1145/1868237.1868241}, doi = {10.1145/1868237.1868241}, timestamp = {Mon, 28 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/talg/BaierEHKKPSS10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/nocs/GhoshSH09, author = {Pavel Ghosh and Arunabha Sen and Alexander Hall}, title = {Energy efficient application mapping to NoC processing elements operating at multiple voltage levels}, booktitle = {Third International Symposium on Networks-on-Chips, {NOCS} 2009, May 10-13 2009, La Jolla, CA, {USA.} Proceedings}, pages = {80--85}, publisher = {{IEEE} Computer Society}, year = {2009}, url = {https://doi.org/10.1109/NOCS.2009.5071448}, doi = {10.1109/NOCS.2009.5071448}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/nocs/GhoshSH09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/im/HallNP08, author = {Alexander Hall and Evdokia Nikolova and Christos H. Papadimitriou}, title = {Incentive-Compatible Interdomain Routing with Linear Utilities}, journal = {Internet Math.}, volume = {5}, number = {4}, pages = {395--410}, year = {2008}, url = {https://doi.org/10.1080/15427951.2008.10129169}, doi = {10.1080/15427951.2008.10129169}, timestamp = {Mon, 26 Oct 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/im/HallNP08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/CieliebakHJN08, author = {Mark Cieliebak and Alexander Hall and Riko Jacob and Marc Nunkesser}, title = {Sequential vector packing}, journal = {Theor. Comput. Sci.}, volume = {409}, number = {3}, pages = {351--363}, year = {2008}, url = {https://doi.org/10.1016/j.tcs.2008.07.027}, doi = {10.1016/J.TCS.2008.07.027}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/CieliebakHJN08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/toc/BruhnCHKS08, author = {Henning Bruhn and Jakub Cern{\'{y}} and Alexander Hall and Petr Kolman and Jir{\'{\i}} Sgall}, title = {Single Source Multiroute Flows and Cuts on Uniform Capacity Networks}, journal = {Theory Comput.}, volume = {4}, number = {1}, pages = {1--20}, year = {2008}, url = {https://doi.org/10.4086/toc.2008.v004a001}, doi = {10.4086/TOC.2008.V004A001}, timestamp = {Sun, 21 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/toc/BruhnCHKS08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/FominGHMVW08, author = {Fedor V. Fomin and Petr A. Golovach and Alexander Hall and Mat{\'{u}}s Mihal{\'{a}}k and Elias Vicari and Peter Widmayer}, editor = {Seok{-}Hee Hong and Hiroshi Nagamochi and Takuro Fukunaga}, title = {How to Guard a Graph?}, booktitle = {Algorithms and Computation, 19th International Symposium, {ISAAC} 2008, Gold Coast, Australia, December 15-17, 2008. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5369}, pages = {318--329}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-92182-0\_30}, doi = {10.1007/978-3-540-92182-0\_30}, timestamp = {Thu, 27 Apr 2023 14:57:19 +0200}, biburl = {https://dblp.org/rec/conf/isaac/FominGHMVW08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/swat/FeketeHKK08, author = {S{\'{a}}ndor P. Fekete and Alexander Hall and Ekkehard K{\"{o}}hler and Alexander Kr{\"{o}}ller}, editor = {Joachim Gudmundsson}, title = {The Maximum Energy-Constrained Dynamic Flow Problem}, booktitle = {Algorithm Theory - {SWAT} 2008, 11th Scandinavian Workshop on Algorithm Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5124}, pages = {114--126}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-69903-3\_12}, doi = {10.1007/978-3-540-69903-3\_12}, timestamp = {Tue, 14 May 2019 10:00:39 +0200}, biburl = {https://dblp.org/rec/conf/swat/FeketeHKK08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@phdthesis{DBLP:phd/ch/Hall2007, author = {Alexander Hall}, title = {Scheduling and flow-related problems in networks: algorithms and complexity}, school = {{ETH} Zurich}, year = {2007}, url = {https://d-nb.info/986348287}, isbn = {978-3-8364-1701-3}, timestamp = {Sat, 17 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/phd/ch/Hall2007.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/HallLS07, author = {Alexander Hall and Katharina Langkau and Martin Skutella}, title = {An {FPTAS} for Quickest Multicommodity Flows with Inflow-Dependent Transit Times}, journal = {Algorithmica}, volume = {47}, number = {3}, pages = {299--321}, year = {2007}, url = {https://doi.org/10.1007/s00453-006-0196-3}, doi = {10.1007/S00453-006-0196-3}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/HallLS07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/im/ErlebachHPV07, author = {Thomas Erlebach and Alexander Hall and Alessandro Panconesi and Danica Vukadinovic}, title = {Cuts and Disjoint Paths in the Valley-Free Model}, journal = {Internet Math.}, volume = {3}, number = {3}, pages = {333--359}, year = {2007}, url = {https://doi.org/10.1080/15427951.2006.10129126}, doi = {10.1080/15427951.2006.10129126}, timestamp = {Sun, 17 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/im/ErlebachHPV07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/HallHS07, author = {Alexander Hall and Steffen Hippler and Martin Skutella}, title = {Multicommodity flows over time: Efficient algorithms and complexity}, journal = {Theor. Comput. Sci.}, volume = {379}, number = {3}, pages = {387--404}, year = {2007}, url = {https://doi.org/10.1016/j.tcs.2007.02.046}, doi = {10.1016/J.TCS.2007.02.046}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/HallHS07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ton/BattistaEHPPS07, author = {Giuseppe Di Battista and Thomas Erlebach and Alexander Hall and Maurizio Patrignani and Maurizio Pizzonia and Thomas Schank}, title = {Computing the types of the relationships between autonomous systems}, journal = {{IEEE/ACM} Trans. Netw.}, volume = {15}, number = {2}, pages = {267--280}, year = {2007}, url = {http://doi.acm.org/10.1145/1279660.1279662}, doi = {10.1145/1279660.1279662}, timestamp = {Tue, 23 Oct 2007 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ton/BattistaEHPPS07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/escape/CieliebakHJN07, author = {Mark Cieliebak and Alexander Hall and Riko Jacob and Marc Nunkesser}, editor = {Bo Chen and Mike Paterson and Guochuan Zhang}, title = {Sequential Vector Packing}, booktitle = {Combinatorics, Algorithms, Probabilistic and Experimental Methodologies, First International Symposium, {ESCAPE} 2007, Hangzhou, China, April 7-9, 2007, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {4614}, pages = {12--23}, publisher = {Springer}, year = {2007}, url = {https://doi.org/10.1007/978-3-540-74450-4\_2}, doi = {10.1007/978-3-540-74450-4\_2}, timestamp = {Tue, 14 May 2019 10:00:54 +0200}, biburl = {https://dblp.org/rec/conf/escape/CieliebakHJN07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/saga/ErlebachHM07, author = {Thomas Erlebach and Alexander Hall and Mat{\'{u}}s Mihal{\'{a}}k}, editor = {Juraj Hromkovic and Richard Kr{\'{a}}lovic and Marc Nunkesser and Peter Widmayer}, title = {Approximate Discovery of Random Graphs}, booktitle = {Stochastic Algorithms: Foundations and Applications, 4th International Symposium, {SAGA} 2007, Zurich, Switzerland, September 13-14, 2007, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {4665}, pages = {82--92}, publisher = {Springer}, year = {2007}, url = {https://doi.org/10.1007/978-3-540-74871-7\_8}, doi = {10.1007/978-3-540-74871-7\_8}, timestamp = {Tue, 14 May 2019 10:00:40 +0200}, biburl = {https://dblp.org/rec/conf/saga/ErlebachHM07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sbm/HallPW07, author = {Alexander Hall and C. Pomm and Peter Widmayer}, editor = {Michiel van de Panne and Eric Saund}, title = {A Combinatorial Approach to Multi-Domain Sketch Recognition}, booktitle = {4th Eurographics Workshop on Sketch-Based Interfaces and Modeling, {SBIM} 2007, Riverside, CA, USA, August 2-3, 2007, Proceedings}, pages = {7--14}, publisher = {Eurographics Association}, year = {2007}, url = {https://doi.org/10.2312/SBM/SBM07/007-014}, doi = {10.2312/SBM/SBM07/007-014}, timestamp = {Wed, 19 Aug 2020 10:18:50 +0200}, biburl = {https://dblp.org/rec/conf/sbm/HallPW07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/BruhnCHK07, author = {Henning Bruhn and Jakub Cern{\'{y}} and Alexander Hall and Petr Kolman}, editor = {Nikhil Bansal and Kirk Pruhs and Clifford Stein}, title = {Single source multiroute flows and cuts on uniform capacity networks}, booktitle = {Proceedings of the Eighteenth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2007, New Orleans, Louisiana, USA, January 7-9, 2007}, pages = {855--863}, publisher = {{SIAM}}, year = {2007}, url = {http://dl.acm.org/citation.cfm?id=1283383.1283475}, timestamp = {Tue, 15 Feb 2022 07:54:27 +0100}, biburl = {https://dblp.org/rec/conf/soda/BruhnCHK07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wine/HallNP07, author = {Alexander Hall and Evdokia Nikolova and Christos H. Papadimitriou}, editor = {Xiaotie Deng and Fan Chung Graham}, title = {Incentive-Compatible Interdomain Routing with Linear Utilities}, booktitle = {Internet and Network Economics, Third International Workshop, {WINE} 2007, San Diego, CA, USA, December 12-14, 2007, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {4858}, pages = {232--244}, publisher = {Springer}, year = {2007}, url = {https://doi.org/10.1007/978-3-540-77105-0\_23}, doi = {10.1007/978-3-540-77105-0\_23}, timestamp = {Tue, 14 May 2019 10:00:37 +0200}, biburl = {https://dblp.org/rec/conf/wine/HallNP07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jsac/BeerliovaEEHHMR06, author = {Zuzana Beerliova and Felix Eberhard and Thomas Erlebach and Alexander Hall and Michael Hoffmann and Mat{\'{u}}s Mihal{\'{a}}k and L. Shankar Ram}, title = {Network Discovery and Verification}, journal = {{IEEE} J. Sel. Areas Commun.}, volume = {24}, number = {12}, pages = {2168--2181}, year = {2006}, url = {https://doi.org/10.1109/JSAC.2006.884015}, doi = {10.1109/JSAC.2006.884015}, timestamp = {Thu, 02 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jsac/BeerliovaEEHHMR06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ciac/ErlebachHHM06, author = {Thomas Erlebach and Alexander Hall and Michael Hoffmann and Mat{\'{u}}s Mihal{\'{a}}k}, editor = {Tiziana Calamoneri and Irene Finocchi and Giuseppe F. Italiano}, title = {Network Discovery and Verification with Distance Queries}, booktitle = {Algorithms and Complexity, 6th Italian Conference, {CIAC} 2006, Rome, Italy, May 29-31, 2006, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3998}, pages = {69--80}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11758471\_10}, doi = {10.1007/11758471\_10}, timestamp = {Tue, 14 May 2019 10:00:53 +0200}, biburl = {https://dblp.org/rec/conf/ciac/ErlebachHHM06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/dics/ErlebachHMPSV06, author = {Thomas Erlebach and Alexander Hall and Linda S. Moonen and Alessandro Panconesi and Frits C. R. Spieksma and Danica Vukadinovic}, editor = {J{\"{u}}rg Kohlas and Bertrand Meyer and Andr{\'{e}} Schiper}, title = {Robustness of the Internet at the Topology and Routing Level}, booktitle = {Dependable Systems: Software, Computing, Networks, Research Results of the {DICS} Program}, series = {Lecture Notes in Computer Science}, volume = {4028}, pages = {260--274}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11808107\_12}, doi = {10.1007/11808107\_12}, timestamp = {Tue, 14 May 2019 10:00:51 +0200}, biburl = {https://dblp.org/rec/conf/dics/ErlebachHMPSV06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/BaierEHKSS06, author = {Georg Baier and Thomas Erlebach and Alexander Hall and Ekkehard K{\"{o}}hler and Heiko Schilling and Martin Skutella}, editor = {Michele Bugliesi and Bart Preneel and Vladimiro Sassone and Ingo Wegener}, title = {Length-Bounded Cuts and Flows}, booktitle = {Automata, Languages and Programming, 33rd International Colloquium, {ICALP} 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part {I}}, series = {Lecture Notes in Computer Science}, volume = {4051}, pages = {679--690}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11786986\_59}, doi = {10.1007/11786986\_59}, timestamp = {Tue, 14 May 2019 10:00:44 +0200}, biburl = {https://dblp.org/rec/conf/icalp/BaierEHKSS06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/alenex/HallS05, author = {Alexander Hall and Heiko Schilling}, editor = {Camil Demetrescu and Robert Sedgewick and Roberto Tamassia}, title = {Flows over Time: Towards a More Realistic and Computationally Tractable Model}, booktitle = {Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics, {ALENEX} /ANALCO 2005, Vancouver, BC, Canada, 22 January 2005}, pages = {55--67}, publisher = {{SIAM}}, year = {2005}, url = {http://www.siam.org/meetings/alenex05/papers/05ahall.pdf}, timestamp = {Tue, 30 Jan 2007 13:47:28 +0100}, biburl = {https://dblp.org/rec/conf/alenex/HallS05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/HallP05, author = {Alexander Hall and Christos H. Papadimitriou}, editor = {Chandra Chekuri and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Luca Trevisan}, title = {Approximating the Distortion}, booktitle = {Approximation, Randomization and Combinatorial Optimization, Algorithms and Techniques, 8th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, {APPROX} 2005 and 9th InternationalWorkshop on Randomization and Computation, {RANDOM} 2005, Berkeley, CA, USA, August 22-24, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3624}, pages = {111--122}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11538462\_10}, doi = {10.1007/11538462\_10}, timestamp = {Tue, 21 Sep 2021 09:36:24 +0200}, biburl = {https://dblp.org/rec/conf/approx/HallP05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BeerliovaEEHHMR05, author = {Zuzana Beerliova and Felix Eberhard and Thomas Erlebach and Alexander Hall and Michael Hoffmann and Mat{\'{u}}s Mihal{\'{a}}k and L. Shankar Ram}, editor = {Dieter Kratsch}, title = {Network Discovery and Verification}, booktitle = {Graph-Theoretic Concepts in Computer Science, 31st International Workshop, {WG} 2005, Metz, France, June 23-25, 2005, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {3787}, pages = {127--138}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11604686\_12}, doi = {10.1007/11604686\_12}, timestamp = {Tue, 14 May 2019 10:00:40 +0200}, biburl = {https://dblp.org/rec/conf/wg/BeerliovaEEHHMR05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/dagstuhl/BeerliovaEEHHMR05, author = {Zuzana Beerliova and Felix Eberhard and Thomas Erlebach and Alexander Hall and Michael Hoffmann and Mat{\'{u}}s Mihal{\'{a}}k and L. Shankar Ram}, editor = {Susanne Albers and Rolf H. M{\"{o}}hring and Georg Ch. Pflug and R{\"{u}}diger Schultz}, title = {Network Discovery and Verification}, booktitle = {Algorithms for Optimization with Incomplete Information, 16.-21. January 2005}, series = {Dagstuhl Seminar Proceedings}, volume = {05031}, publisher = {IBFI, Schloss Dagstuhl, Germany}, year = {2005}, url = {http://drops.dagstuhl.de/opus/volltexte/2005/59}, timestamp = {Thu, 10 Jun 2021 13:02:06 +0200}, biburl = {https://dblp.org/rec/conf/dagstuhl/BeerliovaEEHHMR05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/scheduling/ErlebachH04, author = {Thomas Erlebach and Alexander Hall}, title = {NP-Hardness of Broadcast Scheduling and Inapproximability of Single-Source Unsplittable Min-Cost Flow}, journal = {J. Sched.}, volume = {7}, number = {3}, pages = {223--241}, year = {2004}, url = {https://doi.org/10.1023/B:JOSH.0000019682.75022.96}, doi = {10.1023/B:JOSH.0000019682.75022.96}, timestamp = {Wed, 01 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/scheduling/ErlebachH04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/caan/ErlebachHPV04, author = {Thomas Erlebach and Alexander Hall and Alessandro Panconesi and Danica Vukadinovic}, editor = {Alejandro L{\'{o}}pez{-}Ortiz and Ang{\`{e}}le M. Hamel}, title = {Cuts and Disjoint Paths in the Valley-Free Path Model of Internet {BGP} Routing}, booktitle = {Combinatorial and Algorithmic Aspects of Networking, First Workshop on Combinatorial and Algorithmic Aspects of Networking, {CAAN} 2004, Banff, Alberta, Canada, August 5-7, 2004, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {3405}, pages = {49--62}, publisher = {Springer}, year = {2004}, url = {https://doi.org/10.1007/11527954\_6}, doi = {10.1007/11527954\_6}, timestamp = {Tue, 14 May 2019 10:00:49 +0200}, biburl = {https://dblp.org/rec/conf/caan/ErlebachHPV04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/AnandEHS03, author = {R. Sai Anand and Thomas Erlebach and Alexander Hall and Stamatis Stefanakos}, title = {Call control with \emph{k} rejections}, journal = {J. Comput. Syst. Sci.}, volume = {67}, number = {4}, pages = {707--722}, year = {2003}, url = {https://doi.org/10.1016/S0022-0000(03)00076-X}, doi = {10.1016/S0022-0000(03)00076-X}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/AnandEHS03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/HallHS03, author = {Alexander Hall and Steffen Hippler and Martin Skutella}, editor = {Jos C. M. Baeten and Jan Karel Lenstra and Joachim Parrow and Gerhard J. Woeginger}, title = {Multicommodity Flows over Time: Efficient Algorithms and Complexity}, booktitle = {Automata, Languages and Programming, 30th International Colloquium, {ICALP} 2003, Eindhoven, The Netherlands, June 30 - July 4, 2003. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2719}, pages = {397--409}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/3-540-45061-0\_33}, doi = {10.1007/3-540-45061-0\_33}, timestamp = {Tue, 14 May 2019 10:00:44 +0200}, biburl = {https://dblp.org/rec/conf/icalp/HallHS03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/random/HallLS03, author = {Alexander Hall and Katharina Langkau and Martin Skutella}, editor = {Sanjeev Arora and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Amit Sahai}, title = {An {FPTAS} for Quickest Multicommodity Flows with Inflow-Dependent Transit Times}, booktitle = {Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques, 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, {APPROX} 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, {RANDOM} 2003, Princeton, NJ, USA, August 24-26, 2003, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2764}, pages = {71--82}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/978-3-540-45198-3\_7}, doi = {10.1007/978-3-540-45198-3\_7}, timestamp = {Tue, 14 May 2019 10:00:48 +0200}, biburl = {https://dblp.org/rec/conf/random/HallLS03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wea/HallT03, author = {Alexander Hall and Hanjo T{\"{a}}ubig}, editor = {Klaus Jansen and Marian Margraf and Monaldo Mastrolilli and Jos{\'{e}} D. P. Rolim}, title = {Comparing Push- and Pull-Based Broadcasting}, booktitle = {Experimental and Efficient Algorithms, Second International Workshop, {WEA} 2003, Ascona, Switzerland, May 26-28, 2003, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2647}, pages = {148--164}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/3-540-44867-5\_12}, doi = {10.1007/3-540-44867-5\_12}, timestamp = {Sun, 25 Oct 2020 22:45:48 +0100}, biburl = {https://dblp.org/rec/conf/wea/HallT03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/ErlebachH02, author = {Thomas Erlebach and Alexander Hall}, editor = {David Eppstein}, title = {NP-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow}, booktitle = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete Algorithms, January 6-8, 2002, San Francisco, CA, {USA}}, pages = {194--202}, publisher = {{ACM/SIAM}}, year = {2002}, url = {http://dl.acm.org/citation.cfm?id=545381.545405}, timestamp = {Fri, 07 Dec 2012 17:02:08 +0100}, biburl = {https://dblp.org/rec/conf/soda/ErlebachH02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/swat/AnandEHS02, author = {R. Sai Anand and Thomas Erlebach and Alexander Hall and Stamatis Stefanakos}, editor = {Martti Penttonen and Erik Meineche Schmidt}, title = {Call Control with k Rejections}, booktitle = {Algorithm Theory - {SWAT} 2002, 8th Scandinavian Workshop on Algorithm Theory, Turku, Finland, July 3-5, 2002 Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2368}, pages = {308--317}, publisher = {Springer}, year = {2002}, url = {https://doi.org/10.1007/3-540-45471-3\_32}, doi = {10.1007/3-540-45471-3\_32}, timestamp = {Tue, 14 May 2019 10:00:39 +0200}, biburl = {https://dblp.org/rec/conf/swat/AnandEHS02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.