Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 7
Volume 7, Number 1, January 1984
- Takao Asano, Shunji Kikuchi, Nobuji Saito:
A linear algorithm for finding Hamiltonian cycles in 4-connected maximal planar graphs. 1-15 - Jaakko T. Astola:
The Tietäväinen bound for spherical codes. 17-21 - Michael W. Carter
:
The indefinite zero-one quadratic problem. 23-44 - Edward J. Farrell, S. A. Wahid:
Matchings in benzene chains. 45-54 - Hiroshi Maehara:
Space graphs and sphericity. 55-64 - A. Muir, M. W. Warner:
Lattice valued relations and automata. 65-78 - Eugene Seneta, William L. Steiger:
A new lad curve-fitting algorithm: Slightly overdetermined equation systems in L1. 79-91 - H. Paul Williams:
A duality theorem for linear congruences. 93-103 - Satoru Fujishige:
A note on Frank's generalized polymatroids. 105-109
Volume 7, Number 2, February 1984
- Martin Farber:
Domination, independent domination, and duality in strongly chordal graphs. 115-130 - Peter C. Fishburn:
Probabilities of dominant candidates based on first-place votes. 131-140 - Claude W. Haigh, John W. Kennedy, Louis V. Quintas:
Counting and coding identity trees with fixed diameter and bounded degree. 141-160 - Peter Kirschenhofer:
On the average shape of monotonically labelled tree structures. 161-181 - Arthur L. Liestman, Dana S. Richards:
Toward optimal gossiping schemes with conference calls. 183-189 - Fionn Murtagh:
Counting dendrograms: A survey. 191-199 - Miroslawa Skowronska, Maciej M. Syslo:
An algorithm to recognize a middle graph. 201-208 - Maciej M. Syslo:
Optimal constructions of reversible digraphs. 209-220 - Peter M. Winkler:
Isometric embedding in products of complete graphs. 221-225
Volume 7, Number 3, March 1984
- Frank M. Brown, Yoshihide Igarashi:
On permutations of wires and states. 231-241 - Michel Chein, Michel Habib:
Jump number of dags having Dilworth number 2. 243-250 - Michele Conforti, Gérard Cornuéjols:
Submodular set functions, matroids and the greedy algorithm: Tight worst-case bounds and some generalizations of the Rado-Edmonds theorem. 251-274 - Raymond A. Cuninghame-Green:
The absolute centre of a graph. 275-283 - Shimon Even, Azaria Paz:
A note on cake cutting. 285-296 - Jean-Jacques Pansiot:
A propos d'une conjecture de F. Dejean sur les répétitions dans les mots. 297-311 - András Recski:
A network theory approach to the rigidity of skeletal structures Part I. Modelling and interconnection. 313-324 - Douglas R. Shier:
Some aspects of perfect elimination orderings in chordal graphs. 325-331 - Ulrich Faigle:
5th Bonn workshop on combinatorial optimization : June 11-16, 1984 at the University of Bonn, West Germany. 335
a service of 
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 2024-04-22 21:02 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 and maintained by:
the dblp computer science bibliography is funded and supported by:
