The following publications are possibly variants of this publication:
- Additive Spanners for Circle Graphs and Polygonal GraphsFeodor F. Dragan, Derek G. Corneil, Ekkehard Köhler, Yang Xiang. criwg 2008: 110-121 [doi]
- Collective Additive Tree Spanners of Homogeneously Orderable GraphsFeodor F. Dragan, Chenyu Yan, Yang Xiang. latin 2008: 555-567 [doi]
- Tree spanners on chordal graphs: complexity and algorithmsAndreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Van Bang Le. TCS, 310(1-3):329-354, 2004. [doi]
- Collective additive tree spanners for circle graphs and polygonal graphsFeodor F. Dragan, Derek G. Corneil, Ekkehard Köhler, Yang Xiang. DAM, 160(12):1717-1729, 2012. [doi]
- Collective Additive Tree Spanners of Bounded Tree-Breadth Graphs with Generalizations and ConsequencesFeodor F. Dragan, Muad Abu-Ata. sofsem 2013: 194-206 [doi]
- Collective additive tree spanners of bounded tree-breadth graphs with generalizations and consequencesFeodor F. Dragan, Muad Abu-Ata. TCS, 547:1-17, 2014. [doi]
- Additive sparse spanners for graphs with bounded length of largest induced cycleVictor Chepoi, Feodor F. Dragan, Chenyu Yan. TCS, 347(1-2):54-75, 2005. [doi]
- Additive Spanners and Distance and Routing Labeling Schemes for Hyperbolic GraphsVictor Chepoi, Feodor F. Dragan, Bertrand Estellon, Michel Habib, Yann Vaxès, Yang Xiang. algorithmica, 62(3-4):713-732, 2012. [doi]