Following references will be useful for students to prepare their participation in the EULER Summer School

Internet routing system

  • O. Bonaventure, Computer Networking : Principles, Protocols and Practice, Creative Common Licence, ebook.

Algorithmic graph theory and Graph dynamics modelling

  • M. Golumbic, Algorithmic graph theory and perfect graphs, 2nd edition, North Holland, Feb. 2004.
  • M. Golumbic, A.N. Trenk, Tolerance graphs, Cambridge University Press, 2004
  • N.V.R. Mahadev and U.N. Peled, Threshold graphs and related topics, Annals of Discrete Mathematics, vol. 56, North Holland, 1995
  • A. Brandstadt, V.B. Le, and J.P. Spinrad, Graph classes: a survey, SIAM Monographs on Discrete Mathematics and Applications, 1999.
  • T.A. McKee and F.R. McMorris, Topics in intersection graph theory, SIAM Monographs on Discrete Mathematics and Applications, 1999.
  • A. Bondy and U.S.R. Murty, Graph theory, Springer, 2008.
  • G. Chartrand and P. Zhang, Chromatic graph theory, Series of Discrete Mathematics and its Applications, Taylor and Francis, 2009.
  • T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein, Introduction to algorithms, Mit Press, 2009.
  • D. Easley and J. Kleinberg, Networks, crowds, and markets: reasoning about a highly connected world, Cambridge University Press, 2010
  • D. West, Introduction to graph theory, 2nd edition, Pearson, 2000.
  • J. Alonso, T. Brady, D. Cooper, T. Delzant, V. Ferlini, M. Lustig, M. Mihalik, M. Shapiro, and H. Short, "Notes on word hyperbolic groups", in: E. Ghys, A. Haefliger, A. Verjovsky (Eds.), Group Theory from a Geometrical Viewpoint, World Scientific, Singapore, 1992.
  • J.W. Anderson, Hyperbolic geometry, 2nd edition, Springer-Verlag, London, 2005.
  • Y. Baryshnikov, "On the curvature of the Internet", in Workshop on Stochastic Geometry and Teletraffic, Eindhoven, The Netherlands, April 2002.
  • E. Ghys, and P. de la Harpe, "Sur les groupes hyperboliques d'après Mikhael Gromov", Progress in Mathematics 83, Birkhäuser Boston Inc, Boston, MA, 1990. (mostly in French).
  • E. Jonckheere, and P. Lohsoonthorn, "A hyperbolic geometry approach to multipath routing", in Proceedings of the 10th Mediterranean Conference on Control and Automation (MED 2002), Lisbon, Portugal, FA5-1, July 2002. (pdf)
  • J.M. Rodríguez, J.M. Sigarreta, and E. Tourìs, "Teoría geométrica de funciones: el punto de encuentro entre la variable compleja y la geometría" XXIII Escuela Venezolana de Matematica, Ediciones IVIC, 2010. Available at (pdf in spanish)
  • J.P. Spinrad, Efficient graph representations, in: Fields Institute Monographs, vol. 19, American Mathematical Society, 2003.
  • D.G. Corneil and R.M. Krueger, "A uni ed view of graph searching", SIAM Journal on Discrete Mathematics, vol. 22, pp. 1259-1276, 2008.
  • D.G. Corneil, B. Dalton, and M. Habib, "LDFS-based certifying algorithm for the minimum path cover problem on cocomparability graphs", SIAM Journal on Computing, vol. 42, no. 3, pp. 792-807, 2013.
  • G.B. Mertzios and D.G. Corneil, "A simple polynomial algorithm for the longest path problem on cocomparability graphs", SIAM Journal on Discrete Mathematics, vol. 26, no. 3, pp. 940-963, 2012.
  • G. B. Mertzios, I. Sau, and S. Zaks, "A new intersection model and improved algorithms for tolerance graphs", SIAM Journal on Discrete Mathematics, vol. 23, no. 4, pp. 1800-1813, 2009.
  • T.-H. Ma and J. P. Spinrad, "On the 2-chain subgraph cover and related problems", Journal of Algorithms, vol. 17, pp. 251-268, 1994.

