Elias Dahlhaus

Orcid: 0000-0001-8094-4383

According to our database1, Elias Dahlhaus authored at least 64 papers between 1982 and 2023.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Examples of Clique Closure Systems.
Proceedings of the Formal Concept Analysis - 17th International Conference, 2023

2019
Covering Polygons by Min-Area Convex Polygons.
CoRR, 2019

2013
Linear time and almost linear time cases for minimal elimination orderings.
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.
Theor. Comput. Sci., 2008

2005
Parallel algorithms for generalized clique transversal problems.
Australas. J Comb., 2005

2004
A linear-time algorithm to compute a MAD tree of an interval graph.
Inf. Process. Lett., 2004

2003
MAD trees and distance-hereditary graphs.
Discret. Appl. Math., 2003

2002
Partially Complemented Representations of Digraphs.
Discret. Math. Theor. Comput. Sci., 2002

Minimal elimination ordering for graphs of bounded degree.
Discret. Appl. Math., 2002

2001
Efficient and Practical Algorithms for Sequential Modular Decomposition.
J. Algorithms, 2001

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

The train marshalling problem.
Discret. Appl. Math., 2000

A Linear Time Algorithm for Minimum Fill-in and Treewidth for Distance Hereditary Graphs.
Discret. Appl. Math., 2000

1998
The Parallel Complexity of Approximating the High Degree Subgraph Problem.
Theor. Comput. Sci., 1998

Maximum <i>h</i>-Colourable Subgraph Problem in Balanced Graphs.
Inf. Process. Lett., 1998

A characterization of strongly chordal graphs.
Discret. Math., 1998

Matching and Multidimensional Matching in Chordal and Strongly Chordal Graphs.
Discret. Appl. Math., 1998

Minimum Fill-in and Treewidth for Graphs Modularly Decomposable into Chordal Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1998

Minimal Elimination of Planar Graphs.
Proceedings of the Algorithm Theory, 1998

A Linear Time Algorithm to Recognize Clustered Graphs and Its Parallelization.
Proceedings of the LATIN '98: Theoretical Informatics, 1998

1997
Transversal Partitioning in Balanced Hypergraphs.
Discret. Appl. Math., 1997

Minimal Elimination Ordering Inside a Given Chordal Graph.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1997

Algorithms for the Treewidth and Minimum Fill-in of HHD-Free Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1997

Sequential and Parallel Algorithms on Compactly Represented Chordal and Strongly Chordal Graphs.
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.
Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

Improved Efficient Parallel Algorithms to Recognize Interval Graphs and Interval Hypergraphs.
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.
Discret. Appl. Math., 1995

Efficient Parallel Modular Decomposition (Extended Abstract).
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.
Theor. Comput. Sci., 1994

The Complexity of Multiterminal Cuts.
SIAM J. Comput., 1994

The Parallel Solution of Domination Problems on Chordal and Strongly Chordal Graphs.
Discret. Appl. Math., 1994

A Parallel Algorithm for Computing Steiner Trees in Strongly Chordal Graphs.
Discret. Appl. Math., 1994

On Domination Elimination Orderings and Domination Graphs (Extended Abstract).
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1994

The Computation of the Jump Number of Convex Graphs.
Proceedings of the Orders, 1994

Efficient Parallel Algorithms on Chordal Graphs with a Sparse Tree Representations.
Proceedings of the 27th Annual Hawaii International Conference on System Sciences (HICSS-27), 1994

Efficient Parallel and Linear Time Sequential Split Decomposition (Extended Abstract).
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1994

1993
Fast Parallel Recognition of Ultrametrics and Tree Metrics.
SIAM J. Discret. Math., 1993

On the Parallel Complexity of Hamiltonian Cycle and Matching Problem on Dense Graphs.
J. Algorithms, 1993

The Parallel Complexity of Elimination Ordering Procedures.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1993

An Efficient Parallel Recognition Algorithm of Parity Graphs.
Proceedings of the Computing and Information, 1993

1992
Query Languages for Hierarchic Databases
Inf. Comput., November, 1992

Perfect Matching for Regular Graphs is AC°-Hard for the General Matching Problem.
J. Comput. Syst. Sci., 1992

An Efficient Parallel Algorithm for Computing a Maximal Independent Set in a Hypergraph of Dimension 3.
Inf. Process. Lett., 1992

Optimal (Parallel) Algorithms for the All-to-All Vertices Distance Problem for Certain Graph Classes.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1992

The Complexity of Multiway Cuts (Extended Abstract)
Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992

Fast Parallel Algorithm for the Single Link Heuristics of Hierarchical Clustering.
Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing, 1992

New Parallel Algorithms for Convex Hull and Triangulation in 3-Dimensional Space.
Proceedings of the Mathematical Foundations of Computer Science 1992, 1992

1991
How to Implement First Order Formulas in Local Memory Machine Models.
Proceedings of the Computer Science Logic, 5th Workshop, 1991

1990
Fast Parallel Algorithms for the Clique Separator Decomposition.
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)
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.
Proceedings of the CSL '89, 1989

1988
Parallel Construction of Perfect Matchings and Hamiltonian Cycles on Dense Graphs.
Theor. Comput. Sci., 1988

On the existence of polynomial time algorithms for interpolation problems in propositional logic.
Notre Dame J. Formal Log., 1988

A Fast Parallel Algorithm for Computing all Maximal Cliques in a Graph and the Related Problems (Extended Abstract).
Proceedings of the SWAT 88, 1988

Optimal Parallel Algorithm for the Hamiltonian Cycle Problem on Dense Graphs
Proceedings of the 29th Annual Symposium on Foundations of Computer Science, 1988

Completeness with Respect to Interpretations in Deterministic and Nondeterministic Polynomial Time.
Proceedings of the CSL '88, 1988

1987
Is SETL a Suitable Language for Parallel Programming - A Theoretical Approach.
Proceedings of the CSL '87, 1987

Skolem Normal Forms Concerning the Least Fixpoint.
Proceedings of the Computation Theory and Logic, In Memory of Dieter Rödding, 1987

1986
Membership for Growing Context-Sensitive Grammars is Polynomial.
J. Comput. Syst. Sci., 1986

The Choice of Programming Primitives for SETL-Like Programming Languages.
Proceedings of the ESOP 86, 1986

Computable Directory Queries.
Proceedings of the CAAP '86, 1986

1985
Concerning Two-Adjacent Context-Free Languages.
Theor. Comput. Sci., 1985

1983
Reduction to NP-complete problems by interpretations.
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.
PhD thesis, 1982


  Loading...