Busca avançada
Ano de início
Entree

Carlos Eduardo Ferreira

CV Lattes GoogleMyCitations ORCID


Universidade de São Paulo (USP). Instituto de Matemática e Estatística (IME)  (Instituição-sede da última proposta de pesquisa)
País de origem: Brasil

É professor titular do Departamento de Ciência da Computação do Instituto de Matemática e Estatística da Universidade de São Paulo (IME-USP) desde 2009. Terminou sua graduação em 1986 e mestrado em 1989, ambos em Ciência da Computação no IME-USP. Seu doutorado foi realizado sob orientação de Martin Grötschel na Technische Universität Berlin (1994). Suas principal área de pesquisa é Otimização Combinatória onde atua principalmente em combinatória poliédrica e algoritmos de aproximação. Outras áreas de interesse são Biologia Computacional e Geometria Computacional. (Fonte: Currículo Lattes)

Auxílios à pesquisa
Bolsas no país
Apoio FAPESP em números * Quantidades atualizadas em 11/01/2020
Colaboradores mais frequentes em auxílios e bolsas FAPESP
Contate o Pesquisador

Este canal da BV/FAPESP deve ser utilizado tão somente para mensagens, referentes aos projetos científicos financiados pela FAPESP.


 

 

 

 

Palavras-chave utilizadas pelo pesquisador
Publicações resultantes de Auxílios e Bolsas sob responsabilidade do(a) pesquisador(a) (107)

(Referências obtidas automaticamente do Web of Science e do SciELO, por meio da informação sobre o financiamento pela FAPESP e o número do processo correspondente, incluída na publicação pelos autores)

Publicações103
Citações293
Cit./Artigo2,8
Dados do Web of Science

KELETI, TAMAS; MATOLCSI, MATE; DE OLIVEIRA FILHO, FERNANDO MARIO; RUZSA, IMRE Z.. Better Bounds for Planar Sets Avoiding Unit Distances. DISCRETE & COMPUTATIONAL GEOMETRY, v. 55, n. 3, p. 642-661, . Citações Web of Science: 2.

KINKER, GABRIELA SARTI; THOMAS, ANDREW MALTEZ; CARVALHO, VINICIUS JARDIM; LIMA, FELIPE PRATA; FUJITA, ANDRE. Deletion and low expression of NFKBIA are associated with poor prognosis in lower-grade glioma patients. SCIENTIFIC REPORTS, v. 6, . Citações Web of Science: 4.

COSTA, EURINARDO R.; DOURADO, MITRE C.; SAMPAIO, RUDINI M.. Inapproximability results related to monophonic convexity. DISCRETE APPLIED MATHEMATICS, v. 197, n. SI, p. 70-74, . Citações Web of Science: 7.

ANDRETTA, M.; BIRGIN, E. G.; RAYDAN, M.. An inner-outer nonlinear programming approach for constrained quadratic matrix model updating. MECHANICAL SYSTEMS AND SIGNAL PROCESSING, v. 66-67, p. 78-88, . Citações Web of Science: 1.

ALLEN, P.; KOHAYAKAWA, Y.; MOTA, G. O.; PARENTE, R. F.. On the number of orientations of random graphs with no directed cycles of a given length. ELECTRONIC JOURNAL OF COMBINATORICS, v. 21, n. 1, . Citações Web of Science: 0.

BIRGIN, E. G.; BUENO, L. F.; MARTINEZ, J. M.. Sequential equality-constrained optimization for nonlinear programming. COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, v. 65, n. 3, p. 699-721, . Citações Web of Science: 4.

BIRGIN, E. G.; LOBATO, R. D.; MARTINEZ, J. M.. Packing ellipsoids by nonlinear optimization. Journal of Global Optimization, v. 65, n. 4, p. 709-743, . Citações Web of Science: 9.

HAN, JIE; ZANG, CHUANYUN; ZHAO, YI. Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs. JOURNAL OF COMBINATORIAL THEORY SERIES A, v. 149, p. 115-147, . Citações Web of Science: 3.

BOTLER, FABIO; JIMENEZ, ANDREA. On path decompositions of 2k-regular graphs. DISCRETE MATHEMATICS, v. 340, n. 6, p. 1405-1411, . Citações Web of Science: 5.

BIRGIN, E. G.; GARDENGHI, J. L.; MARTINEZ, J. M.; SANTOS, S. A.; TOINT, PH. L.. Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models. MATHEMATICAL PROGRAMMING, v. 163, n. 1-2, p. 359-368, . Citações Web of Science: 23.

