![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Discrete Applied Mathematics, Volume 46
Volume 46, Number 1, 1993
- Andrew Klapper, Agnes Hui Chan, Mark Goresky:
Cross-Correlations of Linearly and Quadratically Related Geometric Sequences and GMW Sequences. 1-20 - Eugeniusz Nowicki, Czeslaw Smutnicki:
New Results in the Worst-Case Analysis for Flow-Shop Scheduling. 21-41 - Maurice Queyranne, Daning Sun:
The Performance Ratio of Grouping Policies for the Joint Replenishment Problem. 43-72
- Thomas Andreae, Ulf Hennig, Andreas Parra:
On a Problem Concerning Tolerance Graphs. 73-78 - Hajo Broersma
, Xueliang Li:
On "The Matching Polynomial of a Polygraph". 79-86 - Suh-Ryung Kim, Terry A. McKee, Fred R. McMorris, Fred S. Roberts
:
p-Competition Numbers. 87-92 - Donna Crystal Llewellyn, Craig A. Tovey, Michael A. Trick:
Erratum: Local Optimization on Graphs. Discret. Appl. Math. 46(1): 93-94 (1993)
Volume 46, Number 2, 1993
- Sergei L. Bezrukov, Norbert Grünwald, Karl Weber:
On Edge Numberings of the n-Cube Graph. 99-116 - Maurice Cochand:
A Fixed Point Operator for the Generalised Maximum Satisfiability Problem. 117-132 - Thomas R. Ervolina, S. Thomas McCormick:
Two Strongly Polynomial Cut Cancelling Algorithms for Minimum Cost Network Flow. 133-165 - Georg Gunther, Bert L. Hartnell, Douglas F. Rall
:
Graphs whose Vertex Independence Number is Unaffected by Single Edge Addition of Deletion. 167-172
- Philippe Baldy, Michel Morvan:
A Linear Time and Space Algorithm to Regonize Interval Orders. 173-178 - Q. Li, Jun-Ming Xu, Z. L. Zhang:
The Infinite Families of Optimal Double Loop Networks. 179-183 - Rainer E. Burkard, En-Yu Yao:
Erratum: Constrained Partitioning Problems. 185
Volume 46, Number 3, 1993
- Collette R. Coullard, John G. Del Greco, Donald K. Wagner:
Uncovering Generalized-Network Structure in Matrices. 191-220 - Refael Hassin, Mordechai I. Henig:
Monotonicity and Efficient Computation of Optimal Dichotomous Search. 221-234 - Lisa Hellerstein:
Functions that are Read-Once on a Subset of their Inputs. 235-251 - Walter Vogler:
On Hyperedge Replacement and BNLC Graph Grammars. 253-273
- Jean Berstel, Patrice Séébold:
A Characterization of Overlap-Free Morphisms. 275-281 - Frank K. Hwang, Stavros G. Papastavridis:
Erratum: Binary Vectors with Exactly k Nonoverlapping m-Tuples of Consecutive ones. 283
![](https://dblp.org/img/cog.dark.24x24.png)
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.