|
|
Journals in DBLP
- Srinivasa Rao Arikati, Anil Maheshwari, Christos D. Zaroliagis
Efficient Computation of Implicit Representations of Sparse Graphs. [Citation Graph (0, 0)][DBLP]
Discrete Applied Mathematics, 1997, v:78, n:1-3, pp:1-16 [Journal]
- Tiffany M. Barnes, Carla D. Savage
Efficient Generation of Graphical Partitions. [Citation Graph (0, 0)][DBLP]
Discrete Applied Mathematics, 1997, v:78, n:1-3, pp:17-26 [Journal]
- Kenneth A. Berman, Yanpei Liu
Generalized Bicycles. [Citation Graph (0, 0)][DBLP]
Discrete Applied Mathematics, 1997, v:78, n:1-3, pp:27-40 [Journal]
- Maw-Shang Chang, Chung-Chang Hsu
On Minimum Intersection of Two Minimum Dominating Sets of Interval Graphs. [Citation Graph (0, 0)][DBLP]
Discrete Applied Mathematics, 1997, v:78, n:1-3, pp:41-50 [Journal]
- Ding-Zhu Du, Biao Gao, Weili Wu
A Special Case for Subset Interconnection Designs. [Citation Graph (0, 0)][DBLP]
Discrete Applied Mathematics, 1997, v:78, n:1-3, pp:51-60 [Journal]
- Josep Fàbrega, Marisa Zaragozá
Fault-tolerant Routings in Double Fixed-step Networks. [Citation Graph (0, 0)][DBLP]
Discrete Applied Mathematics, 1997, v:78, n:1-3, pp:61-74 [Journal]
- Peter C. Fishburn, Frank K. Hwang, Ding-Zhu Du, Biao Gao
On 1-rate Wide-sense Nonblocking for 3-stage Clos Networks. [Citation Graph (0, 0)][DBLP]
Discrete Applied Mathematics, 1997, v:78, n:1-3, pp:75-87 [Journal]
- Pierre Hansen, Giovanni Storchi, Tsevi Vovor
Paths with Minimum Range and Ratio of Arc Lengths. [Citation Graph (0, 0)][DBLP]
Discrete Applied Mathematics, 1997, v:78, n:1-3, pp:89-102 [Journal]
- Toru Hasunuma, Yukio Shibata
Embedding De Bruijn, Kautz and Shuffle-exchange Networks in Books. [Citation Graph (0, 0)][DBLP]
Discrete Applied Mathematics, 1997, v:78, n:1-3, pp:103-116 [Journal]
- Kevin I.-J. Ho, Joseph Y.-T. Leung, W.-D. Wei
Scheduling Imprecise Computation Tasks with 0/1-constraint. [Citation Graph (0, 0)][DBLP]
Discrete Applied Mathematics, 1997, v:78, n:1-3, pp:117-132 [Journal]
- Gyula Y. Katona
Edge Disjoint Polyp Packing. [Citation Graph (0, 0)][DBLP]
Discrete Applied Mathematics, 1997, v:78, n:1-3, pp:133-152 [Journal]
- Suh-Ryung Kim, Fred S. Roberts
Competition Numbers of Graphs with a Small Number of Triangles. [Citation Graph (0, 0)][DBLP]
Discrete Applied Mathematics, 1997, v:78, n:1-3, pp:153-162 [Journal]
- Khee Meng Koh, Eng Guan Tay
Optimal Orientations of Products of Paths and Cycles. [Citation Graph (0, 0)][DBLP]
Discrete Applied Mathematics, 1997, v:78, n:1-3, pp:163-174 [Journal]
- George J. Kyparisis, Christos Koulamas
Open Shop Scheduling with Maximal Machines. [Citation Graph (0, 0)][DBLP]
Discrete Applied Mathematics, 1997, v:78, n:1-3, pp:175-187 [Journal]
- Haiko Müller
Recognizing Interval Digraphs and Interval Bigraphs in Polynomial Time. [Citation Graph (0, 0)][DBLP]
Discrete Applied Mathematics, 1997, v:78, n:1-3, pp:189-205 [Journal]
- Madan Natu, Shu-Cherng Fang
The Point-to-point Connection Problem - Analysis and Algorithms. [Citation Graph (0, 0)][DBLP]
Discrete Applied Mathematics, 1997, v:78, n:1-3, pp:207-226 [Journal]
- Jing-Ho Yan, Gerard J. Chang, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi
k-Path Partitions in Trees. [Citation Graph (0, 0)][DBLP]
Discrete Applied Mathematics, 1997, v:78, n:1-3, pp:227-233 [Journal]
- Bernhard von Stengel, Ralph Werchner
Complexity of Searching an Immobile Hider in a Graph. [Citation Graph (0, 0)][DBLP]
Discrete Applied Mathematics, 1997, v:78, n:1-3, pp:235-249 [Journal]
- Joost P. Warners, Tamás Terlaky, Cornelis Roos, Benjamin Jansen
A Potential Reduction Approach to the Frequency Assignment Problem. [Citation Graph (0, 0)][DBLP]
Discrete Applied Mathematics, 1997, v:78, n:1-3, pp:251-282 [Journal]
- Ryan B. Hayward
Meyniel Weakly Triangulated Graphs II: A Theorem of Dirac. [Citation Graph (0, 0)][DBLP]
Discrete Applied Mathematics, 1997, v:78, n:1-3, pp:283-289 [Journal]
- Wing Ning Li
Two-segmented Channel Routing Is Strong NP-complete. [Citation Graph (0, 0)][DBLP]
Discrete Applied Mathematics, 1997, v:78, n:1-3, pp:291-298 [Journal]
|
