( en | de | ru )

 

Disambiguation of "Calamoneri, Tiziana"

Author of the publication

copydeleteadd this publication to your clipboard
All graphs with at most seven vertices are Pairwise Compatibility Graphs

, , and . CoRR, (2012)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Tiziana Margaria

Tiziana Roncoroni

Tiziana Ugoletti

Tiziana Chiusi

Tiziana Corda

 

Other publications of authors with the same name

Graphs with Dilworth Number Two are Pairwise Compatibility Graphs., and . Electron. Notes Discret. Math., (2013)Labeling of Oriented Planar Graphs., and . CTW, page 93-96. (2011)The L(h, k)-Labelling Problem: A Survey and Annotated Bibliography.. Comput. J., 49 (5): 585-608 (2006)L(2, 1)-labeling of planar graphs., and . DIAL-M, page 28-33. ACM, (2001)Proxy Assignments for Filling Gaps in Wireless Ad-Hoc Lattice Computers., , , and . SIROCCO, volume 4474 of Lecture Notes in Computer Science, page 208-221. Springer, (2007)Maximizing the Number of Broadcast Operations in Static Random Geometric Ad-Hoc Networks., , , and . OPODIS, volume 4878 of Lecture Notes in Computer Science, page 247-259. Springer, (2007)Recognition of Unigraphs through Superposition of Graphs (Extended Abstract)., , and . WALCOM, volume 5431 of Lecture Notes in Computer Science, page 165-176. Springer, (2009)On the Pairwise Compatibility Property of some Superclasses of Threshold Graphs., , and . Discret. Math. Algorithms Appl., (2013)Pairwise Compatibility Graphs: A Survey., and . SIAM Rev., 58 (3): 445-460 (2016)A simple linear time algorithm for the locally connected spanning tree problem on maximal planar chordal graphs., , and . Theor. Comput. Sci., (2019)