Advanced search
Start date
Betweenand

Combinatorial structures, optimization, and algorithms in theoretical Computer Science

Grant number: 13/03447-6
Support Opportunities:Research Projects - Thematic Grants
Duration: August 01, 2013 - July 31, 2017
Field of knowledge:Physical Sciences and Mathematics - Computer Science - Theory of Computation
Principal Investigator:Carlos Eduardo Ferreira
Grantee:Carlos Eduardo Ferreira
Host Institution: Instituto de Matemática e Estatística (IME). Universidade de São Paulo (USP). São Paulo , SP, Brazil
Pesquisadores principais:
Ernesto Julián Goldberg Birgin ; Yoshiharu Kohayakawa ; Yoshiko Wakabayashi
Associated researchers:Alexandre da Silva Freire ; Álvaro Junio Pereira Franco ; André Fujita ; Andrea Patricia Jiménez Ramírez ; Aritanan Borges Garcia Gruber ; Carlos Henrique Cardonha ; Carlos Hoppen ; César Israel Hernández Vélez ; Cristiane Maria Sato ; Cristina Gomes Fernandes ; Daniel Morgato Martin ; Débora Pretti Ronconi ; Ernesto Julián Goldberg Birgin ; Fabricio Siqueira Benevides ; Fernando Mario de Oliveira Filho ; Gordana Manic ; Guilherme Oliveira Mota ; Hiep Han ; Jie Han ; José Coelho de Pina Junior ; Karla Roberta Pereira Sampaio Lima ; Lehilton Lelis Chaves Pedrosa ; Marcel Kenji de Carli Silva ; Mário César San Felice ; Neal Owen Bushaw ; Rudini Menezes Sampaio ; Sang June Lee ; Sinai Robins ; Yoshiharu Kohayakawa
Associated grant(s):16/21527-5 - Better bounds for densities of distance-avoiding sets and better approximation algorithms for the maximum-cut problem, AV.EXT
15/10323-7 - Matroids and graphs, AV.EXT
Associated scholarship(s):17/11382-2 - Online and Approximation Algorithms for Clustering and Network Design, BP.PD
17/05481-8 - Advanced data structures, BP.MS
15/16339-2 - Algebraic graph theory methods in quantum information theory and extremal combinatorics, and connections to semidefinite programming, BP.PD
+ associated scholarships 15/26678-9 - Bridges in mathematics and computing, BP.IC
15/15986-4 - Asymptotic Combinatorics with Applications in Property Testing and Parameters Estimation., BP.DR
15/08538-5 - Graph transversals, BP.DR
14/18641-5 - Hamilton cycles and tiling problems in hypergraphs, BP.PD
14/23269-8 - Reformulations of binary optimization problems: algorithms and complexity, BP.PD
14/14209-1 - Approximation algorithms for network design problems with restrictions, BP.PD
14/16058-0 - Semidefinite programming bounds for kissing numbers, BP.MS
13/23720-9 - The Asymptotic Combinatorics of Permutations and Flag Algebras, BP.MS
13/20740-9 - Applications of Semidefinite Programming in Combinatorial Optimization, BP.PD - associated scholarships

Abstract

Computer Science is an area of rapid growth. New technologies emerge and become obsolete in one or two years. New approaches and methods are proposed at an impressive pace. Increasingly complex problems from diverse scientific research domains demand such vigorous developments. It is impossible to imagine any competitive research in any data driven area being developed today without the support of methods, techniques, or technology created by Computer Science researchers. It is evident that the most successful technological advances in Computer Science are the ones based on firm theoretical grounds. Research areas such as data mining and pattern recognition, to mention just two, have methods strongly supported by techniques developed in Theoretical Computer Science. Our goal in this project is to study combinatorial objects and several ways of approaching related structural and algorithmic problems: algebraic, geometric, probabilistic, combinatorial, etc. A deeper understanding of such objects will eventually result in new strategies and more efficient algorithms for solving fundamental combinatorial problems. The team that supports this project has researchers with vast experience covering a wide range of subareas in Theoretical Computer Science. The main scientific discoveries of this research project will be published in well-established conferences and journals, with high circulation and highly selective editorial policy. We shall also further intensify the international exchange activities of the group, as well as student training activities at several levels (from the undergraduate to the postdoctoral level). We shall also organize a FAPESP “Advanced School of Sciences” in the area of Theoretical Computer Science. (AU)

