The following pages link to Tiziana Calamoneri (Q287007):
Displaying 50 items.
- (Q197723) (redirect page) (← links)
- A new 3D representation of trivalent Cayley networks (Q287008) (← links)
- 3D straight-line grid drawing of 4-colorable graphs (Q287145) (← links)
- Optimal \(L(\delta_1,\delta_2,1)\)-labeling of eight-regular grids (Q396591) (← links)
- Corrigendum to: ``On pairwise compatibility graphs having Dilworth number two'' (Q497693) (← links)
- \(\lambda\)-coloring matrogenic graphs (Q860405) (← links)
- Minimum-energy broadcast and disk cover in grid wireless networks (Q930903) (← links)
- \(L(h,1,1)\)-labeling of outerplanar graphs (Q1014311) (← links)
- Antibandwidth of complete \(k\)-ary trees (Q1045176) (← links)
- A tight layout of the butterfly network (Q1265167) (← links)
- Orthogonally drawing cubic graphs in parallel (Q1290255) (← links)
- An optimal layout of multigrid networks (Q1607012) (← links)
- Graphs that are not pairwise compatible: a new proof technique (extended abstract) (Q1670981) (← links)
- On dynamic threshold graphs and related classes (Q1705777) (← links)
- A simple linear time algorithm for the locally connected spanning tree problem on maximal planar chordal graphs (Q1731506) (← links)
- Interval routing \(\and\) layered cross product: compact routing schemes for butterflies, meshes of trees, fat trees and Beneš networks (Q1877617) (← links)
- Efficient algorithms for checking the equivalence of multistage interconnection networks (Q1878704) (← links)
- \(L(h,1)\)-labeling subclasses of planar graphs (Q1881282) (← links)
- New results on edge-bandwidth (Q1885045) (← links)
- Exploring pairwise compatibility graphs (Q1935784) (← links)
- Some problems related to the space of optimal tree reconciliations (invited talk) (Q2154074) (← links)
- On pairwise compatibility graphs having Dilworth number \(k\) (Q2253200) (← links)
- Some classes of graphs that are not PCGs (Q2272401) (← links)
- The \(L(2,1)\)-labeling of unigraphs (Q2275923) (← links)
- Visualizing co-phylogenetic reconciliations (Q2310765) (← links)
- Co-divergence and tree topology (Q2315220) (← links)
- \(L(2,1)\)-labeling of oriented planar graphs (Q2446298) (← links)
- On pairwise compatibility graphs having Dilworth number two (Q2637346) (← links)
- (Q2725986) (← links)
- Fully Dynamically Maintaining Minimal Integral Separator for Threshold and Difference Graphs (Q2803835) (← links)
- (Q2816017) (← links)
- On Maximal Chain Subgraphs and Covers of Bipartite Graphs (Q2819498) (← links)
- ON THE PAIRWISE COMPATIBILITY PROPERTY OF SOME SUPERCLASSES OF THRESHOLD GRAPHS (Q2846475) (← links)
- Recognition of Unigraphs through Superposition of Graphs (Q2865028) (← links)
- On Relaxing the Constraints in Pairwise Compatibility Graphs (Q2889906) (← links)
- Optimal L(j,k)-Edge-Labeling of Regular Grids (Q2947806) (← links)
- L(2,1)-Labeling of Unigraphs (Q2999333) (← links)
- (Q3044330) (← links)
- Pairwise Compatibility Graphs: A Survey (Q3186100) (← links)
- Nearly optimal three dimensional layout of hypercube networks (Q3376655) (← links)
- Antibandwidth of Complete k-Ary Trees (Q3439448) (← links)
- (Q3439685) (← links)
- Recognition of Unigraphs through Superposition of Graphs (Extended Abstract) (Q3605495) (← links)
- On the L(h,k)-Labeling of Co-comparability Graphs (Q3611902) (← links)
- Minimum Energy Broadcast and Disk Cover in Grid Wireless Networks (Q3613654) (← links)
- L(h,1,1)-Labeling of Outerplanar Graphs (Q3613657) (← links)
- (Q4233833) (← links)
- Experimental Comparison of Graph Drawing Algorithms for Cubic Graphs (Q4265499) (← links)
- On max cut in cubic graphs (Q4409003) (← links)
- (Q4414573) (← links)
