Hristo N. Djidjev

Quantum Inf. Process., May, 2023

Posiform planting: generating QUBO instances for benchmarking.

[BibT_eX]

[DOI]

Frontiers Comput. Sci., 2023

Initial state encoding via reverse quantum annealing and h-gain features.

[BibT_eX]

[DOI]

CoRR, 2023

Quantum annealing with inequality constraints: the set cover problem.

[BibT_eX]

[DOI]

CoRR, 2023

Logical qubit implementation for quantum annealing: augmented Lagrangian approach.

[BibT_eX]

[DOI]

CoRR, 2023

2022

Inferring the Dynamics of the State Evolution During Quantum Annealing.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 2022

Improved Protein Decoy Selection via Non-Negative Matrix Factorization.

[BibT_eX]

[DOI]

IEEE ACM Trans. Comput. Biol. Bioinform., 2022

Noise Dynamics of Quantum Annealers: Estimating the Effective Noise Using Idle Qubits.

[BibT_eX]

[DOI]

CoRR, 2022

Solving Larger Optimization Problems Using Parallel Quantum Annealing.

[BibT_eX]

[DOI]

CoRR, 2022

Distributed non-negative RESCAL with Automatic Model Selection for Exascale Data.

[BibT_eX]

[DOI]

CoRR, 2022

Distributed Out-of-Memory SVD on CPU/GPU Architectures.

[BibT_eX]

[DOI]

Proceedings of the IEEE High Performance Extreme Computing Conference, 2022

2021

Decomposition Algorithms for Solving NP-hard Problems on a Quantum Annealer.

[BibT_eX]

[DOI]

J. Signal Process. Syst., 2021

Parallel Quantum Annealing.

[BibT_eX]

[DOI]

CoRR, 2021

Quantum Annealing Algorithms for Boolean Tensor Networks.

[BibT_eX]

[DOI]

CoRR, 2021

Using Machine Learning for Quantum Annealing Accuracy Prediction.

[BibT_eX]

[DOI]

Algorithms, 2021

Finding the Number of Latent Topics With Semantic Non-Negative Matrix Factorization.

[BibT_eX]

[DOI]

IEEE Access, 2021

Boolean Hierarchical Tucker Networks on Quantum Annealers.

[BibT_eX]

[DOI]

Proceedings of the Large-Scale Scientific Computing - 13th International Conference, 2021

Reducing quantum annealing biases for solving the graph partitioning problem.

[BibT_eX]

[DOI]

Proceedings of the CF '21: Computing Frontiers Conference, 2021

2020

Distributed non-negative matrix factorization with determination of the number of latent features.

[BibT_eX]

[DOI]

J. Supercomput., 2020

Optimization Approach to Accelerator Codesign.

[BibT_eX]

[DOI]

IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2020

Decoy selection for protein structure prediction via extreme gradient boosting and ranking.

[BibT_eX]

[DOI]

BMC Bioinform., 2020

An Out of Memory tSVD for Big-Data Factorization.

[BibT_eX]

[DOI]

Hector Carrillo-Cabada

IEEE Access, 2020

Embedding Algorithms for Quantum Annealers with Chimera and Pegasus Connection Topologies.

[BibT_eX]

[DOI]

Proceedings of the High Performance Computing - 35th International Conference, 2020

Advanced anneal paths for improved quantum annealing.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Quantum Computing and Engineering, 2020

Optimizing Embedding-Related Quantum Annealing Parameters for Reducing Hardware Bias.

[BibT_eX]

[DOI]

Proceedings of the Parallel Architectures, Algorithms and Programming, 2020

Advanced unembedding techniques for quantum annealers.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Rebooting Computing, 2020

Tucker-1 Boolean Tensor Factorization with Quantum Annealers.

[BibT_eX]

[DOI]

Daniel O'Malley

Boian S. Alexandrov

Proceedings of the International Conference on Rebooting Computing, 2020

Semantic Nonnegative Matrix Factorization with Automatic Model Determination for Topic Modeling.

[BibT_eX]

[DOI]

