| Publication | Date of Publication | Type |
|---|
| Clarification of lower bounds of two-machine flow-shop scheduling to minimize total late work | 2022-12-23 | Paper |
| The exact multiple pattern matching problem solved by a reference tree approach | 2021-08-11 | Paper |
| Minimum spanning trees of moving points in the plane | 2018-09-14 | Paper |
| A parallel algorithm for solving sparse triangular systems | 2018-09-14 | Paper |
| Parallel graph algorithms based upon broadcast communications | 2018-09-14 | Paper |
| An optimal EREW parallel algorithm for computing breadth-first search trees on permutation graphs | 2016-06-01 | Paper |
| A new filtration method and a hybrid strategy for approximate string matching | 2013-11-29 | Paper |
| Edit distance for a run-length-encoded string and an uncompressed string | 2010-03-24 | Paper |
| Finding a longest common subsequence between a run-length-encoded string and an uncompressed string | 2008-04-28 | Paper |
| The approximability of the weighted Hamiltonian path completion problem on a tree | 2005-09-22 | Paper |
| The minimal spanning tree preservation approaches for DNA multiple sequence alignment and evolutionary tree construction | 2005-05-13 | Paper |
| The full Steiner tree problem | 2005-01-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4808628 | 2004-08-12 | Paper |
| An optimal algorithm for finding the minimum cardinality dominating set on permutation graphs | 2002-07-30 | Paper |
| An optimal embedding of cycles into incomplete hypercubes | 2002-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4218434 | 1998-11-11 | Paper |
| The weighted perfect domination problem and its variants | 1996-10-06 | Paper |
| Single step searching in weighted block graphs | 1995-08-10 | Paper |
| An optimal algorithm to solve the minimum weakly cooperative guards problem for 1-spiral polygons | 1994-12-08 | Paper |
| Optimal MMI file systems for orthogonal range retrieval | 1994-01-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5289053 | 1994-01-06 | Paper |
| A linear time algorithm to solve the weighted perfect domination problem in series-parallel graphs | 1994-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4201930 | 1993-09-06 | Paper |
| The searching over separators strategy to solve some NP-hard problems in subexponential time | 1993-06-29 | Paper |
| The slab dividing approach to solve the Euclidean \(P\)-center problem | 1993-04-01 | Paper |
| Amortized analysis of some disk scheduling algorithms: SSTF, SCAN, and \(N\)-step SCAN | 1993-01-26 | Paper |
| Special subgraphs of weighted visibility graphs | 1993-01-17 | Paper |
| Solving the Euclidean bottleneck biconnected edge subgraph problem by 2- relative neighborhood graphs | 1993-01-16 | Paper |
| PARALLEL ALGORITHMS FOR COMPUTING THE CLOSEST VISIBLE VERTEX PAIR BETWEEN TWO POLYGONS | 1993-01-16 | Paper |
| Solving the Euclidean bottleneck matching problem by \(k\)-relative neighborhood graphs | 1992-09-27 | Paper |
| 20‐relative neighborhood graphs are hamiltonian | 1992-06-27 | Paper |
| COVERING CONVEX RECTILINEAR POLYGONS IN LINEAR TIME | 1992-06-27 | Paper |
| On weighted rectilinear 2-center and 3-center problems | 1991-01-01 | Paper |
| VORONOI DIAGRAMS OF MOVING POINTS IN THE PLANE | 1991-01-01 | Paper |
| Solving the set cover problem on a supercomputer | 1990-01-01 | Paper |
| The weighted perfect domination problem | 1990-01-01 | Paper |
| On the continuous working problem | 1990-01-01 | Paper |
| The vectorization of the partition problem | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3359794 | 1990-01-01 | Paper |
| A branch-and-bound algorithm to solve the equal-execution-time job scheduling problem with precedence constraint and profile | 1989-01-01 | Paper |
| Counting clique trees and computing perfect elimination schemes in parallel | 1989-01-01 | Paper |
| On a scheduling problem where a job can be executed only by a limited number of processors | 1988-01-01 | Paper |
| Efficient parallel algorithms for finding maximal cliques, clique trees, and minimum coloring on chordal graphs | 1988-01-01 | Paper |
| The mapping of two-dimensional array processors to one-dimensional processors | 1986-01-01 | Paper |
| An O(N log N) minimal spanning tree algorithm for N points in the plane | 1986-01-01 | Paper |
| A Letter-oriented Minimal Perfect Hashing Scheme | 1986-01-01 | Paper |
| A parallel sorting scheme whose basic operation sortsN elements | 1985-01-01 | Paper |
| Optimal speeding up of parallel algorithms based upon the divide-and- conquer strategy | 1984-01-01 | Paper |
| A new parallel sorting algorithm based upon min-mid-max operations | 1984-01-01 | Paper |
| A parallel algorithm to solve the stable marriage problem | 1984-01-01 | Paper |
| On the average length of Delaunay triangulations | 1984-01-01 | Paper |
| The average performance analysis of a closest‐pair algorithm | 1984-01-01 | Paper |
| The hierarchical ordering in multiattribute files | 1983-01-01 | Paper |
| Symbolic Gray Code as a Perfect Multiattribute Hashing Scheme for Partial Match Queries | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3042217 | 1981-01-01 | Paper |
| Symbolic Gray Code as a Multikey Hashing Function | 1980-01-01 | Paper |
| Towards Automatic Auditing of Records | 1978-01-01 | Paper |
| Storage Reduction Through Minimal Spanning Trees and Spanning Forests | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4136605 | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4125773 | 1975-01-01 | Paper |
| An algorithm to generate prime implicants and its application to the selection problem | 1972-01-01 | Paper |
| Some properties of fuzzy logic | 1972-01-01 | Paper |
| Fuzzy Logic and the Resolution Principle | 1972-01-01 | Paper |
| Application of game tree searching techniques to sequential pattern recognition | 1971-01-01 | Paper |
| On the Optimal Solutions to AND/OR Series-Parallel Graphs | 1971-01-01 | Paper |
