J. Orestes Cerdeira

	2008
10		Domingos Moreira Cardoso, J. Orestes Cerdeira, Charles Delorme, Pedro C. Silva: Efficient edge domination in regular graphs. Discrete Applied Mathematics 156(15): 3060-3065 (2008)
	2005
9		Paulo Bárcia, J. Orestes Cerdeira: k-Colour Partitions of Acyclic Tournaments. Electr. J. Comb. 12: (2005)
8		J. Orestes Cerdeira, Leonor S. Pinto: Requiring Connectivity in the Set Covering Problem. J. Comb. Optim. 9(1): 35-47 (2005)
7		Paulo Bárcia, J. Orestes Cerdeira: The k-Track Assignment Problem on Partial Orders. J. Scheduling 8(2): 135-143 (2005)
	2004
6		Jorge Cadima, J. Orestes Cerdeira, Manuel Minhoto: Computational aspects of algorithms for variable selection in the context of principal components. Computational Statistics & Data Analysis 47(2): 225-236 (2004)
	2003
5		Paulo Bárcia, J. Orestes Cerdeira: Node packings on cocomparability graphs. Oper. Res. Lett. 31(3): 341-342 (2003)
	1996
4		J. Orestes Cerdeira, Paulo Bárcia: Ordered matroids and regular independence systems. Discrete Mathematics 154(1-3): 255-261 (1996)
	1995
3		J. Orestes Cerdeira, Isabel Faria, Paulo Bárcia: Establishing Determinantal Inequalities for Positive-definite Matrices. Discrete Applied Mathematics 63(1): 13-24 (1995)
	1994
2		J. Orestes Cerdeira: Matroids and a forest cover problem. Math. Program. 66: 403-405 (1994)
	1991
1		F. Göbel, J. Orestes Cerdeira, Henk Jan Veldman: Label-connected graphs and the gossip problem. Discrete Mathematics 87(1): 29-40 (1991)

Coauthor Index

1	Paulo Bárcia	[3] [4] [5] [7] [9]
2	Jorge Cadima	[6]
3	Domingos Moreira Cardoso	[10]
4	Charles Delorme	[10]
5	Isabel Faria	[3]
6	F. Göbel	[1]
7	Manuel Minhoto	[6]
8	Leonor S. Pinto	[8]
9	Pedro C. Silva	[10]
10	Henk Jan Veldman	[1]

Colors in the list of coauthors

Last update Sat Feb 11 22:55:45 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page