Deadlock Prediction in the Case of Dynamic Routing. - Daniel P. Bovet; Miriam Di Ianni; Pierluigi Crescenzi (Int. J. Found. Comput. Sci., 1990)

Systolic Acyclic Orientations for Deadlock Prevention. - Miriam Di Ianni; Michele Flammini; Rossella Flammini; Sandro Salomone (SIROCCO, 1995)

Optimum Schedule Problems in Store and Forward Networks. - Andrea Clementi; Miriam Di Ianni (Int. J. Found. Comput. Sci., 1995)

Minimum Length Scheduling of Precedence Constrained Messages in Distributed Systems (Extended Abstract). - Piera Barcaccia; Maurizio A. Bonuccelli; Miriam Di Ianni (Euro-Par, Vol. II, 1996)

Efficient Delay Routing (Extended Abstract). - Miriam Di Ianni (Euro-Par, Vol. I, 1996)

On the hardness of approximating optimum schedule problems in store and forward networks. - Andrea E. F. Clementi; Miriam Di Ianni (IEEE/ACM Trans. Netw., 1996)

Acyclic Orientations for Deadlock Prevention in Interconnection Networks (Extended Abstract). - Jean-Claude Bermond; Miriam Di Ianni; Michele Flammini; Stephane Perennes (WG, 1997)

Parameterized Parallel Complexity - Marco Cesati; Miriam Di Ianni (Electron. Colloquium Comput. Complex., 1997)

Computation Models for Parameterized Complexity. - Marco Cesati; Miriam Di Ianni (Math. Log. Q., 1997)

Interval Routing & Layered Cross Product: Compact Routing Schemes for Butterflies, Mesh of Trees and Fat Trees. - Tiziana Calamoneri; Miriam Di Ianni (Euro-Par, 1998)

Efficient Delay Routing. - Miriam Di Ianni (Theor. Comput. Sci., 1998)

Wormhole Deadlock Prediction. - Miriam Di Ianni (Parallel Process. Lett., 2000)

Complexity of Minimum Length Scheduling for Precedence Constrained Messages in Distributed Systems. - Piera Barcaccia; Maurizio A. Bonuccelli; Miriam Di Ianni (IEEE Trans. Parallel Distributed Syst., 2000)

Approximation algorithms for routing and call scheduling in all-optical chains and rings. - Luca Becchetti; Miriam Di Ianni; Alberto Marchetti-Spaccamela (Theor. Comput. Sci., 2002)

Deadlock Prevention by Acyclic Orientations. - Jean-Claude Bermond; Miriam Di Ianni; Michele Flammini; Stephane Perennes (Discret. Appl. Math., 2003)

Interval routing & layered cross product: compact routing schemes for butterflies, meshes of trees, fat trees and Benes networks. - Tiziana Calamoneri; Miriam Di Ianni (J. Parallel Distributed Comput., 2003)

The minimum broadcast range assignment problem on linear multi-hop wireless networks. - Andrea E. F. Clementi; Miriam Di Ianni; Riccardo Silvestri (Theor. Comput. Sci., 2003)

The Range Assignment Problem in Non-Homogeneous Static Ad-Hoc Networks. - Christoph Ambühl; Andrea E. F. Clementi; Miriam Di Ianni; Gianluca Rossi; Angelo Monti; Riccardo Silvestri (IPDPS, 2004)

Efficient Algorithms for Low-Energy Bounded-Hop Broadcast in Ad-Hoc Wireless Networks. - Christoph Ambühl; Andrea E. F. Clementi; Miriam Di Ianni; Nissan Lev-Tov; Angelo Monti; David Peleg; Gianluca Rossi; Riccardo Silvestri (STACS, 2004)

Approximating call-scheduling makespan in all-optical networks. - Luca Becchetti; Miriam Di Ianni; Alberto Marchetti-Spaccamela (J. Discrete Algorithms, 2004)

Equilibria for Broadcast Range Assignment Games in Ad-Hoc Networks. - Pilu Crescenzi; Miriam Di Ianni; Alessandro Lazzoni; Paolo Penna; Gianluca Rossi; Paola Vocca (ADHOC-NOW, 2005)

