The following pages link to Hristo N. Djidjev (Q452000):
Displayed 50 items.
- Planar crossing numbers of graphs of bounded genus (Q452001) (← links)
- Algorithms for approximate shortest path queries on weighted polyhedral surfaces (Q603866) (← links)
- Weighted graph separators and their applications (Q826080) (← links)
- An \(O(n\log n)\) algorithm for computing the link center of a simple polygon (Q1193703) (← links)
- (Q1578390) (redirect page) (← links)
- Partitioning planar graphs with vertex costs: Algorithms and applications (Q1578391) (← links)
- Improved algorithms for dynamic shortest paths (Q1586136) (← links)
- (Q1736717) (redirect page) (← links)
- Automatic classification of protein structure using the maximum contact map overlap metric (Q1736719) (← links)
- Global optimization for scaffolding and completing genome assemblies (Q1742221) (← links)
- Reduced constants for simple cycle graph separation (Q1920221) (← links)
- Embedding equality constraints of optimization problems into a quantum annealer (Q2003330) (← links)
- Boolean hierarchical Tucker networks on quantum annealers (Q2128464) (← links)
- An approximation algorithm for computing shortest paths in weighted 3-d domains (Q2391841) (← links)
- (Q2721969) (← links)
- (Q2754199) (← links)
- (Q3043708) (← links)
- Approximate Distance Queries for Weighted Polyhedral Surfaces (Q3092262) (← links)
- A faster algorithm for computing the girth of planar and bounded genus graphs (Q3188984) (← links)
- Shortest-Path Queries in Planar Graphs on GPU-Accelerated Architectures (Q3304759) (← links)
- (Q3344221) (← links)
- A Linear-Time Algorithm for Finding a Maximal Planar Subgraph (Q3440266) (← links)
- (Q3484374) (← links)
- Partitioning planar graphs with costs and weights (Q3507765) (← links)
- A Scalable Multilevel Algorithm for Graph Clustering and Community Structure Detection (Q3520035) (← links)
- Planar Crossing Numbers of Genus g Graphs (Q3613778) (← links)
- (Q3663340) (← links)
- (Q3718169) (← links)
- (Q3723044) (← links)
- (Q3738573) (← links)
- (Q3782800) (← links)
- (Q3796779) (← links)
- (Q3798265) (← links)
- (Q3819101) (← links)
- (Q3915030) (← links)
- (Q3936211) (← links)
- On the Problem of Partitioning Planar Graphs (Q3968972) (← links)
- Incomplete block-factorization preconditioners for solving three-dimensional elliptic difference equations on systolic processors<sup>∗</sup><sup>∗∗</sup> (Q4021075) (← links)
- Edge Separators of Planar and Outerplanar Graphs With Applications (Q4033768) (← links)
- (Q4036575) (← links)
- (Q4037407) (← links)
- (Q4206744) (← links)
- (Q4207594) (← links)
- On-line and dynamic algorithms for shortest path problems (Q4596621) (← links)
- Crossing Numbers and Cutwidths (Q4679068) (← links)
- An O(n <font>log</font> n) ALGORITHM FOR FINDING A SHORTEST CENTRAL LINK SEGMENT (Q4682194) (← links)
- (Q4707791) (← links)
- ON COMPUTING VORONOI DIAGRAMS FOR SORTED POINT SETS (Q4848836) (← links)
- Linear Algorithms for Partitioning Embedded Graphs of Bounded Genus (Q4875441) (← links)
- (Q4945513) (← links)