Discrete Applied Mathematics - researchr journal

197	--	205	Andreas Brandstädt, Heinz-Jürgen Voss. Short Disjoint Cycles in Graphs with Degree Constraints
207	--	217	Michael B. Dillencourt. Finding Hamiltonian Cycles in Delaunay Triangulations Is NP-complete
219	--	238	Alix Munier. The Basic Cyclic Scheduling Problem with Linear Precedence Constraints
239	--	248	Carles Padró, Paz Morillo, Eduard Llobet Valero. Diameter-vulnerability of Large Bipartite Digraphs
249	--	265	G. Sajith, Sanjeev Saxena. Optimal Parallel Algorithm for Brooks Colouring Bounded Degree Graphs in Logarithmic Time on EREW PRAM
267	--	279	Terunao Soneoka, Makoto Imase, Yoshifumi Manabe. Design of a D-connected Digraph with a Minimum Number of Edges and a Quasiminimal Diameter: II
281	--	287	Rolf H. Möhring. Triangulating Graphs Without Asteroidal Triples

97	--	103	Ronald D. Armstrong, Zhiying Jin. Strongly Polynomial Simplex Algorithm for Bipartite Vertex Packing
105	--	116	Anindo Bagchi, Edward F. Schmeichel, S. Louis Hakimi. Gossiping with Multiple Sends and Receives
117	--	133	Rong-si Chen. Coronoid Systems with Perfect Matchings
135	--	149	Madhav V. Marathe, Harry B. Hunt III, S. S. Ravi. Efficient Approximation Algorithms for Domatic Partition and on-line Coloring of Circular Arc Graphs
151	--	178	Alon Orlitsky, Santosh S. Venkatesh. On Edge-colored Interior Planar Graphs on a Circle and the Expected Number of RNA Secondary Structures
179	--	191	Masatsugu Urabe. on a Partition into Convex Polygons

1	--	29	Victor Chepoi. A Multifacility Location Problem on Median Spaces
31	--	55	Aviezri S. Fraenkel, Shmuel T. Klein. Robust Universal Complete Codes for Transmission and Compression
57	--	65	Bert Hartnell, Michael D. Plummer. On 4-connected Claw-free Well-covered Graphs
67	--	85	Denise Sakai Troxell. No-hole k-tuple (r+1)-distant Colorings
87	--	92	David R. Guichard. No-hole K-tuple (r+1)-distant Colorings of odd Cycles

External Links