Books<\h2>
Graph Classes: A Survey, with A. Brandsadt, V.B. Le, SIAM, Philadelpia, 1999

Efficient Graph Representations, Fields Institute Monographs 19, American
Mathematical Society, Providence, 2003

Journal Publications

"Worst Case Analysis of a Scheduling Algorithm",
Operations Research Letters 4, 911 (1985)

"Worst Case Analysis of a Graph Coloring Algorithm",
Discrete Applied Mathematics 12, 8992 (1985),
with G. Vijayan

"On Comparability and Permutation Graphs",
SIAM Journal on Computing 14, 658670 (1985)

"The Minimum Dummy Task Problem", Networks 16, 331348 (1986)

"$P sub 4$Trees", Congressus Numerantium 60, 2534 (1987)

"Bipartite Permutation Graphs are Bipartite Tolerance Graphs",
Congressus Numerantium 58, 165174 (1987), with A.
Brandstadt and L. Stewart

"Bipartite Permutation Graphs", Discrete Applied Math 18,
279292 (1987)
with A. Brandstadt and L. Stewart

"An Improved Edge Bound on the Interval Number of a Graph",
Journal of Graph Theory 11, 447449,
with G. Vijayan and D. West (1987)

"CircularArc Graphs with Clique Cover Number Two",
Journal of Combinatorial Theory Series B 44, 300306 (1988)

"Edge Subdivision and Dimension", Order 5, 143147 (1988)

"Incremental Modular Decomposition",
Journal of the ACM 36, 119, with J. Muller (1989)

"Prime Testing for the Split Decomposition", SIAM Journal
on Discrete Math 2, 590599 (1989)

"Transitive Closure for Restricted Classes of Partial Orders",
Order 8, 175183, with T. Ma (1991)

"Note on Recognition of Matroid Systems", Operations Research
Letters 10, 313314 (1991)

"Cyclefree Partial Orders and Chordal Comparability Graphs",
Order 8, 4961, with T. Ma (1991)

"Finding Large Holes", Information Processing Letters 39,
227229 (1991)

"$P sub 4$trees and Substitution Decomposition",
Discrete Applied Mathematics 39, 263291 (1992)

"Doubly Lexical Ordering of Dense 01 Matrices",
Information Processing Letters 45, 229235 (1993)

"Recognition of Circle Graphs", Journal of Algorithms 16,
145160 (1994)

"An O($n sup 2$) Algorithm for Undirected Split Decomposition",
Journal of Algorithms 16, 264282 (1994)
with T. Ma

"On the 2Chain Subgraph Cover and Related Problems",
Journal of Algorithms 17, 251268 (1994), with T. Ma

"Algorithms for Weakly Triangulated Graphs",
Discrete Applied Mathematics 19, 181191 (1995), with R. Sritharan

"A Linear Algorithm to Decompose Inheritance Graphs into Modules,
Algorithmica 13, 573591 (1995) with M. Habib and M. Huchard

"Nonredundant Ones and Chordal Bipartite Graphs",
SIAM Journal on Discrete Mathematics 8, 251257 (1995)

"A Polynomial Time Recognition Algorithm for 3SDH Graphs",
Information Processing Letters 55, 149154 (1995), with O. Oellerman

"Independent Sets in CircularArc Graphs",
Journal of Algorithms 19, 154160 (1995), with W. Hsu

"Visibility Graphs of Towers", with P. Colley and A. Lubiw,
Computational Geometry Theory and Applications 7, 161172 (1997)

"On Treewidth and Minimum Fillin of Asteroidal TripleFree Graphs",
with T. Kloks and D. Kratsch, Theoretical Computer Science 175, 309335 (1997)

"Construction of a Simple Elimination Scheme for a Chordal Comparability
Graph in Linear Time", with R. Borie, Discrete Applied Mathematics 91,
287282, 1999

"Modular Decomposition and Transitive Orientation", with R. McConnell,
Discrete Mathematics 201, 189241, 1999

"Weakly Triangulated Comparability Graphs", with E. Eschen, R. Hayward,
R. Sritharan, SIAM Journal on Computing 29, 278386, 1999

"Ordered Vertex Partitioning", with R. McConnell, Discrete Mathematics and
Theoretical Computer Science 4, 4560, 2000

"Solving Problems on Special Classes of Graphs", Electronic Notes on
Discrete Mathematics 5, 2000

"Domination Graphs: Examples and Counterexamples", with I. Rusu, Discrete
Applied Mathematics 110, 289300, 2001

"Forbidden Subgraph Decomposition", with I. Rusu, Discrete Mathematics 247,
159168, 2002

"Scalar Aggregation in Inconsistent Databases", with M. Arenas, L. Bertossi,
J. Chomicki, X. He, V. Raghavan, Theoretical Computer Science 296, 405434,
2003

"From a Simple Elimination Ordering to a Strong Elimination Ordering in
Linear Time", with J. Sawada, Information Processing Letters 86, 299302,
2003

"Recognition of Some Perfectly Orderable Graph Classes", with E. Eschen,
J.L. Johnson, R. Sritharan, Discrete Applied Mathematics 128, 355373, 2003a

"Robust Algorithms for Restricted Domains", Journal of Algorithms 48,
160172, 2003