Proceedings of the 19th IEEE International Conference on Machine Learning and Applications, 2020

Distributed Non-Negative Tensor Train Decomposition.

[BibT_eX]

[DOI]

Proceedings of the 2020 IEEE High Performance Extreme Computing Conference, 2020

Automaton-based methodology for implementing optimization constraints for quantum annealing.

[BibT_eX]

[DOI]

Proceedings of the 17th ACM International Conference on Computing Frontiers, 2020

Decoy Selection in Protein Structure Determination via Symmetric Non-negative Matrix Factorization.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine, 2020

2019

Finding Maximum Cliques on the D-Wave Quantum Annealer.

[BibT_eX]

[DOI]

J. Signal Process. Syst., 2019

Complete assembly of circular and chloroplast genomes based on global optimization.

[BibT_eX]

[DOI]

J. Bioinform. Comput. Biol., 2019

Embedding Equality Constraints of Optimization Problems into a Quantum Annealer.

[BibT_eX]

[DOI]

Algorithms, 2019

Using Graph Partitioning for Scalable Distributed Quantum Molecular Dynamics.

[BibT_eX]

[DOI]

Susan M. Mniszewski

Christian F. A. Negre

Anders M. N. Niklasson

Algorithms, 2019

Peering Into the Anneal Process of a Quantum Annealer.

[BibT_eX]

[DOI]

Proceedings of the 20th International Conference on Parallel and Distributed Computing, 2019

Constraint Embedding for Solving Optimization Problems on Quantum Annealers.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Parallel and Distributed Processing Symposium Workshops, 2019

Optimizing the Spin Reversal Transform on the D-Wave 2000Q.

[BibT_eX]

[DOI]

Proceedings of the 2019 IEEE International Conference on Rebooting Computing, 2019

Solving large minimum vertex cover problems on a quantum annealer.

[BibT_eX]

[DOI]

Proceedings of the 16th ACM International Conference on Computing Frontiers, 2019

Non-Negative Matrix Factorization for Selection of Near-Native Protein Tertiary Structures.

[BibT_eX]

[DOI]

Proceedings of the 2019 IEEE International Conference on Bioinformatics and Biomedicine, 2019

2018

Global Optimization for Scaffolding and Completing Genome Assemblies.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2018

Quantum Algorithm Implementations for Beginners.

[BibT_eX]

[DOI]

CoRR, 2018

Analytical Cost Metrics : Days of Future Past.

[BibT_eX]

[DOI]

Nirmal Prajapati

Sanjay V. Rajopadhye

CoRR, 2018

Simple Constraint Embedding for Quantum Annealers.

[BibT_eX]

[DOI]

Proceedings of the 2018 IEEE International Conference on Rebooting Computing, 2018

Improved Decoy Selection via Machine Learning and Ranking.

[BibT_eX]

[DOI]

Proceedings of the 8th IEEE International Conference on Computational Advances in Bio and Medical Sciences, 2018

2017

Accelerator Codesign as Non-Linear Optimization.

[BibT_eX]

[DOI]

CoRR, 2017

Simple, Accurate, Analytical Time Modeling and Optimal Tile Size Selection for GPGPU Stencils.

[BibT_eX]

[DOI]

Proceedings of the 22nd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2017

Embedding Inequality Constraints for Quantum Annealing Optimization.

[BibT_eX]

[DOI]

Scott Pakin

Proceedings of the Quantum Technology and Optimization Problems, 2017

Solving Large Maximum Clique Problems on a Quantum Annealer.

[BibT_eX]

[DOI]

Proceedings of the Quantum Technology and Optimization Problems, 2017

Learning on Graphs for Predictions of Fracture Propagation, Flow and Transport.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE International Parallel and Distributed Processing Symposium Workshops, 2017

Reducing Binary Quadratic Forms for More Scalable Quantum Annealing.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Rebooting Computing, 2017

Finding Maximum Cliques on a Quantum Annealer.

[BibT_eX]

[DOI]

Proceedings of the Computing Frontiers Conference, 2017

2016

Graph Partitioning Methods for Fast Parallel Quantum Molecular Dynamics.

