Marco Chiesa's Publications

Marco Chiesa

Home

Research groups:
  Computer Networks

Publications:
  By type
  By year
  By topic

Marco Chiesa's Publications

A Control Plane for Intra-Domain Routing

  1. Marco Chiesa, Gabriele Lospoto, Massimo Rimondini, Giuseppe Di Battista. Intra-Domain Routing with Pathlets. Computer Communications. 46:76-86. 2014. [conference version] [see TR]

  2. Marco Chiesa, Gabriele Lospoto, Massimo Rimondini, Giuseppe Di Battista. Intra-Domain Pathlet Routing. In 22nd International Conference on Computer Communications and Networks (IEEE ICCCN 2013), IEEE, pages 1-9, 2013. [ Presentation at ICCCN'13] [journal version] [see TR]

  3. Marco Chiesa, Gabriele Lospoto, Massimo Rimondini, Giuseppe Di Battista. Intra-Domain Pathlet Routing. Technical Report arXiv:1302.5414, Cornell University, 2013. [journal version] [conference version]

Interdomain Routing Stability

  1. Marco Chiesa, Luca Cittadini, Laurent Vanbever, Stefano Vissicchio, Giuseppe Di Battista. Using Routers to Build Logic Circuits: How Powerful is BGP?. In Proc. International Conference on Network Protocols (IEEE ICNP 2013), IEEE, pages 1-10, 2013. [BEST PAPER AWARD ] [ Presentation at ICNP'13 ]

  2. Marco Chiesa, Giuseppe Di Battista, Thomas Erlebach, Maurizio Patrignani. Computational Complexity of Traffic Hijacking under BGP and S-BGP. In Proc. 39th International Colloquium on Automata, Languages and Programming (ICALP '12), Springer Verlag, volume 7392 of Lecture Notes in Computer Science, pages 476-487, 2012. [see arXiv extended version] [ Presentation at ICALP'12]

  3. Marco Chiesa, Luca Cittadini, Giuseppe Di Battista, Stefano Vissicchio. Local Transit Policies and the Complexity of BGP Stability Testing. In 30th IEEE International Conference on Computer Communications (IEEE INFOCOM 2011), IEEE, pages 2957-2965, 2011. [ Presentation at INFOCOM'11]

Minimum Size Representations of Graphs

  1. Patrizio Angelini, Till Bruckdorfer, Marco Chiesa, Fabrizio Frati, Michael Kaufmann, Claudio Squarcella. On the Area Requirements of Euclidean Minimum Spanning Trees. Computational Geometry: Theory and Applications. 47(2):200-213. 2014. Special Issue on Selected Papers from WADS '11.

  2. Patrizio Angelini, Till Bruckdorfer, Marco Chiesa, Fabrizio Frati, Michael Kaufmann, Claudio Squarcella. On the Area Requirements of Euclidean Minimum Spanning Trees. In, F. K. H. A. Dehne, J. Iacono, J.-R. Sack, editors, 12th Algorithms and Data Structures Symposium (WADS '11), Springer, volume 6844 of Lecture Notes in Computer Science, pages 25-36, 2011.

  3. Patrizio Angelini, Till Bruckdorfer, Marco Chiesa, Fabrizio Frati, Michael Kaufmann, Claudio Squarcella. On the Area Requirements of Euclidean Minimum Spanning Trees. Technical Report RT-DIA-183-2011, Dept. of Computer Science and Automation, Roma Tre University, 2011.

Proximity Drawings

  1. Patrizio Angelini, Till Bruckdorfer, Marco Chiesa, Fabrizio Frati, Michael Kaufmann, Claudio Squarcella. On the Area Requirements of Euclidean Minimum Spanning Trees. Computational Geometry: Theory and Applications. 47(2):200-213. 2014. Special Issue on Selected Papers from WADS '11.

  2. Patrizio Angelini, Till Bruckdorfer, Marco Chiesa, Fabrizio Frati, Michael Kaufmann, Claudio Squarcella. On the Area Requirements of Euclidean Minimum Spanning Trees. In, F. K. H. A. Dehne, J. Iacono, J.-R. Sack, editors, 12th Algorithms and Data Structures Symposium (WADS '11), Springer, volume 6844 of Lecture Notes in Computer Science, pages 25-36, 2011.

  3. Patrizio Angelini, Till Bruckdorfer, Marco Chiesa, Fabrizio Frati, Michael Kaufmann, Claudio Squarcella. On the Area Requirements of Euclidean Minimum Spanning Trees. Technical Report RT-DIA-183-2011, Dept. of Computer Science and Automation, Roma Tre University, 2011.