Carlos Eduardo Ferreira

According to our database1, Carlos Eduardo Ferreira authored at least 52 papers between 1993 and 2020.

Collaborative distances:



In proceedings 
PhD thesis 


Online presence:



An Efficient, Parallelized Algorithm for Optimal Conditional Entropy-Based Feature Selection.
Entropy, 2020

A PTAS for the metric case of the optimum weighted source-destination communication spanning tree problem.
Theor. Comput. Sci., 2019

Optimal Boolean lattice-based algorithms for the U-curve optimization problem.
Inf. Sci., 2019

Prices of Anarchy of Selfish 2D Bin Packing Games.
Int. J. Found. Comput. Sci., 2019

A min-max relation in flowgraphs and some applications.
Discret. Appl. Math., 2018

A PTAS for the metric case of the minimum sum-requirement communication spanning tree problem.
Discret. Appl. Math., 2017

The envy-free pricing problem, unit-demand markets and connections with the network pricing problem.
Discret. Optim., 2016

A min-max relation in flowgraphs.
Electron. Notes Discret. Math., 2015

PTAS's for Some Metric p-source Communication Spanning Tree Problems.
Proceedings of the WALCOM: Algorithms and Computation - 9th International Workshop, 2015

Solving the maximum edge biclique packing problem on unbalanced bipartite graphs.
Discret. Appl. Math., 2014

The U-curve optimization problem: improvements on the original algorithm and time complexity analysis.
CoRR, 2014

The Envy-Free Pricing Problem and Unit-Demand Markets.
Proceedings of the Combinatorial Optimization - Third International Symposium, 2014

Finding Matrimonial Circuits in some Amerindian Kinship Networks: An Experimental Study.
Proceedings of the 10th IEEE International Conference on e-Science, 2014

Syntenic global alignment and its application to the gene prediction problem.
J. Braz. Comput. Soc., 2013

The Unit-Demand Envy-Free Pricing Problem.
CoRR, 2013

Mathematical Models and Polyhedral Studies for Integral Sheet Metal Design.
SIAM J. Optim., 2012

V Latin-American Algorithms, Graphs, and Optimization Symposium - Gramado, Brazil, 2009.
Discret. Appl. Math., 2012

Discriminating different classes of biological networks by analyzing the graphs spectra distribution
CoRR, 2012

Algorithms for Junctions in Directed Acyclic Graphs
CoRR, 2012

Minimum Ratio Cover of Matrix Columns by Extreme Rays of Its Induced Cone.
Proceedings of the Combinatorial Optimization - Second International Symposium, 2012

Inferring Contagion in Regulatory Networks.
IEEE ACM Trans. Comput. Biol. Bioinform., 2011

A dynamic programming algorithm for the tree mapping problem.
Electron. Notes Discret. Math., 2011

Selfish Square Packing.
Electron. Notes Discret. Math., 2011

A branch-and-cut approach to the repetition-free longest common subsequence problem.
Electron. Notes Discret. Math., 2010

The biclique k-clustering problem in bipartite graphs and its application in bioinformatics.
Electron. Notes Discret. Math., 2010

A note on Johnson, Minkoff and Phillips' algorithm for the Prize-Collecting Steiner Tree Problem
CoRR, 2010

A Column Generation Approach for the Graph Matching Problem.
Proceedings of the 20th International Conference on Pattern Recognition, 2010

Comparing Pearson, Spearman and Hoeffding's d Measure for Gene Expression Association Analysis.
J. Bioinform. Comput. Biol., 2009

Parallelisation of a multi-neighbourhood local search heuristic for a phylogeny problem.
Int. J. Bioinform. Res. Appl., 2009

Electron. Notes Discret. Math., 2009

Modeling Nonlinear Gene Regulatory Networks from Time Series Gene Expression Data.
J. Bioinform. Comput. Biol., 2008

Repetition-free longest common subsequence.
Electron. Notes Discret. Math., 2008

A Polyhedral Investigation of the LCS Problem and a Repetition-Free Variant.
Proceedings of the LATIN 2008: Theoretical Informatics, 2008

Primal-dual approximation algorithms for the Prize-Collecting Steiner Tree Problem.
Inf. Process. Lett., 2007

Modeling gene expression regulatory networks with the sparse vector autoregressive model.
BMC Syst. Biol., 2007

GEDI: a user-friendly toolbox for analysis of large-scale gene expression data.
BMC Bioinform., 2007

Time-varying modeling of gene expression regulatory networks using the wavelet dynamic vector autoregressive method.
Bioinform., 2007

New Reduction Techniques for the Group Steiner Tree Problem.
SIAM J. Optim., 2006

Evaluating different methods of microarray data normalization.
BMC Bioinform., 2006

Gene prediction by multiple syntenic alignment.
J. Integr. Bioinform., 2005

Gene Prediction by Syntenic Alignment.
Proceedings of the Advances in Bioinformatics and Computational Biology, 2005

Estimates for the spreading velocity of an epidemic model.
Math. Comput. Simul., 2004

Some Formulations for the Group Steiner Tree Problem.
Electron. Notes Discret. Math., 2004

Rearrangement of DNA fragments: a branch-and-cut algorithm.
Discret. Appl. Math., 2002

DNA Fragments Assembly Programs: a comparative study.
Electron. Notes Discret. Math., 2001

A Combinatorial Optimization Technique for the Sequential Decomposition of Erosions and Dilations.
J. Math. Imaging Vis., 2000

Decomposing Matrices into Blocks.
SIAM J. Optim., 1998

The node capacitated graph partitioning problem: A computational study.
Math. Program., 1998

Solving Multiple Knapsack Problems by Cutting Planes.
SIAM J. Optim., 1996

Formulations and valid inequalities for the node capacitated graph partitioning problem.
Math. Program., 1996

On combinatorial optimization problems arising in computer system design.
PhD thesis, 1994

Some integer programs arising in the design of main frame computers.
ZOR Methods Model. Oper. Res., 1993