default search action
Carlos Eduardo Ferreira
Person information
- affiliation: Department of Computer Science, Institute of Mathematics and Statistics, University of São Paulo, Brazil
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j43]Carlos Eduardo Ferreira, Flavio Keidi Miyazawa, Orlando Lee:
Preface: LAGOS'21 - XI Latin and American Algorithms, Graphs, and Optimization Symposium - São Paulo - Brazil. Discret. Appl. Math. 341: 393 (2023) - 2021
- [e2]Carlos E. Ferreira, Orlando Lee, Flávio Keidi Miyazawa:
Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, LAGOS 2021, Online Event / São Paulo, Brazil, May 2021. Procedia Computer Science 195, Elsevier 2021 [contents] - 2020
- [j42]Gustavo Estrela, Marco Dimas Gubitoso
, Carlos Eduardo Ferreira, Junior Barrera
An Efficient, Parallelized Algorithm for Optimal Conditional Entropy-Based Feature Selection. Entropy 22(4): 492 (2020)
2010 – 2019
- 2019
- [j41]Cristina G. Fernandes
Prices of Anarchy of Selfish 2D Bin Packing Games. Int. J. Found. Comput. Sci. 30(3): 355-374 (2019) - [j40]Marcelo da Silva Reis
Optimal Boolean lattice-based algorithms for the U-curve optimization problem. Inf. Sci. 471: 97-114 (2019) - [j39]Santiago Valdés Ravelo
A PTAS for the metric case of the optimum weighted source-destination communication spanning tree problem. Theor. Comput. Sci. 771: 9-22 (2019) - 2018
- [j38]Carlos Eduardo Ferreira
A min-max relation in flowgraphs and some applications. Discret. Appl. Math. 245: 65-76 (2018) - 2017
- [j37]Santiago Valdés Ravelo
A PTAS for the metric case of the minimum sum-requirement communication spanning tree problem. Discret. Appl. Math. 228: 158-175 (2017) - [j36]Marcelo da Silva Reis
featsel: A framework for benchmarking of feature selection algorithms and cost functions. SoftwareX 6: 193-197 (2017) - [i6]Cristina G. Fernandes, Carlos E. Ferreira, Flávio Keidi Miyazawa, Yoshiko Wakabayashi:
Prices of anarchy of selfish 2D bin packing games. CoRR abs/1707.07882 (2017) - 2016
- [j35]Cristina G. Fernandes
The envy-free pricing problem, unit-demand markets and connections with the network pricing problem. Discret. Optim. 22: 141-161 (2016) - 2015
- [j34]Carlos E. Ferreira, Álvaro Junio Pereira Franco:
A min-max relation in flowgraphs. Electron. Notes Discret. Math. 50: 109-114 (2015) - [c8]Santiago Valdés Ravelo
A PTAS for the Metric Case of the Minimum Sum-Requirement Communication Spanning Tree Problem. CALDAM 2015: 9-20 - [c7]Santiago Valdés Ravelo
PTAS's for Some Metric p-source Communication Spanning Tree Problems. WALCOM 2015: 137-148 - 2014
- [j33]Vicente Acuña, Carlos Eduardo Ferreira
Solving the maximum edge biclique packing problem on unbalanced bipartite graphs. Discret. Appl. Math. 164: 2-12 (2014) - [c6]Carlos Eduardo Ferreira, Álvaro Junio Pereira Franco, Marcio Ferreira da Silva:
Finding Matrimonial Circuits in some Amerindian Kinship Networks: An Experimental Study. eScience 2014: 73-80 - [c5]Cristina G. Fernandes
The Envy-Free Pricing Problem and Unit-Demand Markets. ISCO 2014: 230-241 - [i5]Marcelo da Silva Reis, Carlos Eduardo Ferreira, Junior Barrera:
The U-curve optimization problem: improvements on the original algorithm and time complexity analysis. CoRR abs/1407.6067 (2014) - 2013
- [j32]Said Sadique Adi, Carlos Eduardo Ferreira:
Syntenic global alignment and its application to the gene prediction problem. J. Braz. Comput. Soc. 19(4): 511-521 (2013) - [i4]Cristina G. Fernandes, Carlos Eduardo Ferreira, Álvaro Junio Pereira Franco, Rafael Crivellari Saliba Schouery:
The Unit-Demand Envy-Free Pricing Problem. CoRR abs/1310.0038 (2013) - 2012
- [j31]Carlos Eduardo Ferreira
V Latin-American Algorithms, Graphs, and Optimization Symposium - Gramado, Brazil, 2009. Discret. Appl. Math. 160(18): 2499-2501 (2012) - [j30]Carlos Eduardo Ferreira
Mathematical Models and Polyhedral Studies for Integral Sheet Metal Design. SIAM J. Optim. 22(4): 1493-1517 (2012) - [c4]Alexandre S. Freire, Vicente Acuña, Pilu Crescenzi
Minimum Ratio Cover of Matrix Columns by Extreme Rays of Its Induced Cone. ISCO 2012: 165-177 - [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
- [j29]Carlos Eduardo Ferreira, Alexandre S. Freire, G. A. Puglia:
A dynamic programming algorithm for the tree mapping problem. Electron. Notes Discret. Math. 37: 147-152 (2011) - [j28]Cristina G. Fernandes, Carlos Eduardo Ferreira, Flavio Keidi Miyazawa
Selfish Square Packing. Electron. Notes Discret. Math. 37: 369-374 (2011) - [j27]André Fujita, João Ricardo Sato
Inferring Contagion in Regulatory Networks. IEEE ACM Trans. Comput. Biol. Bioinform. 8(2): 570-576 (2011) - 2010
- [j26]Said Sadique Adi, Marília D. V. Braga, Cristina G. Fernandes
Repetition-free longest common subsequence. Discret. Appl. Math. 158(12): 1315-1324 (2010) - [j25]Vicente Acuña, Carlos Eduardo Ferreira, Alexandre S. Freire, Eduardo Moreno
The biclique k-clustering problem in bipartite graphs and its application in bioinformatics. Electron. Notes Discret. Math. 36: 159-166 (2010) - [j24]Carlos Eduardo Ferreira, Christian Tjandraatmadja:
A branch-and-cut approach to the repetition-free longest common subsequence problem. Electron. Notes Discret. Math. 36: 527-534 (2010) - [c3]Alexandre S. Freire, R. M. Cesar Jr., Carlos Eduardo Ferreira:
A Column Generation Approach for the Graph Matching Problem. ICPR 2010: 1088-1091 - [e1]Carlos Eduardo Ferreira, Satoru Miyano, Peter F. Stadler
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 [contents] - [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
- [j23]Thomas M. Liebling, Jayme Luiz Szwarcfiter, Carlos Eduardo Ferreira, Fábio Protti:
Preface. Electron. Notes Discret. Math. 35: 1-2 (2009) - [j22]Gerardo Valdisio R. Viana, Fernando A. C. Gomes
Parallelisation of a multi-neighbourhood local search heuristic for a phylogeny problem. Int. J. Bioinform. Res. Appl. 5(2): 163-177 (2009) - [j21]André Fujita, João Ricardo Sato
Comparing Pearson, Spearman and Hoeffding's d Measure for Gene Expression Association Analysis. J. Bioinform. Comput. Biol. 7(4): 663-684 (2009) - 2008
- [j20]Said Sadique Adi, Marília D. V. Braga, Cristina G. Fernandes, Carlos Eduardo Ferreira, Fábio Viduani Martinez, Marie-France Sagot, Marco Aurelio Stefanes, Christian Tjandraatmadja, Yoshiko Wakabayashi
Repetition-free longest common subsequence. Electron. Notes Discret. Math. 30: 243-248 (2008) - [j19]André Fujita, João Ricardo Sato
Modeling Nonlinear Gene Regulatory Networks from Time Series Gene Expression Data. J. Bioinform. Comput. Biol. 6(5): 961-979 (2008) - [c2]Cristina G. Fernandes
A Polyhedral Investigation of the LCS Problem and a Repetition-Free Variant. LATIN 2008: 329-338 - 2007
- [j18]André Fujita, João Ricardo Sato
Time-varying modeling of gene expression regulatory networks using the wavelet dynamic vector autoregressive method. Bioinform. 23(13): 1623-1630 (2007) - [j17]André Fujita, João Ricardo Sato
GEDI: a user-friendly toolbox for analysis of large-scale gene expression data. BMC Bioinform. 8 (2007) - [j16]André Fujita, João Ricardo Sato
Modeling gene expression regulatory networks with the sparse vector autoregressive model. BMC Syst. Biol. 1: 39 (2007) - [j15]Paulo Feofiloff
Primal-dual approximation algorithms for the Prize-Collecting Steiner Tree Problem. Inf. Process. Lett. 103(5): 195-202 (2007) - 2006
- [j14]André Fujita, João Ricardo Sato
Evaluating different methods of microarray data normalization. BMC Bioinform. 7: 469 (2006) - [j13]Carlos Eduardo Ferreira
Some formulations for the group steiner tree problem. Discret. Appl. Math. 154(13): 1877-1884 (2006) - [j12]Carlos Eduardo Ferreira
New Reduction Techniques for the Group Steiner Tree Problem. SIAM J. Optim. 17(4): 1176-1188 (2006) - 2005
- [j11]Said Sadique Adi, Carlos Eduardo Ferreira:
Gene prediction by multiple syntenic alignment. J. Integr. Bioinform. 2(1) (2005) - [c1]Said Sadique Adi, Carlos Eduardo Ferreira:
Gene Prediction by Syntenic Alignment. BSB 2005: 246-250 - 2004
- [j10]Carlos Eduardo Ferreira, Fernando Mário de Oliveira Filho:
Some Formulations for the Group Steiner Tree Problem. Electron. Notes Discret. Math. 18: 127-132 (2004) - [j9]O. Alves, Carlos Eduardo Ferreira
Estimates for the spreading velocity of an epidemic model. Math. Comput. Simul. 64(6): 609-616 (2004) - 2002
- [j8]Carlos Eduardo Ferreira, C. Carvalho de Souza
Rearrangement of DNA fragments: a branch-and-cut algorithm. Discret. Appl. Math. 116(1-2): 161-177 (2002) - 2001
- [j7]Said Sadique Adi, Carlos Eduardo Ferreira:
DNA Fragments Assembly Programs: a comparative study. Electron. Notes Discret. Math. 7: 158-161 (2001) - 2000
- [j6]Ronaldo Fumio Hashimoto
A Combinatorial Optimization Technique for the Sequential Decomposition of Erosions and Dilations. J. Math. Imaging Vis. 13(1): 17-33 (2000)
1990 – 1999
- 1998
- [j5]Carlos Eduardo Ferreira, Alexander Martin
The node capacitated graph partitioning problem: A computational study. Math. Program. 81: 229-256 (1998) - [j4]Ralf Borndörfer, Carlos E. Ferreira, Alexander Martin
Decomposing Matrices into Blocks. SIAM J. Optim. 9(1): 236-269 (1998) - 1996
- [j3]Carlos Eduardo Ferreira, Alexander Martin
Formulations and valid inequalities for the node capacitated graph partitioning problem. Math. Program. 74: 247-266 (1996) - [j2]Carlos E. Ferreira, Alexander Martin
Solving Multiple Knapsack Problems by Cutting Planes. SIAM J. Optim. 6(3): 858-877 (1996) - 1994
- [b1]Carlos E. Ferreira:
On combinatorial optimization problems arising in computer system design. Technical University of Berlin, Germany, 1994, pp. 1-203 - 1993
- [j1]Carlos E. Ferreira, Martin Grötschel, Alexander Martin
Some integer programs arising in the design of main frame computers. ZOR Methods Model. Oper. Res. 38(1): 77-100 (1993)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:03 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: