default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMiriam Di Ianni
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j22]Felice Ciccarelli
, Miriam Di Ianni, Giancarlo Palumbo:
A note on the satisfactory partition problem: Constant size requirement. Inf. Process. Lett. 179: 106292 (2023)- [j21]Miriam Di Ianni:
Opinion evolution among friends and foes: The deterministic majority rule. Theor. Comput. Sci. 959: 113875 (2023) - 2022
- [i3]Miriam Di Ianni:
Opinion Evolution among friends and foes: the deterministic Majority Rule - extended abstract. CoRR abs/2211.17159 (2022) - 2021
- [j20]Francesco Arena, Miriam Di Ianni:
Complexity of Scorpion Solitaire and applications to Klondike. Theor. Comput. Sci. 890: 105-124 (2021) - 2020
- [j19]Miriam Di Ianni, Giovanna Varricchio:
Latency-Bounded Target Set Selection in Signed Networks. Algorithms 13(2): 32 (2020) - [c23]Francesco Arena, Miriam Di Ianni:
Complexity of Scorpion Solitaire and applications to Klondike. ICTCS 2020: 172-183
2010 – 2019
- 2016
- [j18]Miriam Di Ianni, Giorgio Gambosi, Gianluca Rossi, Paola Vocca:
Min-max communities in graphs: Complexity and computational properties. Theor. Comput. Sci. 613: 94-114 (2016) - 2015
- [j17]Miriam Di Ianni, Luciano Gualà, Gianluca Rossi:
Reducing the diameter of a unit disk graph via node addition. Inf. Process. Lett. 115(11): 845-850 (2015) - [j16]Andrea Clementi, Miriam Di Ianni, Giorgio Gambosi, Emanuele Natale, Riccardo Silvestri:
Distributed community detection in dynamic graphs. Theor. Comput. Sci. 584: 19-41 (2015) - 2013
- [c22]Andrea Clementi, Miriam Di Ianni, Giorgio Gambosi, Emanuele Natale, Riccardo Silvestri:
Distributed Community Detection in Dynamic Graphs - (Extended Abstract). SIROCCO 2013: 1-12 - [i2]Andrea Clementi, Miriam Di Ianni, Giorgio Gambosi, Emanuele Natale, Riccardo Silvestri:
Distributed Community Detection in Dynamic Graphs. CoRR abs/1302.5607 (2013) - 2011
- [j15]Pilu Crescenzi, Miriam Di Ianni, Andrea Marino, Donatella Merlini, Gianluca Rossi, Paola Vocca:
Smooth movement and Manhattan path based Random Waypoint mobility. Inf. Process. Lett. 111(5): 239-246 (2011)
2000 – 2009
- 2009
- [c21]Pilu Crescenzi, Miriam Di Ianni, Andrea Marino, Gianluca Rossi, Paola Vocca:
Spatial Node Distribution of Manhattan Path Based Random Waypoint Mobility Models with Applications. SIROCCO 2009: 154-166 - 2008
- [j14]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) - [c20]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 - [c19]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 - 2007
- [j13]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) - [c18]Miriam Di Ianni, Gianluca Rossi:
Minimum Energy Range Assignment in Heterogeneous Ad-Hoc Networks. AINA Workshops (2) 2007: 121-126 - 2006
- [c17]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 - [c16]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
- [c15]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 - [c14]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 - [c13]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
- [j12]Luca Becchetti, Miriam Di Ianni, Alberto Marchetti-Spaccamela:
Approximating call-scheduling makespan in all-optical networks. J. Discrete Algorithms 2(4): 501-515 (2004) - [c12]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 - [c11]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 - 2003
- [j11]Jean-Claude Bermond, Miriam Di Ianni, Michele Flammini, Stephane Perennes:
Deadlock Prevention by Acyclic Orientations. Discret. Appl. Math. 129(1): 31-47 (2003) - [j10]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 Distributed Comput. 63(11): 1017-1025 (2003) - [j9]Andrea E. F. Clementi, Miriam Di Ianni, Riccardo Silvestri:
The minimum broadcast range assignment problem on linear multi-hop wireless networks. Theor. Comput. Sci. 299(1-3): 751-761 (2003) - 2002
- [j8]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
- [j7]Miriam Di Ianni:
Wormhole Deadlock Prediction. Parallel Process. Lett. 10(4): 295-304 (2000) - [j6]Piera Barcaccia, Maurizio A. Bonuccelli, Miriam Di Ianni:
Complexity of Minimum Length Scheduling for Precedence Constrained Messages in Distributed Systems. IEEE Trans. Parallel Distributed Syst. 11(10): 1090-1102 (2000) - [c10]Luca Becchetti, Miriam Di Ianni, Alberto Marchetti-Spaccamela:
Approximating Call-Scheduling Makespan in All-Optical Networks. WG 2000: 13-22
1990 – 1999
- 1999
- [c9]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
- [j5]Miriam Di Ianni:
Efficient Delay Routing. Theor. Comput. Sci. 196(1-2): 131-151 (1998) - [c8]Marco Cesati, Miriam Di Ianni:
Parameterized Parallel Complexity. Euro-Par 1998: 892-896 - [c7]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 - 1997
- [j4]Marco Cesati, Miriam Di Ianni:
Computation Models for Parameterized Complexity. Math. Log. Q. 43: 179-202 (1997) - [c6]Miriam Di Ianni:
Wormhole Deadlock Prediction. Euro-Par 1997: 188-195 - [c5]Jean-Claude Bermond, Miriam Di Ianni, Michele Flammini, Stephane Perennes:
Acyclic Orientations for Deadlock Prevention in Interconnection Networks (Extended Abstract). WG 1997: 52-64 - [i1]Marco Cesati, Miriam Di Ianni:
Parameterized Parallel Complexity. Electron. Colloquium Comput. Complex. TR97 (1997) - 1996
- [j3]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) - [c4]Miriam Di Ianni:
Efficient Delay Routing (Extended Abstract). Euro-Par, Vol. I 1996: 258-269 - [c3]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 - 1995
- [j2]Andrea Clementi, Miriam Di Ianni:
Optimum Schedule Problems in Store and Forward Networks. Int. J. Found. Comput. Sci. 6(2): 155-168 (1995) - [c2]Miriam Di Ianni, Michele Flammini, Rossella Flammini, Sandro Salomone:
Systolic Acyclic Orientations for Deadlock Prevention. SIROCCO 1995: 1-12 - 1994
- [c1]Andrea E. F. Clementi, Miriam Di Ianni:
Optimum Schedule Problems in Store and Forward Networks. INFOCOM 1994: 1336-1343 - 1990
- [j1]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)
Coauthor Index
aka: Andrea E. F. Clementi
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
