default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 81
Volume 81, Number 1-3, January 1998
- Jorge L. Ramírez Alfonsín:
On Variations of the Subset Sum Problem. 1-7 - Frank E. Bennett, Lisheng Wu:
Minimum Matrix Representation of Sperner Systems. 9-17 - Catherine Z. W. Hassell Sweatman, Gavin J. Gibson, Bernard Mulgrew:
Exact Classification with Two-layer Neural Nets in N Dimensions. 19-39 - Dih Jiun Guan:
Routing a Vehicle of Capacity Greater than one. 41-57 - Petr Hlinený
:
The Maximal Clique and Colourability of Curve Contact Graphs. 59-68 - Yanpei Liu, Aurora Morgana, Bruno Simeone:
A Linear Algorithm for 2-bend Embeddings of Planar Graphs in the Two-dimensional Grid. 69-91 - Claire Hanen, Alix Munier Kordon:
Performance of Coffman-Graham Schedules in the Presence of Unit Communication Delays. 93-108 - James G. Oxley, Don Row:
Panelling Planar Graphs. 109-122 - Maria Grazia Scutellà:
A Strongly Polynomial Algorithm for the Uniform Balanced Network Flow Problem. 123-131 - Charles R. Blair:
Sensitivity Analysis for Knapsack Problems: A Negative Result. 133-139 - Dasong Cao, George L. Nemhauser:
Polyhedral Characterizations, Perfection of Line Graphs. 141-154 - Arturo Carpi:
On the Number of Abelian Square-free Words on Four Letters. 155-167 - Lenwood S. Heath, John Paul C. Vergara:
Edge-packing Planar Graphs by Cyclic Graphs. 169-180 - Ewa M. Kubicka, Grzegorz Kubicki, Ortrud Oellermann:
Steiner Intervals in Graphs. 181-190 - Rong Lin, Stephan Olariu:
A Fast Parallel Algorithm to Recognize P4-sparse Graphs. 191-215 - Gerard Sierksma:
Interchange Graphs and the Hamiltonian Cycle Polytope. 217-224 - Roberto Conti, Pierluigi Contucci, Corrado Falcolini:
Polynomial Invariants for Trees a Statistical Mechanics Approach. 225-237 - Kazuo Iwama, Eiji Miyano:
Better Approximations of Non-Hamiltonian Graphs. 239-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-08 00:46 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:
