Jonathan L. Gross

	2009
14		Ergun Akleman, Jianer Chen, Qing Xing, Jonathan L. Gross: Cyclic plain-weaving on polygonal mesh surfaces with graph rotation systems. ACM Trans. Graph. 28(3): (2009)
	1996
13		Jianer Chen, Dan Archdeacon, Jonathan L. Gross: Maximum genus and connectivity. Discrete Mathematics 149(1-3): 19-29 (1996)
12		Jianer Chen, Saroja P. Kanchi, Jonathan L. Gross: A tight lower bound on the maximum genus of a simplicial graph. Discrete Mathematics 156(1-3): 83-102 (1996)
11		Jonathan L. Gross, Jianer Chen: Algebraic Specification of Interconnection Network Relationships by Permutation Voltage Graph Mappings. Mathematical Systems Theory 29(5): 451-470 (1996)
	1995
10		Jonathan L. Gross, Thomas W. Tucker: Stratified graphs for imbedding systems. Discrete Mathematics 143(1-3): 71-85 (1995)
	1994
9		Jianer Chen, Jonathan L. Gross, Robert G. Rieper: Overlap matrices and total imbedding distributions. Discrete Mathematics 128(1-3): 73-94 (1994)
	1993
8		Jianer Chen, Jonathan L. Gross: Kuratowski-Type Theorems for Average Genus. J. Comb. Theory, Ser. B 57(1): 100-121 (1993)
	1992
7		Jianer Chen, Jonathan L. Gross: Limit points for average genus. I. 3-Connected and 2-connected simplicial graphs. J. Comb. Theory, Ser. B 55(1): 83-103 (1992)
6		Jianer Chen, Jonathan L. Gross: Limit points for average genus II. 2-Connected non-simplicial graphs. J. Comb. Theory, Ser. B 56(1): 108-129 (1992)
	1989
5		Merrick L. Furst, Jonathan L. Gross, Richard Statman: Genus distributions for two classes of graphs. J. Comb. Theory, Ser. B 46(1): 22-36 (1989)
4		Jonathan L. Gross, David P. Robbinsand, Thomas W. Tucker: Genus distributions for bouquets of circles. J. Comb. Theory, Ser. B 47(3): 292-306 (1989)
	1988
3		Merrick L. Furst, Jonathan L. Gross, Lyle A. McGeoch: Finding a maximum-genus graph imbedding. J. ACM 35(3): 523-534 (1988)
	1979
2		Jonathan L. Gross, Ronald H. Rosen: A Linear Time Planarity Algorithm for 2-Complexes. J. ACM 26(4): 611-617 (1979)
	1977
1		Jonathan L. Gross: Every connected regular graph of even degree is a Schreier coset graph. J. Comb. Theory, Ser. B 22(3): 227-232 (1977)

Coauthor Index

1	Ergun Akleman	[14]
2	Dan Archdeacon	[13]
3	Jianer Chen	[6] [7] [8] [9] [11] [12] [13] [14]
4	Merrick L. Furst	[3] [5]
5	Saroja P. Kanchi	[12]
6	Lyle A. McGeoch	[3]
7	Robert G. Rieper	[9]
8	David P. Robbinsand	[4]
9	Ronald H. Rosen	[2]
10	Richard Statman	[5]
11	Thomas W. Tucker	[4] [10]
12	Qing Xing	[14]

Colors in the list of coauthors