Rafael CS Schouery

Associate Professor

Director of the Brazilian ICPC Summer School

Coordinator of the Laboratory of Optimization and Combinatorics (LOCo)

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

Previous PhD Students

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

Previous Master Students

  1. John Paul Francisco da Silva
  2. Rachel Vanucchi Hail
  3. Leonardo Yvens Schwarzstein
  4. Welverton Rodrigues da Silva
  5. Italos Estilon da Silva de Souza
  6. Mauro Roberto Costa da Silva
  7. Francisco Jhonatas Melo da Silva - co-supervisor
  8. Celso Aimbiré Weffort Santos - co-supervisor
  9. Edson Ariel Ticona Zegarra
  10. Lucas Prado Melo - co-supervisor
  11. Yulle Glebbyo Felipe Borges - co-supervisor
  12. Renata Ghisloti Duarte de Souza Ganha - co-supervisor

Previous Undergraduate Students

  1. Renan Fernando Franco da Silva (Undergrad Research)
  2. Bernardo Panka Archegas (Undergrad Research)
  3. Erico Iago Maldonado Faustino (Final Graduation Project)
  4. Ieremies Vieira Da Fonseca Romero (Undergrad Research)
  5. Luiz Eduardo Targa Chaves Cartolano (Directed Study)
  6. Rachel Vanucchi Hail (Undergrad Research)
  7. Sinara Caonetto Pamplona (Undergrad Research)
  8. Iago A. Neves (Final Graduation Project)
  9. Fabio Yudi Murakami (Final Graduation Project)

Publications

Submitted Papers available online

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

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

  3. Renan FF da Silva, Yulle GF Borges, Rafael CS Schouery. Fast Neighborhood Search Heuristics for the Colorful Bin Packing Problem

  4. Yulle GF Borges, Vinícius L. de Lima, Flávio K. Miyazawa, Lehilton LC Pedrosa, Thiago A. de Queiroz, Rafael CS Schouery. Algorithms for the Bin Packing Problem with Scenarios.

  5. Welverton R. Silva, Fábio L. Usberti, and Rafael CS Schouery. On the approximability and energy-flow modeling of the electric vehicle sharing problem. ssrn

  6. Mauro RC da Silva and Rafael CS Schouery. Local-Search Based Heuristics for Advertisement Scheduling.

Books

  1. Rafael CS Schouery, Orlando Lee, Flávio K. Miyazawa, and Eduardo C. Xavier. Computer game theory topics. 30th Brazilian Mathematics Colloquium - Institute of Pure and Applied Mathematics. IMPA Publisher, 2015. ISBN: 978-85-244-0412-2

Papers in International Journals

  1. Mauro RC da Silva, Lehilton LC Pedrosa, and Rafael CS Schouery. Approximation algorithms for the MAXSPACE advertisement problem. Theory of Computing Systems, 2024. arXiv

  2. Yulle GF Borges, Rafael CS Schouery, Flávio K. Miyazawa. Mathematical Models and Exact Algorithms for the Colored Bin Packing Problem. Computers & Operations Research, 164: 106527, 2024. arXiv

  3. Francisco JM da Silva, Flávio K. Miyazawa, Ieremies VF Romero, and Rafael CS Schouery. Tight Bounds for the Price of Anarchy and Stability in Sequential Transportation Games. Journal of Combinatorial Optimization, 46, 10, 2023. arXiv

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

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

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

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

  8. GL Duarte, H. Eto, T. Hanaka, Y. Kobayashi, Y. Kobayashi, D. Lokshtanov, LLC Pedrosa, RCS Schouery, US Souza. Computing the Largest Bond and the Maximum Connected Cut of a Graph. Algorithmic, 83:1421–1458, 2021. arXiv Version.

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

  10. Yulle GF Borges, Rafael CS Schouery, Flávio K. Miyazawa, Fabrizio Granelli, Nelson LS 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.

  11. Edson Ticona-Zegarra, Rafael CS 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.

  12. Lehilton LC Pedrosa and Rafael CS Schouery. Approximation algorithms for the bus evacuation problem. Journal of Combinatorial Optimization, 36(1):131–141, 2018.

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

  14. Flávio K. Miyazawa, Lehilton LC Pedrosa, Rafael CS Schouery, Renata GD de Souza. PTAS for the Geometric Connected Facility Location Problem. Theory of Computing Systems, 61: 871-892, 2017.

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

  16. Thiago A. de Queiroz, Pedro HDB Hokama, Rafael CS Schouery, Flávio K. Miyazawa. Two-dimensional Disjunctively Constrained Knapsack Problem: Exact and Heuristic Approaches. Computers & Industrial Engineering, 105: 313-328, 2017.

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

  18. Flávio K. Miyazawa, Lehilton LC Pedrosa, Rafael CS Schouery, Maxim Sviridenko, Yoshiko Wakabayashi. Polynomial-Time Approximation Schemes for Circle and Other Packaging Problems. Algorithmic, 76(2):536-568, 2016.

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

  20. Cristina G. Fernandes and Rafael CS 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 JM Silva, Rafael CS Schouery. An Introduction to Algorithmic Game Theory. Operational Research for Development, 10(2):57-69, 2018.

