According to our database1, Hristo Djidjev
Legend:Book In proceedings Article PhD thesis Other
Accelerator Codesign as Non-Linear Optimization.
Simple, Accurate, Analytical Time Modeling and Optimal Tile Size Selection for GPGPU Stencils.
Proceedings of the 22nd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2017
Learning on Graphs for Predictions of Fracture Propagation, Flow and Transport.
Proceedings of the 2017 IEEE International Parallel and Distributed Processing Symposium Workshops, 2017
Reducing Binary Quadratic Forms for More Scalable Quantum Annealing.
Proceedings of the IEEE International Conference on Rebooting Computing, 2017
Finding Maximum Cliques on a Quantum Annealer.
Proceedings of the Computing Frontiers Conference, 2017
Graph Partitioning Methods for Fast Parallel Quantum Molecular Dynamics.
Proceedings of the 2016 Proceedings of the Seventh SIAM Workshop on Combinatorial Scientific Computing, 2016
Parallel Shortest-Path Queries in Planar Graphs.
Proceedings of the ACM Workshop on High Performance Graph Processing, 2016
Parallel Seed-Based Approach to Multiple Protein Structure Similarities Detection.
Scientific Programming, 2015
All-Pairs Shortest Path algorithms for planar graph for GPU-accelerated clusters.
J. Parallel Distrib. Comput., 2015
Shortest-Path Queries in Planar Graphs on GPU-Accelerated Architectures.
Automatic Classification of Protein Structure Using the Maximum Contact Map Overlap Metric.
Shortest-Path Queries in Planar Graphs on GPU-Accelerated Architectures.
Proceedings of the Large-Scale Scientific Computing - 10th International Conference, 2015
Energy Modeling and Optimization for Tiled Nested-Loop Codes.
Proceedings of the 2015 IEEE International Parallel and Distributed Processing Symposium Workshop, 2015
Efficient Multi-GPU Computation of All-Pairs Shortest Paths.
Proceedings of the 2014 IEEE 28th International Parallel and Distributed Processing Symposium, 2014
Exact Protein Structure Classification Using the Maximum Contact Map Overlap Metric.
Proceedings of the Algorithms for Computational Biology - First International Conference, 2014
Scalable and Accurate Graph Clustering and Community Structure Detection.
IEEE Trans. Parallel Distrib. Syst., 2013
An Approximation Algorithm for Computing Shortest Paths in Weighted 3-d Domains.
Discrete & Computational Geometry, 2013
Generation of SSH Network Traffic Data for IDS Testbeds.
Proceedings of the 6th Workshop on Cyber Security Experimentation and Test, 2013
Parallel Seed-Based Approach to Protein Structure Similarity Detection.
Proceedings of the Parallel Processing and Applied Mathematics, 2013
Planar Crossing Numbers of Graphs of Bounded Genus.
Discrete & Computational Geometry, 2012
Using graph partitioning for efficient network modularity optimization.
Proceedings of the Graph Partitioning and Graph Clustering, 2012
An Approximation Algorithm for Computing Shortest Paths in Weighted 3-d Domains
Approximate Distance Queries for Weighted Polyhedral Surfaces.
Proceedings of the Algorithms - ESA 2011, 2011
Approximation algorithms for computing minimum exposure paths in a sensor field.
A faster algorithm for computing the girth of planar and bounded genus graphs.
ACM Trans. Algorithms, 2010
Algorithms for Approximate Shortest Path Queries on Weighted Polyhedral Surfaces.
Discrete & Computational Geometry, 2010
Efficient Computation of Minimum Exposure Paths in a Sensor Network Field.
Proceedings of the Distributed Computing in Sensor Systems, 2007
A Linear-Time Algorithm for Finding a Maximal Planar Subgraph.
SIAM J. Discrete Math., 2006
Partitioning planar graphs with costs and weights.
ACM Journal of Experimental Algorithmics, 2006
A Scalable Multilevel Algorithm for Graph Clustering and Community Structure Detection.
Proceedings of the Algorithms and Models for the Web-Graph, Fourth International Workshop, 2006
Approximate Shortest Path Queries on Weighted Polyhedral Surfaces.
Proceedings of the Mathematical Foundations of Computer Science 2006, 2006
Planar Crossing Numbers of Genus g Graphs.
Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006
Crossing Numbers and Cutwidths.
J. Graph Algorithms Appl., 2003
Partitioning Planar Graphs with Costs and Weights.
Proceedings of the Algorithm Engineering and Experiments, 4th International Workshop, 2002
An Improved Lower Bound for Crossing Numbers.
Proceedings of the Graph Drawing, 9th International Symposium, 2001
An O(n log n) Algorithm for Finding a Shortest Central Link Segment.
Int. J. Comput. Geometry Appl., 2000
Improved Algorithms for Dynamic Shortest Paths.
Partitioning Planar Graphs with Vertex Costs: Algorithms and Applications.
A Dynamic Algorithm for Maintaining Graph Partitions.
Proceedings of the Algorithm Theory, 2000
Force-Directed Methods for Smoothing Unstructured Triangular and Tetrahedral Meshes.
Proceedings of the 9th International Meshing Roundtable, 2000
Computing the Girth of a Planar Graph.
Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000
Separators in Graphs with Negative and Multiple Vertex Weights.
Maintaining partitions of dynamic planar meshes.
Proceedings of the 10th Canadian Conference on Computational Geometry, 1998
Reduced Constants for Simple Cycle Graph Separation.
Acta Inf., 1997
Weighted Graph Separators and Their Applications.
Proceedings of the Algorithms, 1997
Linear Algorithms for Partitioning Embedded Graphs of Bounded Genus.
SIAM J. Discrete Math., 1996
On-Line Algorithms for Shortest Path Problems on Planar Digraphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1996
On computing Voronoi diagrams for sorted point sets.
Int. J. Comput. Geometry Appl., 1995
Planarization of Graphs Embedded on Surfaces.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1995
A Linear Algorithm for the Maximal Planar Subgraph Problem.
Proceedings of the Algorithms and Data Structures, 4th International Workshop, 1995
On-line and Dynamic Algorithms for Shorted Path Problems.
Fast Algorithms for Maintaining Shortest Paths in Outerplanar and Planar Digraphs.
Proceedings of the Fundamentals of Computation Theory, 10th International Symposium, 1995
On Drawing a Graph Convexly in the Plane.
Proceedings of the Graph Drawing, DIMACS International Workshop, 1994
Edge Separators of Planar and Outerplanar Graphs with Applications.
J. Algorithms, 1993
An O(n log n) Algorithm for Computing the Link Center of a Simple Polygon.
Discrete & Computational Geometry, 1992
On Computing the Voronoi Diagram for Restricted Planar Figures.
Proceedings of the Algorithms and Data Structures, 1991
An Efficient Algorithm for the Genus Problem with Explicit Construction of Forbidden Subgraphs
Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 1991
Computing Shortest Paths and Distances in Planar Graphs.
Proceedings of the Automata, Languages and Programming, 18th International Colloquium, 1991
An O(n log n) Algorithm for Computing a Link Center in a Simple Polygon.
Proceedings of the STACS 89, 1989
Improved Bounds on the Size of Separators of Toroidal Graphs.
Proceedings of the Optimal Algorithms, International Symposium, Varna, Bulgaria, May 29, 1989
Linear Algorithms for Graph Separation Problems.
Proceedings of the SWAT 88, 1988
Edge Separators for Planar Graphs and Their Applications.
Proceedings of the Mathematical Foundations of Computer Science 1988, 1988
VLSI Algorithms for Combinatorial Problems.
IFIP Congress, 1986