DI IANNI, MIRIAM
DI IANNI, MIRIAM
Dipartimento di Ingegneria dell'Impresa "Mario Lucertini"
A Distributed Protocol for the Bounded-Hops Converge-Cast in Ad-Hoc Networks
2006-01-01 Clementi, A; DI IANNI, M; Lauria, M; Monti, A; Rossi, G; Silvestri, R
A note on the satisfactory partition problem: Constant size requirement
2023-01-01 Ciccarelli, F; DI IANNI, M; Palumbo, G
Approximating call-scheduling makespan in all-optical networks
2004-01-01 Becchetti, L; DI IANNI, M; Marchetti Spaccamela, A
Complexity of Scorpion Solitaire and applications to Klondike
2020-01-01 Arena, F; DI IANNI, M
Complexity of Scorpion Solitaire and applications to Klondike
2021-01-01 DI IANNI, M; Arena, F
Computation models for parameterized complexity
1997-01-01 Cesati, M; Di Ianni, M
Distributed community detection in dynamic graphs
2015-01-01 Clementi, A; DI IANNI, M; Gambosi, G; Natale, E; Silvestri, R
Distributed Community Detection in Dynamic Graphs
2013-01-01 Clementi, A; DI IANNI, M; Gambosi, G; Natale, E; Silvestri, R
Divide and conquer is almost optimal for the bounded-hop MST problem on random Euclidean instances
2005-01-01 Clementi, A; DI IANNI, M; Monti, A; Lauria, M; Rossi, G; Silvestri, R
Efficient Algorithms for Low-Energy Bounded-Hop Broadcast in Ad-Hoc Wireless Networks
2004-01-01 Ambhl, C; Clementi, A; DI IANNI, M; Lev Tov, N; Monti, A; Peleg, D; Rossi, G; Silvestri, R
Equilibria for broadcast range assignment games in ad-hoc networks
2005-01-01 Crescenzi, P; DI IANNI, M; Lazzoni, A; Penna, P; Rossi, G; Vocca, P
Experimental Analysis of Practically Efficient Algorithms for Bounded-Hop Accumulation in Ad-Hoc Wireless Networks
2005-01-01 Clementi, A; DI IANNI, M; Monti, A; Rossi, G; Silvestri, R
Game of Life-like Opinion Dynamics: Generalizing the Underpopulation Rule
2022-12-28 DI IANNI, M
Il sentiero dei problemi impossibili - Da Euclide al problema da un milione di dollari
2020-09-24 DI IANNI, M
Latency-bounded target set selection in signed networks
2020-01-01 DI IANNI, M; Varricchio, G
Making Role Assignment Feasible: A Polynomial-Time Algorithm for Computing Ecological Colorings
2008-01-01 Crescenzi, P; DI IANNI, M; Greco, F; Rossi, G; Vocca, P
Min-max communities in graphs: Complexity and computational properties
2016-01-01 DI IANNI, M; Gambosi, G; Rossi, G; Vocca, P
Minimum-Energy Broadcast and disk cover in grid wireless networks
2006-01-01 Calamoneri, T; Clementi, A; DI IANNI, M; Lauria, M; Monti, A; Silvestri, R
Minimum-energy broadcast and disk cover in grid wireless networks
2008-06-01 Calamoneri, T; Clementi, A; DI IANNI, M; Lauria, M; Monti, A; Silvestri, R
MOMOSE: A Mobility Model Simulation Environment for Mobile Wireless Ad-hoc Networks
2008-01-01 Boschi, S; Crescenzi, P; DI IANNI, M; Rossi, G; Vocca, P
Data di pubblicazione | Titolo | Autore(i) | Tipo | File |
---|---|---|---|---|
1-gen-2006 | A Distributed Protocol for the Bounded-Hops Converge-Cast in Ad-Hoc Networks | Clementi, A; DI IANNI, M; Lauria, M; Monti, A; Rossi, G; Silvestri, R | Intervento a convegno | |
1-gen-2023 | A note on the satisfactory partition problem: Constant size requirement | Ciccarelli, F; DI IANNI, M; Palumbo, G | Articolo su rivista | |
1-gen-2004 | Approximating call-scheduling makespan in all-optical networks | Becchetti, L; DI IANNI, M; Marchetti Spaccamela, A | Articolo su rivista | |
1-gen-2020 | Complexity of Scorpion Solitaire and applications to Klondike | Arena, F; DI IANNI, M | Intervento a convegno | |
1-gen-2021 | Complexity of Scorpion Solitaire and applications to Klondike | DI IANNI, M; Arena, F | Articolo su rivista | |
1-gen-1997 | Computation models for parameterized complexity | Cesati, M; Di Ianni, M | Articolo su rivista | |
1-gen-2015 | Distributed community detection in dynamic graphs | Clementi, A; DI IANNI, M; Gambosi, G; Natale, E; Silvestri, R | Articolo su rivista | |
1-gen-2013 | Distributed Community Detection in Dynamic Graphs | Clementi, A; DI IANNI, M; Gambosi, G; Natale, E; Silvestri, R | Intervento a convegno | |
1-gen-2005 | Divide and conquer is almost optimal for the bounded-hop MST problem on random Euclidean instances | Clementi, A; DI IANNI, M; Monti, A; Lauria, M; Rossi, G; Silvestri, R | Intervento a convegno | |
1-gen-2004 | Efficient Algorithms for Low-Energy Bounded-Hop Broadcast in Ad-Hoc Wireless Networks | Ambhl, C; Clementi, A; DI IANNI, M; Lev Tov, N; Monti, A; Peleg, D; Rossi, G; Silvestri, R | Intervento a convegno | |
1-gen-2005 | Equilibria for broadcast range assignment games in ad-hoc networks | Crescenzi, P; DI IANNI, M; Lazzoni, A; Penna, P; Rossi, G; Vocca, P | Intervento a convegno | |
1-gen-2005 | Experimental Analysis of Practically Efficient Algorithms for Bounded-Hop Accumulation in Ad-Hoc Wireless Networks | Clementi, A; DI IANNI, M; Monti, A; Rossi, G; Silvestri, R | Intervento a convegno | |
28-dic-2022 | Game of Life-like Opinion Dynamics: Generalizing the Underpopulation Rule | DI IANNI, M | Articolo su rivista | |
24-set-2020 | Il sentiero dei problemi impossibili - Da Euclide al problema da un milione di dollari | DI IANNI, M | Monografia | |
1-gen-2020 | Latency-bounded target set selection in signed networks | DI IANNI, M; Varricchio, G | Articolo su rivista | |
1-gen-2008 | Making Role Assignment Feasible: A Polynomial-Time Algorithm for Computing Ecological Colorings | Crescenzi, P; DI IANNI, M; Greco, F; Rossi, G; Vocca, P | Intervento a convegno | |
1-gen-2016 | Min-max communities in graphs: Complexity and computational properties | DI IANNI, M; Gambosi, G; Rossi, G; Vocca, P | Articolo su rivista | |
1-gen-2006 | Minimum-Energy Broadcast and disk cover in grid wireless networks | Calamoneri, T; Clementi, A; DI IANNI, M; Lauria, M; Monti, A; Silvestri, R | Intervento a convegno | |
1-giu-2008 | Minimum-energy broadcast and disk cover in grid wireless networks | Calamoneri, T; Clementi, A; DI IANNI, M; Lauria, M; Monti, A; Silvestri, R | Articolo su rivista | |
1-gen-2008 | MOMOSE: A Mobility Model Simulation Environment for Mobile Wireless Ad-hoc Networks | Boschi, S; Crescenzi, P; DI IANNI, M; Rossi, G; Vocca, P | Intervento a convegno |