Papers in International Conference's Proceedings

  1. Gabriel L. Duarte, Daniel Lokshtanov, Lehilton LC Pedrosa, Rafael CS 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 LC Pedrosa, Greis YO Quesquén; Rafael CS Schouery. An Asymptotically Optimal Approximation Algorithm for the Traveling Car Renter Problem. 19th Symposium on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS 2019), volume 75 of OpenAccess Series in Informatics (OASIcs), pages 14: 1-14: 15, 2019.

  3. Edson T. Zegarra, Rafael CS 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 CS 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 LC Pedrosa, Rafael CS 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 Reading Notes in Computer Science, pages 713-724, 2014.

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

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

  8. Cristina G. Fernandes and Rafael CS 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 Reading Notes in Computer Science, pages 439-450, 2012.

Extended Abstracts in International Conference's Proceedings

  1. Lehilton LC Pedrosa, Mauro RC da Silva and Rafael CS Schouery. Positional Knapsack Problem: NP-hardness and approximation scheme (Brief Announcement). in XII Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS 2023), to appear, 2023.

  2. CA Weffort-Santos, CN Campos, RCS 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 RC da Silva, Rafael CS Schouery, Lehilton LC 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. CA Weffort-Santos, CN Campos and RCS Schouery. Proper gap-labellings of unicyclic graphs. In VIII Latin American Workshop on Clicks in Graphs, volume 46 of Contemporary Mathematics, pages 165-174, 2019.

Papers in Brazilian Conference's Proceedings

  1. Renan Franco da Silva, Yulle Glebbyo Felipe Borges, Rafael CS Schouery. Heuristics for the Color Packaging Problem. In 54th Brazilian Symposium on Operations Research (SBPO 2022), 2022. (in Portuguese)

  2. Welverton Rodrigues da Silva, Rafael Crivellari Saliba Schouery, Fabio Luiz Usberti. Mathematical Models for the Electric Vehicle Sharing Problem. In LIII Brazilian Symposium on Operational Research, 2021. (in Portuguese)

