 | 2011 |
| 24 |  | Qing Xing,
Gabriel Esquivel,
Ergun Akleman,
Jianer Chen,
Jonathan L. Gross:
Band decomposition of 2-manifold meshes for physical construction of large structures.
SIGGRAPH Posters 2011: 58 |
| 23 |  | Qing Xing,
Gabriel Esquivel,
Ergun Akleman,
Jianer Chen,
Jonathan L. Gross:
Band decomposition of 2-manifold meshes for physical construction of large structures.
SIGGRAPH Talks 2011: 25 |
| 22 |  | Shi-Yu,
Qing Xing,
Ergun Akleman,
Jianer Chen,
Jonathan L. Gross:
Pattern mapping with quad-pattern-coverable quad-meshes.
SIGGRAPH Talks 2011: 26 |
| 21 |  | Ergun Akleman,
Jianer Chen,
Yen-Lin Chen,
Qing Xing,
Jonathan L. Gross:
Cyclic twill-woven objects.
Computers & Graphics 35(3): 623-631 (2011) |
| 20 |  | Jonathan L. Gross,
Thomas W. Tucker:
A Celtic Framework for Knots and Links.
Discrete & Computational Geometry 46(1): 86-99 (2011) |
| 19 |  | Mehvish I. Poshni,
Imran F. Khan,
Jonathan L. Gross:
Genus Distributions of 4-Regular Outerplanar Graphs.
Electr. J. Comb. 18(1): (2011) |
| 18 |  | Jonathan L. Gross:
Genus Distributions of Cubic Outerplanar Graphs.
J. Graph Algorithms Appl. 15(2): 295-316 (2011) |
| 2010 |
| 17 |  | Ergun Akleman,
Jianer Chen,
Jonathan L. Gross:
Paper-Strip Sculptures.
Shape Modeling International 2010: 236-240 |
| 16 |  | Qing Xing,
Ergun Akleman,
Jianer Chen,
Jonathan L. Gross:
Single-Cycle Plain-Woven Objects.
Shape Modeling International 2010: 90-99 |
| 2009 |
| 15 |  | 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 |
| 14 |  | Jianer Chen,
Dan Archdeacon,
Jonathan L. Gross:
Maximum genus and connectivity.
Discrete Mathematics 149(1-3): 19-29 (1996) |
| 13 |  | 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) |
| 12 |  | 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 |
| 11 |  | Jonathan L. Gross,
Thomas W. Tucker:
Stratified graphs for imbedding systems.
Discrete Mathematics 143(1-3): 71-85 (1995) |
| 1994 |
| 10 |  | Jianer Chen,
Jonathan L. Gross,
Robert G. Rieper:
Overlap matrices and total imbedding distributions.
Discrete Mathematics 128(1-3): 73-94 (1994) |
| 1993 |
| 9 |  | Jonathan L. Gross,
E. Ward Klein,
Robert G. Rieper:
On the average genus of a graph.
Graphs and Combinatorics 9(2-4): 153-162 (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) |