HOPPEN, CARLOS; KOHAYAKAWA, YOSHIHARU; LEFMANN, HANNO. Edge-colorings of uniform hypergraphs avoiding monochromatic matchings. DISCRETE MATHEMATICS, v. 338, n. 2, p. 262-271, . Citações Web of Science: 4.

GLEBOV, ROMAN; HOPPEN, CARLOS; KLIMOSOVA, TEREZA; KOHAYAKAWA, YOSHIHARU; KRAL, DANIEL; LIU, HONG. Densities in large permutations and parameter testing. EUROPEAN JOURNAL OF COMBINATORICS, v. 60, p. 89-99, . Citações Web of Science: 2.

HAN, JIE; KOHAYAKAWA, YOSHIHARU. THE MAXIMUM SIZE OF A NON-TRIVIAL INTERSECTING UNIFORM FAMILY THAT IS NOT A SUBFAMILY OF THE HILTON-MILNER FAMILY. Proceedings of the American Mathematical Society, v. 145, n. 1, p. 73-87, . Citações Web of Science: 5.

BOTLER, F.; MOTA, G. O.; OSHIRO, M. T. I.; WAKABAYASHI, Y.. Decomposing regular graphs with prescribed girth into paths of given length. EUROPEAN JOURNAL OF COMBINATORICS, v. 66, p. 28-36, . Citações Web of Science: 0.

KOHAYAKAWA, YOSHIHARU; LEE, SANG JUNE; MOREIRA, CARLOS GUSTAVO; RODL, VOJTECH. INFINITE SIDON SETS CONTAINED IN SPARSE RANDOM SETS OF INTEGERS. SIAM JOURNAL ON DISCRETE MATHEMATICS, v. 32, n. 1, p. 410-449, . Citações Web of Science: 0.

ALLEN, PETER; BOTTCHER, JULIA; KOHAYAKAWA, YOSHIHARU; ROBERTS, BARNABY. Triangle-Free Subgraphs of Random Graphs. COMBINATORICS PROBABILITY & COMPUTING, v. 27, n. 2, p. 141-161, . Citações Web of Science: 0.

KOHAYAKAWA, Y.; KONSTADINIDIS, P. B.; MOTA, G. O.. On an anti-Ramsey threshold for random graphs. EUROPEAN JOURNAL OF COMBINATORICS, v. 40, p. 26-41, . Citações Web of Science: 3.

CAMPELO, MANOEL; HUIBAN, CRISTIANA; SAMPAIO, RUDINI M.; WAKABAYASHI, YOSHIKO. Hardness and inapproximability of convex recoloring problems. THEORETICAL COMPUTER SCIENCE, v. 533, p. 15-25, . Citações Web of Science: 1.

RODRIGUES‚ E.M.; SAGOT‚ M.F.; WAKABAYASHI‚ Y.. The maximum agreement forest problem: Approximation algorithms and computational experiments. THEORETICAL COMPUTER SCIENCE, v. 374, n. 1, p. 91-110, .

ADI‚ S.S.; BRAGA‚ M.D.V.; FERNANDES‚ C.G.; FERREIRA‚ C.E.; MARTINEZ‚ F.V.; SAGOT‚ M.F.; STEFANES‚ M.A.; TJANDRAATMADJA‚ C.; WAKABAYASHI‚ Y.. Repetition-free longest common subsequence. DISCRETE APPLIED MATHEMATICS, v. 158, n. 12, p. 1315-1324, .

FERREIRA‚ C.E.; DE OLIVEIRA FILHO‚ F.M.. Some formulations for the group steiner tree problem. DISCRETE APPLIED MATHEMATICS, v. 154, n. 13, p. 1877-1884, .

FUJITA, ANDRE; VIDAL, MACIEL C.; TAKAHASHI, DANIEL Y.. A Statistical Method to Distinguish Functional Brain Networks. FRONTIERS IN NEUROSCIENCE, v. 11, . Citações Web of Science: 7.

BIRGIN, E. G.; MARTINEZ, J. M.. THE USE OF QUADRATIC REGULARIZATION WITH A CUBIC DESCENT CONDITION FOR UNCONSTRAINED OPTIMIZATION. SIAM JOURNAL ON OPTIMIZATION, v. 27, n. 2, p. 1049-1074, . Citações Web of Science: 14.

BOTLER, F.; TALON, A.. Decomposing 8-regular graphs into paths of length 4. DISCRETE MATHEMATICS, v. 340, n. 9, p. 2275-2285, . Citações Web of Science: 1.

