Volume 91,
Number 1-3,
January 1999
- Nesrine Abbas, Lorna K. Stewart:
Clustering Bipartite, Chordal Graphs: Complexity, Sequential, Parallel Algorithms.
1-23
Electronic Edition (link) BibTeX
- Christos Alexopoulos, J. Scott Provan, H. Donald Ratliff, Bryan R. Stutzman:
Minimal Connected Enclosures on an Embedded Planar Graph.
25-38
Electronic Edition (link) BibTeX
- Noga Alon, Shmuel Onn:
Separable Partitions.
39-51
Electronic Edition (link) BibTeX
- Zhou Bo, Bolian Liu:
Matrices with Maximum Exponents in the Class of Doubly Stochastic Primitive Matrices.
53-66
Electronic Edition (link) BibTeX
- Hazel Everett, Ferran Hurtado, Marc Noy:
Stabbing Information of a Simple Polygon.
67-82
Electronic Edition (link) BibTeX
- Paul Fischer, Norbert Klasner, Ingo Wegener:
On the Cut-off Point for Combinatorial Group Testing.
83-92
Electronic Edition (link) BibTeX
- Susanne E. Hambrusch, Hyeong-Seok Lim:
Minimizing Broadcast Costs Under Edge Reductions in Tree Networks.
93-117
Electronic Edition (link) BibTeX
- Peter Horák, Ljiljana Brankovic, Mirka Miller:
A Combinatorial Problem in Database Security.
119-126
Electronic Edition (link) BibTeX
- Robert W. Irving, David Manlove:
The b-chromatic Number of a Graph.
127-141
Electronic Edition (link) BibTeX
- Gary MacGilivray, Min-Li Yu:
Generalized Partitions of Graphs.
143-153
Electronic Edition (link) BibTeX
- David Manlove:
On the Algorithmic Complexity of Twelve Covering and Independence Parameters of Graphs.
155-175
Electronic Edition (link) BibTeX
- Jacques Mazoyer, Ivan Rapaport:
Inducing an Order on Cellular Automata by a Grouping Operation.
177-196
Electronic Edition (link) BibTeX
- Donatella Merlini, Douglas G. Rogers, Renzo Sprugnoli, M. Cecilia Verri:
Underdiagonal Lattice Paths with Unrestricted Steps.
197-213
Electronic Edition (link) BibTeX
- Vincent Moulton, Mike A. Steel:
Retractions of Finite Distance Functions Onto Tree Metrics.
215-233
Electronic Edition (link) BibTeX
- Giovanni Righini, Marco Trubian:
Data-dependent Bounds for the General and the Asymmetric Stacker-Crane Problems.
235-242
Electronic Edition (link) BibTeX
- Kenji Uemura, Takeo Yaku, Kimio Sugita:
Induced Permutation Automata and Coverings of Strongly Connected Automata.
243-249
Electronic Edition (link) BibTeX
- Stan P. M. van Hoesel, Albert P. M. Wagelmans:
On the Complexity of Postoptimality Analysis of 0/1 Programs.
251-263
Electronic Edition (link) BibTeX
- Helen Verrall:
Compatible Hamilton Decompositions of Directed Wrapped Butterfly Graphs.
265-275
Electronic Edition (link) BibTeX
- Zhang Shengyuan:
On the Nonexistence of Extremal Self-dual Codes.
277-286
Electronic Edition (link) BibTeX
- Richard B. Borie, Jeremy Spinrad:
Construction of a Simple Elimination Scheme for a Chordal Comparability Graph in Linear Time.
287-292
Electronic Edition (link) BibTeX
- Celina M. Herrera de Figueiredo, John G. Gimbel, Célia Picinin de Mello, Jayme Luiz Szwarcfiter:
Even and Odd Pairs in Comparability and in P4-comparability Graphs.
293-297
Electronic Edition (link) BibTeX
- Jaeun Lee, Moo Young Sohn, Kyung Kim Hye:
A Note on Graphs with Large Girth, Small Minus Domination Number.
299-303
Electronic Edition (link) BibTeX
- András Sebö, Zeev Waksman:
Optimal Binary Trees with Order Constraints.
305-311
Electronic Edition (link) BibTeX
Copyright © Sat May 16 23:55:13 2009
by Michael Ley (ley@uni-trier.de)