Extended Abstracts in Brazilian Conference's Proceedings

  1. Rachel V. Saraiva and Rafael CS Schouery. PTAS for Packing Problem Least Sum with Squares. In VIII Meeting of Theory of Computing - XLIII Congress of the Brazilian Computing Society, 2023. (in Portuguese)

  2. Sandro HU Catabriga and Rafael CS Schouery. Formulations for the Minimum Purchase Problem. In VIII Meeting of Theory of Computing - XLIII Congress of the Brazilian Computing Society, 2023. (in Portuguese)

  3. Rafael CS Schouery. A Heuristic Based on Integer Linear Programming for the Least Sum Packing Problem. in VII Meeting of Theory of Computing - XLII Congress of the Brazilian Computing Society, 2022. (in Portuguese)

  4. Lehilton LC Pedrosa, Mauro RC Silva, Rafael CS Schouery. Complexity of the Positional Knapsack Problem. in VII Meeting of Theory of Computing - XLII Congress of the Brazilian Computing Society, 2022. (in Portuguese)

  5. Renan Franco da Silva, Yulle Borges, Rafael Schouery. Heuristics for the Color Packing Problem. in VI Meeting of Theory of Computing - XLI Congress of the Brazilian Computer Society, pages 34-37, 2021. (in Portuguese)

  6. Y. Glebbyo and RCS Schouery. Pseudo Polynomial Models for the Color Packing Problem. In V Computer Theory Meeting - XL Congress of the Brazilian Computer Society, pages 37-40, 2020. (in Portuguese)

  7. IES Souza, MRC Silva, WR Silva, RCS Schouery. Exact and Heuristic Approaches to the Maximum Capacity Representatives Problem. In III Computer Theory Meeting - XXXVIII Congress of the Brazilian Computer Society, 4 pages, 2018. (in Portuguese)

  8. LLC Pedrosa, RCS Schouery. An Optimal Approach to the Rental Clerk Problem. In III Computer Theory Meeting - XXXVIII Congress of the Brazilian Computer Society, 4 pages, 2018. (in Portuguese)

  9. FJM Silva, FK Miyazawa, RCS Schouery. Sequential Transport Games. In III Computer Theory Meeting - XXXVIII Congress of the Brazilian Computer Society, 4 pages, 2018. (in Portuguese)

  10. CA Weffort-Santos, CN Campos and RCS Schouery. Tight bounds for gap-labellings. In II Computer Theory Meeting - XXXVII Congress of the Brazilian Computer Society, 4 pages, 2017. (in Portuguese)

  11. Lehilton LC Pedrosa and Rafael CS Schouery. Approach Algorithm for the Bus Evacuation Problem. In II Computer Theory Meeting - XXXVII Congress of the Brazilian Computer Society, 4 pages, 2017. (in Portuguese)

  12. Flávio K. Miyazawa and Rafael CS Schouery. Sharing of Packaging Costs. In I Computer Theory Meeting - XXXVI Congress of the Brazilian Computer Society, pages 848 - 851, 2016. (in Portuguese)

  13. Leonardo Schwarzstein, Flávio K. Miyazawa and Rafael CS Schouery. A Proof-of-Strategy Auction for Dynamic Travel Sharing with Multiple Passengers. In I Computer Theory Meeting - XXXVI Congress of the Brazilian Computer Society, pages 856 - 859, 2016. (in Portuguese)

  14. Yulle Glebbyo and Flávio K. Miyazawa and Rafael CS Schouery and Eduardo C. Xavier. Branch-and-Price algorithms for the problem of packaging in containers with class restrictions. In I Computer Theory Meeting - XXXVI Congress of the Brazilian Computer Society, pages 820 - 823, 2016. (in Portuguese)

  15. Lehilton Pedrosa and Vinicius dos Santos and Rafael CS Schouery. An Approach to the Terminal Allocation Problem. In I Computer Theory Meeting - XXXVI Congress of the Brazilian Computer Society, pages 824 - 827, 2016. (in Portuguese)

Technical reports

  1. Rachel V. Saraiva and Rafael CS Schouery. Approximation Algorithms for the Packaging Problem. Technical Report IC-20-04, Institute of Computing - State University of Campinas, 2020. (in portuguese)

  2. Fabio Y. Murakami and Rafael CS Schouery. Heuristics for the Envy-Free Pricing Problem. Technical Report IC-PFG-16-09, Institute of Computing - State University of Campinas, 2016. (in portuguese)

  3. Iago A. Neves and Rafael CS Schouery. Theoretical results for single item auctions. Technical Report IC-PFG-16-07, Institute of Computing - State University of Campinas, 2016. (in portuguese)

  4. Cristina G. Fernandes and Rafael CS Schouery. Approximation algorithms and problems with sequences. Technical Report RT-MAC-2009-04, Institute of Mathematics and Statistics - University of 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 CS Schouery. Item allocation and pricing issues. PhD thesis, Institute of Mathematics and Statistics - University of São Paulo, São Paulo-SP, Brazil, 2014.