[BibT_eX]

[DOI]

Susan M. Mniszewski

Christian F. A. Negre

Anders M. N. Niklasson

Vivek B. Sardeshmukh

Proceedings of the 2016 Proceedings of the Seventh SIAM Workshop on Combinatorial Scientific Computing, 2016

Parallel Shortest-Path Queries in Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the ACM Workshop on High Performance Graph Processing, 2016

2015

Parallel Seed-Based Approach to Multiple Protein Structure Similarities Detection.

[BibT_eX]

[DOI]

Dominique Lavenier

Sci. Program., 2015

All-Pairs Shortest Path algorithms for planar graph for GPU-accelerated clusters.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2015

Automatic Classification of Protein Structure Using the Maximum Contact Map Overlap Metric.

[BibT_eX]

[DOI]

Gunnar W. Klau

Inken Wohlers

Algorithms, 2015

Shortest-Path Queries in Planar Graphs on GPU-Accelerated Architectures.

[BibT_eX]

[DOI]

Proceedings of the Large-Scale Scientific Computing - 10th International Conference, 2015

Energy Modeling and Optimization for Tiled Nested-Loop Codes.

[BibT_eX]

[DOI]

Proceedings of the 2015 IEEE International Parallel and Distributed Processing Symposium Workshop, 2015

2014

Efficient Multi-GPU Computation of All-Pairs Shortest Paths.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE 28th International Parallel and Distributed Processing Symposium, 2014

Exact Protein Structure Classification Using the Maximum Contact Map Overlap Metric.

[BibT_eX]

[DOI]

Inken Wohlers

Gunnar W. Klau

Proceedings of the Algorithms for Computational Biology - First International Conference, 2014

2013

Scalable and Accurate Graph Clustering and Community Structure Detection.

[BibT_eX]

[DOI]

Melih Onus

IEEE Trans. Parallel Distributed Syst., 2013

An Approximation Algorithm for Computing Shortest Paths in Weighted 3-d Domains.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2013

Generation of SSH Network Traffic Data for IDS Testbeds.

[BibT_eX]

[DOI]

Proceedings of the 6th Workshop on Cyber Security Experimentation and Test, 2013

Parallel Seed-Based Approach to Protein Structure Similarity Detection.

[BibT_eX]

[DOI]

Dominique Lavenier

Proceedings of the Parallel Processing and Applied Mathematics, 2013

2012

Planar Crossing Numbers of Graphs of Bounded Genus.

[BibT_eX]

[DOI]

Imrich Vrt'o

Discret. Comput. Geom., 2012

Using graph partitioning for efficient network modularity optimization.

[BibT_eX]

[DOI]

Melih Onus

Proceedings of the Graph Partitioning and Graph Clustering, 2012

2011

Approximate Distance Queries for Weighted Polyhedral Surfaces.

[BibT_eX]

[DOI]

Christian Sommer

Proceedings of the Algorithms - ESA 2011, 2011

2010

Approximation algorithms for computing minimum exposure paths in a sensor field.

[BibT_eX]

[DOI]

ACM Trans. Sens. Networks, 2010

A faster algorithm for computing the girth of planar and bounded genus graphs.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2010

Algorithms for Approximate Shortest Path Queries on Weighted Polyhedral Surfaces.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2010

2007

Efficient Computation of Minimum Exposure Paths in a Sensor Network Field.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing in Sensor Systems, 2007

2006

A Linear-Time Algorithm for Finding a Maximal Planar Subgraph.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2006

Partitioning planar graphs with costs and weights.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2006

A Scalable Multilevel Algorithm for Graph Clustering and Community Structure Detection.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Models for the Web-Graph, Fourth International Workshop, 2006

Approximate Shortest Path Queries on Weighted Polyhedral Surfaces.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2006, 2006

Planar Crossing Numbers of Genus <i>g</i> Graphs.

[BibT_eX]

[DOI]

Imrich Vrto

Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

2003

Crossing Numbers and Cutwidths.

[BibT_eX]

[DOI]

Imrich Vrto