MARTINEZ, JOSE MARIO. ON HIGH-ORDER MODEL REGULARIZATION FOR CONSTRAINED OPTIMIZATION. SIAM JOURNAL ON OPTIMIZATION, v. 27, n. 4, p. 2447-2458, . Citações Web of Science: 7.

CEVELIN, BRUNO H.; CONTI, DANTE; DETSCH, DENISE T.; DINIZ-EHRHARDT, MARIA A.; MARTINEZ, JOSE MARIO. Fitting of parameters for a temperature control model by means of continuous derivative-free optimization: a case study in a broiler house. BULLETIN OF COMPUTATIONAL APPLIED MATHEMATICS, v. 5, n. 1, p. 117-139, . Citações Web of Science: 0.

KOHAYAKAWA, YOSHIHARU; RODL, VOJTCH; SCHACHT, MATHIAS. Discrepancy and eigenvalues of Cayley graphs. CZECHOSLOVAK MATHEMATICAL JOURNAL, v. 66, n. 3, p. 941-954, . Citações Web of Science: 1.

VIDAL, MACIEL C.; SATO, JOAO R.; BALARDIN, JOANA B.; TAKAHASHI, DANIEL Y.; FUJITA, ANDRE. ANOCVA in R: A Software to Compare Clusters between Groups and Its Application to the Study of Autism Spectrum Disorder. FRONTIERS IN NEUROSCIENCE, v. 11, . Citações Web of Science: 1.

SANTOS, SUZANA DE SIQUEIRA; DE ALMEIDA GALATRO, THAIS FERNANDA; WATANABE, RODRIGO AKIRA; OBA-SHINJO, SUELI MIEKO; NAGAHASHI MARIE, SUELY KAZUE; FUJITA, ANDRE. CoGA: An R Package to Identify Differentially Co-Expressed Gene Sets by Analyzing the Graph Spectra. PLoS One, v. 10, n. 8, . Citações Web of Science: 8.

FREIRE, ALEXANDRE S.; MORENO, EDUARDO; YUSHIMITO, WILFREDO F.. A branch-and-bound algorithm for the maximum capture problem with random utilities. European Journal of Operational Research, v. 252, n. 1, p. 204-212, . Citações Web of Science: 1.

BIRGIN, E. G.; GARDENGHI, J. L.; MARTINEZ, J. M.; SANTOS, S. A.; TOINT, PH. L.. EVALUATION COMPLEXITY FOR NONLINEAR CONSTRAINED OPTIMIZATION USING UNSCALED KKT CONDITIONS AND HIGH-ORDER MODELS. SIAM JOURNAL ON OPTIMIZATION, v. 26, n. 2, p. 951-967, . Citações Web of Science: 9.

ALLEN, PETER; BOTTCHER, JULIA; GRIFFITHS, SIMON; KOHAYAKAWA, YOSHIHARU; MORRIS, ROBERT. Chromatic Thresholds in Sparse Random Graphs. RANDOM STRUCTURES & ALGORITHMS, v. 51, n. 2, p. 215-236, . Citações Web of Science: 1.

DUQUE, FRANK; GONZALEZ-AGUILAR, HERNAN; HERNADEZ-VELEZ, CESAR; LEANOS, JESUS; MEDINA, CAROLINA. The complexity of computing the cylindrical and the t-circle crossing number of a graph. ELECTRONIC JOURNAL OF COMBINATORICS, v. 25, n. 2, . Citações Web of Science: 1.

FERNANDES, CRISTINA G.; SCHOUERY, RAFAEL C. S.. Approximation Algorithms for the Max-Buying Problem with Limited Supply. ALGORITHMICA, v. 80, n. 11, p. 2973-2992, . Citações Web of Science: 0.

FERNANDES, CRISTINA G.; SCHMIDT, TINA JANNE; TARAZ, ANUSCH. On minimum bisection and related cut problems in trees and tree-like graphs. JOURNAL OF GRAPH THEORY, v. 89, n. 2, p. 214-245, . Citações Web of Science: 0.

BOTLER, F.; MOTA, G. O.; OSHIRO, M. T. I.; WAKABAYASHI, Y.. Decomposing highly connected graphs into paths of length five. DISCRETE APPLIED MATHEMATICS, v. 245, n. SI, p. 128-138, . Citações Web of Science: 1.

GAO, WEI; HAN, JIE. Minimum Codegree Threshold for C-6(3)-Factors in 3-Uniform Hypergraphs. COMBINATORICS PROBABILITY & COMPUTING, v. 26, n. 4, p. 536-559, . Citações Web of Science: 2.

GAO, PU; PEREZ-GIMENEZ, XAVIER; SATO, CRISTIANE M.. Arboricity and spanning-tree packing in random graphs. RANDOM STRUCTURES & ALGORITHMS, v. 52, n. 3, p. 495-535, . Citações Web of Science: 1.

HOPPEN, CARLOS; WORMALD, NICHOLAS. LOCAL ALGORITHMS, REGULAR GRAPHS OF LARGE GIRTH, AND RANDOM REGULAR GRAPHS. COMBINATORICA, v. 38, n. 3, p. 619-664, . Citações Web of Science: 1.

BERGER, S.; KOHAYAKAWA, Y.; MAESAKA, G. S.; MARTINS, T.; MENDONCA, W.; MOTA, G. O.; PARCZYK, O.. THE SIZE-RAMSEY NUMBER OF POWERS OF BOUNDED DEGREE TREES. ACTA MATHEMATICA UNIVERSITATIS COMENIANAE, v. 88, n. 3, p. 451-456, . Citações Web of Science: 0.

HAN, J.; KOHAYAKAWA, Y.; SALES, M. T.; STAGNI, H.. ON SOME EXTREMAL RESULTS FOR ORDER TYPES. ACTA MATHEMATICA UNIVERSITATIS COMENIANAE, v. 88, n. 3, p. 779-785, . Citações Web of Science: 0.

KOHAYAKAWA, Y.; MENDONCA, W.; MOTA, G.; SCHUELKE, B.. COVERING 3-COLOURED RANDOM GRAPHS WITH MONOCHROMATIC TREES. ACTA MATHEMATICA UNIVERSITATIS COMENIANAE, v. 88, n. 3, p. 871-875, . Citações Web of Science: 0.

FERNANDES, CRISTINA G.; FERREIRA, CARLOS E.; MIYAZAWA, FLAVIO K.; WAKABAYASHI, YOSHIKO. Prices of Anarchy of Selfish 2D Bin Packing Games. INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, v. 30, n. 3, p. 355-374, . Citações Web of Science: 0.

HAN, JIE. On vertex-disjoint paths in regular graphs. ELECTRONIC JOURNAL OF COMBINATORICS, v. 25, n. 2, . Citações Web of Science: 0.

BIRGIN, E. G.; HAESER, G.; RAMOS, A.. Augmented Lagrangians with constrained subproblems and convergence to second-order stationary points. COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, v. 69, n. 1, p. 51-75, . Citações Web of Science: 8.

FRANKL, PETER; HAN, JIE; HUANG, HAO; ZHAO, YI. A degree version of the Hilton-Milner theorem. JOURNAL OF COMBINATORIAL THEORY SERIES A, v. 155, p. 493-502, . Citações Web of Science: 3.

FERNANDES, CRISTINA G.; DE PAULA, SAMUEL P.; PEDROSA, LEHILTON L. C.. Improved Approximation Algorithms for Capacitated Fault-Tolerant k-Center. ALGORITHMICA, v. 80, n. 3, SI, p. 1041-1072, . Citações Web of Science: 2.

FERNANDES, CRISTINA G.; HERNANDEZ-VELEZ, CESAR; DE PINA, JOSE C.; ALFONSIN, JORGE LUIS RAMIREZ. Counting Hamiltonian Cycles in the Matroid Basis Graph. GRAPHS AND COMBINATORICS, v. 35, n. 2, p. 539-550, . Citações Web of Science: 0.

BIRGIN, E. G.; KREJIC, N.; MARTINEZ, J. M.. ITERATION AND EVALUATION COMPLEXITY FOR THE MINIMIZATION OF FUNCTIONS WHOSE COMPUTATION IS INTRINSICALLY INEXACT. Mathematics of Computation, v. 89, n. 321, p. 253-278, . Citações Web of Science: 0.

KOHAYAKAWA, YOSHIHARU; MOTA, GUILHERME OLIVEIRA; SCHACHT, MATHIAS. Monochromatic trees in random graphs. MATHEMATICAL PROCEEDINGS OF THE CAMBRIDGE PHILOSOPHICAL SOCIETY, v. 166, n. 1, p. 191-208, . Citações Web of Science: 2.

COELHO, RAFAEL S.; MOURA, PHABLO F. S.; WAKABAYASHI, YOSHIKO. The k-hop connected dominating set problem: approximation and hardness. JOURNAL OF COMBINATORIAL OPTIMIZATION, v. 34, n. 4, p. 1060-1083, . Citações Web of Science: 1.

