Volume 92, Number 1, March 1999
Volume 92, Number 2-3, June 1999
- Ulrik Brandes, Wolfram Schlickenrieder, Gabriele Neyer, Dorothea Wagner, Karsten Weihe:
A Software Package of Algorithms and Heuristics for Disjoint Paths in Planar Networks.
91-110

- Alberto Caprara, Juan José Salazar González:
Separating Lifted Odd-hole Inequalities to Solve the Index Selection Problem.
111-134

- Soo Y. Chang, Hark-Chin Hwang:
The Worst-case Analysis of the MULTIFIT Algorithm for Scheduling Nonsimultaneous Parallel Machines.
135-147

- Hikoe Enomoto, Miki Shimabara Miyauchi, Katsuhiro Ota:
Lower Bounds for the Number of Edge-crossings Over the Spine in a Topological Book Embedding of a Graph.
149-155

- Jeffrey C. Jackson, Eli Shamir, Clara Shwartzman:
Learning with Queries Corrupted by Classification Noise.
157-175

- Raffaele Mosca:
Stable Sets in Certain P6-free Graphs.
177-191

- Mathieu Raffinot:
Asymptotic Estimation of the Average Number of Terminal States in DAWGs.
193-203

- Jürgen Dassow, Gheorghe Paun:
On the Regularity of Languages Generated by Context-free Evolutionary Grammars.
205-209

- Satoru Fujishige, Satoru Iwata:
Minimizing a Submodular Function Arising From a Concave Function.
211-215

- Venkatesan Guruswami:
Maximum Cut on Line and Total Graphs.
217-221

- Masahiro Miyakawa, Akihiro Nozaki, Grant Pogosyan, Ivo G. Rosenberg:
A Map From the Lower-half of the n-cube Onto the (n-1)-cube Which Preserves Intersecting Antichains.
223-228

- Ján Plesník:
Constrained Weighted Matchings and Edge Coverings in Graphs.
229-241

- René Sitters:
A Short Proof of a Conjecture on the Tr-choice Number of Even Cycles.
243-246

- Gerhard J. Woeginger:
Sensitivity Analysis for Knapsack Problems: Another Negative Result.
247-251

Last update Sat May 18 20:20:27 2013
CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page