J. Graph Algorithms Appl., 2003

2001

An Improved Lower Bound for Crossing Numbers.

[BibT_eX]

[DOI]

Imrich Vrto

Proceedings of the Graph Drawing, 9th International Symposium, 2001

2000

An O(n log n) Algorithm for Finding a Shortest Central Link Segment.

[BibT_eX]

[DOI]

Jörg-Rüdiger Sack

Int. J. Comput. Geom. Appl., 2000

Improved Algorithms for Dynamic Shortest Paths.

[BibT_eX]

[DOI]

Algorithmica, 2000

Partitioning Planar Graphs with Vertex Costs: Algorithms and Applications.

[BibT_eX]

[DOI]

Algorithmica, 2000

A Dynamic Algorithm for Maintaining Graph Partitions.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2000

Force-Directed Methods for Smoothing Unstructured Triangular and Tetrahedral Meshes.

[BibT_eX]

[DOI]

Proceedings of the 9th International Meshing Roundtable, 2000

Computing the Girth of a Planar Graph.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000

Link Distance Problems.

[BibT_eX]

[DOI]

Anil Maheshwari

Jörg-Rüdiger Sack

Proceedings of the Handbook of Computational Geometry, 2000

1999

Separators in Graphs with Negative and Multiple Vertex Weights.

[BibT_eX]

[DOI]

John R. Gilbert

Algorithmica, 1999

1998

Maintaining partitions of dynamic planar meshes.

[BibT_eX]

[DOI]

Proceedings of the 10th Canadian Conference on Computational Geometry, 1998

1997

Reduced Constants for Simple Cycle Graph Separation.

[BibT_eX]

[DOI]

Shankar M. Venkatesan

Acta Informatica, 1997

Weighted Graph Separators and Their Applications.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1997

1996

Linear Algorithms for Partitioning Embedded Graphs of Bounded Genus.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1996

On-Line Algorithms for Shortest Path Problems on Planar Digraphs.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1996

1995

On computing Voronoi diagrams for sorted point sets.

[BibT_eX]

[DOI]

Andrzej Lingas

Int. J. Comput. Geom. Appl., 1995

Planarization of Graphs Embedded on Surfaces.

[BibT_eX]

[DOI]

Shankar M. Venkatesan

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1995

A Linear Algorithm for the Maximal Planar Subgraph Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 4th International Workshop, 1995

On-line and Dynamic Algorithms for Shorted Path Problems.

[BibT_eX]

[DOI]

Proceedings of the STACS 95, 1995

Fast Algorithms for Maintaining Shortest Paths in Outerplanar and Planar Digraphs.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 10th International Symposium, 1995

1994

On Drawing a Graph Convexly in the Plane.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, DIMACS International Workshop, 1994

1993

Edge Separators of Planar and Outerplanar Graphs with Applications.

[BibT_eX]

[DOI]

J. Algorithms, 1993

1992

An O(n log n) Algorithm for Computing the Link Center of a Simple Polygon.

[BibT_eX]

[DOI]

Andrzej Lingas

Jörg-Rüdiger Sack

Discret. Comput. Geom., 1992

1991

On Computing the Voronoi Diagram for Restricted Planar Figures.

[BibT_eX]

[DOI]

Andrzej Lingas

Proceedings of the Algorithms and Data Structures, 1991

An Efficient Algorithm for the Genus Problem with Explicit Construction of Forbidden Subgraphs

[BibT_eX]

[DOI]

John H. Reif

Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 1991

Computing Shortest Paths and Distances in Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 18th International Colloquium, 1991

1989

Improved Bounds on the Size of Separators of Toroidal Graphs.

[BibT_eX]

[DOI]

Proceedings of the Optimal Algorithms, International Symposium, Varna, Bulgaria, May 29, 1989

1988

Linear Algorithms for Graph Separation Problems.

[BibT_eX]

[DOI]

Proceedings of the SWAT 88, 1988

Edge Separators for Planar Graphs and Their Applications.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1988, 1988

1986

VLSI Algorithms for Combinatorial Problems.

[BibT_eX]