-
-
Triangulations of Cyclic Polytopes and higher Bruhat
Orders
-
Ewa Malesinska and Alessandro Panconesi
On the Hardness of Allocating Frequencies for Hybrid
Networks
-
-
Switchbox Routing in VLSI Design: Closing the Complexity Gap
-
Uta Wille
The Role of Synthetic Geometry in Representational
Measurement Theory
-
-
A Simple Approximation Algorithm for Scheduling Forests with
Unit Processing Times and Zero-One Communication Delays
-
-
Transitive Packing
-
-
Improved Scheduling Algorithms for Minsum Criteria
-
-
Approximation Algorithms for the Discrete Time-Cost
Tradeoff Problem
-
-
Volume Segmentation of 3-dimensional Images
-
-
Scheduling to Minimize Average Completion Time: Off-line
and On-line Approximation Algorithms
-
-
Minimum Strictly Convex Quadrangulations of Convex
Polygons
-
-
Mesh Refinement via Bidirected Flows: Modeling,
Complexity, and Computational Results
-
-
Memory Management for Union-Find Algorithms
-
-
A pratical and efficient algorithm for substitution
decomposition
-
-
Scheduling-LPs Bear Probabilities: Randomized
Approximations for Min-Sum Criteria
-
-
Base Polytopes of Series-Parallel Posets: Linear
Description and Optimization
-
-
Improved Bounds on Relaxations of a Parallel Machine
Scheduling Problem
-
-
On the NP-Completeness of Channel and
Switchbox Routing Problems
