Elias Dahlhaus - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 64 from 64

2013

Linear time and almost linear time cases for minimal elimination orderingsElias Dahlhaus. colognetwente 2013: 75-78

2008

Sequential and parallel triangulating algorithms for Elimination Game and new insights on Minimum DegreeAnne Berry, Elias Dahlhaus, Pinar Heggernes, Geneviève Simonet. TCS, 409(3):601-616, 2008. [doi]

2005

Parallel algorithms for generalized clique transversal problemsElias Dahlhaus, Paul D. Manuel, Mirka Miller. ajc, 33:3-14, 2005. [doi]

2004

A linear-time algorithm to compute a MAD tree of an interval graphElias Dahlhaus, Peter Dankelmann, R. Ravi. ipl, 89(5):255-259, 2004. [doi]

2003

MAD trees and distance-hereditary graphsElias Dahlhaus, Peter Dankelmann, Wayne Goddard, Henda C. Swart. DAM, 131(1):151-167, 2003. [doi]

2002

Minimal elimination ordering for graphs of bounded degreeElias Dahlhaus. DAM, 116(1-2):127-143, 2002.

Partially Complemented Representations of DigraphsElias Dahlhaus, Jens Gustedt, Ross M. McConnell. dmtcs, 5(1):147-168, 2002. [doi]

2001

Efficient and Practical Algorithms for Sequential Modular DecompositionElias Dahlhaus, Jens Gustedt, Ross M. McConnell. jal, 41(2):360-387, 2001. [doi]

2000

A Linear Time Algorithm for Minimum Fill-in and Treewidth for Distance Hereditary GraphsHajo Broersma, Elias Dahlhaus, Ton Kloks. DAM, 99(1-3):367-400, 2000. [doi]

Parallel Algorithms for Hierarchical Clustering and Applications to Split Decomposition and Parity Graph RecognitionElias Dahlhaus. jal, 36(2):205-240, 2000.

The train marshalling problemElias Dahlhaus, Peter Horák, Mirka Miller, Joseph F. Ryan. DAM, 103(1-3):41-54, 2000.

1998

The Parallel Complexity of Approximating the High Degree Subgraph ProblemAlexander E. Andreev, Andrea E. F. Clementi, Pierluigi Crescenzi, Elias Dahlhaus, Sergio De Agostino, José D. P. Rolim. TCS, 205(1-2):261-282, 1998. [doi]

A Linear Time Algorithm to Recognize Clustered Graphs and Its ParallelizationElias Dahlhaus. latin 1998: 239-248 [doi]

Minimum Fill-in and Treewidth for Graphs Modularly Decomposable into Chordal GraphsElias Dahlhaus. criwg 1998: 351-358

Minimal Elimination of Planar GraphsElias Dahlhaus. swat 1998: 210-221 [doi]

Matching and Multidimensional Matching in Chordal and Strongly Chordal GraphsElias Dahlhaus, Marek Karpinski. DAM, 84(1-3):79-91, 1998. [doi]

Maximum ::::h::::-Colourable Subgraph Problem in Balanced GraphsElias Dahlhaus, Paul D. Manuel, Mirka Miller. ipl, 65(6):301-303, 1998. [doi]

A characterization of strongly chordal graphsElias Dahlhaus, Paul D. Manuel, Mirka Miller. DM, 187(1-3):269-271, 1998. [doi]

1997

1995

The Parallel Complexity of Approximating the High Degree Subgraph ProblemAlexander E. Andreev, Andrea E. F. Clementi, Pierluigi Crescenzi, Elias Dahlhaus, Sergio De Agostino, José D. P. Rolim. isaac 1995: 132-141

Efficient Parallel Modular Decomposition (Extended Abstract)Elias Dahlhaus. criwg 1995: 290-302

Efficient Parallel Recognition Algorithms of Cographs and Distance Hereditary GraphsElias Dahlhaus. DAM, 57(1):29-44, 1995. [doi]

1994

Efficient Parallel Algorithms on Chordal Graphs with a Sparse Tree RepresentationsElias Dahlhaus. hicss 1994: 150-158

Efficient Parallel and Linear Time Sequential Split Decomposition (Extended Abstract)Elias Dahlhaus. fsttcs 1994: 171-180

The Computation of the Jump Number of Convex GraphsElias Dahlhaus. ordal 1994: 176-185

An Efficient Parallel Algorithm for the Minimal Elimination Ordering (MEO) of an Arbitrary GraphElias Dahlhaus, Marek Karpinski. TCS, 134(2):493-528, 1994.

