The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Hristo Djidjev: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Hristo Djidjev, Grammati E. Pantziou, Christos D. Zaroliagis
    On-line and Dynamic Algorithms for Shorted Path Problems. [Citation Graph (1, 0)][DBLP]
    STACS, 1995, pp:193-204 [Conf]
  2. Lyudmil Aleksandrov, Hristo Djidjev, Hua Guo, Anil Maheshwari
    Partitioning Planar Graphs with Costs and Weights. [Citation Graph (0, 0)][DBLP]
    ALENEX, 2002, pp:98-110 [Conf]
  3. Lyudmil Aleksandrov, Hristo Djidjev
    Maintaining partitions of dynamic planar meshes. [Citation Graph (0, 0)][DBLP]
    CCCG, 1998, pp:- [Conf]
  4. Hristo Djidjev
    Weighted Graph Separators and Their Applications. [Citation Graph (0, 0)][DBLP]
    ESA, 1997, pp:130-143 [Conf]
  5. Hristo Djidjev, Grammati E. Pantziou, Christos D. Zaroliagis
    Fast Algorithms for Maintaining Shortest Paths in Outerplanar and Planar Digraphs. [Citation Graph (0, 0)][DBLP]
    FCT, 1995, pp:191-200 [Conf]
  6. Hristo Djidjev
    On Drawing a Graph Convexly in the Plane. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1994, pp:76-83 [Conf]
  7. Hristo Djidjev, Imrich Vrto
    An Improved Lower Bound for Crossing Numbers. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2001, pp:96-101 [Conf]
  8. Hristo Djidjev
    Computing the Girth of a Planar Graph. [Citation Graph (0, 0)][DBLP]
    ICALP, 2000, pp:821-831 [Conf]
  9. Hristo Djidjev, Grammati E. Pantziou, Christos D. Zaroliagis
    Computing Shortest Paths and Distances in Planar Graphs. [Citation Graph (0, 0)][DBLP]
    ICALP, 1991, pp:327-338 [Conf]
  10. Hristo Djidjev, Imrich Vrto
    Planar Crossing Numbers of Genus g Graphs. [Citation Graph (0, 0)][DBLP]
    ICALP (1), 2006, pp:419-430 [Conf]
  11. Hristo Djidjev
    VLSI Algorithms for Combinatorial Problems. [Citation Graph (0, 0)][DBLP]
    IFIP Congress, 1986, pp:649-654 [Conf]
  12. Hristo Djidjev
    Force-Directed Methods for Smoothing Unstructured Triangular and Tetrahedral Meshes. [Citation Graph (0, 0)][DBLP]
    IMR, 2000, pp:395-406 [Conf]
  13. Lyudmil Aleksandrov, Hristo Djidjev, Hua Guo, Anil Maheshwari, Doron Nussbaum, Jörg-Rüdiger Sack
    Approximate Shortest Path Queries on Weighted Polyhedral Surfaces. [Citation Graph (0, 0)][DBLP]
    MFCS, 2006, pp:98-109 [Conf]
  14. Krzysztof Diks, Hristo Djidjev, Ondrej Sýkora, Imrich Vrto
    Edge Separators for Planar Graphs and Their Applications. [Citation Graph (0, 0)][DBLP]
    MFCS, 1988, pp:280-290 [Conf]
  15. Lyudmil Aleksandrov, Hristo Djidjev
    Improved Bounds on the Size of Separators of Toroidal Graphs. [Citation Graph (0, 0)][DBLP]
    Optimal Algorithms, 1989, pp:126-138 [Conf]
  16. Hristo Djidjev, Andrzej Lingas, Jörg-Rüdiger Sack
    An O(n log n) Algorithm for Computing a Link Center in a Simple Polygon. [Citation Graph (0, 0)][DBLP]
    STACS, 1989, pp:96-107 [Conf]
  17. Hristo Djidjev, John H. Reif
    An Efficient Algorithm for the Genus Problem with Explicit Construction of Forbidden Subgraphs [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:337-347 [Conf]
  18. Hristo Djidjev
    Linear Algorithms for Graph Separation Problems. [Citation Graph (0, 0)][DBLP]
    SWAT, 1988, pp:216-222 [Conf]
  19. Lyudmil Aleksandrov, Hristo Djidjev
    A Dynamic Algorithm for Maintaining Graph Partitions. [Citation Graph (0, 0)][DBLP]
    SWAT, 2000, pp:71-82 [Conf]
  20. Hristo Djidjev
    A Linear Algorithm for the Maximal Planar Subgraph Problem. [Citation Graph (0, 0)][DBLP]
    WADS, 1995, pp:369-380 [Conf]
  21. Hristo Djidjev, Andrzej Lingas
    On Computing the Voronoi Diagram for Restricted Planar Figures. [Citation Graph (0, 0)][DBLP]
    WADS, 1991, pp:54-64 [Conf]
  22. Hristo Djidjev
    On-Line Algorithms for Shortest Path Problems on Planar Digraphs. [Citation Graph (0, 0)][DBLP]
    WG, 1996, pp:151-165 [Conf]
  23. Hristo Djidjev, Shankar M. Venkatesan
    Planarization of Graphs Embedded on Surfaces. [Citation Graph (0, 0)][DBLP]
    WG, 1995, pp:62-72 [Conf]
  24. Hristo Djidjev, Shankar M. Venkatesan
    Reduced Constants for Simple Cycle Graph Separation. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1997, v:34, n:3, pp:231-243 [Journal]
  25. Hristo Djidjev
    Partitioning Planar Graphs with Vertex Costs: Algorithms and Applications. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2000, v:28, n:1, pp:51-75 [Journal]
  26. Hristo Djidjev, John R. Gilbert
    Separators in Graphs with Negative and Multiple Vertex Weights. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1999, v:23, n:1, pp:57-71 [Journal]
  27. Hristo Djidjev, Grammati E. Pantziou, Christos D. Zaroliagis
    Improved Algorithms for Dynamic Shortest Paths. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2000, v:28, n:4, pp:367-389 [Journal]
  28. Hristo Djidjev, Andrzej Lingas, Jörg-Rüdiger Sack
    An O(n log n) Algorithm for Computing the Link Center of a Simple Polygon. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1992, v:8, n:, pp:131-152 [Journal]
  29. Lyudmil Aleksandrov, Hristo Djidjev, Jörg-Rüdiger Sack
    An O(n log n) Algorithm for Finding a Shortest Central Link Segment. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2000, v:10, n:2, pp:157-188 [Journal]
  30. Hristo Djidjev, Andrzej Lingas
    On computing Voronoi diagrams for sorted point sets. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1995, v:5, n:3, pp:327-337 [Journal]
  31. Krzysztof Diks, Hristo Djidjev, Ondrej Sýkora, Imrich Vrto
    Edge Separators of Planar and Outerplanar Graphs with Applications. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1993, v:14, n:2, pp:258-279 [Journal]
  32. Lyudmil Aleksandrov, Hristo Djidjev, Hua Guo, Anil Maheshwari
    Partitioning planar graphs with costs and weights. [Citation Graph (0, 0)][DBLP]
    ACM Journal of Experimental Algorithms, 2006, v:11, n:, pp:- [Journal]
  33. Hristo Djidjev, Imrich Vrto
    Crossing Numbers and Cutwidths. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 2003, v:7, n:3, pp:245-251 [Journal]
  34. Lyudmil Aleksandrov, Hristo Djidjev
    Linear Algorithms for Partitioning Embedded Graphs of BoundedGenus. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1996, v:9, n:1, pp:129-150 [Journal]
  35. Hristo Djidjev
    Efficient Computation of Minimum Exposure Paths in a Sensor Network Field. [Citation Graph (0, 0)][DBLP]
    DCOSS, 2007, pp:295-308 [Conf]

  36. A Scalable Multilevel Algorithm for Graph Clustering and Community Structure Detection. [Citation Graph (, )][DBLP]


Search in 0.007secs, Finished in 0.008secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002