Journals
Total number of items: 233
2024
| 1. | ARAUJO, JULIO ; CAMPOS, V. A. ; GIRÃO, DARLAN ; NOGUEIRA, JOÃO ; SALGUEIRO, ANTÓNIO ; SILVA, A. S.. On the hull number on cycle convexity of graphs. INFORMATION PROCESSING LETTERS. v. 183, p. 106420, 2024.  |
| 2. | ARAÚJO, PAULO H.’M. ; Campêlo, Manoel ; CORRÊA, RICARDO C. ; LABBÉ, MARTINE. Integer programming models and polyhedral study for the geodesic classification problem on graphs. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH. v. 314, p. 894-911, 2024. |
| 3. | ARAÚJO, SAMUEL N. ; BRITO, JOÃO MARCOS ; FOLZ, RAQUEL ; DE FREITAS, ROSIANE ; Sampaio, Rudini M.. Graph convexity impartial games: complexity and winning strategies. THEORETICAL COMPUTER SCIENCE. v. 998, p. 114534, 2024. |
| 4. | BESSY, STÉPHANE ; HÖRSCH, FLORIAN ; Maia, Ana Karolinna ; RAUTENBACH, DIETER ; SAU, IGNASI. FPT algorithms for packing -safe spanning rooted sub(di)graphs. DISCRETE APPLIED MATHEMATICS. v. 346, p. 80-94, 2024. |
| 5. | CHANDRAN S. V., ULLAS ; KLAV’AR, SANDI ; P. K., NEETHU ; Sampaio, Rudini. The general position avoidance game and hardness of general position games. THEORETICAL COMPUTER SCIENCE. v. 988, p. 114370, 2024. |
| 6. | COSTA, ISNARD LOPES ; LOPES, RAUL ; MARINO, ANDREA ; Silva, Ana. On computing large temporal (unilateral) connected components. JOURNAL OF COMPUTER AND SYSTEM SCIENCES. v. 144, p. 103548, 2024. |
| 7. | COSTA, ISNARD LOPES ; Silva, Ana Shirley. Acyclic coloring of products of digraphs. DISCRETE APPLIED MATHEMATICS. v. 349, p. 59-69, 2024. |
| 8. | CUNHA, F. C. M. ; SAMPAIO, R. M.. Revisitando dois problemas clássicos do Irodov sobre curvas de perseguição. REVISTA BRASILEIRA DE ENSINO DE FÍSICA (ONLINE). v. 46, p. e20230307, 2024. |
| 9. | CUNHA, Felipe Costa M. ; GUILHON, Ivan ; SAMPAIO, Samuel Madeiro. ; SAMPAIO, Antônio José da Costa ; Sampaio, Rudini Menezes. Revisitando modos normais de oscilações acopladas com a Teoria Espectral de Grafos. REVISTA BRASILEIRA DE ENSINO DE FÍSICA (ONLINE). v. 46, p. e20240095, 2024. |
| 10. | DE ANDRADE, RAFAEL CASTRO; CASTELO, EMANUEL ELIAS SILVA ; SARAIVA, ROMMEL DIAS. Valid inequalities for the k-Color Shortest Path Problem. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH. v. 315, p. 499-510, 2024. |
| 11. | de Figueiredo, Celina M. H. ; DE MELO, ALEXSANDER A. ; Oliveira, Fabiano S. ; Silva, Ana. Maximum Cut on Interval Graphs of Interval Count Four is NP-Complete. DISCRETE & COMPUTATIONAL GEOMETRY. v. 71, p. 893-917, 2024. |
| 12. | de Figueiredo, Celina M. H. ; LOPES, RAUL ; DE MELO, ALEXSANDER A. ; Silva, Ana. Parameterized algorithms for Steiner tree and (connected) dominating set on path graphs. NETWORKS. v. 2024, p. 1, 2024. |
| 13. | IBIAPINA, ALLEN ; Silva, Ana. Snapshot disjointness in temporal graphs. THEORETICAL COMPUTER SCIENCE. v. 1009, p. 114690, 2024. |
| 14. | Sampaio, Rudini; SOBRAL, GABRIEL A. G. ; WAKABAYASHI, YOSHIKO. Density of identifying codes of hexagonal grids with finite number of rows. RAIRO-OPERATIONS RESEARCH. v. 58, p. 1633-1651, 2024. |
2023
| 1. | ADASME, PABLO ; ANDRADE, Rafael Castro de. Minimum weight clustered dominating tree problem. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH. v. 306, p. 535-548, 2023. |
| 2. | ARAUJO, JULIO ; BENSMAIL, JULIEN ; CAMPOS, VICTOR ; HAVET, FRÉDÉRIC ; MAIA, A. KAROLINNA ; NISSE, NICOLAS ; Silva, Ana. On Finding the Best and Worst Orientations for the Metric Dimension. Algorithmica (New York. ALGORITHMICA,. v. 2023, p. 2962-3002, 2023. |
| 3. | Araujo, Julio; CAMPOS, VICTOR ; GIRÃO, DARLAN ; NOGUEIRA, JOÃO ; SALGUEIRO, ANTÓNIO ; SILVA, ANA. On the Hull Number on Cycle Convexity of Graphs. INFORMATION PROCESSING LETTERS. v. 183, p. 106420, 2023. |
| 4. | Araújo, Júlio; BOUGERET, MARIN ; CAMPOS, VICTOR A. ; SAU, IGNASI. Parameterized Complexity of Computing Maximum Minimal Blocking and Hitting Sets. ALGORITHMICA. v. 85, p. 444-491, issn: 0178-4617, 2023. [ citações Google Scholar | busca Google ] |
| 5. | ARAÚJO, PAULO HENRIQUE MACÊDO DE ; CORRÊA, RICARDO C. ; Campêlo, Manoel. A parallel lagrangian heuristic for the fractional chromatic number of a graph. RAIRO-OPERATIONS RESEARCH. v. 57, p. 1821-1841, 2023. |
| 6. | ARAÚJO, RAFAEL T. ; SAMPAIO, R. M.. Domination and convexity problems in the target set selection model. DISCRETE APPLIED MATHEMATICS. v. 330, p. 14-23, issn: 0166-218X, 2023. [ citações Google Scholar | busca Google ] |
| 7. | Benevides, Fabricio; BERMOND, JEAN-CLAUDE ; LESFARI, HICHAM ; NISSE, NICOLAS. Minimum lethal sets in grids and tori under 3-neighbour bootstrap percolation. EUROPEAN JOURNAL OF COMBINATORICS. v. 1, p. 103801, 2023. |
| 8. | Campêlo, Manoel; MATIAS, JHONATA. A strongly polynomial algorithm for the minimum maximum flow degree problem. OPERATIONS RESEARCH LETTERS. v. 51, p. 67-71, 2023. |
| 9. | CARVALHO, C. ; COSTA, J. ; LOPES, RAUL ; Maia, A. K. ; NISSE, N. ; Linhares Sales, C.. From branchings to flows: a study of an Edmonds’ like property to arc-disjoint branching flows. DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE (ONLINE). v. 25:1, p. 1-15, 2023. [ citações Google Scholar | busca Google ] |
| 10. | DE FIGUEIREDO, CELINA M.H. ; DE MELO, ALEXSANDER A. ; Oliveira, Fabiano S. ; Silva, Ana. MaxCut on Permutation Graphs is NP-complete. JOURNAL OF GRAPH THEORY. v. 2023, p. 2023, issn: 0364-9024, 2023. [ citações Google Scholar | busca Google ] |
| 11. | IBIAPINA, ALLEN ; Silva, Ana. Mengerian graphs: characterization and recognition. JOURNAL OF COMPUTER AND SYSTEM SCIENCES. v. 139, p. 103467, 2023. |
| 12. | KEILER, L. ; LIMA, C. V. G. ; MAIA, A. K. ; SAMPAIO, R. M. ; SAU, I.. Target set selection with maximum activation time. DISCRETE APPLIED MATHEMATICS. v. x, p. 1, issn: 0166-218X, 2023. [ citações Google Scholar | busca Google ] |
| 13. | LIMA, CARLOS V.G.C. ; MARCILON, THIAGO ; MARTINS, NICOLAS ; Sampaio, Rudini. The connected greedy coloring game. THEORETICAL COMPUTER SCIENCE. v. 940, p. 1-13, issn: 0304-3975, 2023. [ citações Google Scholar | busca Google ] |
| 14. | MARINO, ANDREA ; Silva, Ana. Eulerian Walks in Temporal Graphs. ALGORITHMICA. v. 85, p. 805-830, 2023. |
| 15. | RODRIGUES, CARLOS DIEGO; CHERRI, ADRIANA CRISTINA ; DE ARAUJO, SILVIO ALEXANDRE. Strip based compact formulation for two-dimensional guillotine cutting problems. COMPUTERS & OPERATIONS RESEARCH. v. 149, p. 106044, 2023. |
2022
| 1. | Antonioli, M. ; RODRIGUES, C. D. ; Prata, B. A.. Minimizing total tardiness for the order scheduling problem with sequence-dependent setup times using hybrid matheuristics. International Journal of Industrial Engineering Computations. v. 13, p. 30, issn: 1923-2934, 2022. [ citações Google Scholar | busca Google ] |
| 2. | Araujo, C. S. ; ARAÚJO, J. ; CEZAR, A. A. ; SILVA, A. S.. Backbone coloring of graphs with galaxy backbones. DISCRETE APPLIED MATHEMATICS. v. 323, p. 2-13, issn: 0166-218X, 2022. [ citações Google Scholar | busca Google ] |
| 3. | ARAÚJO, J.; ARRAES, P.S.M.. Hull and geodetic numbers for some classes of oriented graphs. DISCRETE APPLIED MATHEMATICS. v. 323, p. 14-27, issn: 0166-218X, 2022. [ citações Google Scholar | busca Google ] |
| 4. | ARAÚJO, JÚLIO ; BOUGERET, MARIN ; CAMPOS, VICTOR ; SAU, IGNASI. Introducing lop-Kernels: A Framework for Kernelization Lower Bounds. Algorithmica (New York. Internet). v. 84, p. 3365-3406, issn: 1432-0541, 2022. [ citações Google Scholar | busca Google ] |
| 5. | BENEVIDES, FABRICIO S.; HOPPEN, CARLOS ; LEFMANN, HANNO ; ODERMANN, KNUT. Heilbronn triangle-type problems in the unit square [0,1]2$$ {left[0,1 ight]}^2 $$. Random Structures and Algorithms. v. 1, p. 1, issn: 1098-2418, 2022. [ citações Google Scholar | busca Google ] |
| 6. | BENEVIDES, FABRÍCIO SIQUEIRA; SULKOWSKA, MA’GORZATA. Maximizing the expected number of components in an online search of a graph. DISCRETE MATHEMATICS. v. 345, p. 112668, issn: 0012-365X, 2022. [ citações Google Scholar | busca Google ] |
| 7. | CAMPOS, VICTOR ; LOPES, RAUL ; Maia, Ana Karolinna ; SAU, IGNASI. Adapting the Directed Grid Theorem into an FPT Algorithm. SIAM JOURNAL ON DISCRETE MATHEMATICS. v. 36, p. 1887-1917, issn: 0895-4801, 2022. [ citações Google Scholar | busca Google ] |
| 8. | Campêlo, Manoel; FREIRE, ALEXANDRE S. ; MOURA, PHABLO F.S. ; SOARES, JOEL C.. Strong inequalities and a branch-and-price algorithm for the convex recoloring problem. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH. v. 303, p. 54-65, issn: 0377-2217, 2022. [ citações Google Scholar | busca Google ] |
| 9. | Campêlo, Manoel; MATIAS, JHONATA A. S.. Correction to: Using the minimum maximum flow degree to approximate the flow coloring problem. ANNALS OF OPERATIONS RESEARCH. v. 316, p. 1573-1574, issn: 0254-5330, 2022. [ citações Google Scholar | busca Google ] |
| 10. | COSTA, EURINARDO RODRIGUES ; MARTINS, NICOLAS ALMEIDA ; Sampaio, Rudini. Spy game: FPT-algorithm, hardness and graph products. THEORETICAL COMPUTER SCIENCE. v. 923, p. 304-317, issn: 0304-3975, 2022. [ citações Google Scholar | busca Google ] |
| 11. | DE ANDRADE, RAFAEL CASTRO; BONATES, TIBÉRIUS DE OLIVEIRA E ; CAMPÊLO, MANOEL ; FERREIRA, MARDSON DA SILVA. A compact quadratic model and linearizations for the minimum linear arrangement problem. DISCRETE APPLIED MATHEMATICS. v. 323, p. 134-148, issn: 0166-218X, 2022. [ citações Google Scholar | busca Google ] |
| 12. | DE FIGUEIREDO, CELINA M.H. ; DE MELO, ALEXSANDER A. ; SASAKI, DIANA ; Silva, Ana. Revising Johnson?s table for the 21st century. DISCRETE APPLIED MATHEMATICS. v. 323, p. 184-200, issn: 0166-218X, 2022. [ citações Google Scholar | busca Google ] |
| 13. | LIMA, CARLOS V.G.C. ; MARCILON, THIAGO ; MARTINS, NICOLAS ; Sampaio, Rudini. PSPACE-hardness of variants of the graph coloring game. THEORETICAL COMPUTER SCIENCE. v. 909, p. 87-96, issn: 0304-3975, 2022. [ citações Google Scholar | busca Google ] |
| 14. | MARINO, ANDREA ; Silva, Ana. Coloring temporal graphs. JOURNAL OF COMPUTER AND SYSTEM SCIENCES. v. 123, p. 171-185, issn: 0022-0000, 2022. [ citações Google Scholar | busca Google ] |
| 15. | MARINO, ANDREA ; Silva, Ana. Eulerian Walks in Temporal Graphs. ALGORITHMICA. v. 2022, p. 1, issn: 0178-4617, 2022. [ citações Google Scholar | busca Google ] |
| 16. | PRATA, BRUNO DE ATHAYDE ; FERNANDEZ-VIAGAS, VICTOR ; FRAMINAN, JOSE M. ; RODRIGUES, CARLOS DIEGO. Matheuristics for the flowshop scheduling problem with controllable processing times and limited resource consumption to minimize total tardiness. COMPUTERS & OPERATIONS RESEARCH. v. 145, p. 105880, issn: 0305-0548, 2022. [ citações Google Scholar | busca Google ] |
| 17. | PRATA, BRUNO DE ATHAYDE ; RODRIGUES, CARLOS DIEGO ; FRAMINAN, JOSE MANUEL. A differential evolution algorithm for the customer order scheduling problem with sequence-dependent setup times. EXPERT SYSTEMS WITH APPLICATIONS. v. 189, p. 116097, issn: 0957-4174, 2022. [ citações Google Scholar | busca Google ] |
| 18. | RODRIGUES, CARLOS DIEGO; CHERRI, ADRIANA CRISTINA ; DE ARAUJO, SILVIO ALEXANDRE. Strip based compact formulation for two-dimensional guillotine cutting problems. COMPUTERS & OPERATIONS RESEARCH. v. 1, p. 106044, issn: 0305-0548, 2022. [ citações Google Scholar | busca Google ] |
2021
| 1. | ARAUJO, J. ; CEZAR, A. ; LIMA, C.V.G.C. ; DOS SANTOS, V.F. ; SILVA, A.. On the proper orientation number of chordal graphs. THEORETICAL COMPUTER SCIENCE. v. 888, p. 117-132, issn: 0304-3975, 2021. [ citações Google Scholar | busca Google ] |
| 2. | Assunção, Lucas ; Santos, Andréa Cynthia ; NORONHA, THIAGO F. ; Andrade, Rafael. Improving logic-based Benders? algorithms for solving min-max regret problems. Operations Research And Decisions. v. 31, p. 23-57, issn: 2081-8858, 2021. [ citações Google Scholar | busca Google ] |
| 3. | CAMPOS, VICTOR A. ; GOMES, GUILHERME C.M. ; IBIAPINA, ALLEN ; LOPES, RAUL ; SAU, IGNASI ; Silva, Ana. Coloring Problems on Bipartite Graphs of Small Diameter. ELECTRONIC JOURNAL OF COMBINATORICS. v. 28, p. P2.14, issn: 1077-8926, 2021. [ citações Google Scholar | busca Google ] |
| 4. | Campos, Victor ; LOPES, RAUL ; MARINO, ANDREA ; Silva, Ana. Edge-Disjoint Branchings in Temporal Digraphs. ELECTRONIC JOURNAL OF COMBINATORICS. v. 28, p. P4.3, issn: 1077-8926, 2021. [ citações Google Scholar | busca Google ] |
| 5. | CAMPÊLO, M.; Severin, Daniel. An integer programming approach for solving a generalized version of the Grundy domination number. DISCRETE APPLIED MATHEMATICS. v. 301, p. 26-48, issn: 0166-218X, 2021. [ citações Google Scholar | busca Google ] |
| 6. | Campêlo, Manoel; FIGUEIREDO, TATIANE FERNANDES. Integer programming approaches to the multiple team formation problem. COMPUTERS & OPERATIONS RESEARCH. v. 133, p. 105354, issn: 0305-0548, 2021. [ citações Google Scholar | busca Google ] |
| 7. | Campêlo, Manoel; MATIAS, JHONATA A. S.. Using the minimum maximum flow degree to approximate the flow coloring problem. ANNALS OF OPERATIONS RESEARCH. v. 316, p. 1267-1278, issn: 0254-5330, 2021. [ citações Google Scholar | busca Google ] |
| 8. | Campêlo, Manoel; SOARES, JOEL C. ; MACIEL, TARCISIO F. ; LIMA, F. RAFAEL M.. Heuristics for the connected assignment problem in arrays. International Transactions in Operational Research. v. 28, p. 3147-3171, issn: 0969-6016, 2021. [ citações Google Scholar | busca Google ] |
| 9. | DE ANDRADE, RAFAEL CASTRO ; BONATES, TIBÉRIUS DE OLIVEIRA E ; Campêlo, Manoel ; FERREIRA, MARDSON DA SILVA. A compact quadratic model and linearizations for the minimum linear arrangement problem. DISCRETE APPLIED MATHEMATICS. v. 323, p. 134-148, issn: 0166-218X, 2021. [ citações Google Scholar | busca Google ] |
| 10. | de Carvalho Junior, Francisco Heron; Al-Alam, Wagner ; Dantas, A. B. O.. Contextual Contracts for Component-Oriented Resource Abstraction in a Cloud of HPC Services. CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE. v. 33, p. e6225, issn: 1532-0626, 2021. [ citações Google Scholar | busca Google ] |
| 11. | RÊGO, LEANDRO CHAVES ; SILVA, HUGO VICTOR ; RODRIGUES, CARLOS DIEGO. Optimizing the cost of preference manipulation in the graph model for conflict resolution. APPLIED MATHEMATICS AND COMPUTATION. v. 392, p. 125729, issn: 0096-3003, 2021. [ citações Google Scholar | busca Google ] |
| 12. | SARAIVA, ROMMEL DIAS ; ANDRADE, RAFAEL CASTRO. Constrained shortest path tour problem: models, valid inequalities, and Lagrangian heuristics. International Transactions in Operational Research. v. 28, p. 222-261, issn: 0969-6016, 2021. [ citações Google Scholar | busca Google ] |
| 13. | SOARES, PABLO ; Campêlo, Manoel. t-Linearization for the maximum diversity problem. Optimization Letters. v. 15, p. 2879-2895, issn: 1862-4472, 2021. [ citações Google Scholar | busca Google ] |
| 14. | VIANA, LUIZ ; Campêlo, Manoel ; SAU, IGNASI ; SILVA, ANA. A unifying model for locally constrained spanning tree problems. JOURNAL OF COMBINATORIAL OPTIMIZATION. v. 42, p. 125-150, issn: 1382-6905, 2021. [ citações Google Scholar | busca Google ] |
2020
| 1. | ALCON, L. ; GRAVIER, S. ; LINHARES SALES, C. ; PROTTI, F. ; RAVENNA, G.. On clique-inverse graphs of graphs with bounded clique number. JOURNAL OF GRAPH THEORY. v. 1, p. 1-10, issn: 0364-9024, 2020. [ citações Google Scholar | busca Google ] |
| 2. | ARAÚJO, JÚLIO ; Campos, Victor A. ; LIMA, CARLOS VINÍCIUS G. C. ; DOS SANTOS, VINÍCIUS FERNANDES ; SAU, IGNASI ; Silva, Ana. Dual Parameterization of Weighted Coloring. ALGORITHMICA. v. 82, p. 2316-2336, issn: 0178-4617, 2020. [ citações Google Scholar | busca Google ] |
| 3. | ARAÚJO, JÚLIO ; Campos, Victor A. ; MAIA, ANA KAROLINNA ; SAU, IGNASI ; Silva, Ana. On the Complexity of Finding Internally Vertex-Disjoint Long Directed Paths. ALGORITHMICA. v. 82, p. 1616-1639, issn: 0178-4617, 2020. [ citações Google Scholar | busca Google ] |
| 4. | BRUNO DE OLIVEIRA DANTAS, ALLBERSON ; HERON DE CARVALHO JUNIOR, FRANCISCO ; Barbosa, Luis Soares. A component-based framework for certification of components in a cloud of HPC services. SCIENCE OF COMPUTER PROGRAMMING. v. 191, p. 102379, issn: 0167-6423, 2020. [ citações Google Scholar | busca Google ] |
| 5. | Campêlo, Manoel; FIGUEIREDO, TATIANE ; SILVA, ANA. The sociotechnical teams formation problem: a mathematical optimization approach. ANNALS OF OPERATIONS RESEARCH. v. 286, p. 201-216, issn: 0254-5330, 2020. [ citações Google Scholar | busca Google ] |
| 6. | COSTA, EURINARDO ; PESSOA, VICTOR LAGE ; Sampaio, Rudini ; SOARES, RONAN. PSPACE-completeness of two graph coloring games. THEORETICAL COMPUTER SCIENCE. v. 824, p. 36-45, issn: 0304-3975, 2020. [ citações Google Scholar | busca Google ] |
| 7. | DE ANDRADE, RAFAEL CASTRO; SARAIVA, ROMMEL DIAS. MTZ-primal-dual model, cutting-plane, and combinatorial branch-and-bound for shortest paths avoiding negative cycles. ANNALS OF OPERATIONS RESEARCH. v. 286, p. 147-172, issn: 0254-5330, 2020. [ citações Google Scholar | busca Google ] |
| 8. | IBIAPINA, ALLEN ; Silva, Ana. b-continuity and partial Grundy coloring of graphs with large girth. DISCRETE MATHEMATICS. v. 343, p. 111920, issn: 0012-365X, 2020. [ citações Google Scholar | busca Google ] |
| 9. | MOTA, ESDRAS ; ROCHA, LEONARDO ; Silva, Ana. Connected greedy coloring of H -free graphs. DISCRETE APPLIED MATHEMATICS. v. 284, p. 572-584, issn: 0166-218X, 2020. [ citações Google Scholar | busca Google ] |
| 10. | PRATA, BRUNO DE ATHAYDE ; RODRIGUES, CARLOS DIEGO ; FRAMINAN, JOSE MANUEL. Customer order scheduling problem to minimize makespan with sequence-dependent setup times. COMPUTERS & INDUSTRIAL ENGINEERING. v. 1, p. 106962, issn: 0360-8352, 2020. [ citações Google Scholar | busca Google ] |
| 11. | VIANA, LUIZ ALBERTO DO CARMO ; Campêlo, Manoel. Two dependency constrained spanning tree problems. International Transactions in Operational Research. v. 27, p. 867-898, issn: 0969-6016, 2020. [ citações Google Scholar | busca Google ] |
2019
| 1. | ARAUJO, R. T. ; Costa, E. R. ; KLEIN, S. ; SAMPAIO, R. M. ; SOUZA, U. S.. FPT algorithms to recognize well covered graphs. DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE. v. 21, p. 3, issn: 1462-7264, 2019. [ citações Google Scholar | busca Google ] |
| 2. | ARAÚJO, JÚLIO ; Sales, Cláudia Linhares ; SAU, IGNASI ; Silva, Ana. Weighted proper orientations of trees and graphs of bounded treewidth. THEORETICAL COMPUTER SCIENCE. v. 771, p. 39-48, issn: 0304-3975, 2019. [ citações Google Scholar | busca Google ] |
| 3. | BASTOS, JOSEFRAN DE OLIVEIRA ; BENEVIDES, FABRÍCIO SIQUEIRA ; HAN, JIE. The number of Gallai k-colorings of complete graphs. JOURNAL OF COMBINATORIAL THEORY SERIES B. v. InPres, p. 13, issn: 0095-8956, 2019. [ citações Google Scholar | busca Google ] |
| 4. | BASTOS, JOSEFRAN DE OLIVEIRA ; BENEVIDES, FABRÍCIO SIQUEIRA ; MOTA, GUILHERME OLIVEIRA ; SAU, IGNASI. Counting Gallai 3-colorings of complete graphs. DISCRETE MATHEMATICS. v. 342, p. 2618-2631, issn: 0012-365X, 2019. [ citações Google Scholar | busca Google ] |
| 5. | COSTA, EURINARDO ; PESSOA, VICTOR LAGE ; Sampaio, Rudini ; SOARES, RONAN. PSPACE-hardness of Two Graph Coloring Games. ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE. v. 346, p. 333-344, issn: 1571-0661, 2019. [ citações Google Scholar | busca Google ] |
| 6. | COSTA, J. ; LINHARES SALES, CLAUDIA ; LOPES, R. ; MAIA, A. K.. Um Estudo de Redes com Fluxos Ramificados Arco-disjuntos. MATEMATICA CONTEMPORANEA. v. 46, p. 230-238, issn: 0103-9059, 2019. [ citações Google Scholar | busca Google ] |
| 7. | DE CARVALHO SILVA, JEFFERSON ; DE OLIVEIRA DANTAS, ALLBERSON BRUNO ; de Carvalho Junior, Francisco Heron. A Scientific Workflow Management System for orchestration of parallel components in a cloud of large-scale parallel processing services. SCIENCE OF COMPUTER PROGRAMMING. v. 173, p. 95-127, issn: 0167-6423, 2019. [ citações Google Scholar | busca Google ] |
| 8. | HELL, P. ; HERNANDEZ-CRUZ, C. ; LINHARES SALES, C.. Minimal obstructions to 2-polar cographs. DISCRETE APPLIED MATHEMATICS. v. 261, p. 219-228, issn: 0166-218X, 2019. [ citações Google Scholar | busca Google ] |
| 9. | KANTÉ, MAMADOU ; MARCILON, THIAGO ; Sampaio, Rudini. On the parameterized complexity of the geodesic hull number. THEORETICAL COMPUTER SCIENCE. v. 791, p. 10-27, issn: 0304-3975, 2019. [ citações Google Scholar | busca Google ] |
| 10. | MARTINS, NICOLAS ; SAMPAIO, R. M.. Meyniel’s Conjecture on graphs with few P4’s. MATEMATICA CONTEMPORANEA. v. 46, p. 194-203, issn: 0103-9059, 2019. [ citações Google Scholar | busca Google ] |
| 11. | PERICINI, MATHEUS ; LEITE, LUCAS ; DE CARVALHO-JUNIOR, FRANCISCO ; MACHADO, JAVAM ; REZENDE, CENEZ. MAPSkew: Metaheuristic Approaches for Partitioning Skew in MapReduce. Algorithms. v. 12, p. 5, issn: 1999-4893, 2019. [ citações Google Scholar | busca Google ] |
| 12. | Silva, Ana. Graphs with small fall-spectrum. DISCRETE APPLIED MATHEMATICS. v. 254, p. 183-188, issn: 0166-218X, 2019. [ citações Google Scholar | busca Google ] |
2018
| 1. | ADASME, P. ; Andrade, Rafael ; LEUNG, JANNY ; Lisser, Abdel. Improved solution strategies for dominating trees. EXPERT SYSTEMS WITH APPLICATIONS. v. 100, p. 30-40, issn: 0957-4174, 2018. [ citações Google Scholar | busca Google ] |
| 2. | Andrade, Rafael; GURGURI, JEFFERSON. Models and cutting-plane strategies for the tree-star problem. ELECTRONIC NOTES IN DISCRETE MATHEMATICS. v. 69, p. 261-268, issn: 1571-0653, 2018. [ citações Google Scholar | busca Google ] |
| 3. | ARAÚJO, J.; BENEVIDES, F. S. ; CEZAR, A. A. ; SILVA, A. S.. Circular backbone colorings: On matching and tree backbones of planar graphs. DISCRETE APPLIED MATHEMATICS. v. online, p. 69-82, issn: 0166-218X, 2018. [ citações Google Scholar | busca Google ] |
| 4. | ARAÚJO, J.; DUCOFFE, G. ; NISSE, N. ; SUCHAN, K.. On interval number in cycle convexity. DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE. v. 20, p. 1, issn: 1462-7264, 2018. [ citações Google Scholar | busca Google ] |
| 5. | ARAÚJO, JÚLIO ; SALES, CLÁUDIA LINHARES ; SAU, IGNASI ; Silva, Ana. Weighted proper orientations of trees and graphs of bounded treewidth. THEORETICAL COMPUTER SCIENCE. v. 771, p. 39-48, issn: 0304-3975, 2018. [ citações Google Scholar | busca Google ] |
| 6. | Araújo, Júlio; BASTE, JULIEN ; SAU, IGNASI. Ruling out FPT algorithms for Weighted Coloring on forests. THEORETICAL COMPUTER SCIENCE. p. 11-19, issn: 0304-3975, 2018. [ citações Google Scholar | busca Google ] |
| 7. | ARAÚJO, RAFAEL T. ; Sampaio, Rudini M. ; DOS SANTOS, VINÍCIUS F. ; SZWARCFITER, JAYME L.. The convexity of induced paths of order three and applications: Complexity aspects. DISCRETE APPLIED MATHEMATICS. v. 237, p. 33-42, issn: 0166-218X, 2018. [ citações Google Scholar | busca Google ] |
| 8. | CAMPOS, V.; LOPES, R.. A proof for a conjecture of Gorgol. DISCRETE APPLIED MATHEMATICS. v. 245, p. 202-207, issn: 0166-218X, 2018. [ citações Google Scholar | busca Google ] |
| 9. | Campos, Victor ; Silva, Ana. Edge-b-Coloring Trees. ALGORITHMICA. v. 80, p. 104-115, issn: 0178-4617, 2018. [ citações Google Scholar | busca Google ] |
| 10. | CAMPÊLO, MANOEL ; LIEBLING, THOMAS ; Sampaio, Rudini. Preface: LAGOS?15 – Eighth Latin-American Algorithms, Graphs, and Optimization Symposium, Fortaleza, Brazil – 2015. DISCRETE APPLIED MATHEMATICS. v. 245, p. 1-3, issn: 0166-218X, 2018. [ citações Google Scholar | busca Google ] |
| 11. | Carneiro, Tiago ; Gmys, Jam ; de Carvalho-Junior, Francisco Heron ; Melab, B. ; TUYTTENS, D.. GPU-Accelerated Backtracking Using CUDA Dynamic Parallelism. CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE. v. 30, p. e4374, issn: 1532-0626, 2018. [ citações Google Scholar | busca Google ] |
| 12. | CORRÊA, RICARDO CORDEIRO ; Hoppen, Carlos ; Sampaio, Rudini Menezes. Limits of k -dimensional poset sequences. DISCRETE APPLIED MATHEMATICS. v. 245, p. 208-219, issn: 0166-218X, 2018. [ citações Google Scholar | busca Google ] |
| 13. | DANTAS, RENNAN ; HAVET, FRÉDÉRIC ; Sampaio, Rudini M.. Minimum density of identifying codes of king grids. DISCRETE MATHEMATICS. v. 341, p. 2708-2719, issn: 0012-365X, 2018. [ citações Google Scholar | busca Google ] |
| 14. | DE ANDRADE, RAFAEL CASTRO; SARAIVA, ROMMEL DIAS. An integer linear programming model for the constrained shortest path tour problem. ELECTRONIC NOTES IN DISCRETE MATHEMATICS. v. 69, p. 141-148, issn: 1571-0653, 2018. [ citações Google Scholar | busca Google ] |
| 15. | FERNANDES MURITIBA, ALBERT EINSTEIN ; RODRIGUES, CARLOS DIEGO ; ARAÙJO DA COSTA, FRANCÍIO. A Path-Relinking algorithm for the multi-mode resource-constrained project scheduling problem. COMPUTERS & OPERATIONS RESEARCH. v. 92, p. 145-154, issn: 0305-0548, 2018. [ citações Google Scholar | busca Google ] |
| 16. | MARCILON, THIAGO ; Sampaio, Rudini. The maximum infection time of the P 3 convexity in graphs with bounded maximum degree. DISCRETE APPLIED MATHEMATICS. v. 251, p. 245-257, issn: 0166-218X, 2018. [ citações Google Scholar | busca Google ] |
2017
| 1. | ADASME, PABLO ; Andrade, Rafael ; Lisser, Abdel. Minimum cost dominating tree sensor networks under probabilistic constraints. Computer Networks (1999). v. 112, p. 208-222, issn: 1389-1286, 2017. [ citações Google Scholar | busca Google ] |
| 2. | Andrade, Rafael; BONATES, TIBÉRIUS ; CAMPÊLO, MANOEL ; FERREIRA, MARDSON. Minimum Linear Arrangements. ELECTRONIC NOTES IN DISCRETE MATHEMATICS. v. 62, p. 63-68, issn: 1571-0653, 2017. [ citações Google Scholar | busca Google ] |
| 3. | ARAUJO, J. ; CEZAR, A. A. ; SILVA, A.. On the Existence of Tree Backbones that Realize the Chromatic Number on a Backbone Coloring. JOURNAL OF GRAPH THEORY. v. 85, p. 808-813, issn: 0364-9024, 2017. [ citações Google Scholar | busca Google ] |
| 4. | Araujo, J.; HAVET, F. ; SCHMITT, M.. Steinberg-like theorems for backbone colouring. DISCRETE APPLIED MATHEMATICS. v. 245, p. 155-167, issn: 0166-218X, 2017. [ citações Google Scholar | busca Google ] |
| 5. | Assunção, Lucas ; NORONHA, THIAGO F. ; Santos, Andréa Cynthia ; ANDRADE, Rafael Castro de. A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs. COMPUTERS & OPERATIONS RESEARCH. v. 81, p. 51-66, issn: 0305-0548, 2017. [ citações Google Scholar | busca Google ] |
| 6. | Benevides, Fabricio Siqueira; SULKOWSKA, M.. Percolation and best-choice problem for powers of paths. JOURNAL OF APPLIED PROBABILITY. v. 54, p. 343-362, issn: 0021-9002, 2017. [ citações Google Scholar | busca Google ] |
| 7. | BENEVIDES, FABRÍCIO S. ; Hoppen, Carlos ; Sampaio, Rudini M.. Edge-colorings of graphs avoiding complete graphs with a prescribed coloring. DISCRETE MATHEMATICS. v. 340, p. 2143-2160, issn: 0012-365X, 2017. [ citações Google Scholar | busca Google ] |
| 8. | BENEVIDES, FABRÍCIO S.; GERBNER, DÁNIEL ; PALMER, CORY T. ; VU, DOMINIK K.. Identifying defective sets using queries of small size. DISCRETE MATHEMATICS. v. NA, p. NA, issn: 0012-365X, 2017. [ citações Google Scholar | busca Google ] |
| 9. | COHEN, NATHANN ; A.MARTINS, NÍCOLAS ; MC INERNEY, FIONN ; NISSE, NICOLAS ; PÉRENNES, STÉPHANE ; Sampaio, Rudini. Spy-Game on graphs: Complexity and simple topologies. THEORETICAL COMPUTER SCIENCE. v. 725, p. 1-15, issn: 0304-3975, 2017. [ citações Google Scholar | busca Google ] |
| 10. | Dantas, R. F. ; HAVET, F. ; Sampaio, Rudini M.. Identifying codes for infinite triangular grids with a finite number of rows. Discrete Mathematics. v. 340, p. 1584-1597, issn: 0012-365X, 2017. [ citações Google Scholar | busca Google ] |
| 11. | DIAS, FABIO C.S. ; CAMPÊLO, MANOEL ; SOUZA, CRÍSTON ; Andrade, Rafael. Min-Degree Constrained Minimum Spanning Tree Problem with Fixed Centrals and Terminals: complexity, properties and formulations. Computers & Operations Research. v. 84, p. 46-61, issn: 0305-0548, 2017. [ citações Google Scholar | busca Google ] |
| 12. | KANTÉ, M. ; SAMPAIO, R. M. ; SANTOS, V. F. ; SZWARCFITER, JAYME L.. On the geodetic rank of a graph. JOURNAL OF COMBINATORICS. v. 8, p. 323-340, issn: 2156-3527, 2017. [ citações Google Scholar | busca Google ] |
| 13. | KNOX, F. ; MAZA, S. G. H. L. ; MOHAR, B. ; LINHARES SALES, C.. Proper Orientations of Planar Bipartite Graphs. GRAPHS AND COMBINATORICS. v. 33, p. 1189-1194, issn: 0911-0119, 2017. [ citações Google Scholar | busca Google ] |
| 14. | Linhares Sales, Cláudia ; SAMPAIO, LEONARDO ; Silva, Ana. On the b-Continuity of the Lexicographic Product of Graphs. GRAPHS AND COMBINATORICS. v. 33, p. 1165-1180, issn: 0911-0119, 2017. [ citações Google Scholar | busca Google ] |
| 15. | Maia, A. K.; MOHAR, B. ; HAVET, FRÉDÉRIC. Finding a subdivision of a prescribed digraph of order 4. JOURNAL OF GRAPH THEORY. v. 87, p. 536-560, issn: 0364-9024, 2017. [ citações Google Scholar | busca Google ] |
| 16. | MARCILON, THIAGO ; Sampaio, Rudini. The maximum time of 2-neighbor bootstrap percolation: Complexity results. THEORETICAL COMPUTER SCIENCE. v. 708, p. 1-17, issn: 0304-3975, 2017. [ citações Google Scholar | busca Google ] |
| 17. | MARCILON, THIAGO ; Sampaio, Rudini. The P3 infection time is W[1]-hard parameterized by the treewidth. INFORMATION PROCESSING LETTERS. v. 132, p. 55-61, issn: 0020-0190, 2017. [ citações Google Scholar | busca Google ] |
| 18. | MARTINS, NICOLAS ; Sampaio, Rudini. Locally identifying coloring of graphs with few P4s. THEORETICAL COMPUTER SCIENCE. v. 707, p. 69-76, issn: 0304-3975, 2017. [ citações Google Scholar | busca Google ] |
| 19. | SALES, CLÁUDIA LINHARES; Silva, Ana. The b-Continuity of Graphs with Large Girth. GRAPHS AND COMBINATORICS. v. 33, p. 1139-1146, issn: 0911-0119, 2017. [ citações Google Scholar | busca Google ] |
2016
| 1. | ADASME, PABLO ; Andrade, Rafael ; LEUNG, JANNY ; Lisser, Abdel. Models for minimum cost dominating trees. ELECTRONIC NOTES IN DISCRETE MATHEMATICS. v. 52, p. 101-107, issn: 1571-0653, 2016. [ citações Google Scholar | busca Google ] |
| 2. | ARAUJO, J. ; MOREL, G. ; SAMPAIO, L. ; SOARES, R. ; WEBER, V.. Hull number:. Discrete Applied Mathematics. v. 210, p. 171-175, issn: 0166-218X, 2016. [ citações Google Scholar | busca Google ] |
| 3. | Araujo, J.; GIROIRE, F. ; MOULIERAC, J. ; LIU, Y. ; MODRZEJEWSKI, R.. Energy Efficient Content Distribution. COMPUTER JOURNAL. v. 59, p. 192-207, issn: 0010-4620, 2016. [ citações Google Scholar | busca Google ] |
| 4. | ARAUJO, JULIO ; Havet, Frédéric ; LINHARES SALES, CLAUDIA ; Silva, Ana. Proper orientation of cacti. Theoretical Computer Science. v. 639, p. 14-25, issn: 0304-3975, 2016. [ citações Google Scholar | busca Google ] |
| 5. | ARAÚJO, J.; CEZAR, A. A. ; SILVA, A. S.. On the Existence of Tree Backbones that Realize the Chromatic Number on a Backbone Coloring. JOURNAL OF GRAPH THEORY. p. 808-813, issn: 0364-9024, 2016. [ citações Google Scholar | busca Google ] |
| 6. | BENEVIDES, FABRÍCIO ; Campos, Victor ; DOURADO, MITRE C. ; SAMPAIO, RUDINI M. ; Silva, Ana. The maximum infection time in the geodesic and monophonic convexities. THEORETICAL COMPUTER SCIENCE. v. 609, p. 287-295, issn: 0304-3975, 2016. [ citações Google Scholar | busca Google ] |
| 7. | CAMPÊLO, MANOEL ; Campos, Victor A. ; CORRÊA, RICARDO C. ; DELLE DONNE, DIEGO ; MARENCO, JAVIER ; MYDLARZ, MARCELO. A polyhedral study of the maximum stable set problem with weights on vertex-subsets. DISCRETE APPLIED MATHEMATICS. v. 210, p. 223-234, issn: 0166-218X, 2016. [ citações Google Scholar | busca Google ] |
| 8. | Campêlo, 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, p. 303-330, issn: 0025-5610, 2016. [ citações Google Scholar | busca Google ] |
| 9. | Campêlo, Manoel; MOURA, PHABLO F.S. ; SANTOS, MARCIO C.. Lifted, projected and subgraph-induced inequalities for the representatives. Discrete Optimization. v. 21, p. 131-156, issn: 1572-5286, 2016. [ citações Google Scholar | busca Google ] |
| 10. | CASTRO DE ANDRADE, RAFAEL. New formulations for the elementary shortest-path problem visiting a given set of nodes. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH. v. 254, p. 755-768, issn: 0377-2217, 2016. [ citações Google Scholar | busca Google ] |
| 11. | CERIOLI, MÁRCIA R. ; MARTINS, NICOLAS A. ; POSNER, DANIEL F.D. ; Sampaio, Rudini. L ( 2 , 1 ) -labelling of graphs with few. Discrete Optimization. v. 20, p. 1-10, issn: 1572-5286, 2016. [ citações Google Scholar | busca Google ] |
| 12. | de Carvalho Junior, Francisco Heron; REZENDE, CENEZ ARAÚJO. Performance evaluation of virtual execution environments for intensive computing on usual representations of multidimensional arrays. Science of Computer Programming (Print). v. 132, p. 29-49, issn: 0167-6423, 2016. [ citações Google Scholar | busca Google ] |
| 13. | de Carvalho Junior, Francisco Heron; REZENDE, CENEZ ARAÚJO ; DE CARVALHO SILVA, JEFFERSON ; GUIMARÃES AL-ALAM, WAGNER ; UCHOA DE ALENCAR, JOÃO MARCELO. Contextual abstraction in a type system for component-based high performance computing platforms. Science of Computer Programming (Print). v. 132, p. 96-128, issn: 0167-6423, 2016. [ citações Google Scholar | busca Google ] |
| 14. | DOURADO, MITRE C. ; Sampaio, Rudini M.. Complexity aspects of the triangle path convexity. Discrete Applied Mathematics. p. 39-47, issn: 0166-218X, 2016. [ citações Google Scholar | busca Google ] |
| 15. | NISSE, NICOLAS ; PARDO SOARES, RONAN. On the monotonicity of process number. Discrete Applied Mathematics. v. 210, p. 103-111, issn: 0166-218X, 2016. [ citações Google Scholar | busca Google ] |
2015
| 1. | ADASME, PABLO ; Andrade, Rafael ; LETOURNEL, MARC ; Lisser, Abdel. Stochastic maximum weight forest problem. Networks (New York, N.Y. Print). v. 65, p. n/a-n/a, issn: 0028-3045, 2015. [ citações Google Scholar | busca Google ] |
| 2. | ARAÚJO, J.; MOREL, G. ; SAMPAIO, L. ; SOARES, R. ; WEBER, V.. Hull number:. Discrete Applied Mathematics. p. 171-175, issn: 0166-218X, 2015. [ citações Google Scholar | busca Google ] |
| 3. | BANG-JENSEN, JØRGEN ; HAVET, FRÉDÉRIC ; Karolinna Maia, A.. Finding a subdivision of a digraph. THEORETICAL COMPUTER SCIENCE. v. 562, p. 283-303, issn: 0304-3975, 2015. [ citações Google Scholar | busca Google ] |
| 4. | Benevides, Fabricio; CAMPOS, VICTOR ; DOURADO, MITRE C. ; SILVA, ANA. Complexity of determining the maximum infection time in the geodetic convexity. ELECTRONIC NOTES IN DISCRETE MATHEMATICS. v. 50, p. 403-408, issn: 1571-0653, 2015. [ citações Google Scholar | busca Google ] |
| 5. | Benevides, Fabricio; PRZYKUCKI, MICHA’. Maximum Percolation Time in Two-Dimensional Bootstrap Percolation. SIAM Journal on Discrete Mathematics (Print). v. 29, p. 224-251, issn: 0895-4801, 2015. [ citações Google Scholar | busca Google ] |
| 6. | BENEVIDES, FABRÍCIO ; Campos, Victor ; DOURADO, MITRE C. ; SAMPAIO, RUDINI M. ; Silva, Ana. The maximum time of 2-neighbour bootstrap percolation: Algorithmic aspects. European Journal of Combinatorics (Print). v. 2015, p. 88-99, issn: 0195-6698, 2015. [ citações Google Scholar | busca Google ] |
| 7. | BENEVIDES, FABRÍCIO ; Campos, Victor ; DOURADO, MITRE C. ; SAMPAIO, RUDINI M. ; Silva, Ana. The maximum infection time in the geodesic and monophonic convexities. THEORETICAL COMPUTER SCIENCE. v. 609, p. 287-295, issn: 0304-3975, 2015. [ citações Google Scholar | busca Google ] |
| 8. | CAMPOS, V. ; LIMA, C. ; SILVA, A.. Graphs of girth at least 7 have high b-chromatic number. EUROPEAN JOURNAL OF COMBINATORICS. v. 48, p. 154-164, issn: 0195-6698, 2015. [ citações Google Scholar | busca Google ] |
| 9. | CAMPOS, VICTOR ; Sampaio, Rudini M. ; SILVA, ANA ; SZWARCFITER, JAYME L.. Graphs with few. DISCRETE APPLIED MATHEMATICS. v. 192, p. 28-39, issn: 0166-218X, 2015. [ citações Google Scholar | busca Google ] |
| 10. | Campos, Victor A.; LIMA, CARLOS V. ; MARTINS, NICOLAS A. ; SAMPAIO, LEONARDO ; SANTOS, MARCIO C. ; Silva, Ana. The b-chromatic index of graphs. Discrete Mathematics. v. 338, p. 2072-2079, issn: 0012-365X, 2015. [ citações Google Scholar | busca Google ] |
| 11. | CAMPÊLO, MANOEL ; HUIBAN, CRISTIANA ; RODRIGUES, CARLOS DIEGO ; Sampaio, Rudini M.. On the complexity of the flow coloring problem. Discrete Applied Mathematics. v. 197, p. 75-92, issn: 0166-218X, 2015. [ citações Google Scholar | busca Google ] |
| 12. | Campêlo, Manoel; CORRÊA, RICARDO ; LINHARES SALES, CLAUDIA ; SAMPAIO, RUDINI. Preface – VIII Latin-american Algorithms, Graphs and Optimization Symposium. ELECTRONIC NOTES IN DISCRETE MATHEMATICS. v. 50, p. 1-2, issn: 1571-0653, 2015. [ citações Google Scholar | busca Google ] |
| 13. | COELHO, ERIKA M.M. ; DOURADO, MITRE C. ; Sampaio, Rudini M.. Inapproximability results for graph convexity parameters. Theoretical Computer Science. v. 600, p. 49-58, issn: 0304-3975, 2015. [ citações Google Scholar | busca Google ] |
| 14. | COSTA, EURINARDO R. ; DOURADO, MITRE C. ; Sampaio, Rudini M.. Inapproximability results related to monophonic convexity. DISCRETE APPLIED MATHEMATICS. v. 197, p. 70-74, issn: 0166-218X, 2015. [ citações Google Scholar | busca Google ] |
| 15. | HAVET, FRÉDÉRIC ; MAIA, A. KAROLINNA ; YU, MIN-LI. Complexity of greedy edge-colouring. Journal of the Brazilian Computer Society (Impresso). v. 21, p. 18-24, issn: 0104-6500, 2015. [ citações Google Scholar | busca Google ] |
2014
| 1. | Araujo, J.; NISSE, N. ; PERENNES, S.. Weighted Coloring in Trees. SIAM Journal on Discrete Mathematics (Print). v. 28, p. 2029-2041, issn: 0895-4801, 2014. [ citações Google Scholar | busca Google ] |
| 2. | Araujo, Julio; Cohen, Nathann ; DE REZENDE, SUSANNA F. ; Havet, Frédéric ; MOURA, PHABLO F.S.. On the proper orientation number of bipartite graphs. Theoretical Computer Science. v. 566, p. 59-75, issn: 0304-3975, 2014. [ citações Google Scholar | busca Google ] |
| 3. | CAMPOS, VICTOR ; LINHARES-SALES, CLÁUDIA ; Sampaio, Rudini ; MAIA, ANA KAROLINNA. Maximization coloring problems on graphs with few P4’s. Discrete Applied Mathematics. v. 164, p. 539-546, issn: 0166-218X, 2014. [ citações Google Scholar | busca Google ] |
| 4. | Campos, Victor ; KLEIN, SULAMITA ; SAMPAIO, RUDINI ; Silva, Ana. Fixed-parameter algorithms for the cocoloring problem. Discrete Applied Mathematics. v. 167, p. 52-60, issn: 0166-218X, 2014. [ citações Google Scholar | busca Google ] |
| 5. | Campos, Victor ; SAMPAIO, RUDINI M. ; Silva, Ana ; SZWARCFITER, JAYME L.. Graphs with few ?s under the convexity of paths of order three. Discrete Applied Mathematics. v. 192, p. 28-39, issn: 0166-218X, 2014. [ citações Google Scholar | busca Google ] |
| 6. | CAMPÊLO, MANOEL ; HUIBAN, CRISTIANA ; Sampaio, Rudini M. ; WAKABAYASHI, YOSHIKO. Hardness and inapproximability of convex recoloring problems. Theoretical Computer Science. v. 533, p. 15-25, issn: 0304-3975, 2014. [ citações Google Scholar | busca Google ] |
| 7. | DETIENNE, B. ; QUADRI, D. ; RODRIGUES, C. D.. Two phase solution for an intelligent moving target search problem based on a 0-1 linear model. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH. v. 52, p. 7177-7192, issn: 0020-7543, 2014. [ citações Google Scholar | busca Google ] |
| 8. | GIROIRE, F. ; LAMPROU, I. ; MAZAURIC, D. ; NISSE, N. ; PÉRENNES, S. ; SOARES, R.. Connected surveillance game. Theoretical Computer Science. v. 584, p. 131-143, issn: 0304-3975, 2014. [ citações Google Scholar | busca Google ] |
| 9. | LINHARES-SALES, CLÁUDIA ; MAIA, ANA KAROLINNA ; MARTINS, NICOLAS ; Sampaio, Rudini M.. Restricted coloring problems on Graphs with few P 4-s. Annals of Operation Research. v. 217, p. 385-397, issn: 0254-5330, 2014. [ citações Google Scholar | busca Google ] |
2013
| 1. | ADARRIO-BERRY, L. ; HAVET, F. ; LINHARES SALES, C. ; REED, B. A. ; THOMASSE, S.. Oriented trees in digraphs. Discrete Mathematics. v. 313, p. 967-974, issn: 0012-365X, 2013. [ citações Google Scholar | busca Google ] |
| 2. | ADASME, PABLO ; Andrade, Rafael ; LETOURNEL, MARC ; Lisser, Abdel. A polynomial formulation for the stochastic maximum weight forest problem. ELECTRONIC NOTES IN DISCRETE MATHEMATICS. v. 41, p. 29-36, issn: 1571-0653, 2013. [ citações Google Scholar | busca Google ] |
| 3. | ARAUJO, J. ; CAMPOS, V. ; GIROIRE, F. ; NISSE, N. ; SAMPAIO, L. ; SOARES, R.. On the hull number of some graph classes. Theoretical Computer Science. v. 475, p. 1-12, issn: 0304-3975, 2013. [ citações Google Scholar | busca Google ] |
| 4. | Araujo, J. ; LINHARES SALES, C.. A Hajós-like theorem for weighted coloring. Journal of the Brazilian Computer Society (Impresso). v. 19, p. 275-278, issn: 0104-6500, 2013. [ citações Google Scholar | busca Google ] |
| 5. | Araujo, Julio; Bermond, Jean-Claude ; DUCOFFE, GUILLAUME. Eulerian and Hamiltonian Dicycles in Directed Hypergraphs. Discrete Mathematics, Algorithms and Applications. v. 06, p. 131030175824005, issn: 1793-8309, 2013. [ citações Google Scholar | busca Google ] |
| 6. | Basu, Amitabh ; Campêlo, Manoel ; Conforti, Michele ; Cornuéjols, Gérard ; Zambelli, Giácomo. Unique lifting of integer variables in minimal inequalities. Mathematical Programming. v. 141, p. 561-576, issn: 0025-5610, 2013. [ citações Google Scholar | busca Google ] |
| 7. | BENEVIDES, F. S.; PRZYKUCKI, M.. On slowly percolating sets of minimal size in bootstrap percolation. The Electronic Journal of Combinatorics. v. 20, p. 1, issn: 1077-8926, 2013. [ citações Google Scholar | busca Google ] |
| 8. | CAMPOS, V. A.; CHVATAL, V. ; DEVROYE, L. ; TASLAKIAN, P.. Transversals in Trees. Journal of Graph Theory (Print). v. 73, p. 32-43, issn: 0364-9024, 2013. [ citações Google Scholar | busca Google ] |
| 9. | Campos, Victor ; HAVET, FRÉDÉRIC ; SAMPAIO, RUDINI ; Silva, Ana. Backbone colouring: Tree backbones with small diameter in planar graphs. Theoretical Computer Science. v. 487, p. 50-64, issn: 0304-3975, 2013. [ citações Google Scholar | busca Google ] |
| 10. | CAMPOS, VICTOR ; LINHARES-SALES, CLÁUDIA ; SAMPAIO, RUDINI ; Maia, Ana Karolinna. Maximization coloring problems on graphs with few. Discrete Applied Mathematics. v. 164, p. 539-546, issn: 0166-218X, 2013. [ citações Google Scholar | busca Google ] |
| 11. | Campêlo, Manoel; CORRÊA, R. C. ; MOURA, PHABLO F.S. ; SANTOS, MARCIO C.. On optimal -fold colorings of webs and antiwebs. Discrete Applied Mathematics. v. 161, p. 60-70, issn: 0166-218X, 2013. [ citações Google Scholar | busca Google ] |
| 12. | DE ANDRADE, RAFAEL CASTRO; DE FREITAS, ADRIANO TAVARES. Disjunctive combinatorial branch in a subgradient tree algorithm for the DCMST problem with VNS-Lagrangian bounds. ELECTRONIC NOTES IN DISCRETE MATHEMATICS. v. 41, p. 5-12, issn: 1571-0653, 2013. [ citações Google Scholar | busca Google ] |
| 13. | de Carvalho-Junior, Francisco Heron; REZENDE, C. A.. A case study on expressiveness and performance of component-oriented parallel programming. Journal of Parallel and Distributed Computing (Print). v. 73, p. 557-569, issn: 0743-7315, 2013. [ citações Google Scholar | busca Google ] |
| 14. | Hoppen, Carlos ; Kohayakawa, Yoshiharu ; Moreira, Carlos Gustavo ; RÁTH, BALÁZS ; Menezes Sampaio, Rudini. Limits of permutation sequences. Journal of Combinatorial Theory. Series B (Print). v. 103, p. 93-113, issn: 0095-8956, 2013. [ citações Google Scholar | busca Google ] |
| 15. | Maffray, Frédéric ; Silva, Ana. b-colouring the Cartesian product of trees and some other graphs. Discrete Applied Mathematics. v. 161, p. 650-669, issn: 0166-218X, 2013. [ citações Google Scholar | busca Google ] |
| 16. | NISSE, NICOLAS ; SOARES, RONAN PARDO. On the Monotonicity of Process Number. Electronic Notes in Discrete Mathematics. v. 44, p. 141-147, issn: 1571-0653, 2013. [ citações Google Scholar | busca Google ] |
| 17. | PINHO, E. G. ; Carvalho-Junior, Francisco Heron de. An object-oriented parallel programming language for distributed-memory parallel computing platforms. Science of Computer Programming (Print). p. 65-90, issn: 0167-6423, 2013. [ citações Google Scholar | busca Google ] |
2012
| 1. | Andrade, Rafael; Lisser, Abdel ; Maculan, Nelson. Multi-service multi-facility network design under uncertainty. Annals of Operations Research (Dordrecht. Online). v. 199, p. 157-178, issn: 1572-9338, 2012. [ citações Google Scholar | busca Google ] |
| 2. | Araujo, J.; Bermond, J-C. ; GIROIRE, F. ; HAVET, F. ; MAZAURIC, D. ; MODRZEJEWSKI, R.. Weighted improper colouring. Journal of Discrete Algorithms (Print). v. 16, p. 53-66, issn: 1570-8667, 2012. [ citações Google Scholar | busca Google ] |
| 3. | Araujo, J.; COHEN, N. ; GIROIRE, F. ; HAVET, F.. Good edge-labelling of graphs. Discrete Applied Mathematics. v. 160, p. 2502-2513, issn: 0166-218X, 2012. [ citações Google Scholar | busca Google ] |
| 4. | Araujo, J. ; ARAÚJO, J. ; LINHARES SALES, C.. On the Grundy number of graphs with few ¿s. Discrete Applied Mathematics. v. 160, p. 2514-2522, issn: 0166-218X, 2012. [ citações Google Scholar | busca Google ] |
| 5. | BENEVIDES, FABR’CIO SIQUEIRA. A multipartite Ramsey number for odd cycles. JOURNAL OF GRAPH THEORY. v. 71, p. 293-316, issn: 0364-9024, 2012. [ citações Google Scholar | busca Google ] |
| 6. | Benevides, Fabricio; Luczak, Tomasz ; SCOTT, A. ; Skokan, Jozef ; White, Mathew. Monochromatic Cycles in 2-Coloured Graphs. Combinatorics, Probability & Computing (Print). v. 21, p. 57-87, issn: 0963-5483, 2012. [ citações Google Scholar | busca Google ] |
| 7. | BRAVO, R. ; KLEIN, S. ; NOGUEIRA, L. ; PROTTI, F. ; SAMPAIO, R. M.. Partitioning extended -laden graphs into cliques and stable sets. Information Processing Letters (Print). v. 112, p. 829-834, issn: 0020-0190, 2012. [ citações Google Scholar | busca Google ] |
| 8. | CAMPOS, V. A. ; GYÁRFÁS, A. ; HAVET, F. ; LINHARES SALES, C. ; MAFFRAY, F.. New Bounds on the Grundy Number of Products of Graphs. Journal of Graph Theory (Print). v. 71, p. 78-88, issn: 0364-9024, 2012. [ citações Google Scholar | busca Google ] |
| 9. | Campos, Victor ; Farias, Victor A. E. ; Silva, Ana. b-Coloring graphs with large girth. Journal of the Brazilian Computer Society (Impresso). v. 18, p. 2012-375-378, issn: 0104-6500, 2012. [ citações Google Scholar | busca Google ] |
| 10. | Dantas, Simone ; Maffray, Frédéric ; Silva, Ana. -partition of some classes of graphs. Discrete Applied Mathematics. v. 160, p. 2662-2668, issn: 0166-218X, 2012. [ citações Google Scholar | busca Google ] |
| 11. | HAVET, F. ; LINHARES SALES, C. ; SAMPAIO, L.. b-coloring of tight graphs. Discrete Applied Mathematics. v. 160, p. 2709-2715, issn: 0166-218X, 2012. [ citações Google Scholar | busca Google ] |
| 12. | Hoppen, Carlos ; Kohayakawa, Yoshiharu ; Sampaio, Rudini M.. A note on permutation regularity. Discrete Applied Mathematics. v. 160, p. 2716-2727, issn: 0166-218X, 2012. [ citações Google Scholar | busca Google ] |
| 13. | Maffray, Frédéric ; Silva, Ana. -colouring outerplanar graphs with large girth. Discrete Mathematics. v. 312, p. 1796-1803, issn: 0012-365X, 2012. [ citações Google Scholar | busca Google ] |
| 14. | RIVANO, H. ; LINHARES SALES, C. ; HUC, F.. The Proportional Coloring Problem: Optimizing Buffers in Radio Mesh Networks. Discrete Mathematics, Algorithms and Applications. v. 04, p. 1250028, issn: 1793-8309, 2012. [ citações Google Scholar | busca Google ] |
| 15. | RODRIGUES, C. D.; QUADRI, D. ; MICHELON, P. ; GUEYE, S.. 0-1 Quadratic Knapsack Problems: An Exact Approach Based on a $t$-Linearization. SIAM Journal on Optimization. v. 22, p. 1449-1468, issn: 1095-7189, 2012. [ citações Google Scholar | busca Google ] |
2011
| 1. | ARAUJO, J. ; CAMPOS, V. ; SOARES, R. ; SAMPAIO, L. ; GIROIRE, F.. On the hull number of some graph classes. Electronic Notes in Discrete Mathematics. v. 38, p. 49-55, issn: 1571-0653, 2011. [ citações Google Scholar | busca Google ] |
| 2. | Hoppen, Carlos ; Kohayakawa, Yoshiharu ; Moreira, Carlos Gustavo ; SAMPAIO, R. M.. Testing permutation properties through subpermutations. Theoretical Computer Science. v. 412, p. 3555-3567, issn: 0304-3975, 2011. [ citações Google Scholar | busca Google ] |
| 3. | LINHARES SALES, C.; SAMPAIO, R. M.. Even Pairs in Planar Berge Graphs. Matemática Contemporânea. v. 39, p. 135-160, issn: 0103-9059, 2011. [ citações Google Scholar | busca Google ] |
| 4. | SALES, C. L. ; SAMPAIO, R. M.. Even pairs in planar Berge graphs (mc.sbm.org.br/docs/mc/pdf/39/a16.pdf). MATEMATICA CONTEMPORANEA. v. 39, p. 135-160, issn: 0103-9059, 2011. [ citações Google Scholar | busca Google ] |
2010
| 1. | Asté, Marie ; Havet, Frédéric ; Linhares-Sales, Claudia ; LINHARES SALES, C.. Grundy number and products of graphs. Discrete Mathematics. v. 310, p. 1482-1490, issn: 0012-365X, 2010. [ citações Google Scholar | busca Google ] |
| 2. | BERMOND, JEAN-CLAUDE ; Havet, Frédéric ; HUC, FLORIAN ; Sales, Cláudia Linhares ; LINHARES SALES, C.. IMPROPER COLORING OF WEIGHTED GRID AND HEXAGONAL GRAPHS. Discrete Mathematics, Algorithms and Applications. v. 02, p. 395-411, issn: 1793-8309, 2010. [ citações Google Scholar | busca Google ] |
| 3. | Carvalho, Francisco H.; LINS, Rafael Dueire. Compositional Specification of Parallel Components Using Circus. Electronic Notes in Theoretical Computer Science. v. 260, p. 47-72, issn: 1571-0661, 2010. [ citações Google Scholar | busca Google ] |
| 4. | SILVA, A. S.; da Silva, Aline Alves ; Sales, Cláudia Linhares. A bound on the treewidth of planar even-hole-free graphs?. Discrete Applied Mathematics. v. 158, p. 1229-1239, issn: 0166-218X, 2010. [ citações Google Scholar | busca Google ] |
2009
| 1. | BENEVIDES, F. S.; Lemons, Nathan ; Palmer, Cory ; Riet, Ago-Erik ; Wheeler, Jeffrey Paul. Additive properties of a pair of sequences. Acta Arithmetica. v. 139, p. 185-197, issn: 0065-1036, 2009. [ citações Google Scholar | busca Google ] |
| 2. | Benevides, Fabricio Siqueira; Skokan, Jozef. The 3-colored Ramsey number of even cycles. Journal of Combinatorial Theory. Series B (Print). v. 99, p. 690-708, issn: 0095-8956, 2009. [ citações Google Scholar | busca Google ] |
| 3. | CAMPELO NETO, M. B. ; CAMPOS, V. A. ; CORREA, R. C.. Um algoritmo de planos-de-corte para o número cromático fracionário de um grafo. Pesquisa Operacional (Impresso). v. 29, p. 179-193, issn: 0101-7438, 2009. [ citações Google Scholar | busca Google ] |
| 4. | Campos, Victor ; Linhares Sales, Cláudia ; Maffray, Frédéric ; Silva, Ana. b-chromatic number of cacti. ELECTRONIC NOTES IN DISCRETE MATHEMATICS. v. 35, p. 281-286, issn: 1571-0653, 2009. [ citações Google Scholar | busca Google ] |
| 5. | Campêlo, Manoel; Cornuéjols, Gérard. Stable sets, corner polyhedra and the Chvátal closure. OPERATIONS RESEARCH LETTERS. v. 37, p. 375-378, issn: 0167-6377, 2009. [ citações Google Scholar | busca Google ] |
| 6. | Cordovil, Raul ; Lemos, Manoel ; LINHARES SALES, C. ; Sales, Cláudia Linhares. Dirac¿s Theorem on Simplicial Matroids. Annals of Combinatorics (Print). v. 13, p. 53-63, issn: 0218-0006, 2009. [ citações Google Scholar | busca Google ] |
| 7. | Hoàng, Chính T. ; Sales, Cláudia Linhares ; LINHARES SALES, C. ; Maffray, Frédéric. On minimally b-imperfect graphs. Discrete Applied Mathematics. v. 157, p. 3519-3530, issn: 0166-218X, 2009. [ citações Google Scholar | busca Google ] |
2008
| 1. | CAMPELO NETO, M. B. ; CAMPOS, V. A. ; CORREA, R. C.. On the asymmetric representatives formulation for the vertex coloring problem. Discrete Applied Mathematics. v. 156, p. 1097-1111, issn: 0166-218X, 2008. [ citações Google Scholar | busca Google ] |
| 2. | Carvalho, Francisco H.; LINS, Rafael Dueire. An Institutional Theory for #-Components. Electronic Notes in Theoretical Computer Science. v. 195, p. 113-132, issn: 1571-0661, 2008. [ citações Google Scholar | busca Google ] |
| 3. | LINHARES SALES, C.; MAFFRAY, F. ; REED, B. A.. On Planar Strict Quasi Parity Graphs. SIAM Journal on Discrete Mathematics. v. 22, p. 329-347, issn: 0895-4801, 2008. [ citações Google Scholar | busca Google ] |
| 4. | MATTOS, G. O. ; FORMIGA, A. A. ; LINS, Rafael Dueire ; Carvalho, Francisco H. ; MARTINS, F. M. J.. Comparative Aspects between the Cluster and Grid Implementations of BigBatch. Journal of Universal Computer Science. v. 14, p. 3031-3050, issn: 0948-695X, 2008. [ citações Google Scholar | busca Google ] |
2007
| 1. | Carvalho, Francisco H.; LINS, Rafael Dueire ; CORRÊA, Ricardo Cordeiro ; ARAÚJO, Gisele Azevedo. Towards an Architecture for Component-Oriented Parallel Programming. Concurrency and Computation. Practice & Experience. v. 19, p. 697-719, issn: 1532-0626, 2007. [ citações Google Scholar | busca Google ] |
| 2. | LINS, Rafael Dueire ; Carvalho, Francisco H. ; LINS, Z. D.. Cyclic Reference Counting with Permanent Objects. Journal of Universal Computer Science (Print). v. 13, p. 830-838, issn: 0948-695X, 2007. [ citações Google Scholar | busca Google ] |
2006
| 1. | ANDRADE, Rafael Castro de; LISSER, Abdel ; MACULAN, N. ; PLATEAU, G.. Enhancing a branch and bound algorithm for two-stage stochastic integer network design based models. Management Science. v. 52, n. 9, p. 1450-1455, issn: 0025-1909, 2006. [ citações Google Scholar | busca Google ] |
| 2. | ANDRADE, Rafael Castro de; LUCENA, A ; MACULAN, N.. Using lagrangean dual information to generate degree constrained minimum spanning trees. Discrete Applied Mathematics. v. 154, n. 5, p. 703-717, issn: 0166-218X, 2006. [ citações Google Scholar | busca Google ] |
| 3. | Carvalho, Francisco H.; LINS, Rafael Dueire. A Categorical Characterization for the Compositional Features of the # Component Model. Software Engineering Notes. v. 31, n. 2, p. 12, issn: 0163-5948, 2006. [ citações Google Scholar | busca Google ] |
2005
| 1. | ANDRADE, Rafael Castro de; LISSER, Abdel ; PLATEAU, G. ; MACULAN, N.. B. Annals of Operations Research. v. 140, n. 1, p. 49-65, issn: 0254-5330, 2005. [ citações Google Scholar | busca Google ] |
| 2. | CAMPÊLO, M.; Scheimberg, S.. A simplex approach for finding local solutions of a linear bilevel program by equilibrium points. Annals of Operation Research. v. 138, p. 143-157, issn: 0254-5330, 2005. [ citações Google Scholar | busca Google ] |
| 3. | CAMPÊLO, M.; Scheimberg, S.. A study of local solutions in linear bilevel programming. Journal of Optimization Theory and Applications. v. 125, n. 1, p. 63-84, issn: 0022-3239, 2005. [ citações Google Scholar | busca Google ] |
| 4. | Carvalho, Francisco H.; LINS, Rafael Dueire. Separation of Concerns for Improving Practice of Parallel Programming. Information (Yamaguchi). v. 8, n. 5, p. 621-638, issn: 1343-4500, 2005. [ citações Google Scholar | busca Google ] |
2004
| 1. | ANDRADE, Rafael Castro de; LISSER, Abdel ; MACULAN, N. ; PLATEAU, G.. Telecommunications Network Capacity Design for Uncertain Demand. Computational Optimization and Applications. v. 29, n. 2, p. 127-146, issn: 0926-6003, 2004. [ citações Google Scholar | busca Google ] |
| 2. | BORNSTEIN, C. T. ; CAMPÊLO, M.. An ADD/DROP Procedure for the Capacitated Plant Location Problem. PESQUISA OPERACIONAL (IMPRESSO). v. 24, n. 1, p. 151-162, issn: 0101-7438, 2004. [ citações Google Scholar | busca Google ] |
| 3. | CAMPÊLO, M.; CORRÊA, R. C. ; FROTA, Y. A.. Cliques, Holes and the Vertex Coloring Polytope. Information Processing Letters (Print). v. 89, n. 4, p. 159-164, issn: 0020-0190, 2004. [ citações Google Scholar | busca Google ] |
| 4. | LINHARES SALES, C.; MAFFRAY, F.. On Dart-free Perfectly Contractile Graphs. Theoretical Computer Science. v. 321, p. 171-194, issn: 0304-3975, 2004. [ citações Google Scholar | busca Google ] |
| 5. | SABÓIA, C. H. M. ; CAMPÊLO, M. ; Scheimberg, S.. A computational study of global algorithms for linear bilevel programming. Numerical Algorithms. v. 35, n. 2–4, p. 155-173, issn: 1017-1398, 2004. [ citações Google Scholar | busca Google ] |
2003
| 1. | Carvalho, Francisco H.; LINS, Rafael Dueire. Haskell#: Parallel Programming Made Simple and Efficient. Journal of Universal Computer Science. v. 9, n. 8, p. 776-794, issn: 0948-695X, 2003. [ citações Google Scholar | busca Google ] |
| 2. | LINHARES SALES, C.; MAFFRAY, F.. Even Pairs in Square-free Berge Graphs. Matemática Contemporânea. v. 25, p. 161-176, issn: 0103-9059, 2003. [ citações Google Scholar | busca Google ] |
2001
| 1. | LINHARES SALES, C.; GRAVIER, S. ; FIGUEIREDO, C. M. H.. On Tucker’s proof of the strong perfect graph conjecture for (K4-e)-free graphs. Discrete Mathematics. v. 232, n. 1-3, p. 105-108, issn: 0012-365X, 2001. [ citações Google Scholar | busca Google ] |
| 2. | LINHARES SALES, C.; REED, B. A. ; MAFFRAY, F.. Recognizing Planar Strict Quasi-Parity Graphs. Graphs and Combinatorics. v. 17, n. 4, p. 745-757, issn: 0911-0119, 2001. [ citações Google Scholar | busca Google ] |
2000
| 1. | CAMPÊLO, M.; DANTAS, S. ; Scheimberg, S.. A note on a penalty function approach for solving bilevel linear programs. Journal of Global Optimization. v. 16, n. 3, p. 245-255, issn: 0925-5001, 2000. [ citações Google Scholar | busca Google ] |
| 2. | CAMPÊLO, M.; Scheimberg, S.. A note on a modified simplex approach for solving bilevel linear programming problems. European Journal of Operational Research. v. 126, n. 2, p. 454-458, issn: 0377-2217, 2000. [ citações Google Scholar | busca Google ] |
| 3. | Carvalho, Francisco H.; MOURA, H. P. ; LINS, Rafael Dueire ; LIMA, Ricardo Massa Ferreira. An Action Semantics for STG. Brics Notes Series. v. 00, p. 98-117, issn: 0909-3206, 2000. [ citações Google Scholar | busca Google ] |
1998
| 1. | CAMPÊLO, M.; KLEIN, S.. Maximum Vertex-Weighted Matching in Strongly Chordal Graphs. Discrete Applied Mathematics. v. 84, p. 71-77, issn: 0166-218X, 1998. [ citações Google Scholar | busca Google ] |
| 2. | LINHARES SALES, C.; MAFFRAY, F.. Even Pairs In Claw-Free Perfect Graphs. Journal of Combinatorial Theory. Series B. v. 74, p. 169-191, issn: 0095-8956, 1998. [ citações Google Scholar | busca Google ] |
1997
| 1. | EVERETT, H. ; FIGUEIREDO, C. M. H. ; LINHARES SALES, C. ; MAFFRAY, F. ; PORTO, O. ; REED, B. A.. Path Parity And Perfection. Discrete Mathematics. v. 165, p. 233-252, issn: 0012-365X, 1997. [ citações Google Scholar | busca Google ] |
| 2. | LINHARES SALES, C.; MAFFRAY, F. ; REED, B. A.. On Planar Perfectly Contractile Graphs. Graphs and Combinatorics. v. 13, p. 167-187, issn: 0911-0119, 1997. [ citações Google Scholar | busca Google ] |