HAN, JIE; LO, ALLAN; TREGLOWN, ANDREW; ZHAO, YI. Exact Minimum Codegree Threshold for K-4(-)-Factors. COMBINATORICS PROBABILITY & COMPUTING, v. 26, n. 6, p. 856-885, . Citações Web of Science: 1.

CAMPELO, MANOEL; MOURA, PHABLO F. S.; SANTOS, MARCIO C.. Lifted, projected and subgraph-induced inequalities for the representatives k-fold coloring polytope. DISCRETE OPTIMIZATION, v. 21, p. 131-156, . Citações Web of Science: 0.

FERNANDES, CRISTINA G.; OSHIRO, MARCIO T. I.. Kinetic clustering of points on the line. THEORETICAL COMPUTER SCIENCE, v. 639, p. 60-71, . Citações Web of Science: 0.

MIYAZAWA, FLAVIO K.; PEDROSA, LEHILTON L. C.; SCHOUERY, RAFAEL C. S.; SVIRIDENKO, MAXIM; WAKABAYASHI, YOSHIKO. Polynomial-Time Approximation Schemes for Circle and Other Packing Problems. ALGORITHMICA, v. 76, n. 2, p. 536-568, . Citações Web of Science: 5.

SANTOS, SUZANA DE SIQUEIRA; TAKAHASHI, DANIEL YASUMASA; NAKATA, ASUKA; FUJITA, ANDRE. A comparative study of statistical methods used to identify dependencies between gene expression signals. BRIEFINGS IN BIOINFORMATICS, v. 15, n. 6, p. 906-918, . Citações Web of Science: 31.

DELLAMONICA, JR., DOMINGOS; KOHAYAKAWA, YOSHIHARU; ROEDL, VOJTECH; RUCINSKI, ANDRZEJ. An Improved Upper Bound on the Density of Universal Random Graphs. RANDOM STRUCTURES & ALGORITHMS, v. 46, n. 2, p. 274-299, . Citações Web of Science: 8.

ALLEN, PETER; BOETTCHER, JULIA; KOHAYAKAWA, YOSHIHARU; PERSON, YURY. Tight Hamilton Cycles in Random Hypergraphs. RANDOM STRUCTURES & ALGORITHMS, v. 46, n. 3, p. 446-465, . Citações Web of Science: 7.

HOPPEN, CARLOS; LEFMANN, HANNO. Edge-colorings avoiding a fixed matching with a prescribed color pattern. EUROPEAN JOURNAL OF COMBINATORICS, v. 47, p. 75-94, . Citações Web of Science: 6.

BIRGIN, E. G.; BUENO, L. F.; MARTINEZ, J. M.. Assessing the reliability of general-purpose Inexact Restoration methods. Journal of Computational and Applied Mathematics, v. 282, p. 1-16, . Citações Web of Science: 5.

MARTINEZ‚ F.V.; DE PINA‚ J.C.; SOARES‚ J.. Algorithms for terminal Steiner trees. THEORETICAL COMPUTER SCIENCE, v. 389, n. 1, p. 133-142, .

SATO, JOAO RICARDO; VIDAL, MACIEL CALEBE; SANTOS, SUZANA DE SIQUEIRA; MASSIRER, KATLIN BRAUER; FUJITA, ANDRE. Complex Network Measures in Autism Spectrum Disorders. IEEE-ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS, v. 15, n. 2, p. 581-587, . Citações Web of Science: 3.

ANTHONY, MARTIN; BOROS, ENDRE; CRAMA, YVES; GRUBER, ARITANAN. Quadratization of symmetric pseudo-Boolean functions. DISCRETE APPLIED MATHEMATICS, v. 203, p. 1-12, . Citações Web of Science: 5.

ALLEN, PETER; BOTTCHER, JULIA; HAN, HIEP; KOHAYAKAWA, YOSHIHARU; PERSON, YURY. POWERS OF HAMILTON CYCLES IN PSEUDORANDOM GRAPHS. COMBINATORICA, v. 37, n. 4, p. 573-616, . Citações Web of Science: 2.

CERVELIN, B. H.; CONTI, D.; DINIZ-EHRHARDT, M. A.; MARTINEZ, J. M.. A computer model for particle-like simulation in broiler houses. COMPUTERS AND ELECTRONICS IN AGRICULTURE, v. 141, p. 1-14, . Citações Web of Science: 1.

BOTLER, F.; MOTA, G. O.; OSHIRO, M. T. I.; WAKABAYASHI, Y.. Decomposing highly edge-connected graphs into paths of any given length. JOURNAL OF COMBINATORIAL THEORY SERIES B, v. 122, p. 508-542, . Citações Web of Science: 7.

