Sign in
CAAN
2004
2005
2006
2007
2004
2007
Keyphrases
Publications
2007
Leah Epstein
,
Rob van Stee
Preemptive Scheduling on Selfish Machines.
CAAN
(2007)
Dirk Richter
,
Boris Goldengorin
,
Gerold Jäger
,
Paul Molitor
Improving the Efficiency of Helsgaun's Lin-Kernighan Heuristic for the Symmetric TSP.
CAAN
(2007)
Zareen Alamgir
,
Sarmad Abbasi
Combinatorial Algorithms for Listing Paths in Minimal Change Order.
CAAN
(2007)
Guillermo De Ita Luna
,
Aurelio López-López
A Worst-Case Time Upper Bound for Counting the Number of Independent Sets.
CAAN
(2007)
Peter Winkler
Luck vs. Skill.
CAAN
(2007)
José M. Gutiérrez López
,
Rubén Cuevas Rumín
,
Jens Myrup Pedersen
,
Ole Brun Madsen
Improving Topological Routing in N2R Networks.
CAAN
(2007)
Alejandro López-Ortiz
Valiant Load Balancing, Benes Networks and Resilient Backbone Design.
CAAN
(2007)
Tobias Harks
,
László A. Végh
Nonadaptive Selfish Routing with Online Demands.
CAAN
(2007)
Ioannis Milis
,
Aris Pagourtzis
,
Katerina Potika
Selfish Routing and Path Coloring in All-Optical Networks.
CAAN
(2007)
Margaret-Ellen Messinger
,
Pawel Pralat
,
Richard J. Nowakowski
,
Nicholas C. Wormald
-Regular Graphs with Brushes Using a Degree-Greedy Algorithm.
CAAN
(2007)
Anthony Bonato
,
Pawel Pralat
,
Changping Wang
Vertex Pursuit Games in Stochastic Network Models.
CAAN
(2007)
Alejandro López-Ortiz
Valiant Load Balancing, Capacity Provisioning and Resilient Backbone Design.
CAAN
(2007)
volume 4852, 2007
Combinatorial and Algorithmic Aspects of Networking, 4th Workshop, CAAN 2007, Halifax, Canada, August 14, 2007. Revised Papers
CAAN
4852 (2007)
2006
Davide Bilò
,
Luciano Gualà
,
Guido Proietti
Designing a Truthful Mechanism for a Spanning Arborescence Bicriteria Problem.
CAAN
(2006)
Pier Francesco Cortese
,
Giuseppe Di Battista
,
Fabrizio Frati
,
Luca Grilli
,
Katharina Anna Lehmann
,
Giuseppe Liotta
,
Maurizio Patrignani
,
Ioannis G. Tollis
,
Francesco Trotta
On the Topologies of Local Minimum Spanning Trees.
CAAN
(2006)
Andreas Baltz
,
Sandro Esquivel
,
Lasse Kliemann
,
Anand Srivastav
The Price of Anarchy in Selfish Multicast Routing.
CAAN
(2006)
Ioannis Z. Emiris
,
Euripides Markou
,
Aris Pagourtzis
Distributed Routing in Tree Networks with Few Landmarks.
CAAN
(2006)
Guy Even
,
Shimon Shahar
Scheduling of a Smart Antenna: Capacitated Coloring of Unit Circular-Arc Graphs.
CAAN
(2006)
Fredrik Manne
,
Qin Xin
Optimal Gossiping with Unit Size Messages in Known Topology Radio Networks.
CAAN
(2006)
Andrzej Lingas
,
Mia Persson
,
Martin Wahlen
Case).
CAAN
(2006)
Boris Goldengorin
,
Gerold Jäger
,
Paul Molitor
Tolerance Based Contract-or-Patch Heuristic for the Asymmetric TSP.
CAAN
(2006)
Sven Kosub
,
Moritz G. Maaß
,
Hanjo Täubig
Acyclic Type-of-Relationship Problems on the Internet.
CAAN
(2006)
David Peleg
Recent Advances on Approximation Algorithms for Minimum Energy Range Assignment Problems in Ad-Hoc Wireless Networks.
CAAN
(2006)
Michele Flammini
,
Mordechai Shalom
,
Shmuel Zaks
On Minimizing the Number of ADMs - Tight Bounds for an Algorithm Without Preprocessing.
CAAN
(2006)
volume 4235, 2006
Combinatorial and Algorithmic Aspects of Networking, Third Workshop, CAAN 2006, Chester, UK, July 2, 2006. Revised Papers
CAAN
4235 (2006)
volume 3405, 2005
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
CAAN
3405 (2005)
2004
Hervé Brönnimann
,
Nasir D. Memon
,
Kulesh Shanmugasundaram
String Matching on the Internet.
CAAN
(2004)
George Karakostas
,
Stavros G. Kolliopoulos
The Efficiency of Optimal Taxes.
CAAN
(2004)
Anthony Bonato
,
Jeannette C. M. Janssen
Limits and Power Laws of Models for the Web Graph and Other Networked Information Spaces.
CAAN
(2004)
Alejandro López-Ortiz
Algorithmic Foundations of the Internet: Foreword.
CAAN
(2004)
Andrei Z. Broder
Invited Talk: The Many Wonders of the Web Graph.
CAAN
(2004)
Alejandro López-Ortiz
Search Engines and Web Information Retrieval.
CAAN
(2004)
Jan van den Heuvel
,
Matthew Johnson
The External Network Problem with Edge- or Arc-Connectivity Requirements.
CAAN
(2004)
André Kündgen
,
Michael J. Pelsmajer
,
Radhika Ramamurthi
k-Robust Single-Message Transmission.
CAAN
(2004)
Claus Bauer
Stable Local Scheduling Algorithms With Low Complexity and Without Speedup for a Network of Input-Buffered Switches.
CAAN
(2004)
Thomas Erlebach
,
Alexander Hall
,
Alessandro Panconesi
,
Danica Vukadinovic
Cuts and Disjoint Paths in the Valley-Free Path Model of Internet BGP Routing.
CAAN
(2004)
Eythan Levy
,
Guy Louchard
,
Jordi Petit
A Distributed Algorithm to Find Hamiltonian Cycles in Random Graphs.
CAAN
(2004)
Jean-Loup Guillaume
,
Matthieu Latapy
Bipartite Graphs as Models of Complex Networks.
CAAN
(2004)
Jean-Charles Grégoire
,
Angèle M. Hamel
You Can Get There from Here: Routing in the Internet.
CAAN
(2004)
Luca Dall'Asta
,
J. Ignacio Alvarez-Hamelin
,
Alain Barrat
,
Alexei Vázquez
,
Alessandro Vespignani
Traceroute-Like Exploration of Unknown Networks: A Statistical Analysis.
CAAN
(2004)
Anthony Bonato
A Survey of Models of the Web Graph.
CAAN
(2004)
Alejandro López-Ortiz
Algorithmic Foundations of the Internet: Roundup.
CAAN
(2004)
Anshul Kothari
,
Subhash Suri
,
Csaba D. Tóth
,
Yunhong Zhou
Congestion Games, Load Balancing, and Price of Anarchy.
CAAN
(2004)
Sung-woo Cho
,
Ashish Goel
Bandwidth Allocation in Networks: A Single Dual Update Subroutine for Multiple Objectives.
CAAN
(2004)
Mihaela Enachescu
,
Ashish Goel
,
Ramesh Govindan
,
Rajeev Motwani
Aggregating Correlated Data in Sensor Networks.
CAAN
(2004)