default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 74
Volume 74, Number 1, April 1997
- Martin Aigner:
Finding the Maximum and Minimum. 1-12 - Stefan Felsner, Rudolf Müller, Lorenz Wernisch:
Trapezoid Graphs and Generalizations, Geometry and Algorithms. 13-32 - Ten-Hwang Lai, Shu-Shang Wei:
Bipartite Permutation Graphs with Application to the Minimum Buffer Size Problem. 33-55 - David Nehme, Gang Yu:
The Cardinality and Precedence Constrained Maximum Value Sub-hypergraph Problem, Its Applications. 57-68 - David Peleg, Avishai Wool
:
The Availability of Crumbling Wall Quorum Systems. 69-83 - Hananya Yinnone:
On Paths Avoiding Forbidden Pairs of Vertices in a Graph. 85-92 - Mulan Liu, Gary L. Mullen:
Irreducible Polynomials and Linear Recurring Arrays. 93-99
Volume 74, Number 2, April 1997
- Pranava K. Jha, Naveen Agnihotri, Rajesh Kumar Arora:
Long Cycles and Long Paths in the Kronecker Product of a Cycle, a Tree. 101-121 - Yoshiyasu Ishigami, Sei'ichi Tani:
VC-dimensions of Finite Automata and Commutative Finite Automata with k Letters, n States. 123-134 - Alain Billionnet, Alain Faye:
A Lower Bound for a Constrained Quadratic 0-1 Minimization Problem. 135-146 - Rong-si Chen, Fuji Zhang:
Regular Coronoid Systems. 147-158 - Olivier Goldschmidt, Dorit S. Hochbaum:
k-edge Subgraph Problems. 159-169 - Olaf Kyek, Ian Parberry, Ingo Wegener:
Bounds on the Number of Knight's Tours. 171-181 - William A. Webb:
How to Cut a Cake Fairly Using a Minimal Number of Cuts. 183-190 - Rong-si Chen, Fuji Zhang:
Hamilton Paths in Z-transformation Graphs of Perfect Matchings of Hexagonal Systems. 191-196 - Andrei A. Gladky:
On Complexity of Minimizing Weighted Number of Late Jobs in Unit Time Open Shops. 197-201
Volume 74, Number 3, May 1997
- Leizhen Cai:
On Spanning 2-trees in a Graph. 203-216 - Rowan Davies, Gordon F. Royle:
Graph Domination, Tabu Search and the Football Pool Problem. 217-228 - Yoshiyasu Ishigami, Sei'ichi Tani:
VC-dimensions of Finite Automata and Commutative Finite Automata with k Letters and n States. 229-240 - Y. Daniel Liang:
Parallel Algorithms for the Domination Problems in Trapezoid Graphs. 241-249 - Kazuhisa Makino, Kojin Yano, Toshihide Ibaraki:
Positive and Horn Decomposability of Partially Defined Boolean Functions. 251-274 - Richard A. Brualdi, Jia-Yu Shao:
Generalized Exponents of Primitive Symmetric Digraphs. 275-293 - Stephane Perennes:
A Proof of Jean De Rumeur's Conjecture. 295-299
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-08-03 00:39 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.
