default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 11
Volume 11, Number 2, June 1985
- Julián Aráoz, Jack Edmonds:
A case of non-convergent dual changes in assignment problems. 95-102 - Ronald I. Becker, Yehoshua Perl:
Finding the two-core of a tree. 103-113 - János Demetrovics, Zoltán Füredi, Gyula O. H. Katona:
Minimum matrix representation of closure operations. 115-128 - Ulrich Derigs:
Some basic exchange properties in combinatorial optimization and their application to constructing the K-best solutions. 129-141 - Mohamed H. El-Zahar, I. Rival:
Greedy linear extensions to minimize jumps. 143-156 - Tor Helleseth:
On the covering radius of cyclic linear codes and arithmetic codes. 157-173 - Teruo Masuda, Hiroaki Ishii, Toshio Nishida:
The mixed shop scheduling problem. 175-186 - Truc T. Nguyen, Allan R. Sampson:
Counting the number of p × q integer matrices more concordant than a given matrix. 187-205
Volume 11, Number 3, July 1985
- Peter Butkovic
, Ferdinand Hevery:
A condition for the strong regularity of matrices in the minimax algebra. 209-222 - David Gale, Marilda Sotomayor:
Some remarks on the stable matching problem. 223-232 - Georg Gunther:
Neighbour-connectivity in regular graphs. 233-243 - Yves Robert, Maurice Tchuenté:
Connection-graph and iteration-graph of monotone boolean functions. 245-253 - Patrice Séébold:
Sequences generated by infinitely iterated morphisms. 255-264 - Suvrajeet Sen, Hanif D. Sherali:
A branch and bound algorithm for extreme point mathematical programming problems. 265-280 - George Steiner:
A compact labeling scheme for series-parallel graphs. 281-297 - IJsbrand Jan Aalbersberg, Grzegorz Rozenberg:
Traces, dependency graphs and DNLC grammars. 299-306 - Iiro S. Honkala, Heikki O. Hämäläinen, Markku K. Kaikkonen:
A modification of the Zinoviev lower bound for constant weight codes. 307-310 - G. Saviozzi:
On degeneracy in linear complementarity problems. 311-314
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 2026-07-11 00:13 CEST 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
