default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJonathan L. Gross
Person information
- affiliation: Columbia University, New York City, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j56]Jonathan L. Gross, Toufik Mansour
, Thomas W. Tucker:
Partial duality for ribbon graphs, II: Partial-twuality polynomials and monodromy computations. Eur. J. Comb. 95: 103329 (2021)- 2020
- [j55]Jonathan L. Gross, Toufik Mansour, Thomas W. Tucker:
Partial duality for ribbon graphs, I: Distributions. Eur. J. Comb. 86: 103084 (2020) - [j54]Ergun Akleman, Jianer Chen, Jonathan L. Gross, Shiyu Hu:
A Topologically Complete Theory of Weaving. SIAM J. Discret. Math. 34(4): 2457-2480 (2020)
2010 – 2019
- 2018
- [j53]Jonathan L. Gross, Imran F. Khan, Toufik Mansour, Thomas W. Tucker:
Calculating genus polynomials via string operations and matrices. Ars Math. Contemp. 15(2): 267-295 (2018) - [j52]Yichao Chen, Jonathan L. Gross, Toufik Mansour:
On the genus distributions of wheels and of related graphs. Discret. Math. 341(4): 934-945 (2018) - [j51]Yichao Chen, Jonathan L. Gross:
An Euler-genus approach to the calculation of the crosscap-number polynomial. J. Graph Theory 88(1): 80-100 (2018) - 2017
- [j50]Jonathan L. Gross, Toufik Mansour, Thomas W. Tucker:
Valence-partitioned genus polynomials and their application to generalized dipoles. Australas. J Comb. 67: 203-221 (2017) - 2016
- [j49]Jonathan L. Gross, Toufik Mansour, Thomas W. Tucker, David G. L. Wang:
Iterated claws have real-rooted genus polynomials. Ars Math. Contemp. 10(2): 255-268 (2016) - [j48]Jonathan L. Gross, Toufik Mansour, Thomas W. Tucker, David G. L. Wang:
Combinatorial conjectures that imply local log-concavity of graph genus polynomials. Eur. J. Comb. 52: 207-222 (2016) - 2015
- [j47]Ergun Akleman, Jianer Chen, Jonathan L. Gross:
Block meshes: Topologically robust shape modeling with graphs embedded on 3-manifolds. Comput. Graph. 46: 306-326 (2015) - [j46]Ergun Akleman, Jianer Chen, Jonathan L. Gross:
Extended graph rotation systems as a model for cyclic weaving on orientable surfaces. Discret. Appl. Math. 193: 61-79 (2015) - [j45]Jonathan L. Gross, Toufik Mansour, Thomas W. Tucker, David G. L. Wang:
Log-concavity of the genus polynomials of Ringel Ladders. Electron. J. Graph Theory Appl. 3(2): 109-126 (2015) - [j44]Jonathan L. Gross, Toufik Mansour, Thomas W. Tucker, David G. L. Wang:
Log-Concavity of Combinations of Sequences and Applications to Genus Distributions. SIAM J. Discret. Math. 29(2): 1002-1029 (2015) - 2014
- [j43]Jonathan L. Gross:
Embeddings of graphs of fixed treewidth and bounded degree. Ars Math. Contemp. 7(2): 379-403 (2014) - [j42]Mehvish I. Poshni, Imran F. Khan, Jonathan L. Gross:
Genus distributions of iterated 3-wheels and 3-prisms. Ars Math. Contemp. 7(2): 423-440 (2014) - [j41]Jonathan L. Gross, Imran F. Khan, Mehvish I. Poshni:
Genus Distributions for Iterated Claws. Electron. J. Comb. 21(1): 1 (2014) - [j40]Jonathan L. Gross, Michal Kotrbcík, Timothy Sun:
Genus distributions of cubic series-parallel graphs. Discret. Math. Theor. Comput. Sci. 16(3): 129-146 (2014) - [j39]Yichao Chen, Jonathan L. Gross, Xiaodong Hu:
Enumeration of digraph embeddings. Eur. J. Comb. 36: 660-678 (2014) - [j38]Jonathan L. Gross, Toufik Mansour, Thomas W. Tucker:
Log-concavity of genus distributions of ring-like families of graphs. Eur. J. Comb. 42: 74-91 (2014) - [i1]Jonathan L. Gross, Michal Kotrbcík, Timothy Sun:
Genus Distributions of cubic series-parallel graphs. CoRR abs/1407.8031 (2014) - 2013
- [j37]Jonathan L. Gross:
Embeddings of cubic Halin graphs: Genus distributions. Ars Math. Contemp. 6(1): 37-56 (2013) - [j36]Yichao Chen, Jonathan L. Gross, Toufik Mansour:
Total Embedding Distributions of Circular Ladders. J. Graph Theory 74(1): 32-57 (2013) - 2012
- [j35]Mehvish I. Poshni, Imran F. Khan, Jonathan L. Gross:
Genus distributions of graphs under self-edge-amalgamations. Ars Math. Contemp. 5(1): 127-148 (2012) - [j34]Shiyu Hu, Qing Xing, Ergun Akleman, Jianer Chen, Jonathan L. Gross:
Pattern mapping with quad-pattern-coverable quad-meshes. Comput. Graph. 36(5): 455-465 (2012) - [j33]Imran F. Khan, Mehvish I. Poshni, Jonathan L. Gross:
Genus distribution of P3□Pn. Discret. Math. 312(19): 2863-2871 (2012) - [j32]Yichao Chen, Jonathan L. Gross, Toufik Mansour:
Genus distributions of star-ladders. Discret. Math. 312(20): 3059-3067 (2012) - 2011
- [j31]Jonathan L. Gross:
Genus distribution of graph amalgamations: self-pasting at root-vertices. Australas. J Comb. 49: 19-38 (2011) - [j30]Ergun Akleman, Jianer Chen, Yen-Lin Chen, Qing Xing, Jonathan L. Gross:
Cyclic twill-woven objects. Comput. Graph. 35(3): 623-631 (2011) - [j29]Mehvish I. Poshni, Imran F. Khan, Jonathan L. Gross:
Genus Distributions of 4-Regular Outerplanar Graphs. Electron. J. Comb. 18(1) (2011) - [j28]Jonathan L. Gross, Thomas W. Tucker:
A Celtic Framework for Knots and Links. Discret. Comput. Geom. 46(1): 86-99 (2011) - [j27]Jonathan L. Gross:
Genus Distributions of Cubic Outerplanar Graphs. J. Graph Algorithms Appl. 15(2): 295-316 (2011) - [c6]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 - [c5]Shi-Yu, Qing Xing, Ergun Akleman, Jianer Chen, Jonathan L. Gross:
Pattern mapping with quad-pattern-coverable quad-meshes. SIGGRAPH Talks 2011: 26 - [c4]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 - 2010
- [j26]Jonathan L. Gross, Imran F. Khan, Mehvish I. Poshni:
Genus Distribution of Graph Amalgamations: Pasting at Root-Vertices. Ars Comb. 94 (2010) - [j25]Mehvish I. Poshni, Imran F. Khan, Jonathan L. Gross:
Genus distributions of graphs under edge-amalgamations. Ars Math. Contemp. 3(1): 69-86 (2010) - [j24]Imran F. Khan, Mehvish I. Poshni, Jonathan L. Gross:
Genus distribution of graph amalgamations: Pasting when one root has arbitrary degree. Ars Math. Contemp. 3(2): 121-138 (2010) - [c3]Qing Xing, Ergun Akleman, Jianer Chen, Jonathan L. Gross:
Single-Cycle Plain-Woven Objects. Shape Modeling International 2010: 90-99 - [c2]Ergun Akleman, Jianer Chen, Jonathan L. Gross:
Paper-Strip Sculptures. Shape Modeling International 2010: 236-240
2000 – 2009
- 2009
- [j23]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): 78 (2009) - 2008
- [b1]Jonathan L. Gross:
Combinatorial Methods with Computer Applications. Chapman and Hall/CRC 2008, ISBN 978-1-584-88743-0 - 2003
- [p2]Jonathan L. Gross, Jay Yellen, Lowell W. Beineke, Robin J. Wilson:
Introduction to Graphs. Handbook of Graph Theory 2003: 1-55 - [p1]Tomaz Pisanski, Primoz Potocnik, Jianer Chen, Jonathan L. Gross, Thomas W. Tucker, Andrew Vince, Dan Archdeacon, Seiya Negami, Arthur T. White:
Topological Graph Theory. Handbook of Graph Theory 2003: 610-786 - [e2]Jonathan L. Gross, Jay Yellen:
Handbook of Graph Theory. Discrete Mathematics and Its Applications, Chapman & Hall / Taylor & Francis 2003, ISBN 978-1-58488-090-5 [contents]
1990 – 1999
- 1999
- [e1]Kenneth H. Rosen, John G. Michaels, Jonathan L. Gross, Jerrold W. Grossman, Douglas R. Shier:
Handbook of Discrete and Combinatorial Mathematics. CRC Press 1999, ISBN 978-0-8493-0149-0 [contents] - 1996
- [j22]Jianer Chen, Dan Archdeacon, Jonathan L. Gross:
Maximum genus and connectivity. Discret. Math. 149(1-3): 19-29 (1996) - [j21]Jianer Chen, Saroja P. Kanchi, Jonathan L. Gross:
A tight lower bound on the maximum genus of a simplicial graph. Discret. Math. 156(1-3): 83-102 (1996) - [j20]Jonathan L. Gross, Jianer Chen:
Algebraic Specification of Interconnection Network Relationships by Permutation Voltage Graph Mappings. Math. Syst. Theory 29(5): 451-470 (1996) - 1995
- [j19]Jonathan L. Gross, Thomas W. Tucker:
Stratified graphs for imbedding systems. Discret. Math. 143(1-3): 71-85 (1995) - [j18]Jianer Chen, Jonathan L. Gross, Robert G. Rieper:
Lower bounds for the average genus. J. Graph Theory 19(3): 281-296 (1995) - 1994
- [j17]Jianer Chen, Jonathan L. Gross, Robert G. Rieper:
Overlap matrices and total imbedding distributions. Discret. Math. 128(1-3): 73-94 (1994) - 1993
- [j16]Jonathan L. Gross, E. Ward Klein, Robert G. Rieper:
On the average genus of a graph. Graphs Comb. 9(2-4): 153-162 (1993) - [j15]Jianer Chen, Jonathan L. Gross:
Kuratowski-Type Theorems for Average Genus. J. Comb. Theory B 57(1): 100-121 (1993) - 1992
- [j14]Jianer Chen, Jonathan L. Gross:
Limit points for average genus. I. 3-Connected and 2-connected simplicial graphs. J. Comb. Theory B 55(1): 83-103 (1992) - [j13]Jianer Chen, Jonathan L. Gross:
Limit points for average genus II. 2-Connected non-simplicial graphs. J. Comb. Theory B 56(1): 108-129 (1992) - [c1]Jonathan I. Helfman, Jonathan L. Gross:
Extending a Graph Browser for Topological Graph Theory. Computational Support for Discrete Mathematics 1992: 297-314 - 1991
- [j12]Jonathan L. Gross, Robert G. Rieper:
Local extrema in genus-stratified graphs. J. Graph Theory 15(2): 159-171 (1991)
1980 – 1989
- 1989
- [j11]Merrick L. Furst, Jonathan L. Gross, Richard Statman:
Genus distributions for two classes of graphs. J. Comb. Theory B 46(1): 22-36 (1989) - [j10]Jonathan L. Gross, David P. Robbinsand, Thomas W. Tucker:
Genus distributions for bouquets of circles. J. Comb. Theory B 47(3): 292-306 (1989) - 1988
- [j9]Merrick L. Furst, Jonathan L. Gross, Lyle A. McGeoch:
Finding a maximum-genus graph imbedding. J. ACM 35(3): 523-534 (1988) - 1987
- [j8]Jonathan L. Gross, Merrick L. Furst:
Hierarchy for imbedding-distribution invariants of a graph. J. Graph Theory 11(2): 205-220 (1987) - 1980
- [j7]Jonathan L. Gross, Samuel J. Lomonaco:
A determination of the toroidal k-metacyclic groups. J. Graph Theory 4(2): 165-172 (1980) - [j6]Jonathan L. Gross, Frank Harary:
Some problems in topological graph theory. J. Graph Theory 4(3): 253-263 (1980)
1970 – 1979
- 1979
- [j5]Jonathan L. Gross, Ronald H. Rosen:
A Linear Time Planarity Algorithm for 2-Complexes. J. ACM 26(4): 611-617 (1979) - 1978
- [j4]Jonathan L. Gross:
An infinite family of octahedral crossing numbers. J. Graph Theory 2(2): 171-178 (1978) - 1977
- [j3]Jonathan L. Gross, Thomas W. Tucker:
Generating all graph coverings by permutation voltage assignments. Discret. Math. 18(3): 273-283 (1977) - [j2]Jonathan L. Gross:
Every connected regular graph of even degree is a Schreier coset graph. J. Comb. Theory B 22(3): 227-232 (1977) - 1974
- [j1]Jonathan L. Gross:
Voltage graphs. Discret. Math. 9(3): 239-246 (1974)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 21:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
