Sóstenes Lins - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 15 from 15

2008

A homological solution for the Gauss code problem in arbitrary surfacesSóstenes Lins, Emerson Oliveira-Lima, Valdenberg Silva. JCT, 98(3):506-515, 2008. [doi]

2004

Phorma: perfectly hashable order restricted multidimensional arraysLauro Lins, Sóstenes Lins, Silvio Melo. DAM, 141(1-3):209-223, 2004. [doi]

2003

L-shaped piecesLauro Lins, Sóstenes Lins, Reinaldo Morabito. jors, 54(7):777-789, 2003. [doi]

2002

An n-tet graph approach for non-guillotine packings of n-dimensional boxes into an n-containerLauro Lins, Sóstenes Lins, Reinaldo Morabito. eor, 141(2):421-439, 2002. [doi]

2001

Symmetry Robust Memory Management of Multidimensional ArraysLauro Lins, Sóstenes Lins, Silvio Melo. endm, 7:34-37, 2001. [doi]

1997

Twistors bridges among 3-manifoldsSóstenes Lins. DM, 177(1-3):145-165, 1997. [doi]

1995

The Fundamental Groups of Closed orientable 3-Manifolds admitting Colored Triangulations with Less than 30 TetrahedraSóstenes Lins, Said Sidki. ijac, 5(2):205-250, 1995. [doi]

1992

Decomposition of the vertex group of 3-manifoldsLouis Kauffman, Sóstenes Lins. DM, 103(1):49-55, 1992. [doi]

1991

Topological aspects of edge fusions in 4-graphsMassimo Ferri, Sóstenes Lins. JCT, 51(2):227-243, 1991. [doi]

1989

Invariant Groups on Equivalent CrystallizationsSóstenes Lins. ejc, 10(6):575-584, 1989. [doi]

1988

On the Fundamental Group of 3-Gems and a 'Planar' Class of 3-manifoldsSóstenes Lins. ejc, 9(4):291-305, 1988. [doi]

1985

Graph-encoded 3-manifoldsSóstenes Lins, Arnaldo Mandel. DM, 57(3):261-284, 1985. [doi]

A simple proof of Gagliardi s handle recognition theoremSóstenes Lins. DM, 57(3):253-260, 1985. [doi]

1982

Graph-encoded mapsSóstenes Lins. JCT, 32(2):171-181, 1982. [doi]

1981

A minimax theorem on circuits in projective graphsSóstenes Lins. JCT, 30(3):253-262, 1981. [doi]

Sign in or sign up to see more results.

runs on WebDSL