Miriam Di Ianni

48 papers A* 1A 3B 8Journal 25Unranked 11

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