Elias Dahlhaus

According to our database, Elias Dahlhaus authored at least 65 papers between 1982 and 2023.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2023

Examples of Clique Closure Systems.

Elias Dahlhaus, Bernhard Ganter

Proceedings of the Formal Concept Analysis - 17th International Conference, 2023

2022

A Generalized Approach for Train Marshalling.

Elias Dahlhaus

Proceedings of the Operations Research Proceedings 2022: Selected Papers of the Annual International Conference of the German Operations Research Society (GOR), 2022

2019

Covering Polygons by Min-Area Convex Polygons.

Elias Dahlhaus, Sariel Har-Peled, Alan L. Hu

CoRR, 2019

2013

Linear time and almost linear time cases for minimal elimination orderings.

Elias Dahlhaus

Proceedings of the 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2013

2008

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

2005

Parallel algorithms for generalized clique transversal problems.

Elias Dahlhaus, Paul D. Manuel, Mirka Miller

Australas. J Comb., 2005

2004

A linear-time algorithm to compute a MAD tree of an interval graph.

Elias Dahlhaus, Peter Dankelmann, R. Ravi

Inf. Process. Lett., 2004

2003

MAD trees and distance-hereditary graphs.

Elias Dahlhaus, Peter Dankelmann, Wayne Goddard, Henda C. Swart

Discret. Appl. Math., 2003

2002

Partially Complemented Representations of Digraphs.

Elias Dahlhaus, Jens Gustedt, Ross M. McConnell

Discret. Math. Theor. Comput. Sci., 2002

Minimal elimination ordering for graphs of bounded degree.

Elias Dahlhaus

Discret. Appl. Math., 2002

2001

Efficient and Practical Algorithms for Sequential Modular Decomposition.

Elias Dahlhaus, Jens Gustedt, Ross M. McConnell

J. Algorithms, 2001

2000

Parallel Algorithms for Hierarchical Clustering and Applications to Split Decomposition and Parity Graph Recognition.

Elias Dahlhaus

J. Algorithms, 2000

The train marshalling problem.

Elias Dahlhaus, Peter Horák, Mirka Miller, Joseph F. Ryan

Discret. Appl. Math., 2000

A Linear Time Algorithm for Minimum Fill-in and Treewidth for Distance Hereditary Graphs.

Hajo Broersma, Elias Dahlhaus, Ton Kloks

Discret. Appl. Math., 2000

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

Maximum <i>h</i>-Colourable Subgraph Problem in Balanced Graphs.

Elias Dahlhaus, Paul D. Manuel, Mirka Miller

Inf. Process. Lett., 1998

A characterization of strongly chordal graphs.

Elias Dahlhaus, Paul D. Manuel, Mirka Miller

Discret. Math., 1998

Matching and Multidimensional Matching in Chordal and Strongly Chordal Graphs.

Elias Dahlhaus, Marek Karpinski

Discret. Appl. Math., 1998

Minimum Fill-in and Treewidth for Graphs Modularly Decomposable into Chordal Graphs.

Elias Dahlhaus

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1998

Minimal Elimination of Planar Graphs.

Elias Dahlhaus

Proceedings of the Algorithm Theory, 1998

A Linear Time Algorithm to Recognize Clustered Graphs and Its Parallelization.

Elias Dahlhaus

Proceedings of the LATIN '98: Theoretical Informatics, 1998

1997

Transversal Partitioning in Balanced Hypergraphs.

Elias Dahlhaus, Jan Kratochvíl, Paul D. Manuel, Mirka Miller

Discret. Appl. Math., 1997

Minimal Elimination Ordering Inside a Given Chordal Graph.

Elias Dahlhaus

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1997

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

Hajo Broersma, Elias Dahlhaus, Ton Kloks

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1997

Sequential and Parallel Algorithms on Compactly Represented Chordal and Strongly Chordal Graphs.

Elias Dahlhaus

Proceedings of the STACS 97, 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27, 1997

Efficient and Practical Modular Decomposition.

Elias Dahlhaus, Jens Gustedt, Ross M. McConnell

Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

Improved Efficient Parallel Algorithms to Recognize Interval Graphs and Interval Hypergraphs.

Elias Dahlhaus

Proceedings of the 30th Annual Hawaii International Conference on System Sciences (HICSS-30), 1997

1995

Efficient Parallel Recognition Algorithms of Cographs and Distance Hereditary Graphs.

Elias Dahlhaus

Discret. Appl. Math., 1995

Efficient Parallel Modular Decomposition (Extended Abstract).

Elias Dahlhaus

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1995

1994

An Efficient Parallel Algorithm for the Minimal Elimination Ordering (MEO) of an Arbitrary Graph.

Elias Dahlhaus, Marek Karpinski

Theor. Comput. Sci., 1994

The Complexity of Multiterminal Cuts.

Elias Dahlhaus, David S. Johnson, Christos H. Papadimitriou, Paul D. Seymour, Mihalis Yannakakis

SIAM J. Comput., 1994

The Parallel Solution of Domination Problems on Chordal and Strongly Chordal Graphs.

Elias Dahlhaus, Peter Damaschke

Discret. Appl. Math., 1994

A Parallel Algorithm for Computing Steiner Trees in Strongly Chordal Graphs.

