Rafael C. S. Schouery

Associate Professor

Director of the Brazilian ICPC Summer School

Associate Coordinator of the Bachelor’s Degree Program in Computer Science

Institute of Computing - University of Campinas (Unicamp)
Av. Albert Einstein, 1251, Room 01 13083-852, Campinas-SP, Brazil
rafael@ic.unicamp.br

Research Interests

Teaching (Present and Past)

Students

Current PhD Students

Current Masters Students

Current Undergraduate Students

Previous PhD Students

  1. Welverton Rodrigues da Silva
  2. Yulle Glebbyo Felipe Borges

Previous Masters Students

  1. Jorge Menezes dos Santos
  2. João Paulo Francisco da Silva
  3. Rachel Vanucchi Saraiva
  4. Leonardo Yvens Schwarzstein
  5. Welverton Rodrigues da Silva
  6. Italos Estilon da Silva de Souza
  7. Mauro Roberto Costa da Silva
  8. Francisco Jhonatas Melo da Silva - co-supervisor
  9. Celso Aimbiré Weffort Santos - co-supervisor
  10. Edson Ariel Ticona Zegarra
  11. Lucas Prado Melo - co-supervisor
  12. Yulle Glebbyo Felipe Borges - co-supervisor
  13. Renata Ghisloti Duarte de Souza Granha - co-supervisor

Previous Undergraduate Students

  1. Renan Fernando Franco da Silva (Undergrad Research)
  2. Bernardo Panka Archegas (Undergrad Research)
  3. Érico Iago Maldonado Faustino (Projeto Final de Graduação)
  4. Ieremies Vieira Da Fonseca Romero (Undergrad Research)
  5. Luiz Eduardo Targa Chaves Cartolano (Estudo Dirigido)
  6. Rachel Vanucchi Saraiva (Undergrad Research)
  7. Sinara Caonetto Pamplona (Undergrad Research)
  8. Iago A. Neves (Projeto Final de Graduação)
  9. Fabio Yudi Murakami (Projeto Final de Graduação)

Publications

Submitted Papers available online

  1. Rachel Vanucchi Saraiva, Rafael C. S. Schouery. Approximation algorithms for the square min-sum bin packing problem.

  2. Renan F. F. da Silva, Rafael C. S. Schouery. A Branch-and-Cut-and-Price Algorithm for Cutting Stock and Related Problems.

Books

  1. Rafael C. S. Schouery, Orlando Lee, Flávio K. Miyazawa, and Eduardo C. Xavier. Tópicos da teoria dos jogos em computação. 30º Colóquio Brasileiro de Matemática - Instituto de Matemática Pura e Aplicada. Editora do IMPA, 2015. ISBN: 978-85-244-0412-2

