Miriam Di Ianni

According to our database, Miriam Di Ianni authored at least 40 papers between 1990 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Opinion evolution among friends and foes: The deterministic majority rule.

Miriam Di Ianni

Theor. Comput. Sci., May, 2023

A note on the satisfactory partition problem: Constant size requirement.

Felice Ciccarelli, Miriam Di Ianni, Giancarlo Palumbo

Inf. Process. Lett., 2023

2022

Opinion Evolution among friends and foes: the deterministic Majority Rule - extended abstract.

Miriam Di Ianni

CoRR, 2022

2021

Complexity of Scorpion Solitaire and applications to Klondike.

Francesco Arena, Miriam Di Ianni

Theor. Comput. Sci., 2021

2020

Latency-Bounded Target Set Selection in Signed Networks.

Miriam Di Ianni, Giovanna Varricchio

Algorithms, 2020

2016

Min-max communities in graphs: Complexity and computational properties.

Miriam Di Ianni, Giorgio Gambosi, Gianluca Rossi, Paola Vocca

Theor. Comput. Sci., 2016

2015

Distributed community detection in dynamic graphs.

Andrea Clementi, Miriam Di Ianni, Giorgio Gambosi, Emanuele Natale, Riccardo Silvestri

Theor. Comput. Sci., 2015

Reducing the diameter of a unit disk graph via node addition.

Miriam Di Ianni, Luciano Gualà, Gianluca Rossi

Inf. Process. Lett., 2015

2013

Distributed Community Detection in Dynamic Graphs - (Extended Abstract).

Andrea Clementi, Miriam Di Ianni, Giorgio Gambosi, Emanuele Natale, Riccardo Silvestri

Proceedings of the Structural Information and Communication Complexity, 2013

2011

Smooth movement and Manhattan path based Random Waypoint mobility.

Pilu Crescenzi, Miriam Di Ianni, Andrea Marino, Donatella Merlini, Gianluca Rossi, Paola Vocca

Inf. Process. Lett., 2011

2009

Spatial Node Distribution of Manhattan Path Based Random Waypoint Mobility Models with Applications.

Pilu Crescenzi, Miriam Di Ianni, Andrea Marino, Gianluca Rossi, Paola Vocca

Proceedings of the Structural Information and Communication Complexity, 2009

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

Making Role Assignment Feasible: A Polynomial-Time Algorithm for Computing Ecological Colorings.

Pilu Crescenzi, Miriam Di Ianni, Federico Greco, Gianluca Rossi, Paola Vocca

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2008

MOMOSE: a mobility model simulation environment for mobile wireless ad-hoc networks.

Stefano Boschi, Miriam Di Ianni, Pilu Crescenzi, Gianluca Rossi, Paola Vocca

Proceedings of the 1st International Conference on Simulation Tools and Techniques for Communications, 2008

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

Minimum Energy Range Assignment in Heterogeneous Ad-Hoc Networks.

Miriam Di Ianni, Gianluca Rossi

Proceedings of the 21st International Conference on Advanced Information Networking and Applications (AINA 2007), 2007

2006

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

Proceedings of the Ad-Hoc, Mobile, and Wireless Networks, 5th International Conference, 2006

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

Proceedings of the Structural Information and Communication Complexity, 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

Proceedings of the 19th International Parallel and Distributed Processing Symposium (IPDPS 2005), 2005

Equilibria for Broadcast Range Assignment Games in Ad-Hoc Networks.

Pilu Crescenzi, Miriam Di Ianni, Alessandro Lazzoni, Paolo Penna, Gianluca Rossi, Paola Vocca

Proceedings of the Ad-Hoc, Mobile, and Wireless Networks, 4th International Conference, 2005

2004

Approximating call-scheduling makespan in all-optical networks.

Luca Becchetti, Miriam Di Ianni, Alberto Marchetti-Spaccamela

J. Discrete Algorithms, 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

Proceedings of the STACS 2004, 2004

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

Proceedings of the 18th International Parallel and Distributed Processing Symposium (IPDPS 2004), 2004

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

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

Deadlock Prevention by Acyclic Orientations.

Jean-Claude Bermond, Miriam Di Ianni, Michele Flammini, Stephane Perennes

Discret. Appl. Math., 2003

2002

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

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

Wormhole Deadlock Prediction.

Miriam Di Ianni

Parallel Process. Lett., 2000

1998

Efficient Delay Routing.

Miriam Di Ianni

Theor. Comput. Sci., 1998

Interval Routing & Layered Cross Product: Compact Routing Schemes for Butterflies, Mesh of Trees and Fat Trees.

Tiziana Calamoneri, Miriam Di Ianni

Proceedings of the Euro-Par '98 Parallel Processing, 1998

1997

Computation Models for Parameterized Complexity.

Marco Cesati, Miriam Di Ianni

Math. Log. Q., 1997

Parameterized Parallel Complexity

Marco Cesati, Miriam Di Ianni

Electron. Colloquium Comput. Complex., 1997

Acyclic Orientations for Deadlock Prevention in Interconnection Networks (Extended Abstract).

Jean-Claude Bermond, Miriam Di Ianni, Michele Flammini, Stephane Perennes

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1997

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

Efficient Delay Routing (Extended Abstract).

Miriam Di Ianni

Proceedings of the Euro-Par '96 Parallel Processing, 1996

Minimum Length Scheduling of Precedence Constrained Messages in Distributed Systems (Extended Abstract).

Piera Barcaccia, Maurizio A. Bonuccelli, Miriam Di Ianni

Proceedings of the Euro-Par '96 Parallel Processing, 1996

1995

Optimum Schedule Problems in Store and Forward Networks.

Andrea Clementi, Miriam Di Ianni

Int. J. Found. Comput. Sci., 1995

Systolic Acyclic Orientations for Deadlock Prevention.

Miriam Di Ianni, Michele Flammini, Rossella Flammini, Sandro Salomone

Proceedings of the Structure, Information and Communication Complexity, 1995

1990

Deadlock Prediction in the Case of Dynamic Routing.

Daniel P. Bovet, Miriam Di Ianni, Pierluigi Crescenzi

Int. J. Found. Comput. Sci., 1990