Routing models and algorithmic

  • R. Cohen, S. Havlin, Complex networks: structure, robustness and function, Cambridge University Press, 2010.
  • F. Comellas, "Complex networks: deterministic models physics and theoretical computer science", From Numbers and Languages to (Quantum) Cryptography, 7 NATO Security through Science Series: Information and Communication Security, J.-P. Gazeau, J. Nesetril and B. Rovan (Eds), IOS Press, Amsterdam, pp. 275-293. (pdf)
  • M. E. J. Newman, "The structure and function of complex networks", SIAM Review, vol. 45, pp. 167-256, 2003. (pdf)
  • A. Barrat, M. Barthelemy and A. Vespignani, Dynamical Processes on Complex Networks, Cambridge University Press, 2013.
  • J. Wang, L. Rong, "Cascade-based attack vulnerability on the US power grid", Safety Science, vol. 47, pp. 1332--1336, 2009. (pdf)
  • M.J. Keeling and K.T.D. Earnes, "Networks and epidemic models", J.R. Soc. Interface vol. 2, pp. 295-307, 2005. (pdf)
  • F. Comellas, M. Mitjana, and J.G. Peters, "Broadcasting in small-world communication networks", SIROCCO 9, Proceedings in Informatics 13, Carleton Scientific, pp. 73-85, June 2002. (pdf)
  • J.C. Pasquale, G.C. Polyzos, G. Xylomenos, “The Multimedia Multicasting Problem”, Multimedia Systems, vol. 6, no. 1, pp. 43-59, January 1998.
  • G. Xylomenos, C.N. Ververidis, V.A. Siris, N. Fotiou, C. Tsilopoulos, X. Vasilakos, K.V. Katsaros, G.C. Polyzos, “A Survey of Information-Centric Networking Research”, IEEE Communications Surveys and Tutorials (in press; available at pdf).
  • G. Xylomenos, X. Vasilakos, C. Tsilopoulos, V.A. Siris, G.C. Polyzos, “Caching and Mobility Support in a Publish-Subscribe Internet Architecture”, IEEE Communications Magazine, Special Issue on ‘Information-Centric Networking,’ vol. 50, no. 7, pp. 52-58, July 2012.
  • P. Jokela, A. Zahemszky, C.E. Rothenberg, S. Arianfar, and P. Nikander, “LIPSIN: line speed publish/subscribe inter-networking”, Proc. ACM SIGCOMM, pp. 195–206, 2009.
  • V. Jacobson, D. K. Smetters, J. D. Thornton, M. F. Plass, N. H. Briggs, and R. L. Braynard, “Networking named content”, Proc. ACM CoNEXT, 2009.
  • K.V. Katsaros, N. Fotiou, X. Vasilakos, C.N. Ververidis, C. Tsilopoulos, G. Xylomenos, G.C. Polyzos, “On Inter-domain Name Resolution for Information-Centric Networks”, Proc. 11th International Conference on Networking (IFIP/TC6 Networking), Prague, Czech Republic, May 2012.
  • K.V. Katsaros, G. Xylomenos, G.C. Polyzos, “MultiCache: an Overlay Architecture for Information-Centric Networking”, Computer Networks, vol. 55, no. 4, pp. 936-947, Elsevier, Special Issue on ‘Architectures and Protocols for the Future Internet’, March 2011.
  • J. Kurian and K. Sarac, “A survey on the design, applications, and enhancements of application-layer overlay networks”, ACM Computing Surveys, vol. 43, no. 1, November 2010.
  • M.F. Bari, S. Chowdhury, R. Ahmed, R. Boutaba, B. Mathieu, “A survey of naming and routing in information-centric networks”, IEEE Communications Magazine, vol. 50, no. 12, pp. 44-53, December 2012.
  • S. Androutsellis-Theotokis and D. Spinellis, “A survey of peer-to-peer content distribution technologies”, ACM Computing Surveys, vol. 36, no. 4, pp. 335-371, December 2004.
  • R.K. Ahuja, T.L. Magnanti, J.B. Orlin, Network flows: theory, algorithms, and applications, 1st edition, Prentice Hall, 1993.
  • L.A. Wolsey, G.L. Nemhauser, Integer and combinatorial optimization, Wiley Series in Discrete Mathematics and Optimization, vol. 55, 1999.
  • C.H. Papadimitriou and K. Steiglitz, Combinatorial optimization: algorithms and complexity, Dover Publications, 1998.
  • E. Lawlwe, "Combinatorial implications of max-flow min-cut Theorem 4.6", Combinatorial optimization: networks and matroids, Dover Publications, pp.117-120, 2001.