Articles published in Agência FAPESP Newsletter about the research grant:
Articles published in other media outlets (0 total):
More itemsLess items
VEICULO: TITULO (DATA)
VEICULO: TITULO (DATA)

Scientific publications (139)
(References retrieved automatically from Web of Science and SciELO through information on FAPESP grants and their corresponding numbers as mentioned in the publications by the authors)
RAVELO, S. V.; FERREIRA, C. E.. A PTAS for the metric case of the minimum sum-requirement communication spanning tree problem. DISCRETE APPLIED MATHEMATICS, v. 228, n. SI, p. 158-175, . (13/03447-6)
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, . (13/07699-0, 13/03447-6)
BIRGIN, E. G.; MARTINEZ, J. M.. On the application of an Augmented Lagrangian algorithm to some portfolio problems. EURO JOURNAL ON COMPUTATIONAL OPTIMIZATION, v. 4, n. 1, SI, p. 79-92, . (13/07375-0, 10/10133-0, 13/03447-6, 13/05475-7)
DETSCH, DENISE TREVISOLI; CONTI, DANTE; DINIZ-EHRHARDT, MARIA APARECIDA; MARTINEZ, JOSE MARIO. On the controlling of temperature: A proposal for a real-time controller in broiler houses. Scientia Agricola, v. 75, n. 6, p. 445-451, . (13/03447-6, 10/10133-0, 13/05475-7, 13/07375-0)
FERREIRA, CARLOS EDUARDO; PEREIRA FRANCO, ALVARO JUNIO. A min-max relation in flowgraphs and some applications. DISCRETE APPLIED MATHEMATICS, v. 245, n. SI, p. 65-76, . (13/03447-6)
CORREA, RICARDO CORDEIRO; HOPPEN, CARLOS; SAMPAIO, RUDINI MENEZES. Limits of k-dimensional poset sequences. DISCRETE APPLIED MATHEMATICS, v. 245, n. SI, p. 208-219, . (13/03447-6)
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, . (13/07699-0, 13/03447-6)
HAN, JIE; KOHAYAKAWA, YOSHIHARU; MORRIS, PATRICK; PERSON, YURY. Finding any given 2-factor in sparse pseudorandom graphs efficiently. JOURNAL OF GRAPH THEORY, v. 96, n. 1, SI, . (13/03447-6, 14/18641-5)
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, . (17/23623-4, 13/03447-6, 15/11937-9)
COUTINHO, GABRIEL; PORTUGAL, RENATO. Discretization of continuous-time quantum walks via the staggered model with Hamiltonians. NATURAL COMPUTING, v. 18, n. 2, 1, SI, p. 403-409, . (15/16339-2, 13/03447-6)
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, . (12/00195-3, 13/00506-1, 13/03447-6, 14/09576-5, 13/10498-6)
BIRGIN, E. G.; LOBATO, R. D.; MARTINEZ, J. M.. A nonlinear programming model with implicit variables for packing ellipsoids. Journal of Global Optimization, v. 68, n. 3, p. 467-499, . (13/07375-0, 13/05475-7, 10/10133-0, 13/03447-6, 12/23916-8)
COUTINHO, GABRIEL; GODSIL, CHRIS. PERFECT STATE TRANSFER IS POLY-TIME. QUANTUM INFORMATION & COMPUTATION, v. 17, n. 5-6, p. 495-502, . (15/16339-2, 13/03447-6)
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, . (13/03447-6, 12/25417-9, 11/07762-8, 11/50761-2)
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, . (13/07699-0, 13/03447-6)
ALLEN, PETER; BOTTCHER, JULIA; GRIFFITHS, SIMON; KOHAYAKAWA, YOSHIHARU; MORRIS, ROBERT. Chromatic Thresholds in Dense Random Graphs. RANDOM STRUCTURES & ALGORITHMS, v. 51, n. 2, p. 185-214, . (13/03447-6, 09/17831-7, 10/09555-7, 13/07699-0)
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, . (09/06294-0, 13/07699-0, 13/20733-2, 13/03447-6, 13/11431-2)
KOHAYAKAWA, YOSHIHARU; MOTA, GUILHERME OLIVEIRA; SCHACHT, MATHIAS; TARAZ, ANUSCH. Counting results for sparse pseudorandom hypergraphs I. EUROPEAN JOURNAL OF COMBINATORICS, v. 65, p. 276-287, . (09/06294-0, 13/07699-0, 13/20733-2, 13/03447-6, 13/11431-2)
KOHAYAKAWA, YOSHIHARU; MOTA, GUILHERME OLIVEIRA; SCHACHT, MATHIAS; TARAZ, ANUSCH. Counting results for sparse pseudorandom hypergraphs II. EUROPEAN JOURNAL OF COMBINATORICS, v. 65, p. 288-301, . (13/03447-6, 13/07699-0, 13/11431-2, 13/20733-2)
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, . (10/16526-3, 09/17831-7, 13/07699-0, 10/09555-7, 13/03447-6)
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, . (13/07375-0, 13/05475-7, 10/10133-0, 13/03447-6)
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, . (13/03447-6, 15/11930-4, 13/19179-0)
FERNANDES, CRISTINA G.; OSHIRO, MARCIO T. I.. Kinetic clustering of points on the line. THEORETICAL COMPUTER SCIENCE, v. 639, p. 60-71, . (13/03447-6)
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, . (10/20710-4, 13/03447-6, 13/21744-8, 13/02434-8)
FRANKL, PETER; KOHAYAKAWA, YOSHIHARU; ROEDL, VOJTECH. A note on supersaturated set systems. EUROPEAN JOURNAL OF COMBINATORICS, v. 51, p. 190-199, . (13/07699-0, 13/03447-6)
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, . (13/07375-0, 10/10133-0, 13/03447-6, 13/05475-7)
DELLAMONICA, JR., DOMINGOS; KOHAYAKAWA, YOSHIHARU; LEE, SANG JUNE; RODL, VOJTECH; SAMOTIJ, WOJCIECH. The number of B-3-sets of a given cardinality. JOURNAL OF COMBINATORIAL THEORY SERIES A, v. 142, p. 44-76, . (13/07699-0, 13/03447-6)
HAN, JIE; KIM, JAEHOON. Two-regular subgraphs of odd-uniform hypergraphs. JOURNAL OF COMBINATORIAL THEORY SERIES B, v. 128, p. 175-191, . (13/03447-6, 14/18641-5, 15/07869-8)
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, . (13/03447-6)
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, . (13/07375-0, 10/08434-1, 13/05475-7, 10/10133-0, 13/03447-6)
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, . (13/08278-8, 13/03447-6)
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, . (13/20733-2, 13/03447-6, 13/11431-2, 11/08033-0, 14/01460-8)
CAMPELO, MANOEL; FREIRE, ALEXANDRE S.; LIMA, KARLA R.; MOURA, PHABLO F. S.; WAKABAYASHI, YOSHIKO. The convex recoloring problem: polyhedra, facets and computational experiments. MATHEMATICAL PROGRAMMING, v. 156, n. 1-2, p. 303-330, . (13/03447-6, 13/19179-0, 12/17585-9)
KOHAYAKAWA, YOSHIHARU; RETTER, TROY; RODL, VOJTECH. The size Ramsey number of short subdivisions of bounded degree graphs. RANDOM STRUCTURES & ALGORITHMS, v. 54, n. 2, p. 304-339, . (13/03447-6)
ALLEN, PETER; BOETTCHER, JULIA; KOHAYAKAWA, YOSHIHARU; PERSON, YURY. Tight Hamilton Cycles in Random Hypergraphs. RANDOM STRUCTURES & ALGORITHMS, v. 46, n. 3, p. 446-465, . (09/17831-7, 13/07699-0, 13/03447-6, 10/09555-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, . (13/03447-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, . (13/07375-0, 10/10133-0, 13/03447-6, 13/05475-7)
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, . (13/03447-6, 10/10133-0, 13/05475-7, 13/07375-0, 14/18711-3)
BIRGIN, E. G.; MARTINEZ, J. M.. ON REGULARIZATION AND ACTIVE-SET METHODS WITH COMPLEXITY FOR CONSTRAINED OPTIMIZATION. SIAM JOURNAL ON OPTIMIZATION, v. 28, n. 2, p. 1367-1395, . (14/18711-3, 13/07375-0, 13/03447-6, 13/05475-7)
HAN, JIE. ON PERFECT MATCHINGS AND TILINGS IN UNIFORM HYPERGRAPHS. SIAM JOURNAL ON DISCRETE MATHEMATICS, v. 32, n. 2, p. 919-932, . (13/03447-6, 14/18641-5)
REIS, MARCELO S.; ESTRELA, GUSTAVO; FERREIRA, CARLOS EDUARDO; BARRERA, JUNIOR. featsel: A framework for benchmarking of feature selection algorithms and cost functions. SOFTWAREX, v. 6, p. 193-197, . (13/03447-6, 15/01587-0, 16/25959-7, 13/07467-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, . (13/03447-6, 13/07699-0)
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, . (13/20740-9, 13/03447-6)
PROENCA, NATHAN BENEDETTO; SILVA, MARCEL K. DE CARLI; COUTINHO, GABRIEL. DUAL HOFFMAN BOUNDS FOR THE STABILITY AND CHROMATIC NUMBERS BASED ON SEMIDEFINITE PROGRAMMING. SIAM JOURNAL ON DISCRETE MATHEMATICS, v. 35, n. 4, p. 2880-2907, . (13/03447-6)
HAN, JIE; KOHAYAKAWA, YOSHIHARU. On hypergraphs without loose cycles. DISCRETE MATHEMATICS, v. 341, n. 4, p. 946-949, . (14/18641-5, 13/07699-0, 13/03447-6)
HAN, JIE; TREGLOWN, ANDREW. The complexity of perfect matchings and packings in dense hypergraphs. JOURNAL OF COMBINATORIAL THEORY SERIES B, v. 141, p. 72-104, . (13/03447-6, 15/07869-8, 14/18641-5)
CERIOLI, MARCIA R.; FERNANDES, CRISTINA G.; GOMEZ, RENZO; GUTIERREZ, JUAN; LIMA, PALOMA T.. Transversals of longest paths. DISCRETE MATHEMATICS, v. 343, n. 3, . (13/03447-6, 15/08538-5)
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, . (13/07375-0, 17/05198-4, 16/01860-1, 13/05475-7, 15/18053-9, 13/03447-6, 12/23916-8)
BEDENKNECHT, WIEBKE; HAN, JIE; KOHAYAKAWA, YOSHIHARU; MOTA, GUILHERME O.. Powers of tight Hamilton cycles in randomly perturbed hypergraphs. RANDOM STRUCTURES & ALGORITHMS, v. 55, n. 4, . (14/18641-5, 13/03447-6, 18/04876-1)
JIMENEZ, ANDREA; WAKABAYASHI, YOSHIKO. On path-cycle decompositions of triangle-free graphs. DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, v. 19, n. 3, . (11/19978-5, 13/03447-6)
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, . (13/05475-7, 15/18053-9, 13/07375-0, 13/03447-6, 14/18711-3, 10/10133-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, . (13/07375-0, 14/18711-3, 13/05475-7, 10/10133-0, 13/03447-6)
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, . (13/03447-6, 13/11431-2, 13/20733-2)
COLLARES, MAURICIO; KOHAYAKAWA, YOSHIHARU; MORRIS, ROBERT; MOTA, GUILHERME O.. Counting restricted orientations of random graphs. RANDOM STRUCTURES & ALGORITHMS, v. 56, n. 4, p. 1016-1030, . (13/03447-6, 18/04876-1)
CLEMENS, DENNIS; JENSSEN, MATTHEW; KOHAYAKAWA, YOSHIHARU; MORRISON, NATASHA; MOTA, GUILHERME OLIVEIRA; REDING, DAMIAN; ROBERTS, BARNABY. The size-Ramsey number of powers of paths. JOURNAL OF GRAPH THEORY, v. 91, n. 3, p. 290-299, . (13/11431-2, 18/04876-1, 13/03447-6)
HAN, JIE; KOHAYAKAWA, YOSHIHARU; MORRIS, PATRICK; PERSON, YURY. Clique-factors in sparse pseudorandom graphs. EUROPEAN JOURNAL OF COMBINATORICS, v. 82, . (13/03447-6, 14/18641-5)
DE CARLI SILVA, MARCEL K.; TUNCEL, LEVENT. STRICT COMPLEMENTARITY IN SEMIDEFINITE OPTIMIZATION WITH ELLIPTOPES INCLUDING THE MAXCUT SDP. SIAM JOURNAL ON OPTIMIZATION, v. 29, n. 4, p. 2650-2676, . (13/03447-6)
LINTZMAYER, C. N.; MOTA, G. O.; SAMBINELLI, M.. Decomposing split graphs into locally irregular graphs. DISCRETE APPLIED MATHEMATICS, v. 292, p. 33-44, . (17/23623-4, 18/04876-1, 13/03447-6)
BOTLER, FABIO; FERNANDES, CRISTINA G.; GUTIERREZ, JUAN. On Tuza's conjecture for triangulations and graphs with small treewidth. DISCRETE MATHEMATICS, v. 344, n. 4, . (13/03447-6, 15/08538-5)
GAO, WEI; HAN, JIE; ZHAO, YI. Codegree Conditions for Tiling Complete k-Partite k-Graphs and Loose Cycles. COMBINATORICS PROBABILITY & COMPUTING, v. 28, n. 6, p. 840-870, . (14/18641-5, 15/07869-8, 13/03447-6)
HAN, JIE; KOHAYAKAWA, YOSHIHARU; MORRIS, PATRICK; PERSON, YURY. Finding any given 2-factor in sparse pseudorandom graphs efficiently. JOURNAL OF GRAPH THEORY, v. 96, n. 1, p. 22-pg., . (14/18641-5, 13/03447-6)
COUTINHO, GABRIEL; PORTUGAL, RENATO. Discretization of continuous-time quantum walks via the staggered model with Hamiltonians. NATURAL COMPUTING, v. 18, n. 2, p. 7-pg., . (13/03447-6, 15/16339-2)
ARIAS, C. A.; MARTINEZ, J. M.. Fast convergence of an inexact interior point method for horizontal complementarity problems. NUMERICAL ALGORITHMS, v. 79, n. 4, p. 1187-1210, . (13/03447-6, 10/10133-0, 13/05475-7, 13/07375-0, 14/18711-3)
FERREIRA, CARLOS E.; FRANCO, ALVARO J. P.; DA SILVA, MARCIO F.; IEEE. Finding Matrimonial Circuits in some Amerindian Kinship Networks: an Experimental Study. 2014 IEEE 10TH INTERNATIONAL CONFERENCE ON E-SCIENCE (E-SCIENCE), VOL 1, v. N/A, p. 8-pg., . (08/53352-3, 13/03447-6)
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, p. 11-pg., . (11/08033-0, 13/11431-2, 13/20733-2, 13/03447-6, 14/01460-8)
ALLEN, PETER; BOETTCHER, JULIA; HAN, HIEP; KOHAYAKAWA, YOSHIHARU; PERSON, YURY; PARDO, A; VIOLA, A. Powers of Hamilton Cycles in Pseudorandom Graphs. LATIN 2014: THEORETICAL INFORMATICS, v. 8392, p. 12-pg., . (09/17831-7, 13/07699-0, 10/16526-3, 13/03447-6, 10/09555-7)
LINTZMAYER, C. N.; MOTA, G. O.; SAMBINELLI, M.. Decomposing Split Graphs into Locally Irregular Graphs. ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, v. 346, p. 10-pg., . (18/04876-1, 17/23623-4, 13/03447-6)
CERIOLI, MARCIA R.; FERNANDES, CRISTINA G.; LEE, ORLANDO; LINTZMAYER, CARLA N.; MOTA, GUILHERME O.; DA SILVA, CANDIDA N.. On Edge-magic Labelings of Forests. ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, v. 346, p. 9-pg., . (18/04876-1, 15/11937-9, 13/03447-6)
HAN, JIE; GOPAL, TV; JAGER, G; STEILA, S. The Complexity of Perfect Packings in Dense Graphs. THEORY AND APPLICATIONS OF MODELS OF COMPUTATION (TAMC 2017), v. 10185, p. 15-pg., . (14/18641-5, 15/07869-8, 13/03447-6)
DELLAMONICA, DOMINGOS, JR.; 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, p. 41-pg., . (13/07699-0, 13/03447-6)
FERREIRA, CARLOS EDUARDO; PEREIRA FRANCO, ALVARO JUNIO. A min-max relation in flowgraphs and some applications. DISCRETE APPLIED MATHEMATICS, v. 245, p. 12-pg., . (13/03447-6)
CORREA, RICARDO CORDEIRO; HOPPEN, CARLOS; SAMPAIO, RUDINI MENEZES. Limits of k-dimensional poset sequences. DISCRETE APPLIED MATHEMATICS, v. 245, p. 12-pg., . (13/03447-6)
RAVELO, S. V.; FERREIRA, C. E.. A PTAS for the metric case of the minimum sum-requirement communication spanning tree problem. DISCRETE APPLIED MATHEMATICS, v. 228, p. 18-pg., . (13/03447-6)
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, p. 32-pg., . (14/14209-1, 13/03447-6)
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, . (13/20733-2, 13/03447-6, 13/11431-2, 11/08033-0, 14/01460-8)
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, . (13/03447-6, 14/14209-1)
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, . (13/03447-6)
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, . (13/07375-0, 13/05475-7, 14/18711-3, 13/03447-6)
BOTLER, F.; TALON, A.. Decomposing 8-regular graphs into paths of length 4. DISCRETE MATHEMATICS, v. 340, n. 9, p. 2275-2285, . (13/03447-6, 11/08033-0, 14/01460-8)
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, . (13/03447-6, 13/07699-0, 13/11431-2, 13/20733-2)
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, . (13/07375-0, 10/10133-0, 13/03447-6, 13/05475-7)
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, . (13/07375-0, 13/23494-9, 13/05475-7, 10/10133-0, 13/03447-6)
HOPPEN, CARLOS; KOHAYAKAWA, YOSHIHARU; LEFMANN, HANNO. Edge-colorings of uniform hypergraphs avoiding monochromatic matchings. DISCRETE MATHEMATICS, v. 338, n. 2, p. 262-271, . (13/07699-0, 13/03447-6)
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, . (13/03447-6, 13/07699-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, . (13/03447-6, 13/07699-0)
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, . (13/03447-6, 12/24597-3, 15/10323-7)
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, . (13/03447-6, 13/11431-2, 11/08033-0, 14/01460-8, 13/20733-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, . (13/03447-6, 15/11930-4, 13/19179-0)
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, . (14/18641-5, 13/03447-6)
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, . (15/07869-8, 14/18641-5, 13/07699-0, 13/03447-6)
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, . (14/09576-5, 12/25417-9, 11/50761-2, 13/03447-6)
HAN, JIE. On vertex-disjoint paths in regular graphs. ELECTRONIC JOURNAL OF COMBINATORICS, v. 25, n. 2, . (13/03447-6, 14/18641-5)
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, . (13/07375-0, 16/02092-8, 16/01860-1, 13/05475-7, 13/03447-6)
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, . (13/03447-6, 13/07699-0, 09/06294-0, 12/00036-2)
CAMPELO, MANOEL; HUIBAN, CRISTIANA; SAMPAIO, RUDINI M.; WAKABAYASHI, YOSHIKO. Hardness and inapproximability of convex recoloring problems. THEORETICAL COMPUTER SCIENCE, v. 533, p. 15-25, . (13/03447-6)
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, . (13/07699-0, 10/09555-7, 12/00036-2, 13/03447-6, 13/20733-2, 09/06294-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, . (13/07375-0, 13/05475-7, 15/02528-8, 10/10133-0, 13/03447-6)
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, . (13/07375-0, 13/05475-7, 10/10133-0, 13/03447-6, 12/23916-8)
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, . (13/07699-0, 13/03447-6)
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, . (09/17831-7, 13/07699-0, 13/03447-6, 10/09555-7)
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, . (14/18641-5, 15/07869-8, 13/03447-6)
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, . (13/03447-6)
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, . (13/03447-6, 15/11937-9, 13/21744-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, . (13/03447-6, 12/17585-9)
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, . (13/03447-6)
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, . (14/27287-0, 15/01507-7, 15/01587-0, 13/03447-6, 14/09576-5)
KOHAYAKAWA, YOSHIHARU; RODL, VOJTCH; SCHACHT, MATHIAS. Discrepancy and eigenvalues of Cayley graphs. CZECHOSLOVAK MATHEMATICAL JOURNAL, v. 66, n. 3, p. 941-954, . (13/03447-6, 13/07699-0)
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, . (16/13422-9, 13/03447-6, 15/01587-0, 13/10498-6, 14/09576-5)
FUJITA, ANDRE; VIDAL, MACIEL C.; TAKAHASHI, DANIEL Y.. A Statistical Method to Distinguish Functional Brain Networks. FRONTIERS IN NEUROSCIENCE, v. 11, . (13/07375-0, 15/01587-0, 13/03447-6)
HAN, JIE; KOHAYAKAWA, YOSHIHARU; PERSON, YURY. ear-perfect clique-factors in sparse pseudorandom graph. COMBINATORICS PROBABILITY & COMPUTING, v. 30, n. 4, p. 570-590, . (18/04876-1, 13/03447-6, 14/18641-5)
BIRGIN, E. G.; ROMAO, O. C.; RONCONI, D. P.. The multiperiod two-dimensional non-guillotine cutting stock problem with usable leftovers. International Transactions in Operational Research, v. 27, n. 3, p. 1392-1418, . (13/07375-0, 16/01860-1, 13/03447-6)
COLUCCI, LUCAS; GYORI, ERVIN. On L(2,1)-Labelings of Oriented Graphs. DISCUSSIONES MATHEMATICAE GRAPH THEORY, v. 42, n. 1, p. 39-46, . (13/03447-6)
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, . (13/03447-6)
DETSCH, DENISE TREVISOLI; CONTI, DANTE; DINIZ-EHRHARDT, MARIA APARECIDA; MARTINEZ, JOSE MARIO. On the controlling of temperature: A proposal for a real-time controller in broiler houses. CIENTIA AGRICOL, v. 75, n. 6, p. 7-pg., . (13/07375-0, 13/05475-7, 13/03447-6, 10/10133-0)
HAN, JIE; ZANG, CHUANYUN; ZHAO, YI. Matchings in k-partite k-uniform hypergraphs. JOURNAL OF GRAPH THEORY, v. 95, n. 1, . (15/07869-8, 13/03447-6, 14/18641-5)
COLLARES, MAURICIO; KOHAYAKAWA, YOSHIHARU; MORRIS, ROBERT; MOTA, GUILHERME O.. Counting restricted orientations of random graphs. RANDOM STRUCTURES & ALGORITHMS, . (13/03447-6, 18/04876-1)
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, . (13/03447-6, 16/23552-7, 16/01860-1, 15/11937-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, . (14/18641-5, 13/03447-6, 15/07869-8)
BOTLER, FABIO; JIMENEZ, ANDREA. On path decompositions of 2k-regular graphs. DISCRETE MATHEMATICS, v. 340, n. 6, p. 1405-1411, . (13/03447-6, 11/08033-0, 14/01460-8)
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, . (13/03447-6, 10/10133-0, 13/23494-9, 13/05475-7, 13/07375-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, . (13/03447-6)
MARTINEZ, JOSE MARIO. ON HIGH-ORDER MODEL REGULARIZATION FOR CONSTRAINED OPTIMIZATION. SIAM JOURNAL ON OPTIMIZATION, v. 27, n. 4, p. 2447-2458, . (13/07375-0, 10/10133-0, 13/03447-6, 13/05475-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, . (13/03447-6, 10/10133-0, 13/05475-7, 13/07375-0)
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, . (14/18641-5, 13/03447-6)
FERNANDES, CRISTINA G.; DE PINA, JOSE C.; ALFONSIN, JORGE LUIS RAMIREZ; ROBINS, SINAI. Cubic Graphs, Their Ehrhart Quasi-Polynomials, and a Scissors Congruence Phenomenon. DISCRETE & COMPUTATIONAL GEOMETRY, v. 65, n. 1, . (15/10323-7, 13/03447-6)
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, . (13/03447-6, 13/05475-7, 13/07375-0, 14/18711-3, 16/01860-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, . (13/03447-6, 18/04876-1)
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, . (13/03447-6, 17/02263-0, 15/15986-4)
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, . (13/03447-6, 18/04876-1)
HOPPEN, CARLOS; WORMALD, NICHOLAS. LOCAL ALGORITHMS, REGULAR GRAPHS OF LARGE GIRTH, AND RANDOM REGULAR GRAPHS. COMBINATORICA, v. 38, n. 3, p. 619-664, . (13/03447-6)
HAN, JIE; LO, ALLAN; SANHUEZA-MATAMALA, NICOLAS. Covering and tiling hypergraphs with tight cycles. COMBINATORICS PROBABILITY & COMPUTING, v. 30, n. 2, p. 288-329, . (14/18641-5, 13/03447-6, 15/07869-8)
DE CARLI SILVA, MARCEL K.; TUNCEL, LEVENT. A NOTION OF TOTAL DUAL INTEGRALITY FOR CONVEX, SEMIDEFINITE, AND EXTENDED FORMULATIONS. SIAM JOURNAL ON DISCRETE MATHEMATICS, v. 34, n. 1, p. 470-496, . (13/03447-6)
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, v. 93, n. 3, p. 22-pg., . (17/23623-4, 15/11937-9, 13/03447-6)
HOPPEN, CARLOS; KOHAYAKAWA, YOSHIHARU; LANG, RICHARD; LEFMANN, HANNO; STAGNI, HENRIQUE. Estimating parameters associated with monotone properties. COMBINATORICS PROBABILITY & COMPUTING, v. 29, n. 4, p. 17-pg., . (17/02263-0, 15/15986-4, 13/03447-6)
KOHAYAKAWA, YOSHIHARU; MIYAZAWA, FLAVIO KEIDI; WAKABAYASHI, YOSHIKO; BENDER, MA; FARACHCOLTON, M; MOSTEIRO, MA. A Tight Lower Bound for an Online Hypercube Packing Problem and Bounds for Prices of Anarchy of a Related Game. LATIN 2018: THEORETICAL INFORMATICS, v. 10807, p. 15-pg., . (13/03447-6, 15/11937-9, 13/07699-0, 16/23552-7, 16/01860-1)
HAN, JIE; KOHAYAKAWA, YOSHIHARU; SALES, MARCELO TADEU; STAGNI, HENRIQUE; BENDER, MA; FARACHCOLTON, M; MOSTEIRO, MA. Property Testing for Point Sets on the Plane. LATIN 2018: THEORETICAL INFORMATICS, v. 10807, p. 13-pg., . (13/07699-0, 15/15986-4, 14/18641-5, 13/03447-6)
COSTA, EURINARDO R.; DOURADO, MITRE C.; SAMPAIO, RUDINI M.. Inapproximability results related to monophonic convexity. DISCRETE APPLIED MATHEMATICS, v. 197, p. 5-pg., . (13/03447-6)
DELLAMONICA, DOMINGOS, JR.; KOHAYAKAWA, YOSHIHARU; LEE, SANG JUNE; ROEDL, VOJTECH; SAMOTIJ, WOJCIECH. On the Number of B-h-Sets. COMBINATORICS PROBABILITY & COMPUTING, v. 25, n. 1, p. 22-pg., . (13/07699-0, 13/03447-6)
BIRGIN, E. G.; MARTINEZ, J. M.. On the application of an Augmented Lagrangian algorithm to some portfolio problems. EURO JOURNAL ON COMPUTATIONAL OPTIMIZATION, v. 4, n. 1, p. 14-pg., . (13/07375-0, 13/05475-7, 10/10133-0, 13/03447-6)

Please report errors in scientific publications list using this form.