| Publication | Date of Publication | Type |
|---|
| Efficient algorithms for shortest path queries in planar digraphs | 2024-06-05 | Paper |
| Graph partitioning methods for fast parallel quantum molecular dynamics | 2024-05-14 | Paper |
| Planarization of graphs embedded on surfaces | 2024-02-28 | Paper |
| Posiform Planting: Generating QUBO Instances for Benchmarking | 2023-08-10 | Paper |
| Solving larger maximum clique problems using parallel quantum annealing | 2023-06-13 | Paper |
| A linear algorithm for the maximal planar subgraph problem | 2022-12-16 | Paper |
| Fast algorithms for maintaining shortest paths in outerplanar and planar digraphs | 2022-12-09 | Paper |
| Noise Dynamics of Quantum Annealers: Estimating the Effective Noise Using Idle Qubits | 2022-09-12 | Paper |
| An O(n log n) algorithm for computing a link center in a simple polygon | 2022-08-16 | Paper |
| Boolean hierarchical Tucker networks on quantum annealers | 2022-04-22 | Paper |
| Weighted graph separators and their applications | 2021-12-20 | Paper |
| Shortest-Path Queries in Planar Graphs on GPU-Accelerated Architectures | 2020-08-03 | Paper |
| Embedding equality constraints of optimization problems into a quantum annealer | 2019-07-08 | Paper |
| Automatic classification of protein structure using the maximum contact map overlap metric | 2019-03-26 | Paper |
| Global optimization for scaffolding and completing genome assemblies | 2018-04-11 | Paper |
| On-line and dynamic algorithms for shortest path problems | 2017-12-04 | Paper |
| A faster algorithm for computing the girth of planar and bounded genus graphs | 2014-09-09 | Paper |
| An approximation algorithm for computing shortest paths in weighted 3-d domains | 2013-08-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5298936 | 2013-06-25 | Paper |
| Planar crossing numbers of graphs of bounded genus | 2012-09-19 | Paper |
| Approximate Distance Queries for Weighted Polyhedral Surfaces | 2011-09-16 | Paper |
| Algorithms for approximate shortest path queries on weighted polyhedral surfaces | 2010-11-08 | Paper |
| Planar Crossing Numbers of Genus g Graphs | 2009-03-12 | Paper |
| A Scalable Multilevel Algorithm for Graph Clustering and Community Structure Detection | 2008-08-19 | Paper |
| Partitioning planar graphs with costs and weights | 2008-06-20 | Paper |
| Approximate Shortest Path Queries on Weighted Polyhedral Surfaces | 2007-09-05 | Paper |
| A Linear-Time Algorithm for Finding a Maximal Planar Subgraph | 2007-05-22 | Paper |
| An O(n log n) ALGORITHM FOR FINDING A SHORTEST CENTRAL LINK SEGMENT | 2005-06-10 | Paper |
| Crossing Numbers and Cutwidths | 2005-05-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3043708 | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4707791 | 2003-06-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2754199 | 2001-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2721969 | 2001-07-11 | Paper |
| Improved algorithms for dynamic shortest paths | 2000-11-14 | Paper |
| Partitioning planar graphs with vertex costs: Algorithms and applications | 2000-08-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4945513 | 2000-03-23 | Paper |
| Reduced constants for simple cycle graph separation | 1997-06-05 | Paper |
| Linear Algorithms for Partitioning Embedded Graphs of Bounded Genus | 1996-09-29 | Paper |
| ON COMPUTING VORONOI DIAGRAMS FOR SORTED POINT SETS | 1996-04-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4037407 | 1993-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4036575 | 1993-05-18 | Paper |
| Edge Separators of Planar and Outerplanar Graphs With Applications | 1993-05-16 | Paper |
| Incomplete block-factorization preconditioners for solving three-dimensional elliptic difference equations on systolic processors∗∗∗ | 1993-01-17 | Paper |
| An \(O(n\log n)\) algorithm for computing the link center of a simple polygon | 1992-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3484374 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3796779 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3798265 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3819101 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4206744 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3782800 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4207594 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3738573 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3718169 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3344221 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3723044 | 1984-01-01 | Paper |
| On the Problem of Partitioning Planar Graphs | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3663340 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3936211 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3915030 | 1981-01-01 | Paper |
