Publications :: Search

Show author

On this page you see the details of the selected author.

Author information
First name:	J. Orestes
Last name:	Cerdeira
DBLP:	80/6086
Rating:	(not rated yet)
Bookmark:

Below you find the publications which have been written by this author.

Show item 1 to 10 of 10  

Select a publication
Show	Title	Venue	Rating	Date
	Domingos Moreira Cardoso, J. Orestes Cerdeira, Charles Delorme, Pedro C. Silva. Efficient edge domination in regular graphs.	Discrete Applied Mathematics 2008, Volume 156	(0)	2008
	Paulo Bárcia, J. Orestes Cerdeira. k-Colour Partitions of Acyclic Tournaments.	Electr. J. Comb. 2005, Volume 12	(0)	2005
	J. Orestes Cerdeira, Leonor S. Pinto. Requiring Connectivity in the Set Covering Problem.	J. Comb. Optim. 2005, Volume 9	(0)	2005
	Paulo Bárcia, J. Orestes Cerdeira. The	J. Scheduling 2005, Volume 8	(0)	2005
	Jorge Cadima, J. Orestes Cerdeira, Manuel Minhoto. Computational aspects of algorithms for variable selection in the context of principal components.	Computational Statistics Data Analysis 2004, Volume 47	(0)	2004
	Paulo Bárcia, J. Orestes Cerdeira. Node packings on cocomparability graphs.	Oper. Res. Lett. 2003, Volume 31	(0)	2003
	J. Orestes Cerdeira, Paulo Bárcia. Ordered matroids and regular independence systems.	Discrete Mathematics 1996, Volume 154	(0)	1996
	J. Orestes Cerdeira, Isabel Faria, Paulo Bárcia. Establishing Determinantal Inequalities for Positive-definite Matrices.	Discrete Applied Mathematics 1995, Volume 63	(0)	1995
	J. Orestes Cerdeira. Matroids and a forest cover problem.	Math. Program. 1994, Volume 66	(0)	1994
	F. Göbel, J. Orestes Cerdeira, Henk Jan Veldman. Label-connected graphs and the gossip problem.	Discrete Mathematics 1991, Volume 87	(0)	1991

Your query returned 10 matches in the database.