default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 47
Volume 47, Number 1, 1993
- Péter L. Erdös, László A. Székely:
Counting Bichromatic Evolutionary Trees. 1-8 - Donald Goldfarb, Jianxiu Hao:
On the Maximum Capacity Augmentation Algorithm for the Maximum Flow Problem. 9-16 - Nen-Fu Huang:
On the Complexity of two Circle Connecting Problems. 17-32 - Peter Jeavons:
Counting Representable Sets on Simple Graphs. 33-46 - Fred R. McMorris, Robert C. Powers:
Consensus Functions on Trees that Satisfy Independence Axiom. 47-55 - Jack A. A. van der Veen:
An O(n) Algorithm to Solve the Bottleneck Traveling Salesman Problem Restricted to Ordered Product Matrices. 57-75
- Ephraim Korach, Michal Penn:
A Fast Algorithm for Maximum Integral Two-Commodity Flow in Planar Graphs. 77-83
Volume 47, Number 2, 1993
- Mustafa Akgül, Horst W. Hamacher, Süleyman Tüfekci:
Preface. 85 - Susanne Albers, Peter Brucker:
The Complexity of One-Machine Batching Problems. 87-107 - Geir Dahl
:
Directed Steiner Problems with Connectivity Constraints. 109-128 - Leslie A. Hall:
A Note on Generalizing the Maximum Lateness Criterion for Scheduling. 129-137 - Helmut G. Kahlbacher, T. C. Edwin Cheng:
Parallel Machine Scheduling to Minimize Costs for Earliness and Number of Tardy Jobs. 139-164 - Hans Kellerer, Gerhard J. Woeginger:
On the Euclidean two Paths Problem. 165-173 - Federico Malucelli, Thomas Ottmann, Daniele Pretolani:
Efficient Labelling Algorithms for the Maximum Noncrossing Matching Problem. 175-179 - Katta G. Murty:
On the Complexity of a Special Basis Problem in LP. 181-185 - Pawel Winter:
Auclidean Steiner Minimal Trees with Obstacles and Steiner Visibility Graphs. 187-206
Volume 47, Number 3, 1993
- Martin Anthony, John Shawe-Taylor:
A Result of Vapnik with Applications. 207-217 - Noboru Hamada, Tor Helleseth, Øyvind Ytrehus:
A New Class of Nonbinary Codes Meeting the Griesmer Bound. 219-226 - Yoshiko Ikebe, Tomomi Matsui, Akihisa Tamura:
Adjacency of the Best and Second Best Valued Solutions in Combinatorial Optimization Problems. 227-232 - Dieter Jungnickel:
Trace-Orthogonal Normal Bases. 233-249 - Y. Kaufman, Arie Tamir:
Locating Service Centers with Precedence Constraints. 251-261 - Mulan Liu, Zunquan Li:
Coset Correlation of LR m-Arrays. 263-273 - Arie Tamir:
A Unifying Location Model on Tree Graphs Based on Submodularity Properties. 275-283 - Fuji Zhang, Xueliang Li, Heping Zhang:
Hexagonal Systems with Fixed Bonds. 285-296
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-10-31 20:16 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:
