Home / Publications

  • All
  • Journals
  • Conferences
  • Others
  • External Links

Journals

  • Andrea D'Ascenzo, D'Emidio Mattia. Top-k Distance Queries on Large Time-Evolving Graphs. IEEE Access 11: 102228-102242 (2023).
  • Cicerone Serafino, D'Emidio Mattia, Di Stefano Gabriele, Navarra Alfredo. On the effectiveness of the genetic paradigm for polygonization. Inf. Process. Lett., 106134, 171, 2021.
  • Cicerone Serafino, D'Emidio Mattia, Frigioni Daniele, Pascucci Filippo Tirabassi. Combining Polygon Schematization and Decomposition Approaches for Solving the Cavity Decomposition Problem. {ACM} Trans. Spatial Algorithms Syst., 22:1--22:37, 7, 2021.
  • D'Angelo Gianlorenzo, D'Emidio Mattia, Das Shantanu, Navarra Alfredo, Prencipe Giuseppe. Asynchronous Silent Programmable Matter Achieves Leader Election and Compaction. {IEEE} Access, 207619--207634, 8, 2020.
  • D'Emidio Mattia, Khan Imran, Frigioni Daniele. Journey Planning Algorithms for Massive Delay-Prone Transit Networks. Algorithms, 2, 13, 2020.
  • D'Emidio Mattia. Faster Algorithms for Mining Shortest-Path Distances from Massive Time-Evolving Graphs. Algorithms, 191, 13, 2020.
  • Basciani Francesco, D'Emidio Mattia, Di Ruscio Davide, Frigioni Daniele, Iovino Ludovico, Pierantonio Alfonso. Automated Selection of Optimal Model Transformation Chains via Shortest-Path Algorithms. {IEEE} Trans. Software Eng., 251--279, 46, 2020.
  • D'Emidio Mattia, Di Stefano Gabriele, Navarra Alfredo. Bamboo Garden Trimming Problem: Priority Schedulings. Algorithms, 74, 12, 2019.
  • D'Emidio Mattia, Frigioni Daniele. Special Issue on "Algorithm Engineering: Towards Practically Efficient Solutions to Combinatorial Problems". Algorithms, 229, 12, 2019.
  • D'Emidio Mattia, Forlizzi Luca, Frigioni Daniele, Leucci Stefano, Proietti Guido. Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem. J. Comb. Optim., 165--184, 38, 2019.
  • D'Angelo Gianlorenzo, D'Emidio Mattia, Frigioni Daniele. Fully Dynamic 2-Hop Cover Labeling. {ACM} J. Exp. Algorithmics, 1.6:1--1.6:36, 24, 2019.
  • D'Emidio Mattia, Khan Imran. Collision-free allocation of temporally constrained tasks in multi-robot systems. Robotics Auton. Syst., 151--172, 119, 2019.
  • D'Angelo Gianlorenzo, D'Emidio Mattia. Report on {SEA} 2018. Bull. {EATCS}, 126, 2018.
  • D'Emidio Mattia, Di Stefano Gabriele, Frigioni Daniele, Navarra Alfredo. Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane. Inf. Comput., 57--74, 263, 2018.
  • Cionini Alessio, D'Angelo Gianlorenzo, D'Emidio Mattia, Frigioni Daniele, Giannakopoulou Kalliopi, Paraskevopoulos Andreas, Zaroliagis Christos D.. Engineering graph-based models for dynamic timetable information systems. J. Discrete Algorithms, 40--58, 46-47, 2017.
  • D'Emidio Mattia, Frigioni Daniele, Navarra Alfredo. Synchronous Robots vs Asynchronous Lights-Enhanced Robots on Graphs. Electron. Notes Theor. Comput. Sci., 169--180, 322, 2016.
  • Romano Daniele, Antonini Giulio, D'Emidio Mattia, Frigioni Daniele, Mori Alessandro, Bandinelli Mauro. Rigorous {DC} Solution of Partial Element Equivalent Circuit Models. {IEEE} Trans. Circuits Syst. {I} Regul. Pap., 1499--1510, 63-I, 2016.
  • D'Andrea Annalisa, D'Emidio Mattia, Frigioni Daniele, Leucci Stefano, Proietti Guido. Dynamic Maintenance of a Shortest-Path Tree on Homogeneous Batches of Updates: New Algorithms and Experiments. {ACM} J. Exp. Algorithmics, 1.5:1.1--1.5:1.33, 20, 2015.
  • D'Angelo Gianlorenzo, D'Emidio Mattia, Frigioni Daniele, Romano Daniele. Enhancing the Computation of Distributed Shortest Paths on Power-law Networks in Dynamic Scenarios. Theory Comput. Syst., 444--477, 57, 2015.
  • D'Emidio Mattia, Frigioni Daniele, Navarra Alfredo. Explore and repair graphs with black holes using mobile entities. Theor. Comput. Sci., 129--145, 605, 2015.
  • D'Angelo Gianlorenzo, D'Emidio Mattia, Frigioni Daniele. Fully dynamic update of arc-flags. Networks, 243--259, 63, 2014.
  • D'Angelo Gianlorenzo, D'Emidio Mattia, Frigioni Daniele. A loop-free shortest-path routing algorithm for dynamic networks. Theor. Comput. Sci., 1--19, 516, 2014.
  • D'Angelo Gianlorenzo, D'Emidio Mattia, Frigioni Daniele. Pruning the Computation of Distributed Shortest Paths in Power-law Networks. Informatica (Slovenia), 253--265, 37, 2013.

    • Conferences

  • D'Ascenzo Andrea, D'Emidio Mattia, Flammini Michele, Monaco Gianpiero. Digraph K-Coloring Games: from Theory to Practice. Proceedings of the 20th Symposium on Experimental Algorithms, SEA 2022, Heidelberg, Germany, Jul 25-27, 2022. OASICS, 20:1-20:18, Schloss Dagstuhl - Leibniz-Zentrum fur Informatik, 2022.
  • D'Angelo Gianlorenzo, D'Emidio Mattia, Das Shantanu, Navarra Alfredo, Prencipe Giuseppe. Leader Election and Compaction for Asynchronous Silent Programmable Matter. Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, {AAMAS} '20, Auckland, New Zealand, May 9-13, 2020, 276--284, International Foundation for Autonomous Agents and Multiagent Systems, 2020.
  • D'Emidio Mattia, Frigioni Daniele. Distributed Shortest Paths on Power Law Networks in the Generalized Linear Preference Model: An Experimental Study. Computational Science and Its Applications - {ICCSA} 2019 - 19th International Conference, Saint Petersburg, Russia, July 1-4, 2019, Proceedings, Part {II}, Lecture Notes in Computer Science, 72--81, 11620, Springer, 2019.
  • D'Emidio Mattia, Khan Imran. Dynamic Public Transit Labeling. Computational Science and Its Applications - {ICCSA} 2019 - 19th International Conference, Saint Petersburg, Russia, July 1-4, 2019, Proceedings, Part {I}, Lecture Notes in Computer Science, 103--117, 11619, Springer, 2019.
  • D'Emidio Mattia, Di Stefano Gabriele, Navarra Alfredo. Priority Scheduling in the Bamboo Garden Trimming Problem. {SOFSEM} 2019: Theory and Practice of Computer Science - 45th International Conference on Current Trends in Theory and Practice of Computer Science, Nov{\'{y}} Smokovec, Slovakia, January 27-30, 2019, Proceedings, Lecture Notes in Computer Science, 136--149, 11376, Springer, 2019.
  • Arcelli Davide, Cortellessa Vittorio, D'Emidio Mattia, Pompeo Daniele Di. {EASIER:} An Evolutionary Approach for Multi-objective Software ArchItecturE Refactoring. {IEEE} International Conference on Software Architecture, {ICSA} 2018, Seattle, WA, USA, April 30 - May 4, 2018, 105--114, {IEEE} Computer Society, 2018.
  • Cicerone Serafino, D'Emidio Mattia, Frigioni Daniele. On Mining Distances in Large-Scale Dynamic Graphs. Proceedings of the 19th Italian Conference on Theoretical Computer Science, Urbino, Italy, September 18-20, 2018, {CEUR} Workshop Proceedings, 77--81, 2243, CEUR-WS.org, 2018.
  • Basciani Francesco, Di Ruscio Davide, D'Emidio Mattia, Frigioni Daniele, Pierantonio Alfonso, Iovino Ludovico. A tool for automatically selecting optimal model transformation chains. Proceedings of the 21st {ACM/IEEE} International Conference on Model Driven Engineering Languages and Systems: Companion Proceedings, {MODELS} 2018, Copenhagen, Denmark, October 14-19, 2018, 2--6, {ACM}, 2018.
  • Colella Feliciano, D'Emidio Mattia, Proietti Guido. Simple and Practically Efficient Fault-tolerant 2-hop Cover Labelings. Joint Proceedings of the 18th Italian Conference on Theoretical Computer Science and the 32nd Italian Conference on Computational Logic co-located with the 2017 {IEEE} International Workshop on Measurements and Networking {(2017} {IEEE} M{\&}N), Naples, Italy, September 26-28, 2017, CEUR Workshop Proceedings, 51--62, 1949, CEUR-WS.org, 2017.
  • D'Emidio Mattia, Khan Imran. Multi-robot Task Allocation Problem: Current Trends and New Ideas. Joint Proceedings of the 18th Italian Conference on Theoretical Computer Science and the 32nd Italian Conference on Computational Logic co-located with the 2017 {IEEE} International Workshop on Measurements and Networking {(2017} {IEEE} M{\&}N), Naples, Italy, September 26-28, 2017, {CEUR} Workshop Proceedings, 99--103, 1949, CEUR-WS.org, 2017.
  • D'Emidio Mattia, Frigioni Daniele, Navarra Alfredo. Characterizing the Computational Power of Anonymous Mobile Robots. 36th {IEEE} International Conference on Distributed Computing Systems, {ICDCS} 2016, Nara, Japan, June 27-30, 2016, 293--302, {IEEE} Computer Society, 2016.
  • D'Emidio Mattia, Di Stefano Gabriele, Frigioni Daniele, Navarra Alfredo. Improved Protocols for Luminous Asynchronous Robots. Proceedings of the 17th Italian Conference on Theoretical Computer Science, Lecce, Italy, September 7-9, 2016, {CEUR} Workshop Proceedings, 136--148, 1720, CEUR-WS.org, 2016.
  • D'Emidio Mattia, Forlizzi Luca, Frigioni Daniele, Leucci Stefano, Proietti Guido. On the Clustered Shortest-Path Tree Problem. Proceedings of the 17th Italian Conference on Theoretical Computer Science, Lecce, Italy, September 7-9, 2016, {CEUR} Workshop Proceedings, 263--268, 1720, CEUR-WS.org, 2016.
  • D'Angelo Gianlorenzo, D'Emidio Mattia, Frigioni Daniele. Distance Queries in Large-Scale Fully Dynamic Complex Networks. Combinatorial Algorithms - 27th International Workshop, {IWOCA} 2016, Helsinki, Finland, August 17-19, 2016, Proceedings, Lecture Notes in Computer Science, 109--121, 9843, Springer, 2016.
  • D'Andrea Annalisa, D'Emidio Mattia, Frigioni Daniele, Leucci Stefano, Proietti Guido. Path-Fault-Tolerant Approximate Shortest-Path Trees. Structural Information and Communication Complexity - 22nd International Colloquium, {SIROCCO} 2015, Montserrat, Spain, July 14-16, 2015, Post-Proceedings, Lecture Notes in Computer Science, 224--238, 9439, Springer, 2015.
  • Cionini Alessio, D'Angelo Gianlorenzo, D'Emidio Mattia, Frigioni Daniele, Giannakopoulou Kalliopi, Paraskevopoulos Andreas, Zaroliagis Christos D.. Engineering Graph-Based Models for Dynamic Timetable Information Systems. 14th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, {ATMOS} 2014, September 11, 2014, Wroclaw, Poland, OASICS, 46--61, 42, Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, 2014.
  • D'Emidio Mattia, Frigioni Daniele. Engineering shortest-path algorithms for dynamic networks. Proceedings of the 15th Italian Conference on Theoretical Computer Science, Perugia, Italy, September 17-19, 2014, {CEUR} Workshop Proceedings, 265--269, 1231, CEUR-WS.org, 2014.
  • D'Andrea Annalisa, D'Emidio Mattia, Frigioni Daniele, Leucci Stefano, Proietti Guido. Experimental Evaluation of Dynamic Shortest Path Tree Algorithms on Homogeneous Batches. Experimental Algorithms - 13th International Symposium, {SEA} 2014, Copenhagen, Denmark, June 29 - July 1, 2014. Proceedings, Lecture Notes in Computer Science, 283--294, 8504, Springer, 2014.
  • D'Emidio Mattia, Frigioni Daniele, Navarra Alfredo. Exploring and Making Safe Dangerous Networks Using Mobile Entities. Ad-hoc, Mobile, and Wireless Network - 12th International Conference, {ADHOC-NOW} 2013, Wroc{\l}aw, Poland, July 8-10, 2013. Proceedings, Lecture Notes in Computer Science, 136--147, 7960, Springer, 2013.
  • D'Andrea Annalisa, D'Emidio Mattia, Frigioni Daniele, Leucci Stefano, Proietti Guido. Dynamically Maintaining Shortest Path Trees under Batches of Updates. Structural Information and Communication Complexity - 20th International Colloquium, {SIROCCO} 2013, Ischia, Italy, July 1-3, 2013, Revised Selected Papers, Lecture Notes in Computer Science, 286--297, 8179, Springer, 2013.
  • D'Angelo Gianlorenzo, D'Emidio Mattia, Frigioni Daniele, Romano Daniele. Enhancing the Computation of Distributed Shortest Paths on Real Dynamic Networks. Design and Analysis of Algorithms - First Mediterranean Conference on Algorithms, MedAlg 2012, Kibbutz Ein Gedi, Israel, December 3-5, 2012. Proceedings, Lecture Notes in Computer Science, 148--158, 7659, Springer, 2012.
  • D'Angelo Gianlorenzo, D'Emidio Mattia, Frigioni Daniele, Maurizio Vinicio. Engineering a New Loop-Free Shortest Paths Routing Algorithm. Experimental Algorithms - 11th International Symposium, {SEA} 2012, Bordeaux, France, June 7-9, 2012. Proceedings, Lecture Notes in Computer Science, 123--134, 7276, Springer, 2012.
  • D'Angelo Gianlorenzo, D'Emidio Mattia, Frigioni Daniele, Vitale Camillo. Fully Dynamic Maintenance of Arc-Flags in Road Networks. Experimental Algorithms - 11th International Symposium, {SEA} 2012, Bordeaux, France, June 7-9, 2012. Proceedings, Lecture Notes in Computer Science, 135--147, 7276, Springer, 2012.
  • D'Angelo Gianlorenzo, D'Emidio Mattia, Frigioni Daniele, Maurizio Vinicio. A Speed-Up Technique for Distributed Shortest Paths Computation. Computational Science and Its Applications - {ICCSA} 2011 - International Conference, Santander, Spain, June 20-23, 2011. Proceedings, Part {II}, Lecture Notes in Computer Science, 578--593, 6783, Springer, 2011.

    • Others

  • D'Emidio Mattia, Forlizzi Luca, Frigioni Daniele, Leucci Stefano, Proietti Guido. Hardness, Approximability, and Fixed-Parameter Tractability of the Clustered Shortest-Path Tree Problem. CoRR, abs/1801.10416, 2018.
  • D'Andrea Annalisa, D'Emidio Mattia, Frigioni Daniele, Leucci Stefano, Proietti Guido. Path-Fault-Tolerant Approximate Shortest-Path Trees. CoRR, abs/1507.01695, 2015.

    • External Links