Elias Dahlhaus

67 papers A* 5A 2B 14C 3Journal 30Unranked 12

Year	Rank	Type	Title / Venue / Authors
2023	C	`conf`	Examples of Clique Closure Systems. ICFCA Elias Dahlhaus, Bernhard Ganter
2022	—	`conf`	A Generalized Approach for Train Marshalling. OR Elias Dahlhaus
2019	J	`jnl`	Covering Polygons by Min-Area Convex Polygons. CoRR Elias Dahlhaus, Sariel Har-Peled, Alan L. Hu
2013	C	`conf`	Linear time and almost linear time cases for minimal elimination orderings. CTW Elias Dahlhaus
2008	J	`jnl`	Sequential and parallel triangulating algorithms for Elimination Game and new insights on Minimum Degree. Theor. Comput. Sci. Anne Berry, Elias Dahlhaus, Pinar Heggernes, Geneviève Simonet
2005	J	`jnl`	Parallel algorithms for generalized clique transversal problems. Australas. J Comb. Elias Dahlhaus, Paul D. Manuel, Mirka Miller
2004	J	`jnl`	A linear-time algorithm to compute a MAD tree of an interval graph. Inf. Process. Lett. Elias Dahlhaus, Peter Dankelmann, R. Ravi
2003	J	`jnl`	MAD trees and distance-hereditary graphs. Discret. Appl. Math. Elias Dahlhaus, Peter Dankelmann, Wayne Goddard, Henda C. Swart
2002	J	`jnl`	Minimal elimination ordering for graphs of bounded degree. Discret. Appl. Math. Elias Dahlhaus
2002	J	`jnl`	Partially Complemented Representations of Digraphs. Discret. Math. Theor. Comput. Sci. Elias Dahlhaus, Jens Gustedt, Ross M. McConnell
2001	J	`jnl`	Efficient and Practical Algorithms for Sequential Modular Decomposition. J. Algorithms Elias Dahlhaus, Jens Gustedt, Ross M. McConnell
2000	J	`jnl`	A Linear Time Algorithm for Minimum Fill-in and Treewidth for Distance Hereditary Graphs. Discret. Appl. Math. Hajo Broersma, Elias Dahlhaus, Ton Kloks
2000	J	`jnl`	Parallel Algorithms for Hierarchical Clustering and Applications to Split Decomposition and Parity Graph Recognition. J. Algorithms Elias Dahlhaus
2000	J	`jnl`	The train marshalling problem. Discret. Appl. Math. Elias Dahlhaus, Peter Horák, Mirka Miller, Joseph F. Ryan
1998	B	`conf`	A Linear Time Algorithm to Recognize Clustered Graphs and Its Parallelization. LATIN Elias Dahlhaus
1998	J	`jnl`	A characterization of strongly chordal graphs. Discret. Math. Elias Dahlhaus, Paul D. Manuel, Mirka Miller
1998	J	`jnl`	Matching and Multidimensional Matching in Chordal and Strongly Chordal Graphs. Discret. Appl. Math. Elias Dahlhaus, Marek Karpinski
1998	J	`jnl`	Maximum Inf. Process. Lett. Elias Dahlhaus, Paul D. Manuel, Mirka Miller
1998	—	`conf`	Minimal Elimination of Planar Graphs. SWAT Elias Dahlhaus
1998	B	`conf`	Minimum Fill-in and Treewidth for Graphs Modularly Decomposable into Chordal Graphs. WG Elias Dahlhaus
1998	J	`jnl`	The Parallel Complexity of Approximating the High Degree Subgraph Problem. Theor. Comput. Sci. Alexander E. Andreev, Andrea E. F. Clementi, Pierluigi Crescenzi, Elias Dahlhaus, Sergio De Agostino, José D. P. Rolim
1997	B	`conf`	Algorithms for the Treewidth and Minimum Fill-in of HHD-Free Graphs. WG Hajo Broersma, Elias Dahlhaus, Ton Kloks
1997	A*	`conf`	Efficient and Practical Modular Decomposition. SODA Elias Dahlhaus, Jens Gustedt, Ross M. McConnell
1997	—	`conf`	Improved Efficient Parallel Algorithms to Recognize Interval Graphs and Interval Hypergraphs. HICSS (1) Elias Dahlhaus
1997	B	`conf`	Minimal Elimination Ordering Inside a Given Chordal Graph. WG Elias Dahlhaus
1997	A	`conf`	Sequential and Parallel Algorithms on Compactly Represented Chordal and Strongly Chordal Graphs. STACS Elias Dahlhaus
1997	J	`jnl`	Transversal Partitioning in Balanced Hypergraphs. Discret. Appl. Math. Elias Dahlhaus, Jan Kratochvíl, Paul D. Manuel, Mirka Miller
1995	B	`conf`	Efficient Parallel Modular Decomposition (Extended Abstract). WG Elias Dahlhaus
1995	J	`jnl`	Efficient Parallel Recognition Algorithms of Cographs and Distance Hereditary Graphs. Discret. Appl. Math. Elias Dahlhaus
1995	B	`conf`	The Parallel Complexity of Approximating the High Degree Subgraph Problem. ISAAC Alexander E. Andreev, Andrea Clementi, Pierluigi Crescenzi, Elias Dahlhaus, Sergio De Agostino, José D. P. Rolim
1994	J	`jnl`	A Parallel Algorithm for Computing Steiner Trees in Strongly Chordal Graphs. Discret. Appl. Math. Elias Dahlhaus
1994	J	`jnl`	An Efficient Parallel Algorithm for the Minimal Elimination Ordering (MEO) of an Arbitrary Graph. Theor. Comput. Sci. Elias Dahlhaus, Marek Karpinski
1994	—	`conf`	Efficient Parallel Algorithms on Chordal Graphs with a Sparse Tree Representations. HICSS (2) Elias Dahlhaus
1994	—	`conf`	Efficient Parallel and Linear Time Sequential Split Decomposition (Extended Abstract). FSTTCS Elias Dahlhaus
1994	B	`conf`	On Domination Elimination Orderings and Domination Graphs (Extended Abstract). WG Elias Dahlhaus, Peter L. Hammer, Frédéric Maffray, Stephan Olariu
1994	J	`jnl`	The Complexity of Multiterminal Cuts. SIAM J. Comput. Elias Dahlhaus, David S. Johnson, Christos H. Papadimitriou, Paul D. Seymour, Mihalis Yannakakis
1994	—	`conf`	The Computation of the Jump Number of Convex Graphs. ORDAL Elias Dahlhaus
1994	J	`jnl`	The Parallel Solution of Domination Problems on Chordal and Strongly Chordal Graphs. Discret. Appl. Math. Elias Dahlhaus, Peter Damaschke
1993	C	`conf`	An Efficient Parallel Recognition Algorithm of Parity Graphs. ICCI Elias Dahlhaus
1993	J	`jnl`	Fast Parallel Recognition of Ultrametrics and Tree Metrics. SIAM J. Discret. Math. Elias Dahlhaus
1993	J	`jnl`	On the Parallel Complexity of Hamiltonian Cycle and Matching Problem on Dense Graphs. J. Algorithms Elias Dahlhaus, Péter Hajnal, Marek Karpinski
1993	B	`conf`	The Parallel Complexity of Elimination Ordering Procedures. WG Elias Dahlhaus
1992	J	`jnl`	An Efficient Parallel Algorithm for Computing a Maximal Independent Set in a Hypergraph of Dimension 3. Inf. Process. Lett. Elias Dahlhaus, Marek Karpinski, Pierre Kelsen
1992	—	`conf`	Fast Parallel Algorithm for the Single Link Heuristics of Hierarchical Clustering. SPDP Elias Dahlhaus
1992	B	`conf`	New Parallel Algorithms for Convex Hull and Triangulation in 3-Dimensional Space. MFCS Waldemar Preilowski, Elias Dahlhaus, Gerd Wechsung
1992	B	`conf`	Optimal (Parallel) Algorithms for the All-to-All Vertices Distance Problem for Certain Graph Classes. WG Elias Dahlhaus
1992	J	`jnl`	Perfect Matching for Regular Graphs is AC°-Hard for the General Matching Problem. J. Comput. Syst. Sci. Elias Dahlhaus, Marek Karpinski
1992	J	`jnl`	Query Languages for Hierarchic Databases Inf. Comput. Elias Dahlhaus, Johann A. Makowsky
1992	A*	`conf`	The Complexity of Multiway Cuts (Extended Abstract) STOC Elias Dahlhaus, David S. Johnson, Christos H. Papadimitriou, Paul D. Seymour, Mihalis Yannakakis
1991	B	`conf`	How to Implement First Order Formulas in Local Memory Machine Models. CSL Elias Dahlhaus
1990	A*	`conf`	Fast Parallel Algorithms for the Clique Separator Decomposition. SODA Elias Dahlhaus, Marek Karpinski, Mark B. Novick
1989	A*	`conf`	An Efficient Parallel Algorithm for the Minimal Elimination Ordering (MEO) of an Arbitrary Graph (Extended Abstract) FOCS Elias Dahlhaus, Marek Karpinski
1989	B	`conf`	The Complexity of Subtheories of the Existential Linear Theory of Reals. CSL Elias Dahlhaus
1988	—	`conf`	A Fast Parallel Algorithm for Computing all Maximal Cliques in a Graph and the Related Problems (Extended Abstract). SWAT Elias Dahlhaus, Marek Karpinski
1988	B	`conf`	Completeness with Respect to Interpretations in Deterministic and Nondeterministic Polynomial Time. CSL Elias Dahlhaus
1988	J	`jnl`	On the existence of polynomial time algorithms for interpolation problems in propositional logic. Notre Dame J. Formal Log. Elias Dahlhaus, Amos Israeli, Johann A. Makowsky
1988	A*	`conf`	Optimal Parallel Algorithm for the Hamiltonian Cycle Problem on Dense Graphs FOCS Elias Dahlhaus, Péter Hajnal, Marek Karpinski
1988	J	`jnl`	Parallel Construction of Perfect Matchings and Hamiltonian Cycles on Dense Graphs. Theor. Comput. Sci. Elias Dahlhaus, Marek Karpinski
1987	B	`conf`	Is SETL a Suitable Language for Parallel Programming - A Theoretical Approach. CSL Elias Dahlhaus
1987	—	`conf`	Skolem Normal Forms Concerning the Least Fixpoint. Computation Theory and Logic Elias Dahlhaus
1986	—	`conf`	Computable Directory Queries. CAAP Elias Dahlhaus, Johann A. Makowsky
1986	—	`conf`	Membership for Growing Context Sensitive Grammars is Polynomial. CAAP Elias Dahlhaus, Manfred K. Warmuth
1986	J	`jnl`	Membership for Growing Context-Sensitive Grammars is Polynomial. J. Comput. Syst. Sci. Elias Dahlhaus, Manfred K. Warmuth
1986	A	`conf`	The Choice of Programming Primitives for SETL-Like Programming Languages. ESOP Elias Dahlhaus, Johann A. Makowsky
1985	J	`jnl`	Concerning Two-Adjacent Context-Free Languages. Theor. Comput. Sci. Elias Dahlhaus, Haim Gaifman
1983	—	`conf`	Reduction to NP-complete problems by interpretations. Logic and Machines Elias Dahlhaus
1982	—	`—`	Kombinatorische und logische Eigenschaften von Reduktionen auf einige vollständige Probleme in NP und NL mit einigen Folgerungen. Elias Dahlhaus