default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID4. CAAN 2007: Halifax, Canada
- Jeannette C. M. Janssen, Pawel Pralat:
Combinatorial and Algorithmic Aspects of Networking, 4th Workshop, CAAN 2007, Halifax, Canada, August 14, 2007. Revised Papers. Lecture Notes in Computer Science 4852, Springer 2007, ISBN 978-3-540-77293-4
Invited Lectures (Abstracts)
- Peter Winkler:
Luck vs. Skill. 1 - Alejandro López-Ortiz:
Valiant Load Balancing, Benes Networks and Resilient Backbone Design. 2
Contributed Papers
- Alejandro López-Ortiz:
Valiant Load Balancing, Capacity Provisioning and Resilient Backbone Design. 3-12 - Margaret-Ellen Messinger, Pawel Pralat
, Richard J. Nowakowski, Nicholas C. Wormald:
Cleaning Random d-Regular Graphs with Brushes Using a Degree-Greedy Algorithm. 13-26 - Tobias Harks, László A. Végh:
Nonadaptive Selfish Routing with Online Demands. 27-45 - Anthony Bonato, Pawel Pralat, Changping Wang:
Vertex Pursuit Games in Stochastic Network Models. 46-56 - Leah Epstein, Rob van Stee:
Preemptive Scheduling on Selfish Machines. 57-70 - Ioannis Milis, Aris Pagourtzis, Katerina Potika:
Selfish Routing and Path Coloring in All-Optical Networks. 71-84 - Guillermo De Ita Luna, Aurelio López-López:
A Worst-Case Time Upper Bound for Counting the Number of Independent Sets. 85-98 - Dirk Richter, Boris Goldengorin, Gerold Jäger, Paul Molitor:
Improving the Efficiency of Helsgaun's Lin-Kernighan Heuristic for the Symmetric TSP. 99-111 - Zareen Alamgir, Sarmad Abbasi:
Combinatorial Algorithms for Listing Paths in Minimal Change Order. 112-130 - José M. Gutiérrez López, Rubén Cuevas Rumín, Jens Myrup Pedersen, Ole Brun Madsen:
Improving Topological Routing in N2R Networks. 131-148
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.
last updated on 2026-07-29 23:08 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
