default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRafael C. S. Schouery
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j23]Welverton R. Silva
, Fábio Luiz Usberti, Rafael C. S. Schouery:
On the approximability and energy-flow modeling of the electric vehicle sharing problem. Comput. Ind. Eng. 192: 110181 (2024)- [j22]Yulle G. F. Borges, Rafael C. S. Schouery, Flávio Keidi Miyazawa:
Mathematical models and exact algorithms for the Colored Bin Packing Problem. Comput. Oper. Res. 164: 106527 (2024) - [j21]Yulle G. F. Borges, Vinícius Loti de Lima, Flávio Keidi Miyazawa, Lehilton L. C. Pedrosa, Thiago Alves de Queiroz, Rafael C. S. Schouery:
Algorithms for the bin packing problem with scenarios. J. Comb. Optim. 48(4): 34 (2024) - [j20]Lehilton L. C. Pedrosa, Mauro Roberto Costa da Silva, Rafael C. S. Schouery:
Approximation Algorithms for the MAXSPACE Advertisement Problem. Theory Comput. Syst. 68(3): 571-590 (2024) - [j19]Mauro Roberto Costa da Silva, Rafael Crivellari Saliba Schouery:
Local-search based heuristics for advertisement scheduling. RAIRO Oper. Res. 58(4): 3203-3231 (2024) - 2023
- [j18]Welverton R. Silva, Fábio Luiz Usberti, Rafael C. S. Schouery:
On the complexity and modeling of the electric vehicle sharing problem. Comput. Ind. Eng. 179: 109208 (2023) - [j17]Leonardo Y. Schwarzstein, Rafael C. S. Schouery:
Budget-balanced and strategy-proof auctions for ridesharing. Comput. Oper. Res. 151: 106094 (2023) - [j16]Celso A. Weffort-Santos, Rafael C. S. Schouery:
Graphs without gap-vertex-labellings: Families and bounds. Discret. Appl. Math. 339: 317-335 (2023) - [j15]C. A. Weffort-Santos, C. N. Campos, Rafael C. S. Schouery:
On gap-labellings of some families of graphs. Discret. Appl. Math. 340: 296-314 (2023) - [j14]Francisco J. M. da Silva, Flávio Keidi Miyazawa, Ieremies V. F. Romero, Rafael C. S. Schouery:
Tight bounds for the price of anarchy and stability in sequential transportation games. J. Comb. Optim. 46(2): 10 (2023) - [c11]Lehilton L. C. Pedrosa, Mauro Roberto Costa da Silva, Rafael C. S. Schouery:
Positional Knapsack Problem: NP-hardness and approximation scheme (Brief Announcement). LAGOS 2023: 400-402 - [i16]Welverton R. Silva, Fábio Luiz Usberti, Rafael C. S. Schouery:
On the approximability and energy-flow modeling of the electric vehicle sharing problem. CoRR abs/2305.12176 (2023) - [i15]Yulle G. F. Borges, Vinícius Loti de Lima, Flávio Keidi Miyazawa, Lehilton L. C. Pedrosa, Thiago Alves de Queiroz, Rafael C. S. Schouery:
Algorithms for the Bin Packing Problem with Scenarios. CoRR abs/2305.15351 (2023) - [i14]Rachel Vanucchi Saraiva, Rafael C. S. Schouery:
Approximation algorithms for the square min-sum bin packing problem. CoRR abs/2307.06776 (2023) - [i13]Renan F. F. da Silva, Yulle G. F. Borges, Rafael C. S. Schouery:
Fast Neighborhood Search Heuristics for the Colorful Bin Packing Problem. CoRR abs/2310.04471 (2023) - 2022
- [i12]Welverton R. Silva, Fábio Luiz Usberti, Rafael C. S. Schouery:
On the complexity and modeling of the electric vehicle sharing problem. CoRR abs/2202.12918 (2022) - 2021
- [j13]Gabriel L. Duarte, Hiroshi Eto, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi, Daniel Lokshtanov, Lehilton L. C. Pedrosa, Rafael C. S. Schouery, Uéverton S. Souza:
Computing the Largest Bond and the Maximum Connected Cut of a Graph. Algorithmica 83(5): 1421-1458 (2021) - 2020
- [j12]Yulle G. F. Borges, Flávio Keidi Miyazawa, Rafael C. S. Schouery, Eduardo C. Xavier:
Exact algorithms for class-constrained packing problems. Comput. Ind. Eng. 144: 106455 (2020) - [j11]Yulle G. F. Borges, Rafael C. S. Schouery, Flávio Keidi Miyazawa, Fabrizio Granelli, Nelson L. S. da Fonseca, Lucas P. Melo:
Smart energy pricing for demand-side management in renewable energy smart grids. Int. Trans. Oper. Res. 27(6): 2760-2784 (2020) - [i11]Mauro Roberto Costa da Silva, Lehilton L. C. Pedrosa, Rafael C. S. Schouery:
Approximation algorithms for the MAXSPACE advertisement problem. CoRR abs/2006.13430 (2020) - [i10]Mauro Roberto Costa da Silva, Rafael C. S. Schouery:
Local-Search Based Heuristics for Advertisement Scheduling. CoRR abs/2006.13432 (2020) - [i9]Celso A. Weffort-Santos, Rafael C. S. Schouery:
Graphs without gap-vertex-labellings: families and bounds. CoRR abs/2007.01431 (2020) - [i8]Gabriel L. Duarte, Hiroshi Eto, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi, Daniel Lokshtanov, Lehilton L. C. Pedrosa, Rafael C. S. Schouery, Uéverton S. Souza:
Computing the Largest Bond and the Maximum Connected Cut of a Graph. CoRR abs/2007.04513 (2020) - [i7]Francisco J. M. da Silva, Flávio Keidi Miyazawa, Ieremies V. F. Romero, Rafael C. S. Schouery:
Tight Bounds for the Price of Anarchy and Stability in Sequential Transportation Games. CoRR abs/2007.08726 (2020) - [i6]Leonardo Y. Schwarzstein, Rafael C. S. Schouery:
A budget-balanced and strategy-proof auction for multi-passenger ridesharing. CoRR abs/2007.09182 (2020) - [i5]Welverton R. Silva, Rafael C. S. Schouery:
Maximum Customers' Satisfaction in One-way Car-sharing: Modeling, Exact and Heuristic Solving. CoRR abs/2008.07372 (2020)
2010 – 2019
- 2019
- [c10]Lehilton L. C. Pedrosa, Greis Y. O. Quesquén, Rafael C. S. Schouery:
An Asymptotically Optimal Approximation Algorithm for the Travelling Car Renter Problem. ATMOS 2019: 14:1-14:15 - [c9]Gabriel L. Duarte, Daniel Lokshtanov, Lehilton L. C. Pedrosa, Rafael C. S. Schouery, Uéverton S. Souza:
Computing the Largest Bond of a Graph. IPEC 2019: 12:1-12:15 - [c8]Mauro Roberto Costa da Silva, Rafael C. S. Schouery, Lehilton L. C. Pedrosa:
A Polynomial-time Approximation Scheme for the MAXSPACE Advertisement Problem. LAGOS 2019: 699-710 - [c7]Celso A. Weffort-Santos, C. N. Campos, Rafael C. S. Schouery:
On the Complexity of Gap-[2]-vertex-labellings of Subcubic Bipartite Graphs. LAGOS 2019: 725-734 - [i4]Gabriel L. Duarte, Daniel Lokshtanov, Lehilton L. C. Pedrosa, Rafael C. S. Schouery, Uéverton S. Souza:
Computing the largest bond of a graph. CoRR abs/1910.01071 (2019) - 2018
- [j10]Cristina G. Fernandes, Rafael Crivellari Saliba Schouery:
Approximation Algorithms for the Max-Buying Problem with Limited Supply. Algorithmica 80(11): 2973-2992 (2018) - [j9]Edson Ticona Zegarra, Rafael C. S. Schouery, Leandro A. Villas, Flávio Keidi Miyazawa:
Improved continuous enhancement routing solution for energy-aware data aggregation in wireless sensor networks. Int. J. Distributed Sens. Networks 14(5) (2018) - [j8]Lehilton L. C. Pedrosa, Rafael Crivellari Saliba Schouery:
Approximation algorithms for the bus evacuation problem. J. Comb. Optim. 36(1): 131-141 (2018) - 2017
- [j7]Thiago Alves de Queiroz, Pedro Henrique Del Bianco Hokama, Rafael Crivellari Saliba Schouery, Flávio Keidi Miyazawa:
Two-dimensional Disjunctively Constrained Knapsack Problem: Heuristic and exact approaches. Comput. Ind. Eng. 105: 313-328 (2017) - [j6]Lucas P. Melo, Flávio Keidi Miyazawa, Lehilton L. C. Pedrosa, Rafael Crivellari Saliba Schouery:
Approximation algorithms for k-level stochastic facility location problems. J. Comb. Optim. 34(1): 266-278 (2017) - [j5]Flávio Keidi Miyazawa, Lehilton L. C. Pedrosa, Rafael Crivellari Saliba Schouery, Renata G. D. de Souza:
A PTAS for the Geometric Connected Facility Location Problem. Theory Comput. Syst. 61(3): 871-892 (2017) - 2016
- [j4]Flávio Keidi Miyazawa, Lehilton L. C. Pedrosa, Rafael Crivellari Saliba Schouery, Maxim Sviridenko, Yoshiko Wakabayashi:
Polynomial-Time Approximation Schemes for Circle and Other Packing Problems. Algorithmica 76(2): 536-568 (2016) - [j3]Cristina G. Fernandes, Carlos E. Ferreira, Álvaro Junio Pereira Franco, Rafael Crivellari Saliba Schouery:
The envy-free pricing problem, unit-demand markets and connections with the network pricing problem. Discret. Optim. 22: 141-161 (2016) - [j2]Pedro Henrique Del Bianco Hokama, Flávio Keidi Miyazawa, Rafael Crivellari Saliba Schouery:
A bounded space algorithm for online circle packing. Inf. Process. Lett. 116(5): 337-342 (2016) - [c6]Evandro C. Bracht, Thiago Alves de Queiroz, Rafael Crivellari Saliba Schouery, Flávio Keidi Miyazawa:
Dynamic cargo stability in loading and transportation of containers. CASE 2016: 227-232 - [c5]Edson Ticona Zegarra, Rafael Crivellari Saliba Schouery, Flávio Keidi Miyazawa, Leandro A. Villas:
A Continuous Enhancement Routing Solution aware of data aggregation for Wireless Sensor Networks. NCA 2016: 93-100 - 2014
- [b1]Rafael Crivellari Saliba Schouery:
Allocation and pricing problems. University of São Paulo, Brazil, 2014 - [j1]Cristina G. Fernandes, Rafael Crivellari Saliba Schouery:
Second-Price Ad Auctions with Binary Bids and markets with good competition. Theor. Comput. Sci. 540: 103-114 (2014) - [c4]Flávio Keidi Miyazawa, Lehilton L. C. Pedrosa, Rafael Crivellari Saliba Schouery, Maxim Sviridenko, Yoshiko Wakabayashi:
Polynomial-Time Approximation Schemes for Circle Packing Problems. ESA 2014: 713-724 - [c3]Cristina G. Fernandes, Carlos Eduardo Ferreira, Álvaro Junio Pereira Franco, Rafael Crivellari Saliba Schouery:
The Envy-Free Pricing Problem and Unit-Demand Markets. ISCO 2014: 230-241 - [c2]Cristina G. Fernandes, Rafael Crivellari Saliba Schouery:
Approximation Algorithms for the Max-Buying Problem with Limited Supply. LATIN 2014: 707-718 - [i3]Flávio Keidi Miyazawa, Lehilton L. C. Pedrosa, Rafael Crivellari Saliba Schouery, Maxim Sviridenko, Yoshiko Wakabayashi:
Polynomial-Time Approximation Schemes for Circle and Other Packing Problems. CoRR abs/1412.4709 (2014) - 2013
- [i2]Cristina G. Fernandes, Rafael Crivellari Saliba Schouery:
Approximation Algorithms for the Max-Buying Problem with Limited Supply. CoRR abs/1309.7955 (2013) - [i1]Cristina G. Fernandes, Carlos Eduardo Ferreira, Álvaro Junio Pereira Franco, Rafael Crivellari Saliba Schouery:
The Unit-Demand Envy-Free Pricing Problem. CoRR abs/1310.0038 (2013) - 2012
- [c1]Cristina G. Fernandes, Rafael Crivellari Saliba Schouery:
Second-Price Ad Auctions with Binary Bids and Markets with Good Competition. ISCO 2012: 439-450
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-02 22:35 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
