Andreas Baltz, Sandro Esquivel, Lasse Kliemann and Anand Srivastav.
The Price of Anarchy in Selfish Multicast Routing
Davide Bilò, Luciano Gualà and Guido Proietti. Hardness of Designing a
Truthful Mechanism for a Spanning Arborescence Bicriteria Problem
Pier Francesco Cortese, Giuseppe Di Battista, Fabrizio Frati,
Luca Grilli, Katharina A. Lehmann, Giuseppe Liotta, Maurizio
Patrignani, Ioannis Tollis, Francesco Trotta. On the Topologies
of Local Minimum Spanning Trees
Ioannis Emiris, Euripides Markou and Aris Pagourtzis. Distributed
Routing in Tree Networks with Few Landmarks
Guy Even and Moni Shahar. Scheduling of smart antennas: capacitated
coloring of unit circular-arc graphs
Michele Flammini, Mordechai Shalom and Shmuel Zaks. On Minimizing the
Number of ADMs - Tight Bounds for an Algorithm Without Preprocessing
Boris Goldengorin, Gerold Jaeger and Paul Molitor. Tolerance Based Contract-or-Patch
Heuristic for the Asymmetric TSP
Sven Kosub, Moritz G. Maaß and Hanjo Täubig. Acyclic
Type-of-Relationship Problems on the Internet
Andrzej Lingas, Mia Persson and Martin Wahlén. Minimum-Energy
Broadcasting in Wireless Networks in the d-dimensional Euclidean
Space (the $\alpha \le d$ case)
Fredrik Manne and Qin Xin. Optimal Gossiping with Unit Size Messages
in Known Radio Networks