Kombinatorische und logische Eigenschaften von Reduktionen auf einige vollständige Probleme in NP und NL mit einigen Folgerungen. - Elias Dahlhaus (1982)

Reduction to NP-complete problems by interpretations. - Elias Dahlhaus (Logic and Machines, 1983)

Concerning Two-Adjacent Context-Free Languages. - Elias Dahlhaus; Haim Gaifman (Theor. Comput. Sci., 1985)

Computable Directory Queries. - Elias Dahlhaus; Johann A. Makowsky (CAAP, 1986)

The Choice of Programming Primitives for SETL-Like Programming Languages. - Elias Dahlhaus; Johann A. Makowsky (ESOP, 1986)

Membership for Growing Context-Sensitive Grammars is Polynomial. - Elias Dahlhaus; Manfred K. Warmuth (J. Comput. Syst. Sci., 1986)

Skolem Normal Forms Concerning the Least Fixpoint. - Elias Dahlhaus (Computation Theory and Logic, 1987)

Is SETL a Suitable Language for Parallel Programming - A Theoretical Approach. - Elias Dahlhaus (CSL, 1987)

Completeness with Respect to Interpretations in Deterministic and Nondeterministic Polynomial Time. - Elias Dahlhaus (CSL, 1988)

Optimal Parallel Algorithm for the Hamiltonian Cycle Problem on Dense Graphs - Elias Dahlhaus; Péter Hajnal; Marek Karpinski (FOCS, 1988)

A Fast Parallel Algorithm for Computing all Maximal Cliques in a Graph and the Related Problems (Extended Abstract). - Elias Dahlhaus; Marek Karpinski (SWAT, 1988)

On the existence of polynomial time algorithms for interpolation problems in propositional logic. - Elias Dahlhaus; Amos Israeli; Johann A. Makowsky (Notre Dame J. Formal Log., 1988)

Parallel Construction of Perfect Matchings and Hamiltonian Cycles on Dense Graphs. - Elias Dahlhaus; Marek Karpinski (Theor. Comput. Sci., 1988)

The Complexity of Subtheories of the Existential Linear Theory of Reals. - Elias Dahlhaus (CSL, 1989)

An Efficient Parallel Algorithm for the Minimal Elimination Ordering (MEO) of an Arbitrary Graph (Extended Abstract) - Elias Dahlhaus; Marek Karpinski (FOCS, 1989)

Fast Parallel Algorithms for the Clique Separator Decomposition. - Elias Dahlhaus; Marek Karpinski; Mark B. Novick (SODA, 1990)

How to Implement First Order Formulas in Local Memory Machine Models. - Elias Dahlhaus (CSL, 1991)

New Parallel Algorithms for Convex Hull and Triangulation in 3-Dimensional Space. - Waldemar Preilowski; Elias Dahlhaus; Gerd Wechsung (MFCS, 1992)

Fast Parallel Algorithm for the Single Link Heuristics of Hierarchical Clustering. - Elias Dahlhaus (SPDP, 1992)

The Complexity of Multiway Cuts (Extended Abstract) - Elias Dahlhaus; David S. Johnson 001; Christos H. Papadimitriou; Paul D. Seymour; Mihalis Yannakakis (STOC, 1992)

Optimal (Parallel) Algorithms for the All-to-All Vertices Distance Problem for Certain Graph Classes. - Elias Dahlhaus (WG, 1992)

An Efficient Parallel Algorithm for Computing a Maximal Independent Set in a Hypergraph of Dimension 3. - Elias Dahlhaus; Marek Karpinski; Pierre Kelsen (Inf. Process. Lett., 1992)

Perfect Matching for Regular Graphs is AC°-Hard for the General Matching Problem. - Elias Dahlhaus; Marek Karpinski (J. Comput. Syst. Sci., 1992)

Query Languages for Hierarchic Databases - Elias Dahlhaus; Johann A. Makowsky (Inf. Comput., 1992)

An Efficient Parallel Recognition Algorithm of Parity Graphs. - Elias Dahlhaus (ICCI, 1993)

The Parallel Complexity of Elimination Ordering Procedures. - Elias Dahlhaus (WG, 1993)

On the Parallel Complexity of Hamiltonian Cycle and Matching Problem on Dense Graphs. - Elias Dahlhaus; Péter Hajnal; Marek Karpinski (J. Algorithms, 1993)

Fast Parallel Recognition of Ultrametrics and Tree Metrics. - Elias Dahlhaus (SIAM J. Discret. Math., 1993)

Efficient Parallel and Linear Time Sequential Split Decomposition (Extended Abstract). - Elias Dahlhaus (FSTTCS, 1994)

Efficient Parallel Algorithms on Chordal Graphs with a Sparse Tree Representations. - Elias Dahlhaus (HICSS (2), 1994)

The Computation of the Jump Number of Convex Graphs. - Elias Dahlhaus (ORDAL, 1994)

On Domination Elimination Orderings and Domination Graphs (Extended Abstract). - Elias Dahlhaus; Peter L. Hammer; Frédéric Maffray; Stephan Olariu (WG, 1994)

A Parallel Algorithm for Computing Steiner Trees in Strongly Chordal Graphs. - Elias Dahlhaus (Discret. Appl. Math., 1994)

