ARRIVAL : Algorithms for Robust and online Railway optimization : Improving the Validity and reliAbility of Large scale systems

[1]  Mark W. Krentel,et al.  Structure in locally optimal solutions , 1989, 30th Annual Symposium on Foundations of Computer Science.

[2]  Jean-Claude Bermond,et al.  Gathering with Minimum Delay in Tree Sensor Networks , 2008, SIROCCO.

[3]  Mihalis Yannakakis,et al.  How easy is local search? , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[4]  Stéphane Pérennes,et al.  Hardness and approximation of gathering in static radio networks , 2006, Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06).

[5]  Hervé Rivano,et al.  An optimization framework for the joint routing and scheduling in Wireless Mesh Networks , 2008, 2008 IEEE 19th International Symposium on Personal, Indoor and Mobile Radio Communications.

[6]  Andrea E. F. Clementi,et al.  Flooding time in edge-Markovian dynamic graphs , 2008, PODC '08.

[7]  Marios Mavronicolas,et al.  How Many Attackers Can Selfish Defenders Catch? , 2008, Proceedings of the 41st Annual Hawaii International Conference on System Sciences (HICSS 2008).

[8]  Andrea E. F. Clementi,et al.  Communication in dynamic radio networks , 2007, PODC '07.

[9]  Hervé Rivano,et al.  Génération de colonnes pour le routage et l'ordonnancement dans les réseaux radio maillés , 2008 .

[10]  Gerhard Weikum,et al.  Near-optimal dynamic replication in unstructured peer-to-peer networks , 2008, PODS.

[11]  Paul G. Spirakis,et al.  Network Game with Attacker and Protector Entities , 2005, ISAAC.

[12]  Jean-Claude Bermond,et al.  Gathering Algorithms on Paths Under Interference Constraints , 2006, CIAC.