Travelled to:1 × Italy
1 × Spain
1 × Switzerland
1 × USA
Collaborated with:I.Vrto ∅ J.H.Reif G.E.Pantziou C.D.Zaroliagis
Talks about:planar (3) graph (3) comput (2) genus (2) forbidden (1) construct (1) algorithm (1) subgraph (1) shortest (1) explicit (1)
Person: Hristo Djidjev
DBLP: Djidjev:Hristo
Contributed to:
200620001991
1991Wrote 4 papers:
- ICALP-v1-2006-DjidjevV #graph
- Planar Crossing Numbers of Genus g Graphs (HD, IV), pp. 419–430.
- ICALP-2000-Djidjev #graph
- Computing the Girth of a Planar Graph (HD), pp. 821–831.
- ICALP-1991-DjidjevPZ #graph
- Computing Shortest Paths and Distances in Planar Graphs (HD, GEP, CDZ), pp. 327–338.
- STOC-1991-DjidjevR #algorithm #performance #problem
- An Efficient Algorithm for the Genus Problem with Explicit Construction of Forbidden Subgraphs (HD, JHR), pp. 337–347.