default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 52
Volume 52, Number 1, 1994
- Nafiz Abu-Jaradeh, David L. Powers:
Heat Conduction on Graphs. 1-16 - Franz Aurenhammer, Michael Formann, Ramana M. Idury, Alejandro A. Schäffer, Frank Wagner:
Faster Isometric Embedding in Products of Complete Graphs. 17-28 - Amotz Bar-Noy, Frank K. Hwang, Ilan Kessler, Shay Kutten:
A New Competitive Algorithm for Group Testing. 29-38 - Wei Z. Kitto, Andrew Vince
, David Clifford Wilson:
An Isomorphism Between the P-adic Integers and a Ring Associated with a Tiling of N-space By Permutohedra. 39-51 - S. Thomas McCormick, Thomas R. Ervolina:
Computing Maximum Mean Cuts. 53-70 - Rüdiger Rudolf:
Recognition of D-dimensional Monge Arrays. 71-82 - Hanif D. Sherali, Warren P. Adams:
A Hierarchy of Relaxations and Convex Hull Characterizations for Mixed-integer Zero-one Programming Problems. 83-106
Volume 52, Number 2, 1994
- Edoardo Amaldi, Eddy Mayoraz, Dominique de Werra:
A Review of Combinatorial Problems Arising in Feedforward Neural Network Design. 111-138 - Jürgen Bendisch, Ulrich Derigs, Alfred Heske:
An Efficient Matching Algorithm Applied in Statistical Physics. 139-153 - Joan Boyar, Faith E. Fich, Kim S. Larsen:
Bounds on Certain Multiplications of Affine Combinations. 155-167 - Timothy W. Cole:
Some Results on Greedy Algorithm Conjectures. 169-194 - Fanica Gavril, Jorge Urrutia:
Intersection Graphs of Concatenable Subtrees of Graphs. 195-209 - Martin Anthony, John Shawe-Taylor:
A Result of Vapnik with Applications. 211
Volume 52, Number 3, 1994
- Iiro S. Honkala:
On (q, 1)-subnormal q-ary Covering Codes. 213-221 - Klaus Jansen:
Analysis of Scheduling Problems with Typed Task Systems. 223-232 - Jan Kratochvíl:
A Special Planar Satisfiability Problem and a Consequence of Its NP-completeness. 233-252 - Teruo Masuda, Hiroaki Ishii:
Two Machine open Shop Scheduling Problem with Bi-criteria. 253-259 - Elias Dahlhaus, Peter Damaschke:
The Parallel Solution of Domination Problems on Chordal and Strongly Chordal Graphs. 261-273 - Per Enflo, Andrew Granville, Jeffrey O. Shallit, Sheng Yu:
on Sparse Languages L such that LL = Sigma. 275-285 - Norman J. Finizio:
Z-cyclic Whist Tournaments with a Patterned Starter Initial Round. 287-293 - Pavol Hell, Yannis Manoussakis, Zsolt Tuza:
Packing Problems in Edge-colored Graphs. 295-306 - Frédéric Maffray, Myriam Preissmann:
Linear Recognition of Pseudo-split Graphs. 307-312
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-11-20 20:49 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:
