| Publication | Date of Publication | Type |
|---|
The new class of \(g\)-chain periodic sorters
Journal of Parallel and Distributed Computing | 1999-01-06 | Paper |
An OODB part-whole model: Semantics, notation and implementation
Data & Knowledge Engineering | 1998-08-13 | Paper |
| scientific article; zbMATH DE number 975330 (Why is no real title available?) | 1997-03-09 | Paper |
The shifting algorithm technique for the partitioning of trees
Discrete Applied Mathematics | 1995-01-01 | Paper |
A shifting algorithm for constrained min-max partition on trees
Discrete Applied Mathematics | 1993-12-02 | Paper |
Most uniform path partitioning and its use in image processing
Discrete Applied Mathematics | 1993-06-29 | Paper |
Best location of service centers in a treelike network under budget constraints
Discrete Mathematics | 1990-01-01 | Paper |
The periodic balanced sorting network
Journal of the ACM | 1989-01-01 | Paper |
Better understanding of Batcher's merging networks
Discrete Applied Mathematics | 1989-01-01 | Paper |
Digraphs with maximum number of paths and cycles
Networks | 1987-01-01 | Paper |
Efficient implementation of a shifting algorithm
Discrete Applied Mathematics | 1985-01-01 | Paper |
Finding the two-core of a tree
Discrete Applied Mathematics | 1985-01-01 | Paper |
Optimum split trees
Journal of Algorithms | 1984-01-01 | Paper |
Shifting algorithms for tree partitioning with general weighting functions
Journal of Algorithms | 1983-01-01 | Paper |
Efficient Optimization of Monotonic Functions on Trees
SIAM Journal on Algebraic Discrete Methods | 1983-01-01 | Paper |
Circuit partitioning with size and connection constraints
Networks | 1983-01-01 | Paper |
The complexity of finding maximum disjoint paths with length constraints
Networks | 1982-01-01 | Paper |
A Shifting Algorithm for Min-Max Tree Partitioning
Journal of the ACM | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3723871 (Why is no real title available?) | 1981-01-01 | Paper |
Max-Min Tree Partitioning
Journal of the ACM | 1981-01-01 | Paper |
Mean flow scheduling and optimal construction of a treelike communication network
Networks | 1981-01-01 | Paper |
The complexity of identifying redundant and essential elements
Journal of Algorithms | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3696517 (Why is no real title available?) | 1980-01-01 | Paper |
The edge inducibility of graphs
Acta Mathematica Academiae Scientiarum Hungaricae | 1980-01-01 | Paper |
Generalized Fibonacci maximum path graphs
Discrete Mathematics | 1979-01-01 | Paper |
Finding Two Disjoint Paths Between Two Pairs of Vertices in a Graph
Journal of the ACM | 1978-01-01 | Paper |
Interpolation search—a log log <i>N</i> search
Communications of the ACM | 1978-01-01 | Paper |
Understanding the complexity of interpolation search
Information Processing Letters | 1977-01-01 | Paper |
A counter example to a conjecture of D. J. Rose on minimum triangulation
Journal of Mathematical Analysis and Applications | 1973-01-01 | Paper |
