Volume 126, Number 1, 1 March 2003
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

Last update Fri May 24 20:14:52 2013
CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page