Author of the publication

Algorithms for the Treewidth and Minimum Fill-in of HHD-Free Graphs.

, , and . WG, volume 1335 of Lecture Notes in Computer Science, page 109-117. Springer, (1997)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

The Computation of the Jump Number of Convex Graphs.. ORDAL, volume 831 of Lecture Notes in Computer Science, page 176-185. Springer, (1994)Optimal (Parallel) Algorithms for the All-to-All Vertices Distance Problem for Certain Graph Classes.. WG, volume 657 of Lecture Notes in Computer Science, page 60-69. Springer, (1992)A Fast Parallel Algorithm for Computing all Maximal Cliques in a Graph and the Related Problems (Extended Abstract)., and . SWAT, volume 318 of Lecture Notes in Computer Science, page 139-144. Springer, (1988)Membership for Growing Context-Sensitive Grammars is Polynomial., and . J. Comput. Syst. Sci., 33 (3): 456-472 (1986)MAD trees and distance-hereditary graphs., , , and . Discret. Appl. Math., 131 (1): 151-167 (2003)The Complexity of Multiway Cuts (Extended Abstract), , , , and . STOC, page 241-251. ACM, (1992)Fast Parallel Algorithm for the Single Link Heuristics of Hierarchical Clustering.. SPDP, page 184-187. IEEE Computer Society, (1992)Efficient Parallel Modular Decomposition (Extended Abstract).. WG, volume 1017 of Lecture Notes in Computer Science, page 290-302. Springer, (1995)The Complexity of Subtheories of the Existential Linear Theory of Reals.. CSL, volume 440 of Lecture Notes in Computer Science, page 76-89. Springer, (1989)Efficient Parallel and Linear Time Sequential Split Decomposition (Extended Abstract).. FSTTCS, volume 880 of Lecture Notes in Computer Science, page 171-180. Springer, (1994)