default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 75
Volume 75, Number 1, May 1997
- Béla Bollobás, Imre Leader:
Matchings and Paths in the Cube. 1-8 - Alice M. Dean, Joan P. Hutchinson:
Rectangle-visibility Representations of Bipartite Graphs. 9-25 - Peter Firby, Julie Haviland:
Independence and Average Distance in Graphs. 27-37 - Peter C. Fishburn, Peter Schwander, Larry A. Shepp, Robert J. Vanderbei:
The Discrete Radon Transform and Its Approximate Inversion Via Linear Programming. 39-61 - Martin Gavalec:
Computing Matrix Period in Max-min Algebra. 63-70 - Evangelos Kranakis, Danny Krizanc, Anil Maheshwari, Marc Noy, Jörg-Rüdiger Sack, Jorge Urrutia:
Stage-graph Representations. 71-80 - Sang Kyu Lee, A. Duksu Oh, Hongsik Choi, Hyeong-Ah Choi:
Optimal Transmission Schedules in TWDM Optical Passive Star Networks. 81-91 - Abraham P. Punnen, Yash P. Aneja:
Minimum Dispersion Problems. 93-102 - Zhi-Long Chen:
Parallel Machine Scheduling with Time Dependent Processing Times. 103
Volume 75, Number 2, May 1997
- Roberto De Prisco
, Alfredo De Santis:
Catastrophic Faults in Reconfigurable Systolic Linear Arrays. 105-123 - Christine Garcia, Claudine Peyrat:
Large Cayley Graphs on an Abelian Group. 125-133 - Klaus Jansen, Petra Scheffler:
Generalized Coloring for Tree-like Graphs. 135-155 - Roger Labahn, André Raspaud:
Periodic Gossiping in Back-to-back Trees. 157-168 - Silvano Martello, François Soumis, Paolo Toth:
Exact and Approximation Algorithms for Makespan Minimization on Unrelated Parallel Machines. 169-188 - Alex D. Scott:
Better Bounds for Perpetual Gossiping. 189-197 - T. J. N. Brown, Roger B. Mallion, Paul Pollak, Arnd Roth:
Some Methods for Counting the Spanning Trees in Labelled Molecular Graphs, Examined in Relation to Certain Fullerenes. 199-200
Volume 75, Number 3, June 1997
- Igor Averbakh, Oded Berman:
(p - 1)/(p + 1)-approximate Algorithms for P-traveling Salesmen Problems on a Tree with Minmax Objective. 201-216 - Yves Crama, Oya Ekin, Peter L. Hammer:
Variable and Term Removal From Boolean Formulae. 217-230 - Isabelle Fagnot:
On the Subword Equivalence Problem for Morphic Words. 231-253 - Satoshi Fujita, Arthur M. Farley:
Minimum-cost Line Broadcast in Paths. 255-268 - Jan Gorodkin:
Orbits of Boolean Functions. 269-275 - Yehuda Roditty, Barack Shoham:
On Broadcasting Multiple Messages in a D-dimensional Grid. 277-284 - Constantine Stivaros, Klaus Sutner:
Computing Optimal Assignments for Residual Network Reliability. 285-295
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-11-22 19:34 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:
