
Search the dblp DataBase
José Soares:
[Publications]
[Author Rank by year]
[Coauthors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
 Fábio Viduani Martinez, José Coelho de Pina, José Soares
Algorithms for Terminal Steiner Trees. [Citation Graph (0, 0)][DBLP] COCOON, 2005, pp:369379 [Conf]
 Barun Chandra, Gautam Das, Giri Narasimhan, José Soares
New Sparseness Results on Graph Spanners. [Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 1992, pp:192201 [Conf]
 Elói Araújo, José Soares
Scoring Matrices That Induce Metrics on Sequences. [Citation Graph (0, 0)][DBLP] LATIN, 2006, pp:6879 [Conf]
 José Soares, Marco Stefanes
BSP/CGM Algorithm for Maximum Matching in Convex Bipartite Graphs. [Citation Graph (0, 0)][DBLP] SBACPAD, 2003, pp:167174 [Conf]
 José Coelho de Pina, José Soares
A new bound for the Carathéodory rank of the bases of a matroid. [Citation Graph (0, 0)][DBLP] SODA, 2000, pp:942943 [Conf]
 Ingo Althöfer, Gautam Das, David P. Dobkin, Deborah Joseph, José Soares
On Sparse Spanners of Weighted Graphs. [Citation Graph (0, 0)][DBLP] Discrete & Computational Geometry, 1993, v:9, n:, pp:81100 [Journal]
 José Soares
Approximating Euclidean Distances by Small Degree Graphs. [Citation Graph (0, 0)][DBLP] Discrete & Computational Geometry, 1994, v:11, n:, pp:213233 [Journal]
 Barun Chandra, Gautam Das, Giri Narasimhan, José Soares
New sparseness results on graph spanners. [Citation Graph (0, 0)][DBLP] Int. J. Comput. Geometry Appl., 1995, v:5, n:, pp:125144 [Journal]
 José Coelho de Pina, José Soares
Improved bound for the Carathéodory rank of the bases of a matroid. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 2003, v:88, n:2, pp:323327 [Journal]
Algorithms for Maximum Independent Set in Convex Bipartite Graphs. [Citation Graph (, )][DBLP]
Search in 0.587secs, Finished in 0.588secs
