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