| 2009 |
|---|
| 11 | EE | José Soares,
Marco A. Stefanes:
Algorithms for Maximum Independent Set in Convex Bipartite Graphs.
Algorithmica 53(1): 35-49 (2009) |
| 2007 |
|---|
| 10 | EE | Fábio Viduani Martinez,
José Coelho de Pina,
José Soares:
Algorithms for terminal Steiner trees.
Theor. Comput. Sci. 389(1-2): 133-142 (2007) |
| 2006 |
|---|
| 9 | EE | Elói Araújo,
José Soares:
Scoring Matrices That Induce Metrics on Sequences.
LATIN 2006: 68-79 |
| 2005 |
|---|
| 8 | EE | Fábio Viduani Martinez,
José Coelho de Pina,
José Soares:
Algorithms for Terminal Steiner Trees.
COCOON 2005: 369-379 |
| 2003 |
|---|
| 7 | EE | José Soares,
Marco A. Stefanes:
BSP/CGM Algorithm for Maximum Matching in Convex Bipartite Graphs.
SBAC-PAD 2003: 167-174 |
| 6 | EE | José Coelho de Pina,
José Soares:
Improved bound for the Carathéodory rank of the bases of a matroid.
J. Comb. Theory, Ser. B 88(2): 323-327 (2003) |
| 2000 |
|---|
| 5 | EE | José Coelho de Pina,
José Soares:
A new bound for the Carathéodory rank of the bases of a matroid.
SODA 2000: 942-943 |
| 1995 |
|---|
| 4 | | Barun Chandra,
Gautam Das,
Giri Narasimhan,
José Soares:
New sparseness results on graph spanners.
Int. J. Comput. Geometry Appl. 5: 125-144 (1995) |
| 1994 |
|---|
| 3 | | José Soares:
Approximating Euclidean Distances by Small Degree Graphs.
Discrete & Computational Geometry 11: 213-233 (1994) |
| 1993 |
|---|
| 2 | | Ingo Althöfer,
Gautam Das,
David P. Dobkin,
Deborah Joseph,
José Soares:
On Sparse Spanners of Weighted Graphs.
Discrete & Computational Geometry 9: 81-100 (1993) |
| 1992 |
|---|
| 1 | EE | Barun Chandra,
Gautam Das,
Giri Narasimhan,
José Soares:
New Sparseness Results on Graph Spanners.
Symposium on Computational Geometry 1992: 192-201 |
