| 2023 | ICFCA | Examples of Clique Closure Systems. | Elias Dahlhaus, Bernhard Ganter |
| 1998 | LATIN | A Linear Time Algorithm to Recognize Clustered Graphs and Its Parallelization. | Elias Dahlhaus |
| 1998 | WG | Minimum Fill-in and Treewidth for Graphs Modularly Decomposable into Chordal Graphs. | Elias Dahlhaus |
| 1997 | SODA | Efficient and Practical Modular Decomposition. | Elias Dahlhaus, Jens Gustedt, Ross M. McConnell |
| 1997 | STACS | Sequential and Parallel Algorithms on Compactly Represented Chordal and Strongly Chordal Graphs. | Elias Dahlhaus |
| 1997 | WG | Algorithms for the Treewidth and Minimum Fill-in of HHD-Free Graphs. | Hajo Broersma, Elias Dahlhaus, Ton Kloks |
| 1997 | WG | Minimal Elimination Ordering Inside a Given Chordal Graph. | Elias Dahlhaus |
| 1995 | ISAAC | The Parallel Complexity of Approximating the High Degree Subgraph Problem. | Alexander E. Andreev, Andrea Clementi, Pierluigi Crescenzi, Elias Dahlhaus, Sergio De Agostino, Jos D. P. Rolim |
| 1995 | WG | Efficient Parallel Modular Decomposition (Extended Abstract). | Elias Dahlhaus |
| 1994 | WG | On Domination Elimination Orderings and Domination Graphs (Extended Abstract). | Elias Dahlhaus, Peter L. Hammer, Frdric Maffray, Stephan Olariu |
| 1993 | ICCI | An Efficient Parallel Recognition Algorithm of Parity Graphs. | Elias Dahlhaus |
| 1993 | WG | The Parallel Complexity of Elimination Ordering Procedures. | Elias Dahlhaus |
| 1992 | MFCS | New Parallel Algorithms for Convex Hull and Triangulation in 3-Dimensional Space. | Waldemar Preilowski, Elias Dahlhaus, Gerd Wechsung |
| 1992 | STOC | The Complexity of Multiway Cuts (Extended Abstract) | Elias Dahlhaus, David S. Johnson, Christos H. Papadimitriou, Paul D. Seymour, Mihalis Yannakakis |
| 1992 | WG | Optimal (Parallel) Algorithms for the All-to-All Vertices Distance Problem for Certain Graph Classes. | Elias Dahlhaus |
| 1991 | CSL | How to Implement First Order Formulas in Local Memory Machine Models. | Elias Dahlhaus |
| 1990 | SODA | Fast Parallel Algorithms for the Clique Separator Decomposition. | Elias Dahlhaus, Marek Karpinski, Mark B. Novick |
| 1989 | CSL | The Complexity of Subtheories of the Existential Linear Theory of Reals. | Elias Dahlhaus |
| 1989 | FOCS | An Efficient Parallel Algorithm for the Minimal Elimination Ordering (MEO) of an Arbitrary Graph (Extended Abstract) | Elias Dahlhaus, Marek Karpinski |
| 1988 | CSL | Completeness with Respect to Interpretations in Deterministic and Nondeterministic Polynomial Time. | Elias Dahlhaus |
| 1988 | FOCS | Optimal Parallel Algorithm for the Hamiltonian Cycle Problem on Dense Graphs | Elias Dahlhaus, Pter Hajnal, Marek Karpinski |
| 1987 | CSL | Is SETL a Suitable Language for Parallel Programming - A Theoretical Approach. | Elias Dahlhaus |
| 1986 | ESOP | The Choice of Programming Primitives for SETL-Like Programming Languages. | Elias Dahlhaus, Johann A. Makowsky |