Discrete Applied Mathematics, Volume 101
Volume 101, Number 1-3, April 2000
Mourad Baïou, Michel Balinski: Many-to-many matching: stable polyandrous polygamy (or polygamous polyandry). 1-12- Lorenzo Brunetta, Michele Conforti, Matteo Fischetti: A polyhedral approach to an integer multicommodity flow problem. 13-36
- Lorenzo Brunetta, Francesco Maffioli, Marco Trubian: Solving the feedback vertex set problem on undirected graphs. 37-51
- Dominique Buset: Maximal cubic graphs with diameter 4. 53-61
- Deborah S. Franzblau: Generic rigidity of molecular graphs via ear decomposition. 131-155
- Xuemin Lin: On the computational complexity of edge concentration. 197-205
- Y. Lu, Zhang Shengyuan: Existence of whist tournaments with the three-person property 3PWh(v). 207-219
- Fred R. McMorris, Henry Martyn Mulder, Robert C. Powers: The median function on median graphs and semilattices. 221-230
- Stephanie Perkins, Derek H. Smith: A scheme for the synchronization of variable length codes. 231-245
- Hanif D. Sherali, Jonathan Cole Smith, Warren P. Adams: Reduced first-level representations via the reformulation-linearization technique: results, counterexamples, and computations. 247-267
- Jacques Verriet: Scheduling tree-like task systems with non-uniform deadlines subject to unit-length communication delays. 269-289
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2014-07-25T145207 by the dblp team