Papers in International Journals

  1. Yulle G. F. Borges, Vinícius L. de Lima, Flávio K. Miyazawa, Lehilton L. C. Pedrosa, Thiago A. de Queiroz, Rafael C. S. Schouery. Algorithms for the Bin Packing Problem with Scenarios. Journal of Combinatorial Optimization, 48, 34, 2024. arXiv

  2. Renan F. F. da Silva, Yulle G. F. Borges, Rafael C. S. Schouery. Fast Neighborhood Search Heuristics for the Colorful Bin Packing Problem. Annals of Operations Research, 2024. arXiv

  3. Welverton R. Silva, Fábio L. Usberti, and Rafael C. S. Schouery. On the approximability and energy-flow modeling of the electric vehicle sharing problem. Computers & Industrial Engineering, 110181:192, 2024. arXiv ssrn

  4. Mauro R. C. da Silva and Rafael C. S. Schouery. Local-Search Based Heuristics for Advertisement Scheduling. RAIRO - Operations Research, 3203–3231:58(4), 2024. arXiv.

  5. Mauro R. C. da Silva, Lehilton L. C. Pedrosa, and Rafael C. S. Schouery. Approximation algorithms for the MAXSPACE advertisement problem. Theory of Computing Systems, 68:571-590, 2024. arXiv

  6. Yulle G. F. Borges, Rafael C. S. Schouery, Flávio K. Miyazawa. Mathematical Models and Exact Algorithms for the Colored Bin Packing Problem. Computers & Operations Research, 164:106527, 2024. arXiv

  7. Francisco J. M. da Silva, Flávio K. Miyazawa, Ieremies V. F. Romero, and Rafael C. S. Schouery. Tight Bounds for the Price of Anarchy and Stability in Sequential Transportation Games. Journal of Combinatorial Optimization, 46, 10, 2023. arXiv

  8. Celso A. Weffort-Santos, Christiane N. Campos and Rafael C. S. Schouery. On Gap-Labellings of Some Families of Graphs. Discrete Applied Mathematics, 340:296-314, 2023. ssrn

  9. Celso A. Weffort-Santos and Rafael C.S. Schouery. Graphs without gap-vertex-labellings: Families and bounds. Discrete Applied Mathematics, 339:317-335, 2023. arXiv

  10. Welverton R. Silva, Fábio L. Usberti and Rafael C.S. Schouery. On the complexity and modeling of the electric vehicle sharing problem. Computers & Industrial Engineering, 119:109208, 2023. arXiv

  11. Leonardo Y. Schwarzstein and Rafael C. S. Schouery. Budget-balanced and strategy-proof auctions for ridesharing. Computers & Operations Research, 151:106094, 2023.

  12. G. L. Duarte, H. Eto, T. Hanaka, Y. Kobayashi, Y. Kobayashi, D. Lokshtanov, L. L. C. Pedrosa, R. C. S. Schouery, U. S. Souza. Computing the Largest Bond and the Maximum Connected Cut of a Graph. Algorithmica, 83:1421–1458, 2021. arXiv Version.

  13. Yulle G. F. Borges, Flávio K. Miyazawa, Rafael C.S. Schouery, and Eduardo C. Xavier. Exact algorithms for class-constrained packing problems. Computers & Industrial Engineering, 144:106455, 2020.

  14. Yulle G. F. Borges, Rafael C. S. Schouery, Flávio K. Miyazawa, Fabrizio Granelli, Nelson L. S. da Fonseca, and Lucas P. Melo. Smart Energy Pricing for Demand-Side Management in Renewable Energy Smart Grids. International Transactions in Operational Research, 27(6):2760-2784, 2020.

  15. Edson Ticona-Zegarra, Rafael C. S. Schouery, Leandro A. Villas and Flávio K. Miyazawa. Improved continuous enhancement routing solution for energy-aware data aggregation in wireless sensor networks. International Journal of Distributed Sensor Networks, volume 14, issue 5, 16 pages, 2018.

  16. Lehilton L. C. Pedrosa and Rafael C. S. Schouery. Approximation algorithms for the bus evacuation problem. Journal of Combinatorial Optimization, 36(1):131–141, 2018.

  17. Cristina G. Fernandes and Rafael C. S. Schouery. Approximation algorithms for the max-buying problem with limited supply. Algorithmica, 80(11):2973–2992, 2018.

  18. Flávio K. Miyazawa, Lehilton L. C. Pedrosa, Rafael C. S. Schouery, Renata G. D. de Souza. A PTAS for the Geometric Connected Facility Location Problem. Theory of Computing Systems, 61:871-892, 2017.

  19. Lucas P. Melo, Flávio K. Miyazawa, Lehilton L. C. Pedrosa, Rafael C. S. Schouery. Approximation algorithms for k-level stochastic facility location problems. Journal of Combinatorial Optimization, 34(1):266-278, 2017.

  20. Thiago A. de Queiroz, Pedro H. D. B. Hokama, Rafael C. S. Schouery, Flávio K. Miyazawa. Two-dimensional Disjunctively Constrained Knapsack Problem: Heuristic and Exact Approaches. Computers & Industrial Engineering, 105:313-328, 2017.

  21. Cristina G. Fernandes, Carlos E. Ferreira, Álvaro J. P. Franco, Rafael C. S. Schouery. The Envy-Free Pricing Problem, Unit-Demand Markets and Connections with the Network Pricing Problem. Discrete Optimization, 22:141-161, 2016.

  22. Flávio K. Miyazawa, Lehilton L. C. Pedrosa, Rafael C. S. Schouery, Maxim Sviridenko, Yoshiko Wakabayashi. Polynomial-Time Approximation Schemes for Circle and Other Packing Problems. Algorithmica, 76(2):536-568, 2016.

  23. Pedro Hokama, Flávio K. Miyazawa, Rafael C. S. Schouery. A bounded space algorithm for online circle packing. Information Processing Letters, 116:337-342, 2016.

  24. Cristina G. Fernandes and Rafael C. S. Schouery. Second-price ad auctions with binary bids and markets with good competition. Theoretical Computer Science, 540:103-114, 2014.

