|
Search the dblp DataBase
J. Orestes Cerdeira:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- J. Orestes Cerdeira, Isabel Faria, Paulo Bárcia
Establishing Determinantal Inequalities for Positive-definite Matrices. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1995, v:63, n:1, pp:13-24 [Journal]
- J. Orestes Cerdeira, Leonor S. Pinto
Requiring Connectivity in the Set Covering Problem. [Citation Graph (0, 0)][DBLP] J. Comb. Optim., 2005, v:9, n:1, pp:35-47 [Journal]
- J. Orestes Cerdeira
Matroids and a forest cover problem. [Citation Graph (0, 0)][DBLP] Math. Program., 1994, v:66, n:, pp:403-405 [Journal]
- Paulo Bárcia, J. Orestes Cerdeira
Node packings on cocomparability graphs. [Citation Graph (0, 0)][DBLP] Oper. Res. Lett., 2003, v:31, n:3, pp:341-342 [Journal]
- Paulo Bárcia, J. Orestes Cerdeira
The k-Track Assignment Problem on Partial Orders. [Citation Graph (0, 0)][DBLP] J. Scheduling, 2005, v:8, n:2, pp:135-143 [Journal]
- Jorge Cadima, J. Orestes Cerdeira, Manuel Minhoto
Computational aspects of algorithms for variable selection in the context of principal components. [Citation Graph (0, 0)][DBLP] Computational Statistics & Data Analysis, 2004, v:47, n:2, pp:225-236 [Journal]
- F. Göbel, J. Orestes Cerdeira, Henk Jan Veldman
Label-connected graphs and the gossip problem. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1991, v:87, n:1, pp:29-40 [Journal]
- J. Orestes Cerdeira, Paulo Bárcia
Ordered matroids and regular independence systems. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1996, v:154, n:1-3, pp:255-261 [Journal]
k-Colour Partitions of Acyclic Tournaments. [Citation Graph (, )][DBLP]
Efficient edge domination in regular graphs. [Citation Graph (, )][DBLP]
Search in 0.001secs, Finished in 0.002secs
|