Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Djidjev, Hristo"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Approximate distance queries for weighted polyhedral surfaces
Hristo N. Djidjev
,
Christian Sommer
Lecture Notes in Computer Science
6942
, 2011, pp. 579-590
Approximate shortest path queries on weighted polyhedral surfaces
Lyudmil Aleksandrov
,
Hristo N. Djidjev
,
Hua Guo
,
Anil Maheshwari
,
Doron Nussbaum
,
Jörg-Rüdiger Sack
Lecture Notes in Computer Science
4162
, 2006, pp. 98-109
Planar crossing numbers of genus
g
graphs
Hristo Djidjev
,
Imrich Vrt'o
Lecture Notes in Computer Science
4051
, 2006, pp. 419-430
A linear-time algorithm for finding a maximal planar subgraph
Hristo N. Djidjev
SIAM Journal on Discrete Mathematics
20
(2), 2006, pp. 444-462
Partitioning planar graphs with costs and weights
Lyudmil Aleksandrov
,
Hristo Djidjev
,
Hua Guo
,
Anil Maheshwari
Lecture Notes in Computer Science
2409
, 2002, pp. 98-110
An improved lower bound for crossing numbers
Hristo Djidjev
,
Imrich Vrt'o
Lecture Notes in Computer Science
2265
, 2002, pp. 96-101
A dynamic algorithm for maintaining graph partitions
Lyudmil G. Aleksandrov
,
Hristo N. Djidjev
Lecture Notes in Computer Science
1851
, 2000, pp. 71-82
Computing the girth of a planar graph
Hristo N. Djidjev
Lecture Notes in Computer Science
1853
, 2000, pp. 821-831
Reduced constants for simple cycle graph separation
Hristo N. Djidjev
,
Shankar M. Venkatesan
Acta Informatica
34
(3), 1997, pp. 231-243
Efficient algorithms for shortest path queries in planar digraphs
Hristo N. Djidjev
Lecture Notes in Computer Science
1197
, 1997, pp. 151-165
Weighted graph separators and their applications
Hristo N. Djidjev
Lecture Notes in Computer Science
1284
, 1997, pp. 130-143
On-line and dynamic algorithms for shortest path problems
Hristo N. Djidjev
,
Grammati E. Pantziou
,
Christos D. Zaroliagis
Lecture Notes in Computer Science
900
, 1995, pp. 193-204
Fast algorithms for maintaining shortest paths in outerplanar and planar digraphs
Hristo N. Djidjev
,
Grammati E. Pantziou
,
Christos D. Zaroliagis
Lecture Notes in Computer Science
965
, 1995, pp. 191-200
Planarization of graphs embedded on surfaces
Hristo N. Djidjev
,
Shankar M. Venkatesan
Lecture Notes in Computer Science
1017
, 1995, pp. 62-72
On drawing a graph convexly in the plane
Hristo N. Djidjev
Proceedings of the DIMACS International Workshop, GD'94. Graph Drawing (Princeton, New Jersey, USA, October 10-12, 1994)
LNCS 894
, 1995, pp. 76-83
A linear algorithm for the maximal planar subgraph problem
Hristo N. Djidjev
Lecture Notes in Computer Science
955
, 1995, pp. 369-380
Edge separators of planar and outerplanar graphs with applications
Krzystof Diks
,
Hristo N. Djidjev
,
Ondrej Sykora
,
Imrich Vrto
Journal of Algorithms
14
(2), 1993, pp. 258-279
On computing the Voronoi diagram for restricted planar figures
Hristo Djidjev
,
Andrzej Lingas
Lecture Notes in Computer Science
519
, 1991, pp. 54-64
An efficient algorithm for the genus problem with explicit construction of forbidden subgraphs
Hristo Djidjev
,
John Reif
Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, STOC'91 (New Orleans, Louisiana, May 6-8, 1991)
, 1991, pp. 337-347
Separation of graphs of bounded genus
Ljudmil G. Aleksandrov
,
Hristo N. Djidjev
Technical Report (SCS-TR-175), 1990, May
Edge separators of planar and outerplanar graphs with applications
Krzystof Diks
,
Hristo N. Djidjev
,
Ondrej Sýkora
,
Imrich Vrt̑o
Technical Report (SCS-TR-176), 1990, May
An
O(n \log n)
algorithm for computing a link center in a simple polygon
Hristo N. Djidjev
,
Andrzej Lingas
,
Jörg-Rüdiger Sack
Lecture Notes in Computer Science
349
, 1989, pp. 96-107
On the problem of partitioning planar graphs
Hristo Nicolov Djidjev
SIAM Journal on Algebraic Discrete Methods
3
, 1982, pp. 229-240