JIMENEZ, ANDREA; WAKABAYASHI, YOSHIKO. On path-cycle decompositions of triangle-free graphs. DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, v. 19, n. 3, . Citações Web of Science: 4.

CHEN, GUANTAO; EHRENMULLER, JULIA; FERNANDES, CRISTINA G.; HEISE, CARL GEORG; SHAN, SONGLING; YANG, PING; YATES, AMY N.. Nonempty intersection of longest paths in series-parallel graphs. DISCRETE MATHEMATICS, v. 340, n. 3, p. 287-304, . Citações Web of Science: 5.

KOHAYAKAWA, Y.; KONSTADINIDIS, P. B.; MOTA, G. O.. On an anti-Ramsey threshold for sparse graphs with one triangle. JOURNAL OF GRAPH THEORY, v. 87, n. 2, p. 176-187, . Citações Web of Science: 1.

BIRGIN, E. G.; KREJIC, N.; MARTINEZ, J. M.. On the minimization of possibly discontinuous functions by means of pointwise approximations. Optimization Letters, v. 11, n. 8, p. 1623-1637, . Citações Web of Science: 0.

ALLEN, PETER; BOTTCHER, JULIA; KOHAYAKAWA, YOSHIHARU; ROBERTS, BARNABY. Triangle-Free Subgraphs of Random Graphs. COMBINATORICS PROBABILITY & COMPUTING, v. 27, n. 2, p. 141-161, . Citações Web of Science: 0.

KOHAYAKAWA, Y.; KONSTADINIDIS, P. B.; MOTA, G. O.. On an anti-Ramsey threshold for random graphs. EUROPEAN JOURNAL OF COMBINATORICS, v. 40, p. 26-41, . Citações Web of Science: 3.

CAMPELO, MANOEL; HUIBAN, CRISTIANA; SAMPAIO, RUDINI M.; WAKABAYASHI, YOSHIKO. Hardness and inapproximability of convex recoloring problems. THEORETICAL COMPUTER SCIENCE, v. 533, p. 15-25, . Citações Web of Science: 1.

RODRIGUES‚ E.M.; SAGOT‚ M.F.; WAKABAYASHI‚ Y.. The maximum agreement forest problem: Approximation algorithms and computational experiments. THEORETICAL COMPUTER SCIENCE, v. 374, n. 1, p. 91-110, .

ADI‚ S.S.; BRAGA‚ M.D.V.; FERNANDES‚ C.G.; FERREIRA‚ C.E.; MARTINEZ‚ F.V.; SAGOT‚ M.F.; STEFANES‚ M.A.; TJANDRAATMADJA‚ C.; WAKABAYASHI‚ Y.. Repetition-free longest common subsequence. DISCRETE APPLIED MATHEMATICS, v. 158, n. 12, p. 1315-1324, .

FERREIRA‚ C.E.; DE OLIVEIRA FILHO‚ F.M.. Some formulations for the group steiner tree problem. DISCRETE APPLIED MATHEMATICS, v. 154, n. 13, p. 1877-1884, .

FUJITA, ANDRE; VIDAL, MACIEL C.; TAKAHASHI, DANIEL Y.. A Statistical Method to Distinguish Functional Brain Networks. FRONTIERS IN NEUROSCIENCE, v. 11, . Citações Web of Science: 7.

BIRGIN, E. G.; MARTINEZ, J. M.. THE USE OF QUADRATIC REGULARIZATION WITH A CUBIC DESCENT CONDITION FOR UNCONSTRAINED OPTIMIZATION. SIAM JOURNAL ON OPTIMIZATION, v. 27, n. 2, p. 1049-1074, . Citações Web of Science: 14.

BOTLER, F.; TALON, A.. Decomposing 8-regular graphs into paths of length 4. DISCRETE MATHEMATICS, v. 340, n. 9, p. 2275-2285, . Citações Web of Science: 1.

MARTINEZ, JOSE MARIO. ON HIGH-ORDER MODEL REGULARIZATION FOR CONSTRAINED OPTIMIZATION. SIAM JOURNAL ON OPTIMIZATION, v. 27, n. 4, p. 2447-2458, . Citações Web of Science: 7.

CEVELIN, BRUNO H.; CONTI, DANTE; DETSCH, DENISE T.; DINIZ-EHRHARDT, MARIA A.; MARTINEZ, JOSE MARIO. Fitting of parameters for a temperature control model by means of continuous derivative-free optimization: a case study in a broiler house. BULLETIN OF COMPUTATIONAL APPLIED MATHEMATICS, v. 5, n. 1, p. 117-139, . Citações Web of Science: 0.