The Parallel Solution of Domination Problems on Chordal and Strongly Chordal Graphs. - Elias Dahlhaus; Peter Damaschke (Discret. Appl. Math., 1994)

The Complexity of Multiterminal Cuts. - Elias Dahlhaus; David S. Johnson 001; Christos H. Papadimitriou; Paul D. Seymour; Mihalis Yannakakis (SIAM J. Comput., 1994)

An Efficient Parallel Algorithm for the Minimal Elimination Ordering (MEO) of an Arbitrary Graph. - Elias Dahlhaus; Marek Karpinski (Theor. Comput. Sci., 1994)

Efficient Parallel Modular Decomposition (Extended Abstract). - Elias Dahlhaus (WG, 1995)

Efficient Parallel Recognition Algorithms of Cographs and Distance Hereditary Graphs. - Elias Dahlhaus (Discret. Appl. Math., 1995)

Improved Efficient Parallel Algorithms to Recognize Interval Graphs and Interval Hypergraphs. - Elias Dahlhaus (HICSS (1), 1997)

Efficient and Practical Modular Decomposition. - Elias Dahlhaus; Jens Gustedt; Ross M. McConnell (SODA, 1997)

Sequential and Parallel Algorithms on Compactly Represented Chordal and Strongly Chordal Graphs. - Elias Dahlhaus (STACS, 1997)

Algorithms for the Treewidth and Minimum Fill-in of HHD-Free Graphs. - Hajo Broersma; Elias Dahlhaus; Ton Kloks (WG, 1997)

Minimal Elimination Ordering Inside a Given Chordal Graph. - Elias Dahlhaus (WG, 1997)

Transversal Partitioning in Balanced Hypergraphs. - Elias Dahlhaus; Jan Kratochvíl; Paul D. Manuel; Mirka Miller (Discret. Appl. Math., 1997)

A Linear Time Algorithm to Recognize Clustered Graphs and Its Parallelization. - Elias Dahlhaus (LATIN, 1998)

Minimal Elimination of Planar Graphs. - Elias Dahlhaus (SWAT, 1998)

Minimum Fill-in and Treewidth for Graphs Modularly Decomposable into Chordal Graphs. - Elias Dahlhaus (WG, 1998)

Matching and Multidimensional Matching in Chordal and Strongly Chordal Graphs. - Elias Dahlhaus; Marek Karpinski (Discret. Appl. Math., 1998)

A characterization of strongly chordal graphs. - Elias Dahlhaus; Paul D. Manuel; Mirka Miller (Discret. Math., 1998)

Maximum h-Colourable Subgraph Problem in Balanced Graphs. - Elias Dahlhaus; Paul D. Manuel; Mirka Miller (Inf. Process. Lett., 1998)

The Parallel Complexity of Approximating the High Degree Subgraph Problem. - Alexander E. Andreev; Andrea E. F. Clementi; Pierluigi Crescenzi; Elias Dahlhaus; Sergio De Agostino; José D. P. Rolim (Theor. Comput. Sci., 1998)

A Linear Time Algorithm for Minimum Fill-in and Treewidth for Distance Hereditary Graphs. - Hajo Broersma; Elias Dahlhaus; Ton Kloks (Discret. Appl. Math., 2000)

The train marshalling problem. - Elias Dahlhaus; Peter Horák; Mirka Miller; Joseph F. Ryan 001 (Discret. Appl. Math., 2000)

Parallel Algorithms for Hierarchical Clustering and Applications to Split Decomposition and Parity Graph Recognition. - Elias Dahlhaus (J. Algorithms, 2000)

Efficient and Practical Algorithms for Sequential Modular Decomposition. - Elias Dahlhaus; Jens Gustedt; Ross M. McConnell (J. Algorithms, 2001)

Minimal elimination ordering for graphs of bounded degree. - Elias Dahlhaus (Discret. Appl. Math., 2002)

Partially Complemented Representations of Digraphs. - Elias Dahlhaus; Jens Gustedt; Ross M. McConnell (Discret. Math. Theor. Comput. Sci., 2002)

MAD trees and distance-hereditary graphs. - Elias Dahlhaus; Peter Dankelmann; Wayne Goddard; Henda C. Swart (Discret. Appl. Math., 2003)

A linear-time algorithm to compute a MAD tree of an interval graph. - Elias Dahlhaus; Peter Dankelmann; R. Ravi 001 (Inf. Process. Lett., 2004)

Parallel algorithms for generalized clique transversal problems. - Elias Dahlhaus; Paul D. Manuel; Mirka Miller (Australas. J Comb., 2005)

Sequential and parallel triangulating algorithms for Elimination Game and new insights on Minimum Degree. - Anne Berry; Elias Dahlhaus; Pinar Heggernes; Geneviève Simonet (Theor. Comput. Sci., 2008)

Linear time and almost linear time cases for minimal elimination orderings. - Elias Dahlhaus (CTW, 2013)

Covering Polygons by Min-Area Convex Polygons. - Elias Dahlhaus; Sariel Har-Peled; Alan L. Hu (CoRR, 2019)

A Generalized Approach for Train Marshalling. - Elias Dahlhaus (OR, 2022)

Examples of Clique Closure Systems. - Elias Dahlhaus; Bernhard Ganter (ICFCA, 2023)