| Online search for a hyperplane in high-dimensional Euclidean space | 0 | 0.34 | 2022 |
| On Minimum Generalized Manhattan Connections | 0 | 0.34 | 2021 |
| Secretary and Online Matching Problems with Machine Learned Advice | 0 | 0.34 | 2020 |
| Hallucination Helps: Energy Efficient Virtual Circuit Routing | 0 | 0.34 | 2020 |
| Parallel Machine Scheduling to Minimize Energy Consumption. | 0 | 0.34 | 2020 |
| A PTAS for Euclidean TSP with Hyperplane Neighborhoods | 0 | 0.34 | 2020 |
| A General Framework for Energy-Efficient Cloud Computing Mechanisms | 0 | 0.34 | 2020 |
| On the Complexity of Anchored Rectangle Packing. | 0 | 0.34 | 2019 |
| A PTAS for Euclidean TSP with Hyperplane Neighborhoods. | 0 | 0.34 | 2019 |
| A Near Optimal Mechanism for Energy Aware Scheduling. | 0 | 0.34 | 2018 |
| Approximating Airports and Railways. | 0 | 0.34 | 2018 |
| A Collection of Lower Bounds for Online Matching on the Line. | 0 | 0.34 | 2018 |
| Continuous speed scaling with variability: A simple and direct approach. | 1 | 0.36 | 2017 |
| A Tight Lower Bound for Online Convex Optimization with Switching Costs. | 2 | 0.40 | 2017 |
| A QPTAS for the General Scheduling Problem with Identical Release Dates. | 0 | 0.34 | 2017 |
| Chasing Convex Bodies and Functions. | 10 | 0.73 | 2016 |
| Airports and Railways: Facility Location Meets Network Design. | 0 | 0.34 | 2016 |
| On multi-processor speed scaling with migration | 14 | 0.69 | 2015 |
| Hallucination helps: energy efficient virtual circuit routing | 3 | 0.40 | 2014 |
| Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-off Schedules. | 4 | 0.46 | 2014 |
| Packet Forwarding Algorithms in a Line Network. | 3 | 0.40 | 2014 |
| Energy-efficient circuit design | 2 | 0.41 | 2014 |
| A fully polynomial-time approximation scheme for speed scaling with sleep state | 8 | 0.43 | 2014 |
| A o(n) -Competitive Deterministic Algorithm for Online Matching on a Line. | 6 | 0.55 | 2014 |
| Complexity-theoretic obstacles to achieving energy savings with near-threshold computing | 2 | 0.41 | 2014 |
| How to Pack Your Items When You Have to Buy Your Knapsack. | 4 | 0.43 | 2013 |
| Non-preemptive speed scaling | 11 | 0.57 | 2013 |
| Race to idle: New algorithms for speed scaling with a sleep state | 28 | 0.99 | 2012 |
| On multi-processor speed scaling with migration: extended abstract | 26 | 1.03 | 2011 |
| Balanced Interval Coloring | 0 | 0.34 | 2010 |
| Approximability of Edge Matching Puzzles | 3 | 0.50 | 2010 |
