-
-
L\^e Numbers of Arrangements and Matroid
Identities
-
-
Projections of Polytopes and the Generalized Baues
Conjecture
-
-
Note on Shortest and Nearest Lattice Vectors
-
-
Comparison lemmas and applications for diagrams of
spaces
-
-
Treewidth Equals Bandwidth for AT-Free Claw-Free
Graphs
-
-
Cardinality Matching: Heuristic Search for Augmenting
Paths
-
-
Scheduling Unit Jobs with Compatible Release Dates on
Parallel Machines with Nonstationary Speeds
-
-
0/1-Integer Programming: Optimization and Augmentation
are Equivalent
-
-
Minkowski's second theorem on successive minima
-
Ewa Malesinska
List Coloring and Optimization Criteria for a Channel
Assignment Problem
-
-
Drawing Graphs on Rectangular Grids with at most 2
Bends per Edge
-
-
Scheduling with Forbidden Sets
-
-
Finite packings of spheres
-
-
Basic Properties of Convex Polytopes
-
-
Scheduling to Minimize Total Weighted Completion Time:
Performance Guarantees of LP-Based Heuristics and
Lower Bounds
-
-
Modular decomposition and transitive orientation
-
-
Efficient Union-Find for Planar Graphs and other
Sparse Graph Classes
-
-
A compact data structure and parallel algorithms for
permutation graphs
-
Sven G. Bartels
The complexity of Yamnitsky and Levin's simplices
algorithm
-
-
Approximation Algorithms for Scheduling
Series-Parallel Orders Subject to Unit Time
Communication Delays
-
-
On subspace arrangements of type D
