| Publication | Date of Publication | Type |
|---|
Parallel best-first branch-and-bound in discrete optimization: a framework
| 2024-06-21 | Paper |
A parallel time/hardware tradeoff T.H=O(2/sup n/2/) for the knapsack problem
IEEE Transactions on Computers | 2018-09-14 | Paper |
Efficient parallel graph algorithms for coarse grained multicomputers and BSP
Automata, Languages and Programming | 2018-07-04 | Paper |
Fractional path coloring in bounded degree trees with applications
Algorithmica | 2010-09-16 | Paper |
Characterizing topological assumptions of distributed algorithms in dynamic networks
Structural Information and Communication Complexity | 2010-02-24 | Paper |
Generalized parametric multi-terminal flows problem.
Lecture Notes in Computer Science | 2010-01-12 | Paper |
Neighborhood Broadcasting in Hypercubes
SIAM Journal on Discrete Mathematics | 2008-12-05 | Paper |
Approximate constrained bipartite edge coloring
Discrete Applied Mathematics | 2004-11-23 | Paper |
scientific article; zbMATH DE number 2044917 (Why is no real title available?)
| 2004-02-18 | Paper |
A probabilistic study of inter-satellite links load in polar orbit satellite constellations
Telecommunication Systems | 2003-10-23 | Paper |
The minimum range assignment problem on linear radio networks
Algorithmica | 2003-06-02 | Paper |
Parallel computation on interval graphs: algorithms and experiments
Concurrency and Computation: Practice and Experience | 2003-02-04 | Paper |
Isomorphisms of the De Bruijn digraph and free‐space optical networks
Networks | 2002-12-17 | Paper |
Efficient parallel graph algorithms for coarse-grained multicomputers and BSP
Algorithmica | 2002-06-17 | Paper |
scientific article; zbMATH DE number 1754632 (Why is no real title available?)
| 2002-06-12 | Paper |
scientific article; zbMATH DE number 1670654 (Why is no real title available?)
| 2001-12-18 | Paper |
scientific article; zbMATH DE number 1302197 (Why is no real title available?)
| 2000-09-26 | Paper |
Scalable 2D convex hull and triangulation algorithms for coarse grained multicomputers
Journal of Parallel and Distributed Computing | 1999-11-17 | Paper |
scientific article; zbMATH DE number 1304345 (Why is no real title available?)
| 1999-06-17 | Paper |
scientific article; zbMATH DE number 1163092 (Why is no real title available?)
| 1998-06-11 | Paper |
Fast and scalable parallel algorithms for knapsack-like problems.
Journal of Parallel and Distributed Computing | 1997-08-07 | Paper |
Randomized routing on generalized hypercubes
Theoretical Computer Science | 1997-02-27 | Paper |
scientific article; zbMATH DE number 934535 (Why is no real title available?)
| 1997-01-26 | Paper |
scientific article; zbMATH DE number 918136 (Why is no real title available?)
| 1996-08-19 | Paper |
Bounding the probability of success of stochastic methods for global optimization
Computers & Mathematics with Applications | 1993-07-21 | Paper |
Parallel fractional cascading on hypercube multiprocessors
Computational Geometry | 1992-12-16 | Paper |
Data-movement-intensive problems: Two folk theorems in parallel computation revisited
Theoretical Computer Science | 1992-06-28 | Paper |
The complexity of searching in \(X+Y\) and other multisets
Information Processing Letters | 1990-01-01 | Paper |
Parallel branch and bound on fine-grained hypercube multiprocessors
Parallel Computing | 1990-01-01 | Paper |
The two list algorithm for the knapsack problem on an FPS T20
Parallel Computing | 1989-01-01 | Paper |
scientific article; zbMATH DE number 4070608 (Why is no real title available?)
| 1988-01-01 | Paper |
scientific article; zbMATH DE number 4053045 (Why is no real title available?)
| 1988-01-01 | Paper |
