Elias Dahlhaus Completeness with Respect to Interpretations in Deterministic and Nondeterministic Polynomial Time. [Citation Graph (0, 0)][DBLP] CSL, 1988, pp:52-62 [Conf]
Elias Dahlhaus The Complexity of Subtheories of the Existential Linear Theory of Reals. [Citation Graph (0, 0)][DBLP] CSL, 1989, pp:76-89 [Conf]
Elias Dahlhaus, Marek Karpinski An Efficient Parallel Algorithm for the Minimal Elimination Ordering (MEO) of an Arbitrary Graph (Extended Abstract) [Citation Graph (0, 0)][DBLP] FOCS, 1989, pp:454-459 [Conf]
Elias Dahlhaus Efficient Parallel and Linear Time Sequential Split Decomposition (Extended Abstract). [Citation Graph (0, 0)][DBLP] FSTTCS, 1994, pp:171-180 [Conf]
Elias Dahlhaus Efficient Parallel Algorithms on Chordal Graphs with a Sparse Tree Representations. [Citation Graph (0, 0)][DBLP] HICSS (2), 1994, pp:150-158 [Conf]
Elias Dahlhaus Improved Efficient Parallel Algorithms to Recognize Interval Graphs and Interval Hypergraphs. [Citation Graph (0, 0)][DBLP] HICSS (1), 1997, pp:172-181 [Conf]
Elias Dahlhaus A Linear Time Algorithm to Recognize Clustered Graphs and Its Parallelization. [Citation Graph (0, 0)][DBLP] LATIN, 1998, pp:239-248 [Conf]
Elias Dahlhaus Fast Parallel Algorithm for the Single Link Heuristics of Hierarchical Clustering. [Citation Graph (0, 0)][DBLP] SPDP, 1992, pp:184-187 [Conf]
Elias Dahlhaus Sequential and Parallel Algorithms on Compactly Represented Chordal and Strongly Chordal Graphs. [Citation Graph (0, 0)][DBLP] STACS, 1997, pp:487-498 [Conf]
Elias Dahlhaus, Marek Karpinski A Fast Parallel Algorithm for Computing all Maximal Cliques in a Graph and the Related Problems (Extended Abstract). [Citation Graph (0, 0)][DBLP] SWAT, 1988, pp:139-144 [Conf]
Elias Dahlhaus Optimal (Parallel) Algorithms for the All-to-All Vertices Distance Problem for Certain Graph Classes. [Citation Graph (0, 0)][DBLP] WG, 1992, pp:60-69 [Conf]
Elias Dahlhaus Minimal elimination ordering for graphs of bounded degree. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2002, v:116, n:1-2, pp:127-143 [Journal]
Elias Dahlhaus A Parallel Algorithm for Computing Steiner Trees in Strongly Chordal Graphs. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1994, v:51, n:1-2, pp:47-61 [Journal]
Elias Dahlhaus Efficient Parallel Recognition Algorithms of Cographs and Distance Hereditary Graphs. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1995, v:57, n:1, pp:29-44 [Journal]
Elias Dahlhaus Parallel Algorithms for Hierarchical Clustering and Applications to Split Decomposition and Parity Graph Recognition. [Citation Graph (0, 0)][DBLP] J. Algorithms, 2000, v:36, n:2, pp:205-240 [Journal]
Elias Dahlhaus Fast Parallel Recognition of Ultrametrics and Tree Metrics. [Citation Graph (0, 0)][DBLP] SIAM J. Discrete Math., 1993, v:6, n:4, pp:523-532 [Journal]
Elias Dahlhaus, Marek Karpinski An Efficient Parallel Algorithm for the Minimal Elimination Ordering (MEO) of an Arbitrary Graph. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1994, v:134, n:2, pp:493-528 [Journal]