Papers in Brazilian Journals

  1. Francisco J. M. Silva, Rafael C.S. Schouery. Uma Introdução à Teoria dos Jogos Algorítmica. Pesquisa Operacional para o Desenvolvimento, 10(2):57-69, 2018.

Papers in International Conference’s Proceedings

  1. Gabriel L. Duarte, Daniel Lokshtanov, Lehilton L. C. Pedrosa, Rafael C. S. Schouery, Uéverton S. Souza. Computing the largest bond of a graph. 14th International Symposium on Parameterized and Exact Computation, volume 148 of Leibniz International Proceedings in Informatics (LIPIcs), pages 12:1-12:15, 2019.

  2. Lehilton L. C. Pedrosa, Greis Y. O. Quesquén; Rafael C. S. Schouery. An Asymptotically Optimal Approximation Algorithm for the Travelling Car Renter Problem. 19th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2019), volume 75 of OpenAccess Series in Informatics (OASIcs), pages 14:1-14:15, 2019.

  3. Edson T. Zegarra, Rafael C. S. Schouery, Flávio K. Miyazawa, Leandro A. Villas, A Continuous Enhancement Routing Solution aware of data aggregation for Wireless Sensor Networks. Proceedings of the 2016 IEEE 15th International Symposium on Network Computing and Applications, pages 93-100, 2016.

  4. Evandro C. Bracht, Tiago A. de Queiroz, Rafael C. S. Schouery and Flávio K. Miyazawa, Dynamic cargo stability in loading and transportation of containers. Proceedings of the 2016 IEEE International Conference on Automation Science and Engineering, pages 227-232, 2016.

  5. Flávio K. Miyazawa, Lehilton L. C. Pedrosa, Rafael C. S. Schouery, Maxim Sviridenko, and Yoshiko Wakabayashi. Polynomial-time approximation schemes for circle packing problems.. Proceedings of the 22nd Annual European Symposium on Algorithms, volume 8737 of Lecture Notes in Computer Science, pages 713-724, 2014.

  6. Cristina G. Fernandes and Rafael C. S. Schouery. Approximation algorithms for the max-buying problem with limited supply. In Proceedings of the 11th Latin American Theoretical Informatics Symposium, volume 8392 of Lecture Notes in Computer Science, pages 707-718, 2014.

  7. Cristina G. Fernandes, Carlos E. Ferreira, Álvaro J. P. Franco, and Rafael C. S. Schouery. The envy-free pricing problem and unit-demand markets. In Proceedings of the 3rd International Symposium on Combinatorial Optimization, volume 8596 of Lecture Notes in Computer Science, pages 230-241, 2014.

  8. Cristina G. Fernandes and Rafael C. S. Schouery. Second-price ad auctions with binary bids and markets with good competition. In Proceedings of the 2rd International Symposium on Combinatorial Optimization, volume 7422 of Lecture Notes in Computer Science, pages 439-450, 2012.