KOHAYAKAWA, YOSHIHARU; RODL, VOJTCH; SCHACHT, MATHIAS. Discrepancy and eigenvalues of Cayley graphs. CZECHOSLOVAK MATHEMATICAL JOURNAL, v. 66, n. 3, p. 941-954, . Citações Web of Science: 1.

VIDAL, MACIEL C.; SATO, JOAO R.; BALARDIN, JOANA B.; TAKAHASHI, DANIEL Y.; FUJITA, ANDRE. ANOCVA in R: A Software to Compare Clusters between Groups and Its Application to the Study of Autism Spectrum Disorder. FRONTIERS IN NEUROSCIENCE, v. 11, . Citações Web of Science: 1.

SANTOS, SUZANA DE SIQUEIRA; DE ALMEIDA GALATRO, THAIS FERNANDA; WATANABE, RODRIGO AKIRA; OBA-SHINJO, SUELI MIEKO; NAGAHASHI MARIE, SUELY KAZUE; FUJITA, ANDRE. CoGA: An R Package to Identify Differentially Co-Expressed Gene Sets by Analyzing the Graph Spectra. PLoS One, v. 10, n. 8, . Citações Web of Science: 8.

FREIRE, ALEXANDRE S.; MORENO, EDUARDO; YUSHIMITO, WILFREDO F.. A branch-and-bound algorithm for the maximum capture problem with random utilities. European Journal of Operational Research, v. 252, n. 1, p. 204-212, . Citações Web of Science: 1.

BIRGIN, E. G.; GARDENGHI, J. L.; MARTINEZ, J. M.; SANTOS, S. A.; TOINT, PH. L.. EVALUATION COMPLEXITY FOR NONLINEAR CONSTRAINED OPTIMIZATION USING UNSCALED KKT CONDITIONS AND HIGH-ORDER MODELS. SIAM JOURNAL ON OPTIMIZATION, v. 26, n. 2, p. 951-967, . Citações Web of Science: 9.

ALLEN, PETER; BOTTCHER, JULIA; GRIFFITHS, SIMON; KOHAYAKAWA, YOSHIHARU; MORRIS, ROBERT. Chromatic Thresholds in Sparse Random Graphs. RANDOM STRUCTURES & ALGORITHMS, v. 51, n. 2, p. 215-236, . Citações Web of Science: 1.

DUQUE, FRANK; GONZALEZ-AGUILAR, HERNAN; HERNADEZ-VELEZ, CESAR; LEANOS, JESUS; MEDINA, CAROLINA. The complexity of computing the cylindrical and the t-circle crossing number of a graph. ELECTRONIC JOURNAL OF COMBINATORICS, v. 25, n. 2, . Citações Web of Science: 1.

FERNANDES, CRISTINA G.; SCHOUERY, RAFAEL C. S.. Approximation Algorithms for the Max-Buying Problem with Limited Supply. ALGORITHMICA, v. 80, n. 11, p. 2973-2992, . Citações Web of Science: 0.

FERNANDES, CRISTINA G.; SCHMIDT, TINA JANNE; TARAZ, ANUSCH. On minimum bisection and related cut problems in trees and tree-like graphs. JOURNAL OF GRAPH THEORY, v. 89, n. 2, p. 214-245, . Citações Web of Science: 0.

HAN, JIE. ON PERFECT MATCHINGS AND TILINGS IN UNIFORM HYPERGRAPHS. SIAM JOURNAL ON DISCRETE MATHEMATICS, v. 32, n. 2, p. 919-932, . Citações Web of Science: 0.

BIRGIN, E. G.; LOBATO, R. D.. A matheuristic approach with nonlinear subproblems for large-scale packing of ellipsoids. European Journal of Operational Research, v. 272, n. 2, p. 447-464, . Citações Web of Science: 1.

HOPPEN, CARLOS; PARENTE, ROBERTO F.; SATO, CRISTIANE M.. PACKING ARBORESCENCES IN RANDOM DIGRAPHS. SIAM JOURNAL ON DISCRETE MATHEMATICS, v. 33, n. 1, p. 438-453, . Citações Web of Science: 0.

BEDENKNECHT, WIEBKE; MOTA, GUILHERME OLIVEIRA; REIHER, CHRISTIAN; SCHACHT, MATHIAS. On the local density problem for graphs of given odd-girth. JOURNAL OF GRAPH THEORY, v. 90, n. 2, p. 137-149, . Citações Web of Science: 0.

