Sandra Mitchell Hedetniemi

Sandra L. Mitchell

	2011
25		Brian C. Dean, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Jason Lewis, Alice A. McRae: Matchability and k-maximal matchings. Discrete Applied Mathematics 159(1): 15-22 (2011)
24		Gerd Fricke, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Kevin R. Hutson: γ-graphs of graphs. Discussiones Mathematicae Graph Theory 31(3): 517-531 (2011)
	2008
23		Wayne Goddard, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, John M. Harris, Douglas F. Rall: Braodcast Chromatic Numbers of Graphs. Ars Comb. 86: (2008)
	2006
22		Jean E. Dunbar, David J. Erwin, Teresa W. Haynes, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi: Broadcasts in graphs. Discrete Applied Mathematics 154(1): 59-75 (2006)
	2005
21		Wayne Goddard, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Renu Laskar: Generalized subgraph-restricted matchings in graphs. Discrete Mathematics 293(1-3): 129-138 (2005)
	2004
20		Ernest J. Cockayne, Paul A. Dreyer Jr., Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi: Roman domination in graphs. Discrete Mathematics 278(1-3): 11-22 (2004)
19		Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Alice A. McRae, Dee Parks, Jan Arne Telle: Iterated colorings of graphs. Discrete Mathematics 278(1-3): 81-108 (2004)
	2002
18		Odile Favaron, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Douglas F. Rall: On k-dependent domination. Discrete Mathematics 249(1-3): 83-94 (2002)
17		Teresa W. Haynes, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Michael A. Henning: Domination in Graphs Applied to Electric Power Networks. SIAM J. Discrete Math. 15(4): 519-529 (2002)
	2000
16		Ashraf M. Abdelbar, Stephen T. Hedetniemi, Sandra Mitchell Hedetniemi: The complexity of approximating MAPs for belief networks with bounded probabilities. Artif. Intell. 124(2): 283-288 (2000)
15		Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Douglas F. Rall: Acyclic domination. Discrete Mathematics 222(1-3): 151-165 (2000)
	1999
14		Gerd Fricke, Teresa W. Haynes, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Michael A. Henning: On perfect neighborhood sets in graphs. Discrete Mathematics 199(1-3): 221-225 (1999)
	1998
13		Ashraf M. Abdelbar, Sandra Mitchell Hedetniemi: Approximating MAPs for Belief Networks is NP-Hard and Other Theorems. Artif. Intell. 102(1): 21-38 (1998)
12		Ernest J. Cockayne, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Christina M. Mynhardt: Irredundant and perfect neighbourhood sets in trees. Discrete Mathematics 188(1-3): 253-260 (1998)
	1997
11		Jing-Ho Yan, Gerard J. Chang, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi: k-Path Partitions in Trees. Discrete Applied Mathematics 78(1-3): 227-233 (1997)
10		Ernest J. Cockayne, Johannes H. Hattingh, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Alice A. McRae: Using maximality and minimality conditions to construct inequality chains. Discrete Mathematics 176(1-3): 43-61 (1997)
	1995
9		Jean E. Dunbar, Frederick C. Harris Jr., Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Alice A. McRae, Renu C. Laskar: Nearly perfect sets in graphs. Discrete Mathematics 138(1-3): 229-246 (1995)
	1993
8		Marshall W. Bern, Herbert Edelsbrunner, David Eppstein, Sandra L. Mitchell, Tiow Seng Tan: Edge Insertion for Optimal Triangulations. Discrete & Computational Geometry 10: 47-65 (1993)
	1992
7		Marshall W. Bern, Herbert Edelsbrunner, David Eppstein, Sandra L. Mitchell, Tiow Seng Tan: Edge Insertion for Optional Triangulations. LATIN 1992: 46-60
	1985
6		Sandra Mitchell Hedetniemi, Andrzej Proskurowski, Maciej M. Syslo: Interior graphs of maximal outerplane graphs. J. Comb. Theory, Ser. B 38(2): 156-167 (1985)
	1980
5		Terry Beyer, Sandra Mitchell Hedetniemi: Constant Time Generation of Rooted Trees. SIAM J. Comput. 9(4): 706-712 (1980)
	1979
4		Sandra L. Mitchell, Stephen T. Hedetniemi: Linear Algorithms for Edge-Coloring Trees and Unicyclic Graphs. Inf. Process. Lett. 9(3): 110-112 (1979)
3		Sandra L. Mitchell: Linear Algorithms to Recognize Outerplanar and Maximal Outerplanar Graphs. Inf. Process. Lett. 9(5): 229-232 (1979)
2		Sandra L. Mitchell, Terry Beyer, W. Jones: Linear Algorithms for Isomorphism of Maximal Outerplanar Graphs. J. ACM 26(4): 603-610 (1979)
1		Sandra L. Mitchell, Ernest J. Cockayne, Stephen T. Hedetniemi: Linear Algorithms on Recursive Representations of Trees. J. Comput. Syst. Sci. 18(1): 76-85 (1979)

Coauthor Index

1	Ashraf M. Abdelbar	[13] [16]
2	Marshall W. Bern	[7] [8]
3	Terry Beyer	[2] [5]
4	Gerard J. Chang (Gerard Jennhwa Chang)	[11]
5	Ernest J. Cockayne	[1] [10] [12] [20]
6	Brian C. Dean	[25]
7	Paul A. Dreyer Jr.	[20]
8	Jean E. Dunbar	[9] [22]
9	Herbert Edelsbrunner	[7] [8]
10	David Eppstein	[7] [8]
11	David J. Erwin	[22]
12	Odile Favaron	[18]
13	Gerd Fricke	[14] [24]
14	Wayne Goddard	[21] [23]
15	John M. Harris	[23]
16	Frederick C. Harris Jr.	[9]
17	Johannes H. Hattingh	[10]
18	Teresa W. Haynes	[14] [17] [22]
19	Stephen T. Hedetniemi	[1] [4] [9] [10] [11] [12] [14] [15] [16] [17] [18] [19] [20] [21] [22] [23] [24] [25]
20	Michael A. Henning	[14] [17]
21	Kevin R. Hutson	[24]
22	W. Jones	[2]
23	Renu Laskar (Renu C. Laskar)	[9] [21]
24	Jason Lewis	[25]
25	Alice A. McRae	[9] [10] [19] [25]
26	Christina M. Mynhardt	[12]
27	Dee Parks	[19]
28	Andrzej Proskurowski	[6]
29	Douglas F. Rall	[15] [18] [23]
30	Maciej M. Syslo	[6]
31	Tiow Seng Tan	[7] [8]
32	Jan Arne Telle	[19]
33	Jing-Ho Yan	[11]

Colors in the list of coauthors

Last update Fri Jun 1 15:44:53 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page