Miriam Di Ianni

Publication Activity (10 Years)

Years Active: 1990-2023
Publications (10 Years): 7

Top Topics

Community Detection

Finer Granularity

Real World Graphs

Top Venues

Theor. Comput. Sci.

Inf. Process. Lett.

Publications

Felice Ciccarelli, Miriam Di Ianni, Giancarlo Palumbo
A note on the satisfactory partition problem: Constant size requirement. Inf. Process. Lett. 179 (2023)
Miriam Di Ianni
Opinion evolution among friends and foes: The deterministic majority rule. Theor. Comput. Sci. 959 (2023)
Miriam Di Ianni
Opinion Evolution among friends and foes: the deterministic Majority Rule - extended abstract. CoRR (2022)
Francesco Arena, Miriam Di Ianni
Complexity of Scorpion Solitaire and applications to Klondike. Theor. Comput. Sci. 890 (2021)
Francesco Arena, Miriam Di Ianni
Complexity of Scorpion Solitaire and applications to Klondike. ICTCS (2020)
Miriam Di Ianni, Giovanna Varricchio
Latency-Bounded Target Set Selection in Signed Networks. Algorithms 13 (2) (2020)
Miriam Di Ianni, Giorgio Gambosi, Gianluca Rossi, Paola Vocca
Min-max communities in graphs: Complexity and computational properties. Theor. Comput. Sci. 613 (2016)
Miriam Di Ianni, Luciano Gualà, Gianluca Rossi
Reducing the diameter of a unit disk graph via node addition. Inf. Process. Lett. 115 (11) (2015)
Andrea E. F. Clementi, Miriam Di Ianni, Giorgio Gambosi, Emanuele Natale, Riccardo Silvestri
Distributed community detection in dynamic graphs. Theor. Comput. Sci. 584 (2015)
Andrea E. F. Clementi, Miriam Di Ianni, Giorgio Gambosi, Emanuele Natale, Riccardo Silvestri
Distributed Community Detection in Dynamic Graphs CoRR (2013)
Andrea E. F. Clementi, Miriam Di Ianni, Giorgio Gambosi, Emanuele Natale, Riccardo Silvestri
Distributed Community Detection in Dynamic Graphs - (Extended Abstract). SIROCCO (2013)
Pilu Crescenzi, Miriam Di Ianni, Andrea Marino, Donatella Merlini, Gianluca Rossi, Paola Vocca
Smooth movement and Manhattan path based Random Waypoint mobility. Inf. Process. Lett. 111 (5) (2011)
Pilu Crescenzi, Miriam Di Ianni, Andrea Marino, Gianluca Rossi, Paola Vocca
Spatial Node Distribution of Manhattan Path Based Random Waypoint Mobility Models with Applications. SIROCCO (2009)
Stefano Boschi, Miriam Di Ianni, Pilu Crescenzi, Gianluca Rossi, Paola Vocca
MOMOSE: a mobility model simulation environment for mobile wireless ad-hoc networks. SimuTools (2008)
Pilu Crescenzi, Miriam Di Ianni, Federico Greco, Gianluca Rossi, Paola Vocca
Making Role Assignment Feasible: A Polynomial-Time Algorithm for Computing Ecological Colorings. WG (2008)
Tiziana Calamoneri, Andrea E. F. Clementi, Miriam Di Ianni, Massimo Lauria, Angelo Monti, Riccardo Silvestri
Minimum-Energy Broadcast and disk cover in grid wireless networks. Theor. Comput. Sci. 399 (1-2) (2008)
Miriam Di Ianni, Gianluca Rossi
Minimum Energy Range Assignment in Heterogeneous Ad-Hoc Networks. AINA Workshops (2) (2007)
Andrea E. F. Clementi, Miriam Di Ianni, Massimo Lauria, Angelo Monti, Gianluca Rossi, Riccardo Silvestri
On the bounded-hop MST problem on random Euclidean instances. Theor. Comput. Sci. 384 (2-3) (2007)
Andrea E. F. Clementi, Miriam Di Ianni, Massimo Lauria, Angelo Monti, Gianluca Rossi, Riccardo Silvestri
A Distributed Protocol for the Bounded-Hops Converge-Cast in Ad-Hoc Networks. ADHOC-NOW (2006)
Tiziana Calamoneri, Andrea E. F. Clementi, Miriam Di Ianni, Massimo Lauria, Angelo Monti, Riccardo Silvestri
Minimum Energy Broadcast and Disk Cover in Grid Wireless Networks. SIROCCO (2006)
Pilu Crescenzi, Miriam Di Ianni, Alessandro Lazzoni, Paolo Penna, Gianluca Rossi, Paola Vocca
Equilibria for Broadcast Range Assignment Games in Ad-Hoc Networks. ADHOC-NOW (2005)
Andrea E. F. Clementi, Miriam Di Ianni, Angelo Monti, Gianluca Rossi, Riccardo Silvestri
Experimental Analysis of Practically Efficient Algorithms for Bounded-Hop Accumulation in Ad-Hoc Wireless Networks. IPDPS (2005)
Andrea E. F. Clementi, Miriam Di Ianni, Angelo Monti, Massimo Lauria, Gianluca Rossi, Riccardo Silvestri
Divide and Conquer Is Almost Optimal for the Bounded-Hop MST Problem on Random Euclidean Instances. SIROCCO (2005)
Christoph Ambühl, Andrea E. F. Clementi, Miriam Di Ianni, Nissan Lev-Tov, Angelo Monti, David Peleg, Gianluca Rossi, Riccardo Silvestri
Efficient Algorithms for Low-Energy Bounded-Hop Broadcast in Ad-Hoc Wireless Networks. STACS (2004)
Christoph Ambühl, Andrea E. F. Clementi, Miriam Di Ianni, Gianluca Rossi, Angelo Monti, Riccardo Silvestri
The Range Assignment Problem in Non-Homogeneous Static Ad-Hoc Networks. IPDPS (2004)
Luca Becchetti, Miriam Di Ianni, Alberto Marchetti-Spaccamela
Approximating call-scheduling makespan in all-optical networks. J. Discrete Algorithms 2 (4) (2004)
Andrea E. F. Clementi, Miriam Di Ianni, Riccardo Silvestri
The minimum broadcast range assignment problem on linear multi-hop wireless networks. Theor. Comput. Sci. 299 (1-3) (2003)
Jean-Claude Bermond, Miriam Di Ianni, Michele Flammini, Stephane Perennes
Deadlock Prevention by Acyclic Orientations. Discret. Appl. Math. 129 (1) (2003)
Tiziana Calamoneri, Miriam Di Ianni
Interval routing & layered cross product: compact routing schemes for butterflies, meshes of trees, fat trees and Benes networks. J. Parallel Distributed Comput. 63 (11) (2003)
Luca Becchetti, Miriam Di Ianni, Alberto Marchetti-Spaccamela
Approximation algorithms for routing and call scheduling in all-optical chains and rings. Theor. Comput. Sci. 287 (2) (2002)
Luca Becchetti, Miriam Di Ianni, Alberto Marchetti-Spaccamela
Approximating Call-Scheduling Makespan in All-Optical Networks. WG (2000)
Miriam Di Ianni
Wormhole Deadlock Prediction. Parallel Process. Lett. 10 (4) (2000)
Piera Barcaccia, Maurizio A. Bonuccelli, Miriam Di Ianni
Complexity of Minimum Length Scheduling for Precedence Constrained Messages in Distributed Systems. IEEE Trans. Parallel Distributed Syst. 11 (10) (2000)
Luca Becchetti, Miriam Di Ianni, Alberto Marchetti-Spaccamela
Approximation Algorithms for Routing and Call Scheduling in All-Optical Chains and Rings. FSTTCS (1999)
Marco Cesati, Miriam Di Ianni
Parameterized Parallel Complexity. Euro-Par (1998)
Miriam Di Ianni
Efficient Delay Routing. Theor. Comput. Sci. 196 (1-2) (1998)
Tiziana Calamoneri, Miriam Di Ianni
Interval Routing & Layered Cross Product: Compact Routing Schemes for Butterflies, Mesh of Trees and Fat Trees. Euro-Par (1998)
Marco Cesati, Miriam Di Ianni
Parameterized Parallel Complexity Electron. Colloquium Comput. Complex. 4 (6) (1997)
Jean-Claude Bermond, Miriam Di Ianni, Michele Flammini, Stephane Perennes
Acyclic Orientations for Deadlock Prevention in Interconnection Networks (Extended Abstract). WG (1997)
Miriam Di Ianni
Wormhole Deadlock Prediction. Euro-Par (1997)
Marco Cesati, Miriam Di Ianni
Computation Models for Parameterized Complexity. Math. Log. Q. 43 (1997)
Miriam Di Ianni
Efficient Delay Routing (Extended Abstract). Euro-Par, Vol. I (1996)
Piera Barcaccia, Maurizio A. Bonuccelli, Miriam Di Ianni
Minimum Length Scheduling of Precedence Constrained Messages in Distributed Systems (Extended Abstract). Euro-Par, Vol. II (1996)
Andrea E. F. Clementi, Miriam Di Ianni
On the hardness of approximating optimum schedule problems in store and forward networks. IEEE/ACM Trans. Netw. 4 (2) (1996)
Andrea E. F. Clementi, Miriam Di Ianni
Optimum Schedule Problems in Store and Forward Networks. Int. J. Found. Comput. Sci. 6 (2) (1995)
Miriam Di Ianni, Michele Flammini, Rossella Flammini, Sandro Salomone
Systolic Acyclic Orientations for Deadlock Prevention. SIROCCO (1995)
Andrea E. F. Clementi, Miriam Di Ianni
Optimum Schedule Problems in Store and Forward Networks. INFOCOM (1994)
Daniel P. Bovet, Miriam Di Ianni, Pierluigi Crescenzi
Deadlock Prediction in the Case of Dynamic Routing. Int. J. Found. Comput. Sci. 1 (3) (1990)