Extended Abstracts in International Conference’s Proceedings

  1. Lehilton L. C. Pedrosa, Mauro R. C. da Silva and Rafael C. S. Schouery. Positional Knapsack Problem: NP-hardness and approximation scheme (Brief Announcement). In XII Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS 2023), volume 223 of Procedia Computer Science, pages 400-402, 2023.

  2. C. A. Weffort-Santos, C. N. Campos, R. C. S. Schouery. On the Complexity of Gap-[2]-vertex-labellings of Subcubic Bipartite Graphs. In Tenth Latin and American Algorithms, Graphs and Optimization Symposium (LAGOS 2019), volume 346 of Electronic Notes in Theoretical Computer Science, pages 725-734, 2019.

  3. Mauro R.C. da Silva, Rafael C. S. Schouery, Lehilton L. C. Pedrosa. A Polynomial-time Approximation Scheme for the MAXSPACE Advertisement Problem. In Tenth Latin and American Algorithms, Graphs and Optimization Symposium (LAGOS 2019), volume 346 of Electronic Notes in Theoretical Computer Science, pages 699-710, 2019.

  4. C. A. Weffort-Santos, C. N. Campos and R. C. S. Schouery. Proper gap-labellings of unicyclic graphs. In VIII Latin American Workshop on Cliques in Graphs, volume 46 of Matemática Contemporânea, pages 165-174, 2019.

Papers in Brazilian Conference’s Proceedings

  1. Renan Franco da Silva, Yulle Glebbyo Felipe Borges, Rafael C. S. Schouery. Heurísticas para o Problema Do Empacotamento Colorido. In 54° Simpósio Brasileiro de Pesquisa Operacional (SBPO 2022), 2022. (in portuguese)

  2. Welverton Rodrigues da Silva, Rafael Crivellari Saliba Schouery, Fábio Luiz Usberti. Modelos Matemáticos para o Problema de Compartilhamento de Veículos Elétricos. In LIII Simpósio Brasileiro de Pesquisa Operacional, 2021. (in portuguese)

