2008 |
35 | EE | 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: 38 |
34 | EE | 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: 90-100 |
33 | EE | 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): 38-53 (2008) |
2007 |
32 | EE | Miriam Di Ianni,
Gianluca Rossi:
Minimum Energy Range Assignment in Heterogeneous Ad-Hoc Networks.
AINA Workshops (2) 2007: 121-126 |
31 | | 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): 161-167 (2007) |
2006 |
30 | EE | 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: 60-72 |
29 | EE | 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: 227-239 |
2005 |
28 | EE | 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: 4-17 |
27 | EE | 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 |
26 | EE | 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: 89-98 |
2004 |
25 | EE | 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 |
24 | EE | 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: 418-427 |
23 | EE | Luca Becchetti,
Miriam Di Ianni,
Alberto Marchetti-Spaccamela:
Approximating call-scheduling makespan in all-optical networks.
J. Discrete Algorithms 2(4): 501-515 (2004) |
2003 |
22 | EE | Jean-Claude Bermond,
Miriam Di Ianni,
Michele Flammini,
Stephane Perennes:
Deadlock Prevention by Acyclic Orientations.
Discrete Applied Mathematics 129(1): 31-47 (2003) |
21 | EE | 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 Distrib. Comput. 63(11): 1017-1025 (2003) |
20 | EE | Andrea E. F. Clementi,
Miriam Di Ianni,
Riccardo Silvestri:
The minimum broadcast range assignment problem on linear multi-hop wireless networks.
Theor. Comput. Sci. 1-3(299): 751-761 (2003) |
2002 |
19 | | 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): 429-448 (2002) |
2000 |
18 | EE | Luca Becchetti,
Miriam Di Ianni,
Alberto Marchetti-Spaccamela:
Approximating Call-Scheduling Makespan in All-Optical Networks.
WG 2000: 13-22 |
17 | EE | Piera Barcaccia,
Maurizio A. Bonuccelli,
Miriam Di Ianni:
Complexity of Minimum Length Scheduling for Precedence Constrained Messages in Distributed Systems.
IEEE Trans. Parallel Distrib. Syst. 11(10): 1090-1102 (2000) |
16 | | Miriam Di Ianni:
Wormhole Deadlock Prediction.
Parallel Processing Letters 10(4): 295-304 (2000) |
1999 |
15 | EE | Luca Becchetti,
Miriam Di Ianni,
Alberto Marchetti-Spaccamela:
Approximation Algorithms for Routing and Call Scheduling in All-Optical Chains and Rings.
FSTTCS 1999: 201-212 |
1998 |
14 | EE | Tiziana Calamoneri,
Miriam Di Ianni:
Interval Routing & Layered Cross Product: Compact Routing Schemes for Butterflies, Mesh of Trees and Fat Trees.
Euro-Par 1998: 1029-1039 |
13 | EE | Marco Cesati,
Miriam Di Ianni:
Parameterized Parallel Complexity.
Euro-Par 1998: 892-896 |
12 | EE | Miriam Di Ianni:
Efficient Delay Routing.
Theor. Comput. Sci. 196(1-2): 131-151 (1998) |
1997 |
11 | | Miriam Di Ianni:
Wormhole Deadlock Prediction.
Euro-Par 1997: 188-195 |
10 | | Jean-Claude Bermond,
Miriam Di Ianni,
Michele Flammini,
Stephane Perennes:
Acyclic Orientations for Deadlock Prevention in Interconnection Networks (Extended Abstract).
WG 1997: 52-64 |
9 | EE | Marco Cesati,
Miriam Di Ianni:
Parameterized Parallel Complexity
Electronic Colloquium on Computational Complexity (ECCC) 4(6): (1997) |
8 | | Marco Cesati,
Miriam Di Ianni:
Computation Models for Parameterized Complexity.
Math. Log. Q. 43: 179-202 (1997) |
1996 |
7 | | Miriam Di Ianni:
Efficient Delay Routing (Extended Abstract).
Euro-Par, Vol. I 1996: 258-269 |
6 | | 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: 594-601 |
5 | EE | 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): 272-280 (1996) |
1995 |
4 | | Miriam Di Ianni,
Michele Flammini,
Rossella Flammini,
Sandro Salomone:
Systolic Acyclic Orientations for Deadlock Prevention.
SIROCCO 1995: 1-12 |
3 | | Andrea E. F. Clementi,
Miriam Di Ianni:
Optimum Schedule Problems in Store and Forward Networks.
Int. J. Found. Comput. Sci. 6(2): 155-168 (1995) |
1994 |
2 | | Andrea E. F. Clementi,
Miriam Di Ianni:
Optimum Schedule Problems in Store and Forward Networks.
INFOCOM 1994: 1336-1343 |
1990 |
1 | | Daniel P. Bovet,
Miriam Di Ianni,
Pierluigi Crescenzi:
Deadlock Prediction in the Case of Dynamic Routing.
Int. J. Found. Comput. Sci. 1(3): 185-200 (1990) |