Susanne E. Hambrusch

Available identifiers

zbMath Open hambrusch.susanne-eDBLPh/SusanneSHambruschWikidataQ102264444 ScholiaQ102264444MaRDI QIDQ673518

List of research outcomes

Publication	Date of Publication	Type
Embedding complete binary trees into butterfly networks	2018-09-14	Paper
Query indexing and velocity constrained indexing: scalable techniques for continuous queries on moving objects	2018-07-09	Paper
Data replication in static tree structures	2009-03-23	Paper
https://portal.mardi4nfdi.de/entity/Q4473266	2004-08-04	Paper
Termination detection in data-driven parallel computations/applications.	2003-08-19	Paper
https://portal.mardi4nfdi.de/entity/Q4410706	2003-07-03	Paper
https://portal.mardi4nfdi.de/entity/Q4408092	2003-07-01	Paper
https://portal.mardi4nfdi.de/entity/Q4780330	2002-11-19	Paper
Clustering in Trees: Optimizing Cluster Sizes and Number of Subtrees	2001-02-19	Paper
Minimizing broadcast costs under edge reductions in tree networks	1999-03-30	Paper
Edge Weight Reduction Problems in Directed Acyclic Graphs	1997-08-25	Paper
New algorithms for mimizing the longest wire length during circuit compaction.	1997-08-07	Paper
Communication operations on coarse-grained mesh architectures	1997-02-28	Paper
https://portal.mardi4nfdi.de/entity/Q5284061	1997-02-04	Paper
Parallel algorithms for gray-scale digitized picture component labeling on a mesh-connected computer	1995-03-01	Paper
Determining maximum \(k\)-width-connectivity on meshes	1994-01-19	Paper
Multiple network embeddings into hypercubes	1993-12-20	Paper
Shortest path computations in source-deplanarized graphs	1993-10-17	Paper
Erratum to: New clique and independent set algorithms for circle graphs	1993-05-16	Paper
https://portal.mardi4nfdi.de/entity/Q4028878	1993-03-28	Paper
Load balanced tree embeddings	1993-01-16	Paper
Minimizing total wire length during 1-dimensional compaction	1993-01-13	Paper
A framework for 1-D compaction with forbidden region avoidance	1992-09-27	Paper
New clique and independent set algorithms for circle graphs	1992-06-28	Paper
Parallel asynchronous connected components in a mesh	1992-06-26	Paper
Topological numbering of features on a mesh	1992-06-25	Paper
Parallel algorithms for determining \(k\)-width connectivity in binary images	1992-06-25	Paper
On the computational complexity of continuous routing	1989-01-01	Paper
Planar linear arrangements of outerplanar graphs	1988-01-01	Paper
Optimal three-dimensional layouts of complete binary trees	1987-01-01	Paper
Finding maximum cliques on circular-arc graphs	1987-01-01	Paper
On bipartite matchings of minimum density	1987-01-01	Paper
An assignment algorithm with applications to integrated circuit layout	1986-01-01	Paper
Two-layer channel routing with vertical unit-length overlap	1986-01-01	Paper
Optimal Rotation Problems in Channel Routing	1986-01-01	Paper
Solving tree problems on a mesh-connected processor array	1986-01-01	Paper
Solving Undirected Graph Problems on VLSI	1985-01-01	Paper
VLSI Algorithms for the Connected Component Problem	1983-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3674073	1983-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3327727	1982-01-01	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Susanne E. Hambrusch