HAN, JIE; KOHAYAKAWA, YOSHIHARU; MORRIS, PATRICK; PERSON, YURY. Clique-factors in sparse pseudorandom graphs. EUROPEAN JOURNAL OF COMBINATORICS, v. 82, . Citações Web of Science: 0.

BOTLER, FABIO; SAMBINELLI, MAYCON; COELHO, RAFAEL S.; LEE, ORLANDO. Gallai's path decomposition conjecture for graphs with treewidth at most 3. JOURNAL OF GRAPH THEORY, . Citações Web of Science: 0.

ANTHONY, MARTIN; BOROS, ENDRE; CRAMA, YVES; GRUBER, ARITANAN. Quadratic reformulations of nonlinear binary optimization problems. MATHEMATICAL PROGRAMMING, v. 162, n. 1-2, p. 115-144, . Citações Web of Science: 1.

DE CARLI SILVA, MARCEL K.; TUNCEL, LEVENT. An axiomatic duality framework for the theta body and related convex corners. MATHEMATICAL PROGRAMMING, v. 162, n. 1-2, p. 283-323, . Citações Web of Science: 0.

HAN, JIE; KIM, JAEHOON. Two-regular subgraphs of odd-uniform hypergraphs. JOURNAL OF COMBINATORIAL THEORY SERIES B, v. 128, p. 175-191, . Citações Web of Science: 0.

BIRGIN, ERNESTO G.; LOBATO, RAFAEL D.; MARTINEZ, JOSE MARIO. Constrained optimization with integer and continuous variables using inexact restoration and projected gradients. BULLETIN OF COMPUTATIONAL APPLIED MATHEMATICS, v. 4, n. 2, p. 55-70, . Citações Web of Science: 0.

BIRGIN, E. G.; KREJIC, N.; MARTINEZ, J. M.. ON THE EMPLOYMENT OF INEXACT RESTORATION FOR THE MINIMIZATION OF FUNCTIONS WHOSE EVALUATION IS SUBJECT TO ERRORS. Mathematics of Computation, v. 87, n. 311, p. 1307-1326, . Citações Web of Science: 1.

DELLAMONICA, JR., DOMINGOS; KOHAYAKAWA, YOSHIHARU; LEE, SANG JUNE; RODL, VOJTECH; SAMOTIJ, WOJCIECH. The number of Bh-sets of a given cardinality. PROCEEDINGS OF THE LONDON MATHEMATICAL SOCIETY, v. 116, n. 3, p. 629-669, . Citações Web of Science: 1.

DELLAMONICA, JR., DOMINGOS; KOHAYAKAWA, YOSHIHARU; LEE, SANG JUNE; ROEDL, VOJTECH; SAMOTIJ, WOJCIECH. On the Number of B-h-Sets. COMBINATORICS PROBABILITY & COMPUTING, v. 25, n. 1, SI, p. 108-129, . Citações Web of Science: 6.

FRANKL, PETER; KOHAYAKAWA, YOSHIHARU; ROEDL, VOJTECH. A note on supersaturated set systems. EUROPEAN JOURNAL OF COMBINATORICS, v. 51, p. 190-199, . Citações Web of Science: 1.

BIRGIN, E. G.; FERREIRA, J. E.; RONCONI, D. P.. List scheduling and beam search methods for the flexible job shop scheduling problem with sequencing flexibility. European Journal of Operational Research, v. 247, n. 2, p. 421-440, . Citações Web of Science: 15.

SAKURABA, CELSO S.; RONCONI, DEBORA P.; BIRGIN, ERNESTO G.; YAGIURA, MUTSUNORI. Metaheuristics for large-scale instances of the linear ordering problem. EXPERT SYSTEMS WITH APPLICATIONS, v. 42, n. 9, p. 4432-4442, . Citações Web of Science: 2.

DE QUEIROZ, THIAGO ALVES; MIYAZAWA, FLAVIO KEIDI; WAKABAYASHI, YOSHIKO. On the L-approach for generating unconstrained two-dimensional non-guillotine cutting patterns. 4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH, v. 13, n. 2, p. 199-219, . Citações Web of Science: 2.

Publicações acadêmicas

(Referências obtidas automaticamente das Instituições de Ensino e Pesquisa do Estado de São Paulo)

TJANDRAATMADJA, Christian. O problema da subsequência comum máxima sem repetições. 2010. Dissertação (Mestrado) - Instituto de Matemática e Estatística. Universidade de São Paulo (USP). São Paulo.

Por favor, reporte erros na informação da página do pesquisador escrevendo para: cdi@fapesp.br.
X

Reporte um problema na página


Detalhes do problema: