


default search action
Discrete Applied Mathematics, Volume 126
Volume 126, Number 1, 1 March 2003
- Kazuyuki Amano, Akira Maruoka, Jun Tarui:

On the negation-limited circuit complexity of merging. 3-8 - Jin-yi Cai:

A new transference theorem in the geometry of numbers and new bounds for Ajtai's connection factor. 9-31 - Ka Wong Chong, Yijie Han, Yoshihide Igarashi, Tak Wah Lam

:
Improving the efficiency of parallel minimum spanning tree algorithms. 33-54 - David A. Hutchinson, Anil Maheshwari, Norbert Zeh:

An external memory data structure for shortest path queries. 55-82 - Hiroshi Nagamochi:

An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree. 83-113 - Tadao Takaoka:

Theory of 2-3 Heaps. 115-128
Volume 126, Number 2-3, 15 March 2003
- Marcella Anselmo:

A non-ambiguous decomposition of regular languages and factorizing codes. 129-165 - Guiqing Li, Wenlong Su, Haipeng Luo:

Edge colorings of the complete graph K149 and the lower bounds of three Ramsey numbers. 167-179 - Refael Hassin, Asaf Levin

:
Subgraphs decomposable into two trees and k-edge-connected subgraphs. 181-195 - Daniel Kobler, Udi Rotics:

Edge dominating set and colorings on graphs with fixed clique-width. 197-221 - Dale Peterson:

Gridline graphs: a review in two dimensions and an extension to higher dimensions. 223-239 - Antonio Restivo, Pedro V. Silva

:
Periodicity vectors for labelled trees. 241-260 - Stefan Szeider

:
Finding paths in graphs avoiding forbidden transitions. 261-273 - Liang Zhao

, Hiroshi Nagamochi, Toshihide Ibaraki:
A primal-dual approximation algorithm for the survivable network design problem in hypergraphs. 275-289 - Jinquan Dong, Yanpei Liu, Cun-Quan Zhang:

Determination of the star valency of a graph. 291-296 - Marisa Gutierrez, João Meidanis:

Recognizing clique graphs of directed edge path graphs. 297-304 - Kazuhisa Makino:

Efficient dualization of O(log n)-term monotone disjunctive normal forms. 305-312 - Shuichi Sakai, Mitsunori Togasaki, Koichi Yamazaki

:
A note on greedy algorithms for the maximum weighted independent set problem. 313-322

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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














