Sóstenes Lins

According to our database1, Sóstenes Lins authored at least 16 papers between 1981 and 2008.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2008
A homological solution for the Gauss code problem in arbitrary surfaces.
J. Comb. Theory, Ser. B, 2008

2004
Phorma: perfectly hashable order restricted multidimensional arrays.
Discret. Appl. Math., 2004

2003
An <i>L</i>-approach for packing (<i>ℓ</i>, <i>w</i>)-rectangles into rectangular and <i>L</i>-shaped pieces.
J. Oper. Res. Soc., 2003

PHORMA: Perfectly Hashed Order Restricted Multidimensional Array
CoRR, 2003

2002
An n-tet graph approach for non-guillotine packings of n-dimensional boxes into an n-container.
Eur. J. Oper. Res., 2002

2001
Symmetry Robust Memory Management of Multidimensional Arrays.
Electron. Notes Discret. Math., 2001

1997
Twistors bridges among 3-manifolds.
Discret. Math., 1997

1995
The Fundamental Groups of Closed orientable 3-Manifolds admitting Colored Triangulations with Less than 30 Tetrahedra.
Int. J. Algebra Comput., 1995

1992
Decomposition of the vertex group of 3-manifolds.
Discret. Math., 1992

1991
Topological aspects of edge fusions in 4-graphs.
J. Comb. Theory, Ser. B, 1991

1989
Invariant Groups on Equivalent Crystallizations.
Eur. J. Comb., 1989

1988
On the Fundamental Group of 3-Gems and a 'Planar' Class of 3-manifolds.
Eur. J. Comb., 1988

1985
Graph-encoded 3-manifolds.
Discret. Math., 1985

A simple proof of Gagliardi's handle recognition theorem.
Discret. Math., 1985

1982
Graph-encoded maps.
J. Comb. Theory, Ser. B, 1982

1981
A minimax theorem on circuits in projective graphs.
J. Comb. Theory, Ser. B, 1981


  Loading...