Остановите войну!
for scientists:
default search action
Tiziana Calamoneri
- > Home > Persons > Tiziana Calamoneri
Publications
- 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
- [c34]Tiziana Calamoneri, Angelo Monti, Rossella Petreschi:
Fully Dynamically Maintaining Minimal Integral Separator for Threshold and Difference Graphs. WALCOM 2016: 313-324 - 2015
- [j52]Tiziana Calamoneri, Rossella Petreschi:
Corrigendum to "On pairwise compatibility graphs having Dilworth number two" [Theoret. Comput. Science (2014) 34-40]. Theor. Comput. Sci. 602: 524 (2015) - [i8]Tiziana Calamoneri, Angelo Monti, Rossella Petreschi:
Dynamically Operating on Threshold Graphs and Related Classes (Extended Abstract). CTW 2015: 20-23 - 2014
- [j49]Tiziana Calamoneri, Rossella Petreschi:
On pairwise compatibility graphs having Dilworth number two. Theor. Comput. Sci. 524: 34-40 (2014) - [j48]Tiziana Calamoneri, Rossella Petreschi:
On pairwise compatibility graphs having Dilworth number k. Theor. Comput. Sci. 547: 82-89 (2014) - [c32]Tiziana Calamoneri, Rossella Petreschi:
On Dilworth k Graphs and Their Pairwise Compatibility. WALCOM 2014: 213-224 - 2013
- [j45]Tiziana Calamoneri, Rossella Petreschi, Blerina Sinaimeri:
On the Pairwise Compatibility Property of some Superclasses of Threshold Graphs. Discret. Math. Algorithms Appl. 5(2) (2013) - [j43]Tiziana Calamoneri, Rossella Petreschi:
Graphs with Dilworth Number Two are Pairwise Compatibility Graphs. Electron. Notes Discret. Math. 44: 31-38 (2013) - [j41]Tiziana Calamoneri, Eugenio Montefusco, Rossella Petreschi, Blerina Sinaimeri:
Exploring pairwise compatibility graphs. Theor. Comput. Sci. 468: 23-36 (2013) - 2012
- [c31]Tiziana Calamoneri, Rossella Petreschi, Blerina Sinaimeri:
On Relaxing the Constraints in Pairwise Compatibility Graphs. WALCOM 2012: 124-135 - 2011
- [j36]Tiziana Calamoneri, Rossella Petreschi:
The L(2, 1)-labeling of unigraphs. Discret. Appl. Math. 159(12): 1196-1206 (2011) - [j34]Alessandro Borri, Tiziana Calamoneri, Rossella Petreschi:
Recognition of Unigraphs through Superposition of Graphs. J. Graph Algorithms Appl. 15(3): 323-343 (2011) - [c29]Tiziana Calamoneri, Rossella Petreschi:
L(2, 1)-Labeling of Unigraphs - (Extended Abstract). TAPAS 2011: 57-68 - [i5]Tiziana Calamoneri, Rossella Petreschi, Blerina Sinaimeri:
On relaxing the constraints in pairwise compatibility graphs. CoRR abs/1105.2171 (2011) - 2009
- [j27]Tiziana Calamoneri, Saverio Caminiti, Rossella Petreschi, Stephan Olariu:
On the L(h, k)-labeling of co-comparability graphs and circular-arc graphs. Networks 53(1): 27-34 (2009) - [c24]Alessandro Borri, Tiziana Calamoneri, Rossella Petreschi:
Recognition of Unigraphs through Superposition of Graphs (Extended Abstract). WALCOM 2009: 165-176 - 2008
- [j26]Tiziana Calamoneri, Saverio Caminiti, Rossella Petreschi:
A General Approach to L ( h, k )-Label Interconnection Networks. J. Comput. Sci. Technol. 23(4): 652-659 (2008) - 2007
- [c19]Tiziana Calamoneri, Saverio Caminiti, Stephan Olariu, Rossella Petreschi:
On the L(h, k)-Labeling of Co-comparability Graphs. ESCAPE 2007: 116-127 - 2006
- [j23]Tiziana Calamoneri, Rossella Petreschi:
lambda-Coloring matrogenic graphs. Discret. Appl. Math. 154(17): 2445-2457 (2006) - [j22]Tiziana Calamoneri, Andrzej Pelc, Rossella Petreschi:
Labeling trees with a condition at distance two. Discret. Math. 306(14): 1534-1539 (2006) - 2005
- [j18]Tiziana Calamoneri, Saverio Caminiti, Rossella Petreschi:
A general approach to L(h, k)-label interconnection networks. Electron. Notes Discret. Math. 19: 211-217 (2005) - [c14]Tiziana Calamoneri, Irene Finocchi, Rossella Petreschi:
Graph Coloring with Distance Constraints. PDPTA 2005: 131-140 - 2004
- [j16]Tiziana Calamoneri, Rossella Petreschi:
L(h, 1)-labeling subclasses of planar graphs. J. Parallel Distributed Comput. 64(3): 414-426 (2004) - 2003
- [j15]Tiziana Calamoneri, Rossella Petreschi, Andrzej Pelc:
Labeling trees with a condition at distance two. Electron. Notes Discret. Math. 15: 55-58 (2003) - 2002
- [j12]Tiziana Calamoneri, Irene Finocchi, Yannis Manoussakis, Rossella Petreschi:
On max cut in cubic graphs. Parallel Algorithms Appl. 17(3): 165-183 (2002) - [c10]Tiziana Calamoneri, Rossella Petreschi:
On the Radiocoloring Problem. IWDC 2002: 118-127 - [c9]Tiziana Calamoneri, Rossella Petreschi:
L(2, 1)-Coloring Matrogenic Graphs. LATIN 2002: 236-247 - 2001
- [j11]Tiziana Calamoneri, Rossella Petreschi:
LD-Coloring of Regular Tiling (Extended Abstract). Electron. Notes Discret. Math. 8: 18-21 (2001) - [j10]Tiziana Calamoneri, Rossella Petreschi:
Edge-clique graphs and the l-coloring problem. J. Braz. Comput. Soc. 7(3): 38-47 (2001) - [c8]Tiziana Calamoneri, Rossella Petreschi:
L(2, 1)-labeling of planar graphs. DIAL-M 2001: 28-33 - 2000
- [j8]Tiziana Calamoneri, Stephan Olariu, Rossella Petreschi:
A Simple Parallel Algorithm to Draw Cubic Graphs. IEEE Trans. Parallel Distributed Syst. 11(10): 1009-1018 (2000) - 1999
- [j7]Tiziana Calamoneri, Rossella Petreschi:
Optimal Layout of Trivalent Cayley Interconnection Networks. Int. J. Found. Comput. Sci. 10(3): 277-288 (1999) - [j5]Tiziana Calamoneri, Simone Jannelli, Rossella Petreschi:
Experimental Comparison of Graph Drawing Algorithms for Cubic Graphs. J. Graph Algorithms Appl. 3(2): 1-23 (1999) - [c7]Tiziana Calamoneri, Irene Finocchi, Yannis Manoussakis, Rossella Petreschi:
A Parallel Approximation Algorithm for the Max Cut Problem on Cubic Graphs. ASIAN 1999: 27-36 - 1998
- [j4]Tiziana Calamoneri, Rossella Petreschi:
Orthogonally Drawing Cubic Graphs in Parallel. J. Parallel Distributed Comput. 55(1): 94-108 (1998) - 1997
- [j2]Tiziana Calamoneri, Rossella Petreschi:
A New 3D Representation of Trivalent Cayley Networks. Inf. Process. Lett. 61(5): 247-252 (1997) - 1995
- [c1]Tiziana Calamoneri, Rossella Petreschi:
An Efficient Orthogonal Grid Drawing Algorithm For Cubic Graphs. COCOON 1995: 31-40
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-04-25 05:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint