# Items where Subject is "05-XX Combinatorics > 05Cxx Graph theory > 05C12 Distance in graphs"

Up a level |

- MSC Classification Numbers (9)
- 05-XX Combinatorics (9)
- 05Cxx Graph theory (9)
**05C12 Distance in graphs**(9)

- 05Cxx Graph theory (9)

- 05-XX Combinatorics (9)

**9**.

## F

Fekete, Sandor P. and Hochstättler, Winfried and Kromberg, Stephan and Moll, Christoph
(1999)
*The Complexity of an Inverse Shortest Path Problem.*
**Published In:**
Contemporary trends in discrete mathematics : from DIMACS and DIMATIA to the future ; DIMATIA-DIMACS conference, May 19 - 25, 1997, Štiřín Castle, Czech Republic ; [contains papers from a DIMATIA/DIMACS Conference on the Future of Discrete Mathematics], DIMACS series in discrete mathematics and theoretical computer science. 49 American Mathematical Society (AMS) 1999, pp. 113-127.

Fekete, Sandor P. and Khuller, Samir and Klemmstein, Monika and Raghavachari, Balaji and Young, Neal
(1997)
*A network-flow technique for finding low-weight bounded-degree spanning trees.*
**Published in: **
Journal of Algorithms Vol. 24 (2).
pp. 310-324.

Fekete, Sandor P. and Khuller, Samir and Klemmstein, Monika and Raghavachari, Balaji and Young, Neal
(1996)
*A network-flow technique for finding low-weight bounded-degree spanning trees.*
**Published In:**
Integer programming and combinatorial optimization : 5th International IPCO Conference, Vancouver, British Columbia, Canada, June 3 - 5, 1996 ; proceedings, Lecture notes in computer science. 1084 Springer 1996, pp. 105-117.

Fekete, Sandor P. and Klemmstein, Monika
(1995)
*Worst-case ratios for degree-constrained trees.*
**Published In:**
Proceedings of the 4th Biannual Twente Workshop on Graph Theory and Discrete Optimization 1995, pp. 103-106.

Fekete, Sandor P. and Kremer, Jana
(2001)
*Tree Spanners in Planar Graphs.*
**Published in: **
Discrete Applied Mathematics Vol. 108 (1-2).
pp. 85-103.

Fekete, Sandor P. and Kremer, Jana
(1998)
*Tree Spanners in Planar Graphs.*
**Published In:**
Graph theoretic concepts in computer science : 24th international workshop ; proceedings / WG '98, Smolenice Castle, Slovak Republic, June 18 - 20, 1998 , Lecture notes in computer science. 1517 Springer 1998, pp. 9-30.

## L

Lätsch, Martin
(2008)
*Schranken für den minimalen orientierten Durchmesser.*
["eprint_fieldopt_thesis_type_phd" not defined] thesis.

Lätsch, Martin and Peis, Britta
(2008)
*On a relation between the domination number and a strongly connected bidirection of an undirected graph.*
**Published in: **
Discrete Applied Mathematics Vol. 156 (17).
pp. 3194-3202.

Lätsch, Martin and Schrader, Rainer
(2010)
*Distance-hereditary digraphs.*
**Published in: **
Journal of Disrete Algorithms Vol. 8 (2).
pp. 231-240.