Elias Dahlhaus

Discret. Appl. Math., 1994

On Domination Elimination Orderings and Domination Graphs (Extended Abstract).

Elias Dahlhaus, Peter L. Hammer, Frédéric Maffray, Stephan Olariu

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1994

The Computation of the Jump Number of Convex Graphs.

Elias Dahlhaus

Proceedings of the Orders, 1994

Efficient Parallel Algorithms on Chordal Graphs with a Sparse Tree Representations.

Elias Dahlhaus

Proceedings of the 27th Annual Hawaii International Conference on System Sciences (HICSS-27), 1994

Efficient Parallel and Linear Time Sequential Split Decomposition (Extended Abstract).

Elias Dahlhaus

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1994

1993

Fast Parallel Recognition of Ultrametrics and Tree Metrics.

Elias Dahlhaus

SIAM J. Discret. Math., 1993

On the Parallel Complexity of Hamiltonian Cycle and Matching Problem on Dense Graphs.

Elias Dahlhaus, Péter Hajnal, Marek Karpinski

J. Algorithms, 1993

The Parallel Complexity of Elimination Ordering Procedures.

Elias Dahlhaus

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1993

An Efficient Parallel Recognition Algorithm of Parity Graphs.

Elias Dahlhaus

Proceedings of the Computing and Information, 1993

1992

Query Languages for Hierarchic Databases

Elias Dahlhaus, Johann A. Makowsky

Inf. Comput., November, 1992

Perfect Matching for Regular Graphs is AC°-Hard for the General Matching Problem.

Elias Dahlhaus, Marek Karpinski

J. Comput. Syst. Sci., 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

Optimal (Parallel) Algorithms for the All-to-All Vertices Distance Problem for Certain Graph Classes.

Elias Dahlhaus

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1992

The Complexity of Multiway Cuts (Extended Abstract)

Elias Dahlhaus, David S. Johnson, Christos H. Papadimitriou, Paul D. Seymour, Mihalis Yannakakis

Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992

Fast Parallel Algorithm for the Single Link Heuristics of Hierarchical Clustering.

Elias Dahlhaus

Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing, 1992

New Parallel Algorithms for Convex Hull and Triangulation in 3-Dimensional Space.

Waldemar Preilowski, Elias Dahlhaus, Gerd Wechsung

Proceedings of the Mathematical Foundations of Computer Science 1992, 1992

1991

How to Implement First Order Formulas in Local Memory Machine Models.

Elias Dahlhaus

Proceedings of the Computer Science Logic, 5th Workshop, 1991

1990

Fast Parallel Algorithms for the Clique Separator Decomposition.

Elias Dahlhaus, Marek Karpinski, Mark B. Novick

Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, 1990

1989

An Efficient Parallel Algorithm for the Minimal Elimination Ordering (MEO) of an Arbitrary Graph (Extended Abstract)

Elias Dahlhaus, Marek Karpinski

Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989

The Complexity of Subtheories of the Existential Linear Theory of Reals.

Elias Dahlhaus

Proceedings of the CSL '89, 1989

1988

Parallel Construction of Perfect Matchings and Hamiltonian Cycles on Dense Graphs.

Elias Dahlhaus, Marek Karpinski

Theor. Comput. Sci., 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

A Fast Parallel Algorithm for Computing all Maximal Cliques in a Graph and the Related Problems (Extended Abstract).

Elias Dahlhaus, Marek Karpinski

Proceedings of the SWAT 88, 1988

Optimal Parallel Algorithm for the Hamiltonian Cycle Problem on Dense Graphs

Elias Dahlhaus, Péter Hajnal, Marek Karpinski

Proceedings of the 29th Annual Symposium on Foundations of Computer Science, 1988

Completeness with Respect to Interpretations in Deterministic and Nondeterministic Polynomial Time.

Elias Dahlhaus

Proceedings of the CSL '88, 1988

1987

Is SETL a Suitable Language for Parallel Programming - A Theoretical Approach.

Elias Dahlhaus

Proceedings of the CSL '87, 1987

Skolem Normal Forms Concerning the Least Fixpoint.

Elias Dahlhaus

Proceedings of the Computation Theory and Logic, In Memory of Dieter Rödding, 1987

1986

Membership for Growing Context-Sensitive Grammars is Polynomial.

Elias Dahlhaus, Manfred K. Warmuth

J. Comput. Syst. Sci., 1986

The Choice of Programming Primitives for SETL-Like Programming Languages.

Elias Dahlhaus, Johann A. Makowsky

Proceedings of the ESOP 86, 1986

Computable Directory Queries.

Elias Dahlhaus, Johann A. Makowsky

Proceedings of the CAAP '86, 1986

1985

Concerning Two-Adjacent Context-Free Languages.

Elias Dahlhaus, Haim Gaifman

Theor. Comput. Sci., 1985

1983

Reduction to NP-complete problems by interpretations.

Elias Dahlhaus

Proceedings of the Logic and Machines: Decision Problems and Complexity, 1983

1982

Kombinatorische und logische Eigenschaften von Reduktionen auf einige vollständige Probleme in NP und NL mit einigen Folgerungen.

Elias Dahlhaus

PhD thesis, 1982