Conferences in DBLP
Eric Angel , Evripidis Bampis , Fanny Pascual Traffic Grooming in a Passive Star WDM Network. [Citation Graph (0, 0)][DBLP ] Conf ] Vittorio Bilò , Luca Moscardelli The Price of Anarchy in All-Optical Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Paul Boone , Edgar Chávez , Lev Gleitzky , Evangelos Kranakis , Jaroslav Opatrny , Gelasio Salazar , Jorge Urrutia Morelia Test: Improving the Efficiency of the Gabriel Test and Face Routing in Ad-Hoc Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Anat Bremler-Barr , Leah Epstein Path Layout on Tree Networks: Bounds in Different Label Switching Models. [Citation Graph (0, 0)][DBLP ] Conf ] Miroslav Chlebík , Janka Chlebíková On Approximability of the Independent Set Problem for Low Degree Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Bogdan S. Chlebus , Mariusz A. Rokicki Asynchronous Broadcast in Radio Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Sébastien Choplin , Lata Narayanan , Jaroslav Opatrny Two-Hop Virtual Path Layout in Tori. [Citation Graph (0, 0)][DBLP ] Conf ] Reuven Cohen , David Peleg Robot Convergence via Center-of-Gravity Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Gennaro Cordasco , Luisa Gargano , Mikael Hammar , Alberto Negro , Vittorio Scarano F-Chord: Improved Uniform Routing on Chord: (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Aleksej Di Salvo , Guido Proietti Swapping a Failing Edge of a Shortest Paths Tree by Minimizing the Average Stretch Factor. [Citation Graph (0, 0)][DBLP ] Conf ] Stefan Dobrev , Paola Flocchini , Nicola Santoro Improved Bounds for Optimal Black Hole Search with a Network Map. [Citation Graph (0, 0)][DBLP ] Conf ] Yon Dourisboure , Cyril Gavoille Sparse Additive Spanners for Bounded Tree-Length Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Guillaume Fertin , André Raspaud , Ondrej Sýkora No-Hole L(p, 0) Labelling of Cycles, Grids and Hypercubes. [Citation Graph (0, 0)][DBLP ] Conf ] Alessandro Ferrante , Mimmo Parente Existence of Nash Equilibria in Selfish Routing Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Paola Flocchini , Evangelos Kranakis , Danny Krizanc , Flaminia L. Luccio , Nicola Santoro , Cindy Sawchuk Mobile Agents Rendezvous When Tokens Fail. [Citation Graph (0, 0)][DBLP ] Conf ] Leszek Gasieniec , Igor Potapov , Qin Xin Time Efficient Gossiping in Known Radio Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Chryssis Georgiou , Peter M. Musial , Alexander A. Shvartsman Long-Lived Rambo: Trading Knowledge for Communication. [Citation Graph (0, 0)][DBLP ] Conf ] Arvind Gupta , Ján Manuch , Ladislav Stacho Fault Tolerant Forwarding and Optical Indexes: A Design Theory Approach. [Citation Graph (0, 0)][DBLP ] Conf ] Flaminia L. Luccio , Jop F. Sibeyn Tighter Bounds on Feedback Vertex Sets in Mesh-Based Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Luciano Margara , Alessandro Pistocchi , Marco Vassura Perfect Token Distribution on Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Rachel Matichin , David Peleg Approximation Algorithm for Hotlink Assignment in the Greedy Model. [Citation Graph (0, 0)][DBLP ] Conf ] Michel Paquette , Andrzej Pelc Optimal Decision Strategies in Byzantine Environments. [Citation Graph (0, 0)][DBLP ] Conf ] Paolo Penna , Carmine Ventre Sharing the Cost of Multicast Transmissions in Wireless Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Rui Wang , Francis C. M. Lau , Yan Yan Liu NP-Completeness Results for All-Shortest-Path Interval Routing. [Citation Graph (0, 0)][DBLP ] Conf ] Deshi Ye , Guochuan Zhang On-Line Scheduling of Parallel Jobs. [Citation Graph (0, 0)][DBLP ] Conf ] Deshi Ye , Hu Zhang The Range Assignment Problem in Static Ad-Hoc Networks on Metric Spaces. [Citation Graph (0, 0)][DBLP ] Conf ] 