Experimental Analysis of Practically Efficient Algorithms for Bounded-Hop Accumulation in Ad-Hoc Wireless Networks. - Andrea E. F. Clementi; Miriam Di Ianni; Angelo Monti; Gianluca Rossi; Riccardo Silvestri (IPDPS, 2005)

Divide and Conquer Is Almost Optimal for the Bounded-Hop MST Problem on Random Euclidean Instances. - Andrea E. F. Clementi; Miriam Di Ianni; Angelo Monti; Massimo Lauria; Gianluca Rossi; Riccardo Silvestri (SIROCCO, 2005)

A Distributed Protocol for the Bounded-Hops Converge-Cast in Ad-Hoc Networks. - Andrea E. F. Clementi; Miriam Di Ianni; Massimo Lauria; Angelo Monti; Gianluca Rossi; Riccardo Silvestri (ADHOC-NOW, 2006)

Minimum Energy Range Assignment in Heterogeneous Ad-Hoc Networks. - Miriam Di Ianni; Gianluca Rossi (AINA Workshops (2), 2007)

On the bounded-hop MST problem on random Euclidean instances. - Andrea E. F. Clementi; Miriam Di Ianni; Massimo Lauria; Angelo Monti; Gianluca Rossi; Riccardo Silvestri (Theor. Comput. Sci., 2007)

MOMOSE: a mobility model simulation environment for mobile wireless ad-hoc networks. - Stefano Boschi; Miriam Di Ianni; Pilu Crescenzi; Gianluca Rossi; Paola Vocca (SimuTools, 2008)

Making Role Assignment Feasible: A Polynomial-Time Algorithm for Computing Ecological Colorings. - Pilu Crescenzi; Miriam Di Ianni; Federico Greco; Gianluca Rossi; Paola Vocca (WG, 2008)

Minimum-Energy Broadcast and disk cover in grid wireless networks. - Tiziana Calamoneri; Andrea E. F. Clementi; Miriam Di Ianni; Massimo Lauria; Angelo Monti; Riccardo Silvestri (Theor. Comput. Sci., 2008)

Spatial Node Distribution of Manhattan Path Based Random Waypoint Mobility Models with Applications. - Pilu Crescenzi; Miriam Di Ianni; Andrea Marino 001; Gianluca Rossi; Paola Vocca (SIROCCO, 2009)

Smooth movement and Manhattan path based Random Waypoint mobility. - Pilu Crescenzi; Miriam Di Ianni; Andrea Marino 001; Donatella Merlini; Gianluca Rossi; Paola Vocca (Inf. Process. Lett., 2011)

Distributed Community Detection in Dynamic Graphs - (Extended Abstract). - Andrea Clementi; Miriam Di Ianni; Giorgio Gambosi; Emanuele Natale; Riccardo Silvestri (SIROCCO, 2013)

Reducing the diameter of a unit disk graph via node addition. - Miriam Di Ianni; Luciano Gualà; Gianluca Rossi (Inf. Process. Lett., 2015)

Distributed community detection in dynamic graphs. - Andrea Clementi; Miriam Di Ianni; Giorgio Gambosi; Emanuele Natale; Riccardo Silvestri (Theor. Comput. Sci., 2015)

Min-max communities in graphs: Complexity and computational properties. - Miriam Di Ianni; Giorgio Gambosi; Gianluca Rossi; Paola Vocca (Theor. Comput. Sci., 2016)

Latency-Bounded Target Set Selection in Signed Networks. - Miriam Di Ianni; Giovanna Varricchio (Algorithms, 2020)

Complexity of Scorpion Solitaire and applications to Klondike. - Francesco Arena; Miriam Di Ianni (Theor. Comput. Sci., 2021)

Opinion Evolution among friends and foes: the deterministic Majority Rule - extended abstract. - Miriam Di Ianni (CoRR, 2022)

A note on the satisfactory partition problem: Constant size requirement. - Felice Ciccarelli; Miriam Di Ianni; Giancarlo Palumbo (Inf. Process. Lett., 2023)

Opinion evolution among friends and foes: The deterministic majority rule. - Miriam Di Ianni (Theor. Comput. Sci., 2023)