The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

José Coelho de Pina: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

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. 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]
  3. John M. Boyer, Cristina G. Fernandes, Alexandre Noma, José Coelho de Pina
    Lempel, Even, and Cederbaum Planarity Method. [Citation Graph (0, 0)][DBLP]
    WEA, 2004, pp:129-144 [Conf]
  4. Hein van der Holst, José Coelho de Pina
    Length-bounded disjoint paths in planar graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:120, n:1-3, pp:251-261 [Journal]
  5. 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]
  6. Paulo Feofiloff, Cristina G. Fernandes, Carlos E. Ferreira, José Coelho de Pina
    Primal-dual approximation algorithms for the Prize-Collecting Steiner Tree Problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2007, v:103, n:5, pp:195-202 [Journal]

  7. A note on Johnson, Minkoff and Phillips' algorithm for the Prize-Collecting Steiner Tree Problem [Citation Graph (, )][DBLP]


Search in 0.000secs, Finished in 0.001secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002