MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for authors named "Hristo Djidjev" – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

16 documents found, showing 1 through 10. Next 10 →

ATOM

Force-Directed Methods For Smoothing Unstructured Triangular And Tetrahedral Meshes
by Hristo Djidjev — 2000 — In Proceedings of the 9th International Meshing Roundtable
…FORCE-DIRECTED METHODS FOR SMOOTHING UNSTRUCTURED TRIANGULAR AND TETRAHEDRAL MESHES Hristo N…
Cited by 6 (0 self) – Add To MetaCart

Planar crossing numbers of genus g graphs, in
by Hristo Djidjev — 2006 — Proc. 33rd International Colloquium on Automata, Languages and Programming , Lecture Notes in Computer Science 4051, Part I
…Planar Crossing Numbers of Genus g Graphs Hristo Djidjev1⋆ 2 ⋆⋆ , Imrich Vrt’o 1 Los Alamos…
Cited by 1 (0 self) – Add To MetaCart

Force-Directed Methods for Mesh Improvement
by Hristo Djidjev — 2000
…Force-directed methods for mesh improvement 1 Hristo N. Djidjev University of Warwick We study…
Cited by 2 (1 self) – Add To MetaCart

Computing the Girth of a Planar Graph
by Hristo N. Djidjev — 2000 — In Proc. 27th International Colloquium on Automata, Languages and Programming ICALP 2000, volume 1853 of LNCS
…Computing the Girth of a Planar Graph ? Hristo N. Djidjev 1 Department of Computer Science…
Cited by 3 (0 self) – Add To MetaCart

A linear algorithm for finding a maximal planar subgraph
by Hristo N. Djidjev — 2006 — SIAM J. Disc. Math
…A LINEAR-TIME ALGORITHM FOR FINDING A MAXIMAL PLANAR SUBGRAPH ∗ HRISTO N. DJIDJEV † Los Alamos…
Cited by 1 (0 self) – Add To MetaCart

Partitioning Graphs with Costs and Weights on Vertices: Algorithms and Applications
by Hristo N. Djidjev — of Lecture Notes in Computer Science
…Partitioning Graphs with Costs and Weights on Vertices: Algorithms and Applications Hristo N…
Cited by 4 (0 self) – Add To MetaCart

Efficient Algorithms for Shortest Path Queries in Planar Digraphs
by Hristo N. Djidjev — 1996 — In Proceedings of the 22nd International Workshop on Graph-Theoretic Concepts in Computer Science
…Efficient Algorithms for Shortest Path Queries in Planar Digraphs ? Hristo N. Djidjev Department…
Cited by 7 (0 self) – Add To MetaCart

Crossing Numbers and Cutwidths
by Hristo N. Djidjev, Imrich Vrt'o — 2003 — MR2112230 (2005h:05055), Zbl 1066.05054
…) Crossing Numbers and Cutwidths Hristo N. Djidjev Department of Computer Science Warwick University hristo…
Add To MetaCart

On the Maximum Q-Dependent Set Problem
by Oscar Garrido, Christos Levcopoulos, Andrzej Lingas, Hristo Djidjev
… y Hristo Djidjev z Abstract Let q be a nonnegative integer. For a graph G, the maximum q…
Cited by 1 (0 self) – Add To MetaCart

On Computing Voronoi Diagrams For Sorted Point Sets
by Hristo N. Djidjev, Andrzei Lingas — 1995
…ON COMPUTING VORONOI DIAGRAMS FOR SORTED POINT SETS HRISTO N. DJIDJEV Department of Computer…
Cited by 5 (0 self) – Add To MetaCart

Showing 1 through 10. Next 10 →

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB