Publication | Date of Publication | Type |
---|
“The big sweep”: On the power of the wavefront approach to Voronoi diagrams | 2022-08-18 | Paper |
Parallel Sorting for GPUs | 2018-10-04 | Paper |
Efficient parallel graph algorithms for coarse grained multicomputers and BSP | 2018-07-04 | Paper |
Exact and approximate computational geometry solutions of an unrestricted point set stereo matching problem | 2016-05-26 | Paper |
Shortest paths in time-dependent FIFO networks | 2012-04-26 | Paper |
Using spine decompositions to efficiently solve the length-constrained heaviest path problem for trees | 2010-06-09 | Paper |
Graph-Theoretic Concepts in Computer Science | 2010-01-12 | Paper |
An \(\mathcal O(2^{O(k)}n^{3})\) FPT algorithm for the undirected feedback vertex set problem | 2007-12-19 | Paper |
SOFSEM 2006: Theory and Practice of Computer Science | 2006-11-14 | Paper |
Computing and Combinatorics | 2006-01-11 | Paper |
MAXIMIZING A VORONOI REGION: THE CONVEX CASE | 2005-11-29 | Paper |
Euro-Par 2004 Parallel Processing | 2005-08-23 | Paper |
ANALOG PARALLEL ALGORITHMS FOR COMPUTATIONAL GEOMETRY | 2004-10-06 | Paper |
Solving large FPT problems on coarse-grained parallel machines | 2004-08-19 | Paper |
https://portal.mardi4nfdi.de/entity/Q4473266 | 2004-08-04 | Paper |
https://portal.mardi4nfdi.de/entity/Q4427882 | 2003-09-14 | Paper |
https://portal.mardi4nfdi.de/entity/Q4408092 | 2003-07-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4785983 | 2002-12-12 | Paper |
Efficient parallel graph algorithms for coarse-grained multicomputers and BSP | 2002-06-17 | Paper |
https://portal.mardi4nfdi.de/entity/Q2779600 | 2002-04-15 | Paper |
https://portal.mardi4nfdi.de/entity/Q2751885 | 2001-10-21 | Paper |
WordNet++: A lexicon for the Color-X-method | 2001-08-20 | Paper |
Randomized parallel list ranking for distributed memory multiprocessors. | 1997-08-07 | Paper |
``The big sweep: On the power of the wavefront approach to Voronoi diagrams | 1997-06-22 | Paper |
A randomized parallel three-dimensional convex hull algorithm for coarse-grained multicomputers | 1997-01-01 | Paper |
SCALABLE PARALLEL COMPUTATIONAL GEOMETRY FOR COARSE GRAINED MULTICOMPUTERS | 1996-12-16 | Paper |
Multisearch techniques: Parallel data structures on mesh-connected computers | 1994-07-03 | Paper |
Determining maximum \(k\)-width-connectivity on meshes | 1994-01-19 | Paper |
https://portal.mardi4nfdi.de/entity/Q4694761 | 1993-06-29 | Paper |
Parallel fractional cascading on hypercube multiprocessors | 1992-12-16 | Paper |
Editor's foreword to: Special issue on parallel algorithms for geometric problems on digitized pictures | 1992-06-25 | Paper |
Computational geometry algorithms for the systolic screen | 1992-06-25 | Paper |
Parallel algorithms for determining \(k\)-width connectivity in binary images | 1992-06-25 | Paper |
Parallel branch and bound on fine-grained hypercube multiprocessors | 1990-01-01 | Paper |
Computing the configuration space for a robot on a mesh-of-prosessors | 1989-01-01 | Paper |
Pipelined search on coarse grained networks | 1989-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3484388 | 1989-01-01 | Paper |
Solving visibility and separability problems on a mesh-of-processors | 1988-01-01 | Paper |
On O(\(\sqrt{n})\) time algorithm for the ECDF searching problem for arbitrary dimensions on a mesh-of-processors | 1988-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3787488 | 1988-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3795223 | 1988-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3796757 | 1988-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3820006 | 1988-01-01 | Paper |
Translation separability of sets of polygons | 1987-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3785935 | 1987-01-01 | Paper |
Optical clustering | 1986-01-01 | Paper |
Clustering methods for geometric objects and applications to design problems | 1986-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3745337 | 1986-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3670582 | 1983-01-01 | Paper |