Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Miriam Di Ianni
Observed names:
M. Di Ianni,
M. di Ianni,
MIRIAM DI IANNI
Institution:
University of Rome Tor Vergata
Observed institutions:
University of Pisa,
University of Rome Tor Vergata,
University of Perugia,
University of Florence,
Sapienza University of Rome
ORCID:
0000-0002-1699-5802
Observed ORCID:
0000-0002-1699-5802
OpenAlex ID:
A5014515479
Distributed community detection in dynamic graphs
2014
·
Andrea Clementi
, Miriam Di Ianni
, et al.
·
Theoretical Computer Science
·
45
PDF
The minimum broadcast range assignment problem on linear multi-hop wireless networks
2003
·
Andrea E.F. Clementi
, Miriam Di Ianni
, et al.
·
Theoretical Computer Science
·
45
PDF
Efficient Algorithms for Low-Energy Bounded-Hop Broadcast in Ad-Hoc Wireless Networks
2004
·
Christoph Ambühl
, Andrea E. F. Clementi
, et al.
·
Lecture notes in computer science
·
34
Parameterized parallel complexity
1998
·
Marco Cesati
, Miriam Di Ianni
·
Lecture notes in computer science
·
24
PDF
The range assignment problem in non-homogeneous static ad-hoc networks
2004
·
C. Ambuhl
, A.E.F. Clementi
, et al.
·
IEEE International Parallel and Distributed Processing Symposium (IPDPS)
·
21
Efficient delay routing
1998
·
Miriam Di Ianni
·
Theoretical Computer Science
·
19
Experimental Analysis of Practically Efficient Algorithms for Bounded-Hop Accumulation in Ad-Hoc Wireless Networks
2005
·
A.E.F. Clementi
, M. Di Ianni
, et al.
·
IEEE International Parallel and Distributed Processing Symposium (IPDPS)
·
14
On the hardness of approximating optimum schedule problems in store and forward networks
1996
·
A.E.F. Clementi
, M. Di Ianni
·
IEEE/ACM Transactions on Networking
·
14
MOMOSE: a mobility model simulation environment for mobile wireless ad-hoc networks
2008
·
Stefano Boschi
, Pilu Crescenzi
, et al.
·
International ICST Conference on Simulation Tools and Techniques (SIMUTools)
·
13
PDF
Divide and Conquer Is Almost Optimal for the Bounded-Hop MST Problem on Random Euclidean Instances
2005
·
Andrea E. F. Clementi
, Miriam Di Ianni
, et al.
·
Lecture notes in computer science
·
12
Minimum-Energy Broadcast and disk cover in grid wireless networks
2008
·
Tiziana Calamoneri
, Andrea E.F. Clementi
, et al.
·
Theoretical Computer Science
·
11
PDF
Spatial Node Distribution of Manhattan Path Based Random Waypoint Mobility Models with Applications
2010
·
Pilu Crescenzi
, Miriam Di Ianni
, et al.
·
Lecture notes in computer science
·
10
Distributed Community Detection in Dynamic Graphs
2013
·
Andrea Clementi
, Miriam Di Ianni
, et al.
·
Lecture notes in computer science
·
9
PDF
Opinion evolution among friends and foes: The deterministic majority rule
2023
·
Miriam Di Ianni
·
Theoretical Computer Science
·
7
Complexity of minimum length scheduling for precedence constrained messages in distributed systems
2000
·
M. di Ianni
, M.A. Bonuccelli
, et al.
·
IEEE Transactions on Parallel and Distributed Systems
·
7
Minimum length scheduling of precedence constrained messages in distributed systems: Extended abstract
1996
·
Piera Barcaccia
, Maurizio A. Bonuccelli
, et al.
·
Lecture notes in computer science
·
7
PDF
Optimum schedule problems in store and forward networks
2002
·
A. Clementi
, M. Di Ianni
·
IEEE Conference on Computer Communications (INFOCOM)
·
6
Wormhole deadlock prediction
1997
·
Miriam Di Ianni
·
Lecture notes in computer science
·
6
Latency-Bounded Target Set Selection in Signed Networks
2020
·
Miriam Di Ianni
, Giovanna Varricchio
·
Algorithms
·
5
PDF
Min–max communities in graphs: Complexity and computational properties
2015
·
Miriam Di Ianni
, Giorgio Gambosi
, et al.
·
Theoretical Computer Science
·
5
PDF
On the bounded-hop MST problem on random Euclidean instances
2007
·
Andrea E.F. Clementi
, Miriam Di Ianni
, et al.
·
Theoretical Computer Science
·
5
PDF
Approximation algorithms for routing and call scheduling in all-optical chains and rings
2002
·
Luca Becchetti
, Miriam Di Ianni
, et al.
·
Theoretical Computer Science
·
5
Systolic Acyclic Orientations for Deadlock Prevention.
1995
·
Miriam Di Ianni
, Michele Flammini
, et al.
·
SIROCCO
·
5
A note on the satisfactory partition problem: Constant size requirement
2022
·
Felice Ciccarelli
, Miriam Di Ianni
, et al.
·
Information Processing Letters
·
4
Distributed Community Detection in Dynamic Graphs - (Extended Abstract).
2013
·
Andrea Clementi
, Miriam Di Ianni
, et al.
·
SIROCCO
·
4
Show more works
View as search
Works count:
49
Citation count:
377
H-index:
11
I10-index:
12
Year
Topic
Type