default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDElias Dahlhaus
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c35]Elias Dahlhaus
, Bernhard Ganter:
Examples of Clique Closure Systems. ICFCA 2023: 143-151- 2022
- [c34]Elias Dahlhaus:
A Generalized Approach for Train Marshalling. OR 2022: 411-417
2010 – 2019
- 2019
- [i2]Elias Dahlhaus, Sariel Har-Peled, Alan L. Hu:
Covering Polygons by Min-Area Convex Polygons. CoRR abs/1912.03429 (2019) - 2013
- [i1]Elias Dahlhaus:
Linear time and almost linear time cases for minimal elimination orderings. CTW 2013: 75-78
2000 – 2009
- 2008
- [j29]Anne Berry, Elias Dahlhaus, Pinar Heggernes, Geneviève Simonet:
Sequential and parallel triangulating algorithms for Elimination Game and new insights on Minimum Degree. Theor. Comput. Sci. 409(3): 601-616 (2008) - 2005
- [j28]Elias Dahlhaus, Paul D. Manuel, Mirka Miller:
Parallel algorithms for generalized clique transversal problems. Australas. J Comb. 33: 3-14 (2005) - 2004
- [j27]Elias Dahlhaus, Peter Dankelmann, R. Ravi:
A linear-time algorithm to compute a MAD tree of an interval graph. Inf. Process. Lett. 89(5): 255-259 (2004) - 2003
- [j26]Elias Dahlhaus, Peter Dankelmann, Wayne Goddard, Henda C. Swart:
MAD trees and distance-hereditary graphs. Discret. Appl. Math. 131(1): 151-167 (2003) - 2002
- [j25]Elias Dahlhaus:
Minimal elimination ordering for graphs of bounded degree. Discret. Appl. Math. 116(1-2): 127-143 (2002) - [j24]Elias Dahlhaus, Jens Gustedt, Ross M. McConnell:
Partially Complemented Representations of Digraphs. Discret. Math. Theor. Comput. Sci. 5(1): 147-168 (2002) - 2001
- [j23]Elias Dahlhaus, Jens Gustedt, Ross M. McConnell:
Efficient and Practical Algorithms for Sequential Modular Decomposition. J. Algorithms 41(2): 360-387 (2001) - 2000
- [j22]Hajo Broersma, Elias Dahlhaus, Ton Kloks:
A Linear Time Algorithm for Minimum Fill-in and Treewidth for Distance Hereditary Graphs. Discret. Appl. Math. 99(1-3): 367-400 (2000) - [j21]Elias Dahlhaus, Peter Horák, Mirka Miller, Joseph F. Ryan:
The train marshalling problem. Discret. Appl. Math. 103(1-3): 41-54 (2000) - [j20]Elias Dahlhaus:
Parallel Algorithms for Hierarchical Clustering and Applications to Split Decomposition and Parity Graph Recognition. J. Algorithms 36(2): 205-240 (2000)
1990 – 1999
- 1998
- [j19]Elias Dahlhaus, Marek Karpinski:
Matching and Multidimensional Matching in Chordal and Strongly Chordal Graphs. Discret. Appl. Math. 84(1-3): 79-91 (1998) - [j18]Elias Dahlhaus, Paul D. Manuel, Mirka Miller:
A characterization of strongly chordal graphs. Discret. Math. 187(1-3): 269-271 (1998) - [j17]Elias Dahlhaus, Paul D. Manuel, Mirka Miller:
Maximum h-Colourable Subgraph Problem in Balanced Graphs. Inf. Process. Lett. 65(6): 301-303 (1998) - [j16]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. Theor. Comput. Sci. 205(1-2): 261-282 (1998) - [c33]Elias Dahlhaus:
A Linear Time Algorithm to Recognize Clustered Graphs and Its Parallelization. LATIN 1998: 239-248 - [c32]Elias Dahlhaus:
Minimal Elimination of Planar Graphs. SWAT 1998: 210-221 - [c31]Elias Dahlhaus:
Minimum Fill-in and Treewidth for Graphs Modularly Decomposable into Chordal Graphs. WG 1998: 351-358 - 1997
- [j15]Elias Dahlhaus, Jan Kratochvíl, Paul D. Manuel, Mirka Miller:
Transversal Partitioning in Balanced Hypergraphs. Discret. Appl. Math. 79(1-3): 75-89 (1997) - [c30]Elias Dahlhaus:
Improved Efficient Parallel Algorithms to Recognize Interval Graphs and Interval Hypergraphs. HICSS (1) 1997: 172-181 - [c29]Elias Dahlhaus, Jens Gustedt, Ross M. McConnell:
Efficient and Practical Modular Decomposition. SODA 1997: 26-35 - [c28]Elias Dahlhaus:
Sequential and Parallel Algorithms on Compactly Represented Chordal and Strongly Chordal Graphs. STACS 1997: 487-498 - [c27]Hajo Broersma, Elias Dahlhaus, Ton Kloks:
Algorithms for the Treewidth and Minimum Fill-in of HHD-Free Graphs. WG 1997: 109-117 - [c26]Elias Dahlhaus:
Minimal Elimination Ordering Inside a Given Chordal Graph. WG 1997: 132-143 - 1995
- [j14]Elias Dahlhaus:
Efficient Parallel Recognition Algorithms of Cographs and Distance Hereditary Graphs. Discret. Appl. Math. 57(1): 29-44 (1995) - [c25]Alexander E. Andreev, Andrea Clementi, Pierluigi Crescenzi, Elias Dahlhaus, Sergio De Agostino, José D. P. Rolim:
The Parallel Complexity of Approximating the High Degree Subgraph Problem. ISAAC 1995: 132-141 - [c24]Elias Dahlhaus:
Efficient Parallel Modular Decomposition (Extended Abstract). WG 1995: 290-302 - 1994
- [j13]Elias Dahlhaus:
A Parallel Algorithm for Computing Steiner Trees in Strongly Chordal Graphs. Discret. Appl. Math. 51(1-2): 47-61 (1994) - [j12]Elias Dahlhaus, Peter Damaschke:
The Parallel Solution of Domination Problems on Chordal and Strongly Chordal Graphs. Discret. Appl. Math. 52(3): 261-273 (1994) - [j11]Elias Dahlhaus, David S. Johnson, Christos H. Papadimitriou, Paul D. Seymour, Mihalis Yannakakis:
The Complexity of Multiterminal Cuts. SIAM J. Comput. 23(4): 864-894 (1994) - [j10]Elias Dahlhaus, Marek Karpinski:
An Efficient Parallel Algorithm for the Minimal Elimination Ordering (MEO) of an Arbitrary Graph. Theor. Comput. Sci. 134(2): 493-528 (1994) - [c23]Elias Dahlhaus:
Efficient Parallel and Linear Time Sequential Split Decomposition (Extended Abstract). FSTTCS 1994: 171-180 - [c22]Elias Dahlhaus:
Efficient Parallel Algorithms on Chordal Graphs with a Sparse Tree Representations. HICSS (2) 1994: 150-158 - [c21]Elias Dahlhaus:
The Computation of the Jump Number of Convex Graphs. ORDAL 1994: 176-185 - [c20]Elias Dahlhaus, Peter L. Hammer, Frédéric Maffray, Stephan Olariu:
On Domination Elimination Orderings and Domination Graphs (Extended Abstract). WG 1994: 81-92 - 1993
- [j9]Elias Dahlhaus, Péter Hajnal, Marek Karpinski:
On the Parallel Complexity of Hamiltonian Cycle and Matching Problem on Dense Graphs. J. Algorithms 15(3): 367-384 (1993) - [j8]Elias Dahlhaus:
Fast Parallel Recognition of Ultrametrics and Tree Metrics. SIAM J. Discret. Math. 6(4): 523-532 (1993) - [c19]Elias Dahlhaus:
An Efficient Parallel Recognition Algorithm of Parity Graphs. ICCI 1993: 82-86 - [c18]Elias Dahlhaus:
The Parallel Complexity of Elimination Ordering Procedures. WG 1993: 225-236 - 1992
- [j7]Elias Dahlhaus, Johann A. Makowsky:
Query Languages for Hierarchic Databases. Inf. Comput. 101(1): 1-32 (1992) - [j6]Elias Dahlhaus, Marek Karpinski, Pierre Kelsen:
An Efficient Parallel Algorithm for Computing a Maximal Independent Set in a Hypergraph of Dimension 3. Inf. Process. Lett. 42(6): 309-313 (1992) - [j5]Elias Dahlhaus, Marek Karpinski:
Perfect Matching for Regular Graphs is AC°-Hard for the General Matching Problem. J. Comput. Syst. Sci. 44(1): 94-102 (1992) - [c17]Waldemar Preilowski, Elias Dahlhaus, Gerd Wechsung:
New Parallel Algorithms for Convex Hull and Triangulation in 3-Dimensional Space. MFCS 1992: 442-450 - [c16]Elias Dahlhaus:
Fast Parallel Algorithm for the Single Link Heuristics of Hierarchical Clustering. SPDP 1992: 184-187 - [c15]Elias Dahlhaus, David S. Johnson, Christos H. Papadimitriou, Paul D. Seymour, Mihalis Yannakakis:
The Complexity of Multiway Cuts (Extended Abstract). STOC 1992: 241-251 - [c14]Elias Dahlhaus:
Optimal (Parallel) Algorithms for the All-to-All Vertices Distance Problem for Certain Graph Classes. WG 1992: 60-69 - 1991
- [c13]Elias Dahlhaus:
How to Implement First Order Formulas in Local Memory Machine Models. CSL 1991: 68-78 - 1990
- [c12]Elias Dahlhaus, Marek Karpinski, Mark B. Novick:
Fast Parallel Algorithms for the Clique Separator Decomposition. SODA 1990: 244-251
1980 – 1989
- 1989
- [c11]Elias Dahlhaus:
The Complexity of Subtheories of the Existential Linear Theory of Reals. CSL 1989: 76-89 - [c10]Elias Dahlhaus, Marek Karpinski:
An Efficient Parallel Algorithm for the Minimal Elimination Ordering (MEO) of an Arbitrary Graph (Extended Abstract). FOCS 1989: 454-459 - 1988
- [j4]Elias Dahlhaus, Amos Israeli, Johann A. Makowsky:
On the existence of polynomial time algorithms for interpolation problems in propositional logic. Notre Dame J. Formal Log. 29(4): 497-509 (1988) - [j3]Elias Dahlhaus, Marek Karpinski:
Parallel Construction of Perfect Matchings and Hamiltonian Cycles on Dense Graphs. Theor. Comput. Sci. 61: 121-136 (1988) - [c9]Elias Dahlhaus:
Completeness with Respect to Interpretations in Deterministic and Nondeterministic Polynomial Time. CSL 1988: 52-62 - [c8]Elias Dahlhaus, Péter Hajnal, Marek Karpinski:
Optimal Parallel Algorithm for the Hamiltonian Cycle Problem on Dense Graphs. FOCS 1988: 186-193 - [c7]Elias Dahlhaus, Marek Karpinski:
A Fast Parallel Algorithm for Computing all Maximal Cliques in a Graph and the Related Problems (Extended Abstract). SWAT 1988: 139-144 - 1987
- [c6]Elias Dahlhaus:
Skolem Normal Forms Concerning the Least Fixpoint. Computation Theory and Logic 1987: 101-106 - [c5]Elias Dahlhaus:
Is SETL a Suitable Language for Parallel Programming - A Theoretical Approach. CSL 1987: 56-63 - 1986
- [j2]Elias Dahlhaus, Manfred K. Warmuth:
Membership for Growing Context-Sensitive Grammars is Polynomial. J. Comput. Syst. Sci. 33(3): 456-472 (1986) - [c4]Elias Dahlhaus, Manfred K. Warmuth:
Membership for Growing Context Sensitive Grammars is Polynomial. CAAP 1986: 85-99 - [c3]Elias Dahlhaus, Johann A. Makowsky:
Computable Directory Queries. CAAP 1986: 254-265 - [c2]Elias Dahlhaus, Johann A. Makowsky:
The Choice of Programming Primitives for SETL-Like Programming Languages. ESOP 1986: 160-172 - 1985
- [j1]Elias Dahlhaus, Haim Gaifman:
Concerning Two-Adjacent Context-Free Languages. Theor. Comput. Sci. 41: 169-184 (1985) - 1983
- [c1]Elias Dahlhaus:
Reduction to NP-complete problems by interpretations. Logic and Machines 1983: 357-365 - 1982
- [b1]Elias Dahlhaus:
Kombinatorische und logische Eigenschaften von Reduktionen auf einige vollständige Probleme in NP und NL mit einigen Folgerungen. Technical University of Berlin, Germany, 1982, pp. 1-67
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-13 01:39 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
