CAAN - researchr conference series publications

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 45 from 45

2007

Combinatorial Algorithms for Listing Paths in Minimal Change OrderZareen Alamgir, Sarmad Abbasi. caan 2007: 112-130 [doi]

Vertex Pursuit Games in Stochastic Network ModelsAnthony Bonato, Pawel Pralat, Changping Wang. caan 2007: 46-56 [doi]

Preemptive Scheduling on Selfish MachinesLeah Epstein, Rob van Stee. caan 2007: 57-70 [doi]

Nonadaptive Selfish Routing with Online DemandsTobias Harks, László A. Végh. caan 2007: 27-45 [doi]

A Worst-Case Time Upper Bound for Counting the Number of Independent SetsGuillermo De Ita, Aurelio López-López. caan 2007: 85-98 [doi]

Combinatorial and Algorithmic Aspects of Networking, 4th Workshop, CAAN 2007, Halifax, Canada, August 14, 2007. Revised PapersJeannette C. M. Janssen, Pawel Pralat, editors, Volume 4852 of Lecture Notes in Computer Science, Springer, 2007.

Valiant Load Balancing, Capacity Provisioning and Resilient Backbone DesignAlejandro López-Ortiz. caan 2007: 3-12 [doi]

Valiant Load Balancing, Benes Networks and Resilient Backbone DesignAlejandro López-Ortiz. caan 2007: 2 [doi]

Improving Topological Routing in N2R NetworksJosé M. Gutiérrez López, Rubén Cuevas Rumín, Jens Myrup Pedersen, Ole Brun Madsen. caan 2007: 131-148 [doi]

Cleaning Random ::::d::::-Regular Graphs with Brushes Using a Degree-Greedy AlgorithmMargaret-Ellen Messinger, Pawel Pralat, Richard J. Nowakowski, Nicholas C. Wormald. caan 2007: 13-26 [doi]

Selfish Routing and Path Coloring in All-Optical NetworksIoannis Milis, Aris Pagourtzis, Katerina Potika. caan 2007: 71-84 [doi]

Improving the Efficiency of Helsgaun s Lin-Kernighan Heuristic for the Symmetric TSPDirk Richter, Boris Goldengorin, Gerold Jäger, Paul Molitor. caan 2007: 99-111 [doi]

Luck vs. SkillPeter Winkler. caan 2007: 1 [doi]

2006

The Price of Anarchy in Selfish Multicast RoutingAndreas Baltz, Sandro Esquivel, Lasse Kliemann, Anand Srivastav. caan 2006: 5-18 [doi]

Designing a Truthful Mechanism for a Spanning Arborescence Bicriteria ProblemDavide Bilò, Luciano Gualà, Guido Proietti. caan 2006: 19-30 [doi]

On the Topologies of Local Minimum Spanning TreesPier Francesco Cortese, Giuseppe Di Battista, Fabrizio Frati, Luca Grilli, Katharina Anna Lehmann, Giuseppe Liotta, Maurizio Patrignani, Ioannis G. Tollis, Francesco Trotta. caan 2006: 31-44 [doi]

Distributed Routing in Tree Networks with Few LandmarksIoannis Z. Emiris, Euripides Markou, Aris Pagourtzis. caan 2006: 45-57 [doi]

Combinatorial and Algorithmic Aspects of Networking, Third Workshop, CAAN 2006, Chester, UK, July 2, 2006. Revised PapersThomas Erlebach, editor, Volume 4235 of Lecture Notes in Computer Science, Springer, 2006.

Scheduling of a Smart Antenna: Capacitated Coloring of Unit Circular-Arc GraphsGuy Even, Shimon Shahar. caan 2006: 58-71 [doi]

On Minimizing the Number of ADMs - Tight Bounds for an Algorithm Without PreprocessingMichele Flammini, Mordechai Shalom, Shmuel Zaks. caan 2006: 72-85 [doi]

Tolerance Based Contract-or-Patch Heuristic for the Asymmetric TSPBoris Goldengorin, Gerold Jäger, Paul Molitor. caan 2006: 86-97 [doi]