Extended Abstracts in Brazilian Conference’s Proceedings

  1. Rachel V. Saraiva and Rafael C. S. Schouery. PTAS para Problema do Empacotamento Soma Mínima com Quadrados. In VIII Encontro da Teoria da Computação - XLIII Congresso da Sociedade Brasileira de Computação, 2023. (in portuguese)

  2. Sandro H. U. Catabriga and Rafael C. S. Schouery. Formulações para o Problema da Compra Mínima. In VIII Encontro da Teoria da Computação - XLIII Congresso da Sociedade Brasileira de Computação, 2023. (in portuguese)

  3. Rafael C. S. Schouery. Uma Heurística Baseada em Programação Linear Inteira para o Problema do Empacotamento de Soma Mínima. In VII Encontro da Teoria da Computação - XLII Congresso da Sociedade Brasileira de Computação, 2022. (in portuguese)

  4. Lehilton L. C. Pedrosa, Mauro R. C. Silva, Rafael C. S. Schouery. Complexidade do Positional Knapsack Problem. In VII Encontro da Teoria da Computação - XLII Congresso da Sociedade Brasileira de Computação, 2022. (in portuguese)

  5. Renan Franco da Silva, Yulle Borges, Rafael Schouery. Heurísticas para o Problema do Empacotamento Colorido. In VI Encontro da Teoria da Computação - XLI Congresso da Sociedade Brasileira de Computação, pages 34-37, 2021. (in portuguese)

  6. Y. Glebbyo and R. C. S. Schouery. Modelos Pseudo Polinomiais para o Problema do Empacotamento Colorido. In V Encontro da Teoria da Computação - XL Congresso da Sociedade Brasileira de Computação, pages 37-40, 2020. (in portuguese)

  7. I. E. S. Souza, M. R. C. Silva, W. R. Silva, R. C. S. Schouery. Exact and Heuristic Approaches to the Maximum Capacity Representatives Problem. In III Encontro da Teoria da Computação - XXXVIII Congresso da Sociedade Brasileira de Computação, 4 pages, 2018. (in portuguese)

  8. L. L. C. Pedrosa, R. C. S. Schouery. Uma Aproximação Ótima para o Problema do Caixeiro Alugador. In III Encontro da Teoria da Computação - XXXVIII Congresso da Sociedade Brasileira de Computação, 4 pages, 2018. (in portuguese)

  9. F. J. M. Silva, F. K. Miyazawa, R. C. S. Schouery. Jogos de Transporte Sequenciais. In III Encontro da Teoria da Computação - XXXVIII Congresso da Sociedade Brasileira de Computação, 4 pages, 2018. (in portuguese)

  10. C. A. Weffort-Santos, C. N. Campos and R. C. S. Schouery. Tight bounds for gap-labellings. In II Encontro da Teoria da Computação - XXXVII Congresso da Sociedade Brasileira de Computação, 4 pages, 2017. (in portuguese)

  11. Lehilton L. C. Pedrosa and Rafael C. S. Schouery. Algoritmo de Aproximação para o Problema da Evacuação por Ônibus. In II Encontro da Teoria da Computação - XXXVII Congresso da Sociedade Brasileira de Computação, 4 pages, 2017. (in portuguese)

  12. Flávio K. Miyazawa and Rafael C. S. Schouery. Compartilhamento de Custos de Empacotamento. In I Encontro da Teoria da Computação - XXXVI Congresso da Sociedade Brasileira de Computação, pages 848 - 851, 2016. (in portuguese)

  13. Leonardo Schwarzstein, Flávio K. Miyazawa and Rafael C. S. Schouery. Um Leilão à Prova de Estratégia para o Compartilhamento de Viagens Dinâmico com Múltiplos Passageiros. In I Encontro da Teoria da Computação - XXXVI Congresso da Sociedade Brasileira de Computação, pages 856 - 859, 2016. (in portuguese)

  14. Yulle Glebbyo and Flávio K. Miyazawa and Rafael C. S. Schouery and Eduardo C. Xavier. Algoritmos Branch-and-Price para o Problema de Empacotamento em Recipientes com Restrições de Classe. In I Encontro da Teoria da Computação - XXXVI Congresso da Sociedade Brasileira de Computação, pages 820 - 823, 2016. (in portuguese)

  15. Lehilton Pedrosa and Vinicius dos Santos and Rafael C. S. Schouery. Uma Aproximação para o Problema de Alocação de Terminais. In I Encontro da Teoria da Computação - XXXVI Congresso da Sociedade Brasileira de Computação, pages 824 - 827, 2016. (in portuguese)

Technical Reports

  1. Rachel V. Saraiva and Rafael C. S. Schouery. Algoritmos de Aproximação para o Problema do Empacotamento. Technical Report IC-20-04, Instituto de Computação - Universidade Estadual de Campinas, 2020. (in portuguese)

  2. Fabio Y. Murakami and Rafael C. S. Schouery. Heurísticas para o Problema de Precificação Livre de Inveja. Technical Report IC-PFG-16-09, Instituto de Computação - Universidade Estadual de Campinas, 2016. (in portuguese)

  3. Iago A. Neves and Rafael C. S. Schouery. Resultados teóricos para leilões de um único item. Technical Report IC-PFG-16-07, Instituto de Computação - Universidade Estadual de Campinas, 2016. (in portuguese)

  4. Cristina G. Fernandes and Rafael C. S. Schouery. Algoritmos de aproximação e problemas com seqüências. Technical Report RT-MAC-2009-04, Instituto de Matemática e Estatística - Universidade de São Paulo, 2009. (in portuguese)

Instances and Generators

  1. Unit-Demand Market Models - For more information, please refer to the paper The Envy-Free Pricing Problem, Unit-Demand Markets and Connections with the Network Pricing Problem.

PhD Thesis

  1. Rafael C. S. Schouery. Problemas de alocação e precificação de itens. PhD thesis, Instituto de Matemática e Estatística - Universidade de São Paulo, São Paulo-SP, Brasil, 2014.