Rafael C. S. Schouery

Orcid: 0000-0002-0472-4810

According to our database1, Rafael C. S. Schouery authored at least 37 papers between 2013 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
On gap-labellings of some families of graphs.
Discret. Appl. Math., December, 2023

Graphs without gap-vertex-labellings: Families and bounds.
Discret. Appl. Math., November, 2023

Tight bounds for the price of anarchy and stability in sequential transportation games.
J. Comb. Optim., September, 2023

On the complexity and modeling of the electric vehicle sharing problem.
Comput. Ind. Eng., May, 2023

Fast Neighborhood Search Heuristics for the Colorful Bin Packing Problem.
CoRR, 2023

Approximation algorithms for the square min-sum bin packing problem.
CoRR, 2023

Algorithms for the Bin Packing Problem with Scenarios.
CoRR, 2023

On the approximability and energy-flow modeling of the electric vehicle sharing problem.
CoRR, 2023

Budget-balanced and strategy-proof auctions for ridesharing.
Comput. Oper. Res., 2023

Positional Knapsack Problem: NP-hardness and approximation scheme (Brief Announcement).
Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, 2023

2021
Computing the Largest Bond and the Maximum Connected Cut of a Graph.
Algorithmica, 2021

2020
Smart energy pricing for demand-side management in renewable energy smart grids.
Int. Trans. Oper. Res., 2020

Maximum Customers' Satisfaction in One-way Car-sharing: Modeling, Exact and Heuristic Solving.
CoRR, 2020

A budget-balanced and strategy-proof auction for multi-passenger ridesharing.
CoRR, 2020

Local-Search Based Heuristics for Advertisement Scheduling.
CoRR, 2020

Approximation algorithms for the MAXSPACE advertisement problem.
CoRR, 2020

Exact algorithms for class-constrained packing problems.
Comput. Ind. Eng., 2020

2019
On the Complexity of Gap-[2]-vertex-labellings of Subcubic Bipartite Graphs.
Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

A Polynomial-time Approximation Scheme for the MAXSPACE Advertisement Problem.
Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

Computing the Largest Bond of a Graph.
Proceedings of the 14th International Symposium on Parameterized and Exact Computation, 2019

An Asymptotically Optimal Approximation Algorithm for the Travelling Car Renter Problem.
Proceedings of the 19th Symposium on Algorithmic Approaches for Transportation Modelling, 2019

2018
Approximation algorithms for the bus evacuation problem.
J. Comb. Optim., 2018

Improved continuous enhancement routing solution for energy-aware data aggregation in wireless sensor networks.
Int. J. Distributed Sens. Networks, 2018

Approximation Algorithms for the Max-Buying Problem with Limited Supply.
Algorithmica, 2018

2017
A PTAS for the Geometric Connected Facility Location Problem.
Theory Comput. Syst., 2017

Approximation algorithms for k-level stochastic facility location problems.
J. Comb. Optim., 2017

Two-dimensional Disjunctively Constrained Knapsack Problem: Heuristic and exact approaches.
Comput. Ind. Eng., 2017

2016
A bounded space algorithm for online circle packing.
Inf. Process. Lett., 2016

The envy-free pricing problem, unit-demand markets and connections with the network pricing problem.
Discret. Optim., 2016

Polynomial-Time Approximation Schemes for Circle and Other Packing Problems.
Algorithmica, 2016

A Continuous Enhancement Routing Solution aware of data aggregation for Wireless Sensor Networks.
Proceedings of the 15th IEEE International Symposium on Network Computing and Applications, 2016

Dynamic cargo stability in loading and transportation of containers.
Proceedings of the IEEE International Conference on Automation Science and Engineering, 2016

2014
Allocation and pricing problems.
PhD thesis, 2014

Second-Price Ad Auctions with Binary Bids and markets with good competition.
Theor. Comput. Sci., 2014

The Envy-Free Pricing Problem and Unit-Demand Markets.
Proceedings of the Combinatorial Optimization - Third International Symposium, 2014

Polynomial-Time Approximation Schemes for Circle Packing Problems.
Proceedings of the Algorithms - ESA 2014, 2014

2013
The Unit-Demand Envy-Free Pricing Problem.
CoRR, 2013


  Loading...