( en | de | ru )

 

Disambiguation of "Dahlhaus, Elias"

Author of the publication

copydeleteadd this publication to your clipboard
The Complexity of Multiterminal Cuts.

, , , , and . SIAM J. Comput., 23 (4): 864-894 (1994)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Elias Dahlhaus

Elias Elias

Elias

Helmut Dahlhaus

Reinhard Dahlhaus

 

Other publications of authors with the same name

An Efficient Parallel Algorithm for Computing a Maximal Independent Set in a Hypergraph of Dimension 3., , and . Inf. Process. Lett., 42 (6): 309-313 (1992)Skolem Normal Forms Concerning the Least Fixpoint.. Computation Theory and Logic, volume 270 of Lecture Notes in Computer Science, page 101-106. Springer, (1987)Reduction to NP-complete problems by interpretations.. Logic and Machines, volume 171 of Lecture Notes in Computer Science, page 357-365. Springer, (1983)The Complexity of Subtheories of the Existential Linear Theory of Reals.. CSL, volume 440 of Lecture Notes in Computer Science, page 76-89. Springer, (1989)Efficient Parallel and Linear Time Sequential Split Decomposition (Extended Abstract).. FSTTCS, volume 880 of Lecture Notes in Computer Science, page 171-180. Springer, (1994)A Linear Time Algorithm for Minimum Fill-in and Treewidth for Distance Hereditary Graphs., , and . Discret. Appl. Math., 99 (1-3): 367-400 (2000)Transversal Partitioning in Balanced Hypergraphs., , , and . Discret. Appl. Math., 79 (1-3): 75-89 (1997)The Complexity of Multiterminal Cuts., , , , and . SIAM J. Comput., 23 (4): 864-894 (1994)Query Languages for Hierarchic Databases, and . Inf. Comput., 101 (1): 1-32 (November 1992)A linear-time algorithm to compute a MAD tree of an interval graph., , and . Inf. Process. Lett., 89 (5): 255-259 (2004)