Elias Dahlhaus

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

Coauthor Index

1	Sergio De Agostino	[38] [45]
2	Alexander E. Andreev	[38] [45]
3	Anne Berry	[60]
4	Hajo Broersma (H. J. Broersma)	[41] [53]
5	Andrea E. F. Clementi	[38] [45]
6	Pierluigi Crescenzi (Pilu Crescenzi)	[38] [45]
7	Peter Damaschke	[30]
8	Peter Dankelmann	[58] [59]
9	Haim Gaifman	[2]
10	Wayne Goddard	[58]
11	Jens Gustedt	[43] [55] [56]
12	Péter Hajnal	[11] [25]
13	Peter L. Hammer (Peter Ladislaw Hammer)	[32]
14	Pinar Heggernes	[60]
15	Peter Horák	[54]
16	David S. Johnson	[21] [29]
17	Marek Karpinski	[9] [10] [11] [13] [15] [17] [18] [25] [28] [48]
18	Pierre Kelsen	[18]
19	Ton Kloks (Antonius J. J. Kloks)	[41] [53]
20	Jan Kratochvíl	[39]
21	Frédéric Maffray	[32]
22	Johann A. Makowsky (Janos Makowsky)	[4] [6] [19]
23	Paul D. Manuel	[39] [46] [47]
24	Ross M. McConnell	[43] [55] [56]
25	Mirka Miller	[39] [46] [47] [54]
26	Mark B. Novick	[15]
27	Stephan Olariu	[32]
28	Christos H. Papadimitriou	[21] [29]
29	Waldemar Preilowski	[23]
30	R. Ravi	[59]
31	José D. P. Rolim	[38] [45]
32	Joseph F. Ryan	[54]
33	Paul D. Seymour	[21] [29]
34	Geneviève Simonet	[60]
35	Henda C. Swart	[58]
36	Manfred K. Warmuth	[3] [5]
37	Gerd Wechsung	[23]
38	Mihalis Yannakakis	[21] [29]

Colors in the list of coauthors

Last update Tue May 29 20:41:18 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page