![](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 39
Volume 39, Number 1, 1992
- Maw-Shang Chang
, Chuan Yi Tang, Richard C. T. Lee:
Solving the Euclidean Bottleneck Biconnected Edge Subgraph Problem by 2-Relative Neighborhood Graphs. 1-12 - Joseph Manning, Mikhail J. Atallah:
Fast Detection and Display of Symmetry in Outerplanar Graphs. 13-35 - Ronald L. Rardin, Moises Sudit:
Paroids: A Canonical Format for Combinatorial Optimization. 37-56 - Louis W. Shapiro:
Random Walks with Absorbing Points. 57-67 - John H. Vande Vate:
Structural Properties of Matroid Matchings. 69-85
- Madhav V. Marathe, R. Ravi, C. Pandu Rangan:
Generalized Vertex Covering in Interval Graphs. 87-93
Volume 39, Number 2, 1992
- Francine Blanchet-Sadri:
Games, Equations and Dot-Depth Two Monoids. 99-111 - David Hartvigsen, Eitan Zemel:
The Complexity of Lifted Inequalities for the Knapsack Problem. 113-123 - Shin'ichirou Ishii:
Measure Theoretic Approach to the Classification of Cellular Automata. 125-136 - András Recski, Werner Schwärzler:
One-Story Buildings as Tensegrity Frameworks III. 137-146 - Michael B. Richey, Abraham P. Punnen:
Minimum Perfect Bipartite Matchings and Spanning Trees under Categorization. 147-153
- Carlisle M. Adams, Stafford E. Tavares:
Generating Bent Sequences. 155-159 - Anders Björner, Johan Karlander, Bernt Lindström:
Communication Complexity of two Decision Problems. 161-163
- Jitender S. Deogun, George Steiner:
Hamiltonian Cycle is Polynomial on Cocomparability Graphs. 165-172
- Peter C. Fishburn:
Correlation in Partially Ordered Sets. 173-191
Volume 39, Number 3, 1992
- Moshe Dror:
Openshop Scheduling with Machine Dependent Processing Times. 197-205 - Philippe Flajolet, Danièle Gardy
, Loÿs Thimonier:
Birthday Paradox, Coupon Collectors, Caching Algorithms and Self-Organizing Search. 207-229 - Frank K. Hwang, Gaylord W. Richards:
The Capacity of the Subarray Partial Concentrators. 231-240 - Uriel G. Rothblum, Hans Schneider, Michael H. Schneider:
Characterizations of Max-Balanced Flows. 241-261 - Jeremy P. Spinrad:
P4-Trees and Substitution Decomposition. 263-291
- J. Ales, Roman Bacik:
Strong Elimination Ordering of the Total Graph of a Tree. 293-295
![](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.