Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Carlos Eduardo Ferreira
2010 – today
- 2012
[j24]Carlos Eduardo Ferreira, Fábio Protti, Jayme Luiz Szwarcfiter: V Latin-American Algorithms, Graphs, and Optimization Symposium - Gramado, Brazil, 2009. Discrete Applied Mathematics 160(18): 2499-2501 (2012)
[j23]Carlos Eduardo Ferreira, Ute Günther, Alexander Martin: Mathematical Models and Polyhedral Studies for Integral Sheet Metal Design. SIAM Journal on Optimization 22(4): 1493-1517 (2012)
[i3]Carlos Eduardo Ferreira, Álvaro Junio Pereira Franco: Algorithms for Junctions in Directed Acyclic Graphs. CoRR abs/1204.3113 (2012)
[i2]Daniel Yasumasa Takahashi, João Ricardo Sato, Carlos Eduardo Ferreira, André Fujita: Discriminating different classes of biological networks by analyzing the graphs spectra distribution. CoRR abs/1208.2976 (2012)- 2011
[j22]Cristina G. Fernandes, Carlos Eduardo Ferreira, Flavio Keidi Miyazawa, Yoshiko Wakabayashi: Selfish Square Packing. Electronic Notes in Discrete Mathematics 37: 369-374 (2011)
[j21]André Fujita, João Ricardo Sato, Marcos Angelo Almeida Demasi, Rui Yamaguchi, Teppei Shimamura, Carlos Eduardo Ferreira, Mari Cleide Sogayar, Satoru Miyano: Inferring Contagion in Regulatory Networks. IEEE/ACM Trans. Comput. Biology Bioinform. 8(2): 570-576 (2011)- 2010
[j20]Said Sadique Adi, Marília D. V. Braga, Cristina G. Fernandes, Carlos Eduardo Ferreira, Fábio Viduani Martinez, Marie-France Sagot, Marco A. Stefanes, Christian Tjandraatmadja, Yoshiko Wakabayashi: Repetition-free longest common subsequence. Discrete Applied Mathematics 158(12): 1315-1324 (2010)
[j19]Carlos Eduardo Ferreira, Christian Tjandraatmadja: A branch-and-cut approach to the repetition-free longest common subsequence problem. Electronic Notes in Discrete Mathematics 36: 527-534 (2010)
[e1]Carlos Eduardo Ferreira, Satoru Miyano, Peter F. Stadler (Eds.): Advances in Bioinformatics and Computational Biology, 5th Brazilian Symposium on Bioinformatics, BSB 2010, Rio de Janeiro, Brazil, August 31-September 3, 2010. Proceedings. Lecture Notes in Computer Science 6268, Springer 2010, ISBN 978-3-642-15059-3
[i1]Paulo Feofiloff, Cristina G. Fernandes, Carlos Eduardo Ferreira, José Coelho de Pina: A note on Johnson, Minkoff and Phillips' algorithm for the Prize-Collecting Steiner Tree Problem. CoRR abs/1004.1437 (2010)
2000 – 2009
- 2009
[j18]Thomas M. Liebling, Jayme Luiz Szwarcfiter, Carlos Eduardo Ferreira, Fábio Protti: Preface. Electronic Notes in Discrete Mathematics 35: 1-2 (2009)
[j17]André Fujita, João Ricardo Sato, Marcos Angelo Almeida Demasi, Mari Cleide Sogayar, Carlos Eduardo Ferreira, Satoru Miyano: Comparing Pearson, Spearman and Hoeffding's d Measure for Gene Expression Association Analysis. J. Bioinformatics and Computational Biology 7(4): 663-684 (2009)- 2008
[j16]Said Sadique Adi, Marília D. V. Braga, Cristina G. Fernandes, Carlos Eduardo Ferreira, Fábio Viduani Martinez, Marie-France Sagot, Marco A. Stefanes, Christian Tjandraatmadja, Yoshiko Wakabayashi: Repetition-free longest common subsequence. Electronic Notes in Discrete Mathematics 30: 243-248 (2008)
[j15]André Fujita, João Ricardo Sato, Humberto Miguel Garay-Malpartida, Mari Cleide Sogayar, Carlos Eduardo Ferreira, Satoru Miyano: Modeling Nonlinear Gene Regulatory Networks from Time Series Gene Expression Data. J. Bioinformatics and Computational Biology 6(5): 961-979 (2008)
[c2]Cristina G. Fernandes, Carlos Eduardo Ferreira, Christian Tjandraatmadja, Yoshiko Wakabayashi: A Polyhedral Investigation of the LCS Problem and a Repetition-Free Variant. LATIN 2008: 329-338- 2007
[j14]André Fujita, João Ricardo Sato, Humberto Miguel Garay-Malpartida, Pedro Alberto Morettin, Mari Cleide Sogayar, Carlos Eduardo Ferreira: Time-varying modeling of gene expression regulatory networks using the wavelet dynamic vector autoregressive method. Bioinformatics 23(13): 1623-1630 (2007)
[j13]André Fujita, João Ricardo Sato, Carlos Eduardo Ferreira, Mari Cleide Sogayar: GEDI: a user-friendly toolbox for analysis of large-scale gene expression data. BMC Bioinformatics 8 (2007)
[j12]Paulo Feofiloff, Cristina G. Fernandes, Carlos Eduardo Ferreira, José Coelho de Pina: Primal-dual approximation algorithms for the Prize-Collecting Steiner Tree Problem. Inf. Process. Lett. 103(5): 195-202 (2007)- 2006
[j11]André Fujita, João Ricardo Sato, Leonardo de Oliveira Rodrigues, Carlos Eduardo Ferreira, Mari Cleide Sogayar: Evaluating different methods of microarray data normalization. BMC Bioinformatics 7: 469 (2006)
[j10]Carlos Eduardo Ferreira, Fernando M. de Oliveira Filho: Some formulations for the group steiner tree problem. Discrete Applied Mathematics 154(13): 1877-1884 (2006)
[j9]Carlos Eduardo Ferreira, Fernando M. de Oliveira Filho: New Reduction Techniques for the Group Steiner Tree Problem. SIAM Journal on Optimization 17(4): 1176-1188 (2006)- 2005
[j8]Said Sadique Adi, Carlos Eduardo Ferreira: Gene prediction by multiple syntenic alignment. J. Integrative Bioinformatics 2(1) (2005)
[c1]- 2004
[j7]Carlos Eduardo Ferreira, Fernando M. de Oliveira Filho: Some Formulations for the Group Steiner Tree Problem. Electronic Notes in Discrete Mathematics 18: 127-132 (2004)
[j6]O. Alves, Carlos Eduardo Ferreira, F. P. Machado: Estimates for the spreading velocity of an epidemic model. Mathematics and Computers in Simulation 64(6): 609-616 (2004)- 2002
[j5]Carlos Eduardo Ferreira, C. Carvalho de Souza, Yoshiko Wakabayashi: Rearrangement of DNA fragments: a branch-and-cut algorithm. Discrete Applied Mathematics 116(1-2): 161-177 (2002)- 2001
[j4]Said Sadique Adi, Carlos Eduardo Ferreira: DNA Fragments Assembly Programs: a comparative study. Electronic Notes in Discrete Mathematics 7: 158-161 (2001)- 2000
[j3]Ronaldo Fumio Hashimoto, Junior Barrera, Carlos Eduardo Ferreira: A Combinatorial Optimization Technique for the Sequential Decomposition of Erosions and Dilations. Journal of Mathematical Imaging and Vision 13(1): 17-33 (2000)
1990 – 1999
- 1998
[j2]Carlos Eduardo Ferreira, Alexander Martin, C. Carvalho de Souza, Robert Weismantel, Laurence A. Wolsey: The node capacitated graph partitioning problem: A computational study. Math. Program. 81: 229-256 (1998)- 1996
[j1]Carlos Eduardo Ferreira, Alexander Martin, C. Carvalho de Souza, Robert Weismantel, Laurence A. Wolsey: Formulations and valid inequalities for the node capacitated graph partitioning problem. Math. Program. 74: 247-266 (1996)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-01-22 19:44 CET by the dblp team



