Assistant Professor
Head of the Department of Theory of Computing
Institute of Computing, Room 74
University of Campinas (UNICAMP)
Av. Albert Einstein, 1251, 13083-852, Campinas-SP, Brazil
Tel: (+55) (19) 3521-5826

rafael@ic.unicamp.br

Research Interests:

Teaching

Current Teaching

Past Teaching

Current Students

PhD Students

Masters Students

Undergraduate Students

Previous Students

Masters Students

  1. Welverton Rodrigues da Silva
  2. Italos Estilon da Silva de Souza
  3. Mauro Roberto Costa da Silva
  4. Francisco Jhonatas Melo da Silva - co-supervisor - thesis
  5. Celso Aimbiré Weffort Santos - co-supervisor - thesis
  6. Edson Ariel Ticona Zegarra - thesis
  7. Lucas Prado Melo - co-supervisor - thesis
  8. Yulle Glebbyo Felipe Borges - co-supervisor - thesis
  9. Renata Ghisloti Duarte de Souza Granha - co-supervisor - thesis

Undergraduate Students

  1. Iago A. Neves - Technical Report
  2. Fabio Yudi Murakami - Technical Report

Publications

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 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.

  2. Edson Ticona-Zegarra, Rafael C. S. Schouery, Leando 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.

  3. 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.

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

  5. 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.

  6. 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.

  7. 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.

  8. 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.

  9. 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.

  10. 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.

  11. 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 Conference’s Proceedings

  1. 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.

  2. 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.

  3. 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 22th Annual European Symposium on Algorithms, volume 8737 of Lecture Notes in Computer Science, pages 713-724, 2014.

  4. 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.

  5. 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.

  6. 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 Conference’s Proceedings

  1. 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)

  2. 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)

  3. 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)

  4. 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)

  5. 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)

  6. 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) - Proceedings

  7. 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) - Proceedings

  8. 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) - Proceedings

  9. 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) - Proceedings

Abstracts in Conference’s Proceedings

  1. 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, page 34, 2018.

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.

Technical Reports

  1. 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)

  2. 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)

  3. 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.