A Parallel Algorithm for Computing Steiner Trees in Strongly Chordal GraphsElias Dahlhaus. DAM, 51(1-2):47-61, 1994. [doi]

The Parallel Solution of Domination Problems on Chordal and Strongly Chordal GraphsElias Dahlhaus, Peter Damaschke. DAM, 52(3):261-273, 1994. [doi]

On Domination Elimination Orderings and Domination Graphs (Extended Abstract)Elias Dahlhaus, Peter L. Hammer, Frédéric Maffray, Stephan Olariu. criwg 1995: 81-92

The Complexity of Multiterminal CutsElias Dahlhaus, David S. Johnson, Christos H. Papadimitriou, Paul D. Seymour, Mihalis Yannakakis. SICOMP, 23(4):864-894, 1994.

1993

The Parallel Complexity of Elimination Ordering ProceduresElias Dahlhaus. criwg 1994: 225-236

An Efficient Parallel Recognition Algorithm of Parity GraphsElias Dahlhaus. icci 1993: 82-86

Fast Parallel Recognition of Ultrametrics and Tree MetricsElias Dahlhaus. siamdm, 6(4):523-532, 1993.

On the Parallel Complexity of Hamiltonian Cycle and Matching Problem on Dense GraphsElias Dahlhaus, Péter Hajnal, Marek Karpinski. jal, 15(3):367-384, 1993.

1992

Optimal (Parallel) Algorithms for the All-to-All Vertices Distance Problem for Certain Graph ClassesElias Dahlhaus. criwg 1993: 60-69

Fast Parallel Algorithm for the Single Link Heuristics of Hierarchical ClusteringElias Dahlhaus. spdp 1992: 184-187

Perfect Matching for Regular Graphs is AC°-Hard for the General Matching ProblemElias Dahlhaus, Marek Karpinski. jcss, 44(1):94-102, 1992.

An Efficient Parallel Algorithm for Computing a Maximal Independent Set in a Hypergraph of Dimension 3Elias Dahlhaus, Marek Karpinski, Pierre Kelsen. ipl, 42(6):309-313, 1992.

Query Languages for Hierarchic DatabasesElias Dahlhaus, Johann A. Makowsky. iandc, 101(1):1-32, November 1992.

The Complexity of Multiway Cuts (Extended Abstract)Elias Dahlhaus, David S. Johnson, Christos H. Papadimitriou, Paul D. Seymour, Mihalis Yannakakis. stoc 1992: 241-251

New Parallel Algorithms for Convex Hull and Triangulation in 3-Dimensional SpaceW. Preilowski, Elias Dahlhaus, Gerd Wechsung. mfcs 1992: 442-450

1991

How to Implement First Order Formulas in Local Memory Machine ModelsElias Dahlhaus. csl 1992: 68-78

1990

Fast Parallel Algorithms for the Clique Separator DecompositionElias Dahlhaus, Marek Karpinski, Mark B. Novick. soda 1990: 244-251

1989

The Complexity of Subtheories of the Existential Linear Theory of RealsElias Dahlhaus. csl 1990: 76-89

An Efficient Parallel Algorithm for the Minimal Elimination Ordering (MEO) of an Arbitrary Graph (Extended Abstract)Elias Dahlhaus, Marek Karpinski. focs 1989: 454-459

1988

1987

Is SETL a Suitable Language for Parallel Programming - A Theoretical ApproachElias Dahlhaus. csl 1988: 56-63

Skolem Normal Forms Concerning the Least FixpointElias Dahlhaus. BIRTHDAY 1987: 101-106

1986

Computable Directory QueriesElias Dahlhaus, Johann A. Makowsky. caap 1986: 254-265

The Choice of Programming Primitives for SETL-Like Programming LanguagesElias Dahlhaus, Johann A. Makowsky. ESOP 1986: 160-172

Membership for Growing Context-Sensitive Grammars is PolynomialElias Dahlhaus, Manfred K. Warmuth. jcss, 33(3):456-472, 1986.

Membership for Growing Context Sensitive Grammars is PolynomialElias Dahlhaus, Manfred K. Warmuth. caap 1986: 85-99

1985

Concerning Two-Adjacent Context-Free LanguagesElias Dahlhaus, Haim Gaifman. TCS, 41:169-184, 1985.

1983

Reduction to NP-complete problems by interpretationsElias Dahlhaus. prolamat 1984: 357-365

1982

Kombinatorische und logische Eigenschaften von Reduktionen auf einige vollständige Probleme in NP und NL mit einigen FolgerungenElias Dahlhaus. PhD thesis, Technical University of Berlin, Germany, 1982. [doi]

Sign in or sign up to see more results.

runs on WebDSL