default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 29
Volume 29, Number 1, November 1990
- Faith E. Fich:
Preface. 1-2 - Paul Beame
:
Lower bounds for recognizing small cliques on CRCW PRAM's. 3-20 - Ashok K. Chandra, Martin Tompa:
The complexity of short two-person games. 21-33 - Phillip B. Gibbons, Richard M. Karp, Gary L. Miller, Danny Soroker:
Subtree isomorphism is in random NC. 35-62 - Vince Grolmusz, Prabhakar Ragde:
Incomparability in parallel computation. 63-78 - David G. Kirkpatrick, Teresa M. Przytycka:
Parallel recognition of complement reducible graphs and cotree construction. 79-96 - Baruch Schieber, Uzi Vishkin:
Finding all nearest neighbors for convex polygons in parallel: A new lower bound technique and a matching algorithm. 97-111 - Danny Soroker:
Optimal parallel construction of prescribed tournaments. 113-125
Volume 29, Numbers 2-3, December 1990
- Pierre Hansen, Dominique de Werra:
Preface. 129 - Warren E. Adams, Alain Billionnet, Alain Sutter:
Unconstrained 0-1 optimization and Lagrangean relaxation. 131-142 - Marc A. Berger, Alexander Felzenbaum, Aviezri S. Fraenkel:
Irreducible disjoint covering systems (with an application to boolean algebra). 143-164 - Vasek Chvátal, C. Ebenegger:
A note on line digraphs and the directed max-cut problem. 165-170 - Yves Crama, Pierre Hansen, Brigitte Jaumard:
The basic algorithm for pseudo-Boolean programming revisited. 171-185 - Pierre Hansen, Shi-Hui Lu, Bruno Simeone:
On the equivalence of paved-duality and standard linearization in nonlinear 0-1 optimization. 187-193 - Michel Minoux, Kamel Barkaoui:
Deadlocks and traps in Petri nets as Horn-satisfiability solutions and some related polynomially solvable problems. 195-210 - Uri N. Peled, Murali K. Srinivasan:
Vicinal orders of trees. 211-219 - Fred S. Roberts:
Meaningfulness of conclusions from combinatorial optimization. 221-241 - Bruno Simeone, Dominique de Werra, Maurice Cochand:
Recognition of a class of unimodular functions. 243-250 - Laurence A. Wolsey:
Valid inequalities for 0-1 knapsacks and mips with generalised upper bound constraints. 251-261
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-03-25 00:07 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
