The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Elias Dahlhaus: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Elias Dahlhaus, Johann A. Makowsky
    Computable Directory Queries. [Citation Graph (3, 0)][DBLP]
    CAAP, 1986, pp:254-265 [Conf]
  2. Elias Dahlhaus, David S. Johnson, Christos H. Papadimitriou, Paul D. Seymour, Mihalis Yannakakis
    The Complexity of Multiway Cuts (Extended Abstract) [Citation Graph (2, 0)][DBLP]
    STOC, 1992, pp:241-251 [Conf]
  3. Elias Dahlhaus
    Is SETL a Suitable Language for Parallel Programming - A Theoretical Approach. [Citation Graph (1, 0)][DBLP]
    CSL, 1987, pp:56-63 [Conf]
  4. Elias Dahlhaus, Johann A. Makowsky
    The Choice of Programming Primitives for SETL-Like Programming Languages. [Citation Graph (1, 0)][DBLP]
    ESOP, 1986, pp:160-172 [Conf]
  5. Elias Dahlhaus
    Skolem Normal Forms Concerning the Least Fixpoint. [Citation Graph (0, 0)][DBLP]
    Computation Theory and Logic, 1987, pp:101-106 [Conf]
  6. Elias Dahlhaus, Manfred K. Warmuth
    Membership for Growing Context Sensitive Grammars is Polynomial. [Citation Graph (0, 0)][DBLP]
    CAAP, 1986, pp:85-99 [Conf]
  7. Elias Dahlhaus
    Completeness with Respect to Interpretations in Deterministic and Nondeterministic Polynomial Time. [Citation Graph (0, 0)][DBLP]
    CSL, 1988, pp:52-62 [Conf]
  8. Elias Dahlhaus
    The Complexity of Subtheories of the Existential Linear Theory of Reals. [Citation Graph (0, 0)][DBLP]
    CSL, 1989, pp:76-89 [Conf]
  9. Elias Dahlhaus
    How to Implement First Order Formulas in Local Memory Machine Models. [Citation Graph (0, 0)][DBLP]
    CSL, 1991, pp:68-78 [Conf]
  10. Elias Dahlhaus, Péter Hajnal, Marek Karpinski
    Optimal Parallel Algorithm for the Hamiltonian Cycle Problem on Dense Graphs [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:186-193 [Conf]
  11. Elias Dahlhaus, Marek Karpinski
    An Efficient Parallel Algorithm for the Minimal Elimination Ordering (MEO) of an Arbitrary Graph (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1989, pp:454-459 [Conf]
  12. Elias Dahlhaus
    Efficient Parallel and Linear Time Sequential Split Decomposition (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1994, pp:171-180 [Conf]
  13. Elias Dahlhaus
    Efficient Parallel Algorithms on Chordal Graphs with a Sparse Tree Representations. [Citation Graph (0, 0)][DBLP]
    HICSS (2), 1994, pp:150-158 [Conf]
  14. Elias Dahlhaus
    Improved Efficient Parallel Algorithms to Recognize Interval Graphs and Interval Hypergraphs. [Citation Graph (0, 0)][DBLP]
    HICSS (1), 1997, pp:172-181 [Conf]
  15. Elias Dahlhaus
    An Efficient Parallel Recognition Algorithm of Parity Graphs. [Citation Graph (0, 0)][DBLP]
    ICCI, 1993, pp:82-86 [Conf]
  16. 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. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1995, pp:132-141 [Conf]
  17. Elias Dahlhaus
    Reduction to NP-complete problems by interpretations. [Citation Graph (0, 0)][DBLP]
    Logic and Machines, 1983, pp:357-365 [Conf]
  18. Elias Dahlhaus
    A Linear Time Algorithm to Recognize Clustered Graphs and Its Parallelization. [Citation Graph (0, 0)][DBLP]
    LATIN, 1998, pp:239-248 [Conf]
  19. W. Preilowski, Elias Dahlhaus, Gerd Wechsung
    New Parallel Algorithms for Convex Hull and Triangulation in 3-Dimensional Space. [Citation Graph (0, 0)][DBLP]
    MFCS, 1992, pp:442-450 [Conf]
  20. Elias Dahlhaus
    The Computation of the Jump Number of Convex Graphs. [Citation Graph (0, 0)][DBLP]
    ORDAL, 1994, pp:176-185 [Conf]
  21. Elias Dahlhaus, Jens Gustedt, Ross M. McConnell
    Efficient and Practical Modular Decomposition. [Citation Graph (0, 0)][DBLP]
    SODA, 1997, pp:26-35 [Conf]
  22. Elias Dahlhaus, Marek Karpinski, Mark B. Novick
    Fast Parallel Algorithms for the Clique Separator Decomposition. [Citation Graph (0, 0)][DBLP]
    SODA, 1990, pp:244-251 [Conf]
  23. Elias Dahlhaus
    Fast Parallel Algorithm for the Single Link Heuristics of Hierarchical Clustering. [Citation Graph (0, 0)][DBLP]
    SPDP, 1992, pp:184-187 [Conf]
  24. Elias Dahlhaus
    Sequential and Parallel Algorithms on Compactly Represented Chordal and Strongly Chordal Graphs. [Citation Graph (0, 0)][DBLP]
    STACS, 1997, pp:487-498 [Conf]
  25. Elias Dahlhaus, Marek Karpinski
    A Fast Parallel Algorithm for Computing all Maximal Cliques in a Graph and the Related Problems (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SWAT, 1988, pp:139-144 [Conf]
  26. Elias Dahlhaus
    Minimal Elimination of Planar Graphs. [Citation Graph (0, 0)][DBLP]
    SWAT, 1998, pp:210-221 [Conf]
  27. Hajo Broersma, Elias Dahlhaus, Ton Kloks
    Algorithms for the Treewidth and Minimum Fill-in of HHD-Free Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1997, pp:109-117 [Conf]
  28. Elias Dahlhaus
    Optimal (Parallel) Algorithms for the All-to-All Vertices Distance Problem for Certain Graph Classes. [Citation Graph (0, 0)][DBLP]
    WG, 1992, pp:60-69 [Conf]
  29. Elias Dahlhaus
    The Parallel Complexity of Elimination Ordering Procedures. [Citation Graph (0, 0)][DBLP]
    WG, 1993, pp:225-236 [Conf]
  30. Elias Dahlhaus
    Efficient Parallel Modular Decomposition (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WG, 1995, pp:290-302 [Conf]
  31. Elias Dahlhaus
    Minimal Elimination Ordering Inside a Given Chordal Graph. [Citation Graph (0, 0)][DBLP]
    WG, 1997, pp:132-143 [Conf]
  32. Elias Dahlhaus
    Minimum Fill-in and Treewidth for Graphs Modularly Decomposable into Chordal Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1998, pp:351-358 [Conf]
  33. Elias Dahlhaus, Peter L. Hammer, Frédéric Maffray, Stephan Olariu
    On Domination Elimination Orderings and Domination Graphs (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WG, 1994, pp:81-92 [Conf]
  34. Hajo Broersma, Elias Dahlhaus, Ton Kloks
    A Linear Time Algorithm for Minimum Fill-in and Treewidth for Distance Hereditary Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:99, n:1-3, pp:367-400 [Journal]
  35. Elias Dahlhaus
    Minimal elimination ordering for graphs of bounded degree. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:116, n:1-2, pp:127-143 [Journal]
  36. Elias Dahlhaus
    A Parallel Algorithm for Computing Steiner Trees in Strongly Chordal Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:51, n:1-2, pp:47-61 [Journal]
  37. Elias Dahlhaus
    Efficient Parallel Recognition Algorithms of Cographs and Distance Hereditary Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1995, v:57, n:1, pp:29-44 [Journal]
  38. Elias Dahlhaus, Peter Damaschke
    The Parallel Solution of Domination Problems on Chordal and Strongly Chordal Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:52, n:3, pp:261-273 [Journal]
  39. Elias Dahlhaus, Peter Dankelmann, Wayne Goddard, Henda C. Swart
    MAD trees and distance-hereditary graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:131, n:1, pp:151-167 [Journal]
  40. Elias Dahlhaus, Peter Horák, Mirka Miller, Joseph F. Ryan
    The train marshalling problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:103, n:1-3, pp:41-54 [Journal]
  41. Elias Dahlhaus, Marek Karpinski
    Matching and Multidimensional Matching in Chordal and Strongly Chordal Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:84, n:1-3, pp:79-91 [Journal]
  42. Elias Dahlhaus, Jan Kratochvíl, Paul D. Manuel, Mirka Miller
    Transversal Partitioning in Balanced Hypergraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1997, v:79, n:1-3, pp:75-89 [Journal]
  43. Elias Dahlhaus, Jens Gustedt, Ross M. McConnell
    Partially Complemented Representations of Digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics & Theoretical Computer Science, 2002, v:5, n:1, pp:147-168 [Journal]
  44. Elias Dahlhaus, Johann A. Makowsky
    Query Languages for Hierarchic Databases [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1992, v:101, n:1, pp:1-32 [Journal]
  45. Elias Dahlhaus, Paul D. Manuel, Mirka Miller
    Maximum h-Colourable Subgraph Problem in Balanced Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1998, v:65, n:6, pp:301-303 [Journal]
  46. Elias Dahlhaus, Peter Dankelmann, R. Ravi
    A linear-time algorithm to compute a MAD tree of an interval graph. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:89, n:5, pp:255-259 [Journal]
  47. Elias Dahlhaus, Marek Karpinski, Pierre Kelsen
    An Efficient Parallel Algorithm for Computing a Maximal Independent Set in a Hypergraph of Dimension 3. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:42, n:6, pp:309-313 [Journal]
  48. Elias Dahlhaus
    Parallel Algorithms for Hierarchical Clustering and Applications to Split Decomposition and Parity Graph Recognition. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2000, v:36, n:2, pp:205-240 [Journal]
  49. Elias Dahlhaus, Jens Gustedt, Ross M. McConnell
    Efficient and Practical Algorithms for Sequential Modular Decomposition. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2001, v:41, n:2, pp:360-387 [Journal]
  50. Elias Dahlhaus, Péter Hajnal, Marek Karpinski
    On the Parallel Complexity of Hamiltonian Cycle and Matching Problem on Dense Graphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1993, v:15, n:3, pp:367-384 [Journal]
  51. Elias Dahlhaus, Marek Karpinski
    Perfect Matching for Regular Graphs is AC°-Hard for the General Matching Problem. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1992, v:44, n:1, pp:94-102 [Journal]
  52. Elias Dahlhaus, Manfred K. Warmuth
    Membership for Growing Context-Sensitive Grammars is Polynomial. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1986, v:33, n:3, pp:456-472 [Journal]
  53. Elias Dahlhaus, David S. Johnson, Christos H. Papadimitriou, Paul D. Seymour, Mihalis Yannakakis
    The Complexity of Multiterminal Cuts. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1994, v:23, n:4, pp:864-894 [Journal]
  54. Elias Dahlhaus
    Fast Parallel Recognition of Ultrametrics and Tree Metrics. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1993, v:6, n:4, pp:523-532 [Journal]
  55. 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. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:205, n:1-2, pp:261-282 [Journal]
  56. Elias Dahlhaus, Haim Gaifman
    Concerning Two-Adjacent Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:41, n:, pp:169-184 [Journal]
  57. Elias Dahlhaus, Marek Karpinski
    Parallel Construction of Perfect Matchings and Hamiltonian Cycles on Dense Graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1988, v:61, n:, pp:121-136 [Journal]
  58. Elias Dahlhaus, Marek Karpinski
    An Efficient Parallel Algorithm for the Minimal Elimination Ordering (MEO) of an Arbitrary Graph. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:134, n:2, pp:493-528 [Journal]
  59. Elias Dahlhaus, Paul D. Manuel, Mirka Miller
    A characterization of strongly chordal graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:187, n:1-3, pp:269-271 [Journal]

Search in 0.012secs, Finished in 0.014secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002