## Stem genus$ (all stems)

### 18 papers:

- STOC-2015-KawarabayashiS #approximate #graph
- Beyond the Euler Characteristic: Approximating the Genus of General Graphs (KiK, AS), pp. 675–682.
- STOC-2014-ElberfeldK #bound #graph
- Embedding and canonizing graphs of bounded genus in logspace (ME, KiK), pp. 383–392.
- ICPR-2012-YuL #3d #refinement
- Genus refinement of a manifold surface reconstructed by sculpting the 3d-Delaunay triangulation of Structure-from-Motion points (SY, ML), pp. 1021–1025.
- ICALP-v1-2011-KawarabayashiKS #approximate #bound #distance #graph
- Linear-Space Approximate Distance Oracles for Planar, Bounded-Genus and Minor-Free Graphs (KiK, PNK, CS), pp. 135–146.
- SAC-2007-Dufourd #framework #proving #theorem
- A hypermap framework for computer-aided proofs in surface subdivisions: genus theorem and Euler’s formula (JFD), pp. 757–761.
- ICALP-v1-2006-DjidjevV #graph
- Planar Crossing Numbers of Genus g Graphs (HD, IV), pp. 419–430.
- ICPR-v2-2006-LiuL #classification #image #using
- Genus-Zero Shape Classification Using Spherical Normal Image (SL, JL), pp. 126–129.
- ICALP-2005-HanedaKT
- Suitable Curves for Genus-4 HCC over Prime Fields: Point Counting Formulae for Hyperelliptic Curves of Type y2=x2k+1+ax (MH, MK, TT), pp. 539–550.
- STOC-2004-Kelner #bound #clustering #graph
- Spectral partitioning, eigenvalue bounds, and circle packings for graphs of bounded genus (JAK), pp. 455–464.
- ICALP-2003-ChenKPSX #complexity #graph #problem
- Genus Characterizes the Complexity of Graph Problems: Some Tight Results (JC, IAK, LP, ES, GX), pp. 845–856.
- STOC-2002-AgolHT
- 3-manifold knot genus is NP-complet (IA, JH, WPT), pp. 761–766.
- STOC-2000-MahajanV #graph
- A new NC-algorithm for finding a perfect matching in bipartite planar and small genus graphs (extended abstract) (MM, KRV), pp. 351–357.
- ICALP-1999-GavoilleH #bound #graph
- Compact Routing Tables for Graphs of Bounded Genus (CG, NH), pp. 351–360.
- STOC-1991-DjidjevR #algorithm #performance #problem
- An Efficient Algorithm for the Genus Problem with Explicit Construction of Forbidden Subgraphs (HD, JHR), pp. 337–347.
- STOC-1987-HeathI #graph
- The Pagenumber of Genus g Graphs is O(g) (LSH, SI), pp. 388–397.
- STOC-1980-FilottiM #algorithm #graph #morphism #polynomial
- A Polynomial-time Algorithm for Determining the Isomorphism of Graphs of Fixed Genus (Working Paper) (ISF, JNM), pp. 236–243.
- STOC-1980-Miller #bound #graph #morphism #testing
- Isomorphism Testing for Graphs of Bounded Genus (GLM), pp. 225–235.
- STOC-1979-FilottiMR #graph #on the
- On Determining the Genus of a Graph in O(v^O(g)) Steps (ISF, GLM, JHR), pp. 27–37.