Elias Dahlhaus

ORCID

Publication Activity (10 Years)

Years Active: 1983-2023
Publications (10 Years): 2

Top Venues

ICFCA

CoRR

CTW

Technical University of Berlin, Germany (PHD)

Education History

Technical University of Berlin, Germany

PHD

Publications

Elias Dahlhaus, Bernhard Ganter
Examples of Clique Closure Systems. ICFCA (2023)
Elias Dahlhaus, Sariel Har-Peled, Alan L. Hu
Covering Polygons by Min-Area Convex Polygons. CoRR (2019)
Elias Dahlhaus
Linear time and almost linear time cases for minimal elimination orderings. CTW (2013)
Anne Berry, Elias Dahlhaus, Pinar Heggernes, Geneviève Simonet
Sequential and parallel triangulating algorithms for Elimination Game and new insights on Minimum Degree. Theor. Comput. Sci. 409 (3) (2008)
Elias Dahlhaus, Paul D. Manuel, Mirka Miller
Parallel algorithms for generalized clique transversal problems. Australas. J Comb. 33 (2005)
Elias Dahlhaus, Peter Dankelmann, R. Ravi
A linear-time algorithm to compute a MAD tree of an interval graph. Inf. Process. Lett. 89 (5) (2004)
Elias Dahlhaus, Peter Dankelmann, Wayne Goddard, Henda C. Swart
MAD trees and distance-hereditary graphs. Discret. Appl. Math. 131 (1) (2003)
Elias Dahlhaus
Minimal elimination ordering for graphs of bounded degree. Discret. Appl. Math. 116 (1-2) (2002)
Elias Dahlhaus, Jens Gustedt, Ross M. McConnell
Partially Complemented Representations of Digraphs. Discret. Math. Theor. Comput. Sci. 5 (1) (2002)
Elias Dahlhaus, Jens Gustedt, Ross M. McConnell
Efficient and Practical Algorithms for Sequential Modular Decomposition. J. Algorithms 41 (2) (2001)
Elias Dahlhaus, Peter Horák, Mirka Miller, Joseph F. Ryan
The train marshalling problem. Discret. Appl. Math. 103 (1-3) (2000)
Elias Dahlhaus
Parallel Algorithms for Hierarchical Clustering and Applications to Split Decomposition and Parity Graph Recognition. J. Algorithms 36 (2) (2000)
Hajo Broersma, Elias Dahlhaus, Ton Kloks
A Linear Time Algorithm for Minimum Fill-in and Treewidth for Distance Hereditary Graphs. Discret. Appl. Math. 99 (1-3) (2000)
Elias Dahlhaus
A Linear Time Algorithm to Recognize Clustered Graphs and Its Parallelization. LATIN (1998)
Alexander E. Andreev, Andrea E. F. Clementi, Pierluigi Crescenzi, Elias Dahlhaus, Sergio De Agostino, José D. P. Rolim
The Parallel Complexity of Approximating the High Degree Subgraph Problem. Theor. Comput. Sci. 205 (1-2) (1998)
Elias Dahlhaus, Paul D. Manuel, Mirka Miller
-Colourable Subgraph Problem in Balanced Graphs. Inf. Process. Lett. 65 (6) (1998)
Elias Dahlhaus, Marek Karpinski
Matching and Multidimensional Matching in Chordal and Strongly Chordal Graphs. Discret. Appl. Math. 84 (1-3) (1998)
Elias Dahlhaus
Minimum Fill-in and Treewidth for Graphs Modularly Decomposable into Chordal Graphs. WG (1998)
Elias Dahlhaus, Paul D. Manuel, Mirka Miller
A characterization of strongly chordal graphs. Discret. Math. 187 (1-3) (1998)
Elias Dahlhaus
Minimal Elimination of Planar Graphs. SWAT (1998)
Elias Dahlhaus
Minimal Elimination Ordering Inside a Given Chordal Graph. WG (1997)
Elias Dahlhaus, Jan Kratochvíl, Paul D. Manuel, Mirka Miller
Transversal Partitioning in Balanced Hypergraphs. Discret. Appl. Math. 79 (1-3) (1997)
Elias Dahlhaus, Jens Gustedt, Ross M. McConnell
Efficient and Practical Modular Decomposition. SODA (1997)
Hajo Broersma, Elias Dahlhaus, Ton Kloks
Algorithms for the Treewidth and Minimum Fill-in of HHD-Free Graphs. WG (1997)
Elias Dahlhaus
Improved Efficient Parallel Algorithms to Recognize Interval Graphs and Interval Hypergraphs. HICSS (1) (1997)
Elias Dahlhaus
Sequential and Parallel Algorithms on Compactly Represented Chordal and Strongly Chordal Graphs. STACS (1997)
Elias Dahlhaus
Efficient Parallel Recognition Algorithms of Cographs and Distance Hereditary Graphs. Discret. Appl. Math. 57 (1) (1995)
Elias Dahlhaus
Efficient Parallel Modular Decomposition (Extended Abstract). WG (1995)
Alexander E. Andreev, Andrea E. F. Clementi, Pierluigi Crescenzi, Elias Dahlhaus, Sergio De Agostino, José D. P. Rolim
The Parallel Complexity of Approximating the High Degree Subgraph Problem. ISAAC (1995)
Elias Dahlhaus
Efficient Parallel Algorithms on Chordal Graphs with a Sparse Tree Representations. HICSS (2) (1994)
Elias Dahlhaus
Efficient Parallel and Linear Time Sequential Split Decomposition (Extended Abstract). FSTTCS (1994)
Elias Dahlhaus
A Parallel Algorithm for Computing Steiner Trees in Strongly Chordal Graphs. Discret. Appl. Math. 51 (1-2) (1994)
Elias Dahlhaus, David S. Johnson, Christos H. Papadimitriou, Paul D. Seymour, Mihalis Yannakakis
The Complexity of Multiterminal Cuts. SIAM J. Comput. 23 (4) (1994)
Elias Dahlhaus, Peter L. Hammer, Frédéric Maffray, Stephan Olariu
On Domination Elimination Orderings and Domination Graphs (Extended Abstract). WG (1994)
Elias Dahlhaus
The Computation of the Jump Number of Convex Graphs. ORDAL (1994)
Elias Dahlhaus, Peter Damaschke
The Parallel Solution of Domination Problems on Chordal and Strongly Chordal Graphs. Discret. Appl. Math. 52 (3) (1994)
Elias Dahlhaus, Marek Karpinski
An Efficient Parallel Algorithm for the Minimal Elimination Ordering (MEO) of an Arbitrary Graph. Theor. Comput. Sci. 134 (2) (1994)
Elias Dahlhaus
Fast Parallel Recognition of Ultrametrics and Tree Metrics. SIAM J. Discret. Math. 6 (4) (1993)
Elias Dahlhaus
The Parallel Complexity of Elimination Ordering Procedures. WG (1993)
Elias Dahlhaus
An Efficient Parallel Recognition Algorithm of Parity Graphs. ICCI (1993)
Elias Dahlhaus, Péter Hajnal, Marek Karpinski
On the Parallel Complexity of Hamiltonian Cycle and Matching Problem on Dense Graphs. J. Algorithms 15 (3) (1993)
Elias Dahlhaus
Optimal (Parallel) Algorithms for the All-to-All Vertices Distance Problem for Certain Graph Classes. WG (1992)
Waldemar Preilowski, Elias Dahlhaus, Gerd Wechsung
New Parallel Algorithms for Convex Hull and Triangulation in 3-Dimensional Space. MFCS (1992)
Elias Dahlhaus, Johann A. Makowsky
Query Languages for Hierarchic Databases Inf. Comput. 101 (1) (1992)
Elias Dahlhaus, Marek Karpinski, Pierre Kelsen
An Efficient Parallel Algorithm for Computing a Maximal Independent Set in a Hypergraph of Dimension 3. Inf. Process. Lett. 42 (6) (1992)
Elias Dahlhaus, Marek Karpinski
Perfect Matching for Regular Graphs is AC°-Hard for the General Matching Problem. J. Comput. Syst. Sci. 44 (1) (1992)
Elias Dahlhaus
Fast Parallel Algorithm for the Single Link Heuristics of Hierarchical Clustering. SPDP (1992)
Elias Dahlhaus, David S. Johnson, Christos H. Papadimitriou, Paul D. Seymour, Mihalis Yannakakis
The Complexity of Multiway Cuts (Extended Abstract) STOC (1992)
Elias Dahlhaus
How to Implement First Order Formulas in Local Memory Machine Models. CSL (1991)
Elias Dahlhaus, Marek Karpinski, Mark B. Novick
Fast Parallel Algorithms for the Clique Separator Decomposition. SODA (1990)
Elias Dahlhaus
The Complexity of Subtheories of the Existential Linear Theory of Reals. CSL (1989)
Elias Dahlhaus, Marek Karpinski
An Efficient Parallel Algorithm for the Minimal Elimination Ordering (MEO) of an Arbitrary Graph (Extended Abstract) FOCS (1989)
Elias Dahlhaus, Péter Hajnal, Marek Karpinski
Optimal Parallel Algorithm for the Hamiltonian Cycle Problem on Dense Graphs FOCS (1988)
Elias Dahlhaus
Completeness with Respect to Interpretations in Deterministic and Nondeterministic Polynomial Time. CSL (1988)
Elias Dahlhaus, Marek Karpinski
Parallel Construction of Perfect Matchings and Hamiltonian Cycles on Dense Graphs. Theor. Comput. Sci. 61 (1988)
Elias Dahlhaus, Amos Israeli, Johann A. Makowsky
On the existence of polynomial time algorithms for interpolation problems in propositional logic. Notre Dame J. Formal Log. 29 (4) (1988)
Elias Dahlhaus, Marek Karpinski
A Fast Parallel Algorithm for Computing all Maximal Cliques in a Graph and the Related Problems (Extended Abstract). SWAT (1988)
Elias Dahlhaus
Skolem Normal Forms Concerning the Least Fixpoint. Computation Theory and Logic (1987)
Elias Dahlhaus
Is SETL a Suitable Language for Parallel Programming - A Theoretical Approach. CSL (1987)
Elias Dahlhaus, Manfred K. Warmuth
Membership for Growing Context-Sensitive Grammars is Polynomial. J. Comput. Syst. Sci. 33 (3) (1986)
Elias Dahlhaus, Manfred K. Warmuth
Membership for Growing Context Sensitive Grammars is Polynomial. CAAP (1986)
Elias Dahlhaus, Johann A. Makowsky
The Choice of Programming Primitives for SETL-Like Programming Languages. ESOP (1986)
Elias Dahlhaus, Johann A. Makowsky
Computable Directory Queries. CAAP (1986)
Elias Dahlhaus, Haim Gaifman
Concerning Two-Adjacent Context-Free Languages. Theor. Comput. Sci. 41 (1985)
Elias Dahlhaus
Reduction to NP-complete problems by interpretations. Logic and Machines (1983)

Elias Dahlhaus.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Elias Dahlhaus