default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 20
Volume 20, Number 1, May 1988
- Daniel Bienstock:
Broadcasting with random faults. 1-7 - Terrence Bone, Clark Jeffries, Victor Klee:
A qualitative analysis of I. 9-30 - Charles J. Colbourn, Dieter Jungnickel, Alexander Rosa:
The strong chromatic number of partial triple systems. 31-38 - Oskar Goecke:
A greedy algorithm for hereditary set systems and a generalization of the Rado-Edmonds characterization of matroids. 39-49 - Hanif D. Sherali, Danny C. Myers:
Dual formulations and subgradient optimization strategies for linear programming relaxations of mixed-integer programs. 51-68 - Kathy Williamson Hoke:
Completely unimodal numberings of a simple polytope. 69-81 - Guy Chaty:
On signed digraphs with all cycles negative. 83-85 - Fan T. Tseng, Klaus Truemper:
Addendum. 87-88 - Panos M. Pardalos, J. Ben Rosen:
Erratum. 89
Volume 20, Number 2, June 1988
- Peter Brucker, Wolfgang Meyer:
Scheduling two irregular polygons. 91-100 - Marek Chrobak, Svatopluk Poljak:
On common edges in optimal solutions to traveling salesman and other optimization problems. 101-111 - Ronald D. Dutton, Robert C. Brigham:
An extremal problem for edge domination insensitive graphs. 113-125 - Luquan Pan:
On the security of p-party protocols. 127-144 - J. D. Parker:
The period of the Fibonacci random number generator. 145-164 - Maurice Tchuenté:
Cycles generated by sequential iterations. 165-172 - Zvi Galil, Baruch Schieber:
On finding most uniform spanning trees. 173-175 - Katta G. Murty:
A correction to a result in linear programming. 177-180
Volume 20, Number 3, July 1988
- Perino M. Dearing, Douglas R. Shier, D. D. Warner:
Maximal chordal subgraphs. 181-190 - Andrzej Ehrenfeucht, David Haussler:
A new distance metric on strings computable in linear time. 191-203 - Søren Holm, Jørgen Tind:
A unified approach for price directive decomposition procedures in integer programming. 205-219 - Yuji Kobayashi:
Enumeration of irreducible binary words. 221-232 - Chung-Yee Lee, J. David Massey:
Multiprocessor scheduling: combining LPT and MULTIFIT. 233-242 - Hosam M. Mahmoud
, Boris G. Pittel:
On the joint distribution of the insertion path length and the number of comparisons in search trees. 243-251 - Fuji Zhang, Ming-kun Zhou:
Matching polynomials of two classes of graphs. 253-260 - Josef Vyskoc:
Partial information in public key cryptography. 261-263 - Sheng Yu:
Can the catenation of two weakly sparse languages be dense? 265-267
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-28 23:58 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:
