Search the dblp DataBase

Publications of Author

1. Fábio Viduani Martinez, José Coelho de Pina, José Soares
   Algorithms for Terminal Steiner Trees. [Citation Graph (0, 0)][DBLP]
   COCOON, 2005, pp:369-379 [Conf]
   
2. 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:192-201 [Conf]
   
3. Elói Araújo, José Soares
   Scoring Matrices That Induce Metrics on Sequences. [Citation Graph (0, 0)][DBLP]
   LATIN, 2006, pp:68-79 [Conf]
   
4. José Soares, Marco Stefanes
   BSP/CGM Algorithm for Maximum Matching in Convex Bipartite Graphs. [Citation Graph (0, 0)][DBLP]
   SBAC-PAD, 2003, pp:167-174 [Conf]
   
5. 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:942-943 [Conf]
   
6. 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:81-100 [Journal]
   
7. José Soares
   Approximating Euclidean Distances by Small Degree Graphs. [Citation Graph (0, 0)][DBLP]
   Discrete & Computational Geometry, 1994, v:11, n:, pp:213-233 [Journal]
   
8. 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:125-144 [Journal]
   
9. 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:323-327 [Journal]
   
10. 
    Algorithms for Maximum Independent Set in Convex Bipartite Graphs. [Citation Graph (, )][DBLP]