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 BibTeX
- Guiqing Li, Wenlong Su, Haipeng Luo:
Edge colorings of the complete graph K149 and the lower bounds of three Ramsey numbers.
167-179 BibTeX
- Refael Hassin, Asaf Levin:
Subgraphs decomposable into two trees and k-edge-connected subgraphs.
181-195 BibTeX
- Daniel Kobler, Udi Rotics:
Edge dominating set and colorings on graphs with fixed clique-width.
197-221 BibTeX
- Dale Peterson:
Gridline graphs: a review in two dimensions and an extension to higher dimensions.
223-239 BibTeX
- Antonio Restivo, Pedro V. Silva:
Periodicity vectors for labelled trees.
241-260 BibTeX
- Stefan Szeider:
Finding paths in graphs avoiding forbidden transitions.
261-273 BibTeX
- Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki:
A primal-dual approximation algorithm for the survivable network design problem in hypergraphs.
275-289 BibTeX
- Jinquan Dong, Yanpei Liu, Cun-Quan Zhang:
Determination of the star valency of a graph.
291-296 BibTeX
- Marisa Gutierrez, João Meidanis:
Recognizing clique graphs of directed edge path graphs.
297-304 BibTeX
- Kazuhisa Makino:
Efficient dualization of O(log n)-term monotone disjunctive normal forms.
305-312 BibTeX
- Shuichi Sakai, Mitsunori Togasaki, Koichi Yamazaki:
A note on greedy algorithms for the maximum weighted independent set problem.
313-322 BibTeX
Copyright © Sat May 16 23:55:15 2009
by Michael Ley (ley@uni-trier.de)
