A minimax theorem on circuits in projective graphs. - Sóstenes Lins (J. Comb. Theory B, 1981)

Graph-encoded maps. - Sóstenes Lins (J. Comb. Theory B, 1982)

A simple proof of Gagliardi's handle recognition theorem. - Sóstenes Lins (Discret. Math., 1985)

Graph-encoded 3-manifolds. - Sóstenes Lins; Arnaldo Mandel (Discret. Math., 1985)

On the Fundamental Group of 3-Gems and a 'Planar' Class of 3-manifolds. - Sóstenes Lins (Eur. J. Comb., 1988)

Invariant Groups on Equivalent Crystallizations. - Sóstenes Lins (Eur. J. Comb., 1989)

Topological aspects of edge fusions in 4-graphs. - Massimo Ferri; Sóstenes Lins (J. Comb. Theory B, 1991)

Decomposition of the vertex group of 3-manifolds. - Louis H. Kauffman; Sóstenes Lins (Discret. Math., 1992)

The Fundamental Groups of Closed orientable 3-Manifolds admitting Colored Triangulations with Less than 30 Tetrahedra. - Sóstenes Lins; Said Sidki (Int. J. Algebra Comput., 1995)

Twistors bridges among 3-manifolds. - Sóstenes Lins (Discret. Math., 1997)

Symmetry Robust Memory Management of Multidimensional Arrays. - Lauro Lins; Sóstenes Lins; Silvio Melo (Electron. Notes Discret. Math., 2001)

An n-tet graph approach for non-guillotine packings of n-dimensional boxes into an n-container. - Lauro Lins; Sóstenes Lins; Reinaldo Morabito (Eur. J. Oper. Res., 2002)

PHORMA: Perfectly Hashed Order Restricted Multidimensional Array - Lauro Lins; Sóstenes Lins; Silvio Melo (CoRR, 2003)

An L-approach for packing (ℓ, w)-rectangles into rectangular and L-shaped pieces. - Lauro Lins; Sóstenes Lins; Reinaldo Morabito (J. Oper. Res. Soc., 2003)

Phorma: perfectly hashable order restricted multidimensional arrays. - Lauro Lins; Sóstenes Lins; Silvio Melo (Discret. Appl. Math., 2004)

A homological solution for the Gauss code problem in arbitrary surfaces. - Sóstenes Lins; Emerson Oliveira-Lima; Valdenberg Silva (J. Comb. Theory B, 2008)