Acyclic Type-of-Relationship Problems on the InternetSven Kosub, Moritz G. Maaß, Hanjo Täubig. caan 2006: 98-111 [doi]

Minimum-Energy Broadcasting in Wireless Networks in the ::::d::::-Dimensional Euclidean Space (The ::::alpha::::<=::::d:::: Case)Andrzej Lingas, Mia Persson, Martin Wahlen. caan 2006: 112-124 [doi]

Optimal Gossiping with Unit Size Messages in Known Topology Radio NetworksFredrik Manne, Qin Xin. caan 2006: 125-134 [doi]

Recent Advances on Approximation Algorithms for Minimum Energy Range Assignment Problems in Ad-Hoc Wireless NetworksDavid Peleg. caan 2006: 1-4 [doi]

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 PapersAlejandro López-Ortiz, Angèle M. Hamel, editors, Volume 3405 of Lecture Notes in Computer Science, Springer, 2005.

2004

Traceroute-Like Exploration of Unknown Networks: A Statistical AnalysisLuca Dall Asta, J. Ignacio Alvarez-Hamelin, Alain Barrat, Alexei Vázquez, Alessandro Vespignani. caan 2005: 140-153 [doi]

Stable Local Scheduling Algorithms With Low Complexity and Without Speedup for a Network of Input-Buffered SwitchesClaus Bauer. caan 2005: 102-113 [doi]

Limits and Power Laws of Models for the Web Graph and Other Networked Information SpacesAnthony Bonato, Jeannette C. M. Janssen. caan 2005: 42-48 [doi]

A Survey of Models of the Web GraphAnthony Bonato. caan 2005: 159-172 [doi]

Invited Talk: The Many Wonders of the Web GraphAndrei Z. Broder. caan 2005: 154-154 [doi]

String Matching on the InternetHervé Brönnimann, Nasir D. Memon, Kulesh Shanmugasundaram. caan 2005: 75-89 [doi]

Bandwidth Allocation in Networks: A Single Dual Update Subroutine for Multiple ObjectivesSung-woo Cho, Ashish Goel. caan 2005: 28-41 [doi]

Aggregating Correlated Data in Sensor NetworksMihaela Enachescu, Ashish Goel, Ramesh Govindan, Rajeev Motwani. caan 2005: 1-2 [doi]

Cuts and Disjoint Paths in the Valley-Free Path Model of Internet BGP RoutingThomas Erlebach, Alexander Hall, Alessandro Panconesi, Danica Vukadinovic. caan 2005: 49-62 [doi]

You Can Get There from Here: Routing in the InternetJean-Charles Grégoire, Angèle M. Hamel. caan 2005: 173-182 [doi]

Bipartite Graphs as Models of Complex NetworksJean-Loup Guillaume, Matthieu Latapy. caan 2005: 127-139 [doi]

The Efficiency of Optimal TaxesGeorge Karakostas, Stavros G. Kolliopoulos. caan 2005: 3-12 [doi]

Congestion Games, Load Balancing, and Price of AnarchyAnshul Kothari, Subhash Suri, Csaba D. Tóth, Yunhong Zhou. caan 2005: 13-27 [doi]

k-Robust Single-Message TransmissionAndré Kündgen, Michael J. Pelsmajer, Radhika Ramamurthi. caan 2005: 90-101 [doi]

A Distributed Algorithm to Find Hamiltonian Cycles in Random GraphsEythan Levy, Guy Louchard, Jordi Petit. caan 2005: 63-74 [doi]

Algorithmic Foundations of the Internet: ForewordAlejandro López-Ortiz. caan 2005: 155-158 [doi]

Search Engines and Web Information RetrievalAlejandro López-Ortiz. caan 2005: 183-191 [doi]

Algorithmic Foundations of the Internet: RoundupAlejandro López-Ortiz. caan 2005: 192-204 [doi]

The External Network Problem with Edge- or Arc-Connectivity RequirementsJan van den Heuvel, Matthew Johnson. caan 2005: 114-126 [doi]

Sign in or sign up to see more results.

runs on WebDSL