default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTiziana Calamoneri
- > Home > Persons > Tiziana Calamoneri
Publications
- 2025
[j74]Tiziana Calamoneri, Angelo Monti, Fabrizio Petroni:
All Graphs with at Most 8 Nodes are 2-interval-PCGs. Fundam. Informaticae 193(1-4): 1-9 (2025)- 2024
- [j71]Tiziana Calamoneri, Manuel Lafond, Angelo Monti, Blerina Sinaimeri:
On Generalizations of Pairwise Compatibility Graphs. Discret. Math. Theor. Comput. Sci. 26(3) (2024) - 2022
- [j65]Tiziana Calamoneri, Angelo Monti, Blerina Sinaimeri:
On the domination number of $t$-constrained de Bruijn graphs. Discret. Math. Theor. Comput. Sci. 24(2) (2022) - [c45]Tiziana Calamoneri, Angelo Monti, Blerina Sinaimeri:
On the Domination Number of t-Constrained de Bruijn Graphs. ICTCS 2022: 34-39 - [i14]Tiziana Calamoneri, Angelo Monti, Fabrizio Petroni:
All Graphs with at most 8 nodes are 2-interval-PCGs. CoRR abs/2202.13844 (2022) - 2021
- [i11]Tiziana Calamoneri, Angelo Monti, Blerina Sinaimeri:
On Generalizations of Pairwise Compatibility Graphs. CoRR abs/2112.08503 (2021) - 2019
- [j60]Tiziana Calamoneri
, Matteo Dell'Orefice, Angelo Monti:
A simple linear time algorithm for the locally connected spanning tree problem on maximal planar chordal graphs. Theor. Comput. Sci. 764: 2-14 (2019) - [j59]Pierluigi Baiocchi, Tiziana Calamoneri, Angelo Monti, Rossella Petreschi:
Some classes of graphs that are not PCGs. Theor. Comput. Sci. 791: 62-75 (2019) - 2018
- [j58]Tiziana Calamoneri, Angelo Monti, Rossella Petreschi:
On dynamic threshold graphs and related classes. Theor. Comput. Sci. 718: 46-57 (2018) - [c40]Pierluigi Baiocchi, Tiziana Calamoneri, Angelo Monti, Rossella Petreschi:
Graphs that Are Not Pairwise Compatible: A New Proof Technique (Extended Abstract). IWOCA 2018: 39-51 - 2017
- [i10]Pierluigi Baiocchi, Tiziana Calamoneri, Angelo Monti, Rossella Petreschi:
Some classes of graphs that are not PCGs. CoRR abs/1707.07436 (2017) - 2016
- [c37]Tiziana Calamoneri, Matteo Dell'Orefice, Angelo Monti:
A Locally Connected Spanning Tree Can Be Found in Polynomial Time on Simple Clique 3-Trees. ICTCS 2016: 103-121 - [c34]Tiziana Calamoneri, Angelo Monti, Rossella Petreschi:
Fully Dynamically Maintaining Minimal Integral Separator for Threshold and Difference Graphs. WALCOM 2016: 313-324 - 2015
- [i8]Tiziana Calamoneri, Angelo Monti, Rossella Petreschi:
Dynamically Operating on Threshold Graphs and Related Classes (Extended Abstract). CTW 2015: 20-23 - 2008
- [j25]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) - [c21]Tiziana Calamoneri, Andrea E. F. Clementi, Angelo Monti, Gianluca Rossi, Riccardo Silvestri:
Minimum-energy broadcast in random-grid ad-hoc networks: approximation and distributed algorithms. MSWiM 2008: 354-361 - [i1]Tiziana Calamoneri, Andrea E. F. Clementi, Angelo Monti, Gianluca Rossi, Riccardo Silvestri:
Minimum-energy broadcast in random-grid ad-hoc networks: approximation and distributed algorithms. CoRR abs/0804.3902 (2008) - 2006
- [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
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 2025-08-13 21:24 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:
