The following pages link to Rafael C. S. Schouery (Q251069):
Displaying 27 items.
- Polynomial-time approximation schemes for circle and other packing problems (Q329299) (← links)
- Approximation algorithms for the bus evacuation problem (Q724742) (← links)
- The envy-free pricing problem, unit-demand markets and connections with the network pricing problem (Q1751179) (← links)
- Approximation algorithms for the max-buying problem with limited supply (Q1755724) (← links)
- A polynomial-time approximation scheme for the MAXSPACE advertisement problem (Q2132409) (← links)
- On the complexity of gap-\([2]\)-vertex-labellings of subcubic bipartite graphs (Q2132413) (← links)
- A PTAS for the geometric connected facility location problem (Q2408564) (← links)
- Approximation algorithms for \(k\)-level stochastic facility location problems (Q2410048) (← links)
- Second-price ad auctions with binary bids and markets with good competition (Q2453168) (← links)
- Computing the largest bond and the maximum connected cut of a graph (Q2663713) (← links)
- Polynomial-Time Approximation Schemes for Circle Packing Problems (Q2921456) (← links)
- Second-Price Ad Auctions with Binary Bids and Markets with Good Competition (Q3167646) (← links)
- The Envy-Free Pricing Problem and Unit-Demand Markets (Q3195332) (← links)
- Approximation Algorithms for the Max-Buying Problem with Limited Supply (Q5405085) (← links)
- Computing the largest bond of a graph (Q5875544) (← links)
- A bounded space algorithm for online circle packing (Q5964819) (← links)
- On gap-labellings of some families of graphs (Q6048440) (← links)
- Tight bounds for the price of anarchy and stability in sequential transportation games (Q6053961) (← links)
- Graphs without gap-vertex-labellings: families and bounds (Q6064864) (← links)
- Smart energy pricing for demand‐side management in renewable energy smart grids (Q6090496) (← links)
- Budget-balanced and strategy-proof auctions for ridesharing (Q6109306) (← links)
- Mathematical Models and Exact Algorithms for the Colored Bin Packing Problem (Q6437843) (← links)
- A Branch-and-Cut-and-Price Algorithm for Cutting Stock and Related Problems (Q6446539) (← links)
- Proper gap-labellings of unicyclic graphs (Q6492335) (← links)
- Approximation algorithms for the MAXSPACE advertisement problem (Q6580082) (← links)
- An asymptotically optimal approximation algorithm for the travelling car renter problem (Q6591926) (← links)
- Algorithms for the bin packing problem with scenarios (Q6646755) (← links)
