Skip to content

Workshop on Approximation and Online Algorithms

WAOA

B

CORE rank

CORE rank (raw)

B

Fields of research

Theory of Computation

Papers indexed

450

2003–2025

Papers per year

200326 peak2025

WAOA papers

450 records sourced from DBLP. Search titles, filter by year, sort by recency.

YearTitleAuthors
2008Reoptimization of Weighted Graph and Covering Problems.Davide Bil, Peter Widmayer, Anna Zych
2008Randomized Algorithms for Buffer Management with 2-Bounded Delay.Marcin Bienkowski, Marek Chrobak, Lukasz Jez
2008Peak Shaving through Resource Buffering.Amotz Bar-Noy, Matthew P. Johnson, Ou Liu
2008Degree-Constrained Subgraph Problems: Hardness and Approximation Results.Omid Amini, David Peleg, Stphane Prennes, Ignasi Sau, Saket Saurabh
2007Deterministic Algorithms for Rank Aggregation and Other Ranking and Clustering Problems.Anke van Zuylen, David P. Williamson
2007Online Rectangle Filling.Haitao Wang, Amitabh Chaudhary, Danny Z. Chen
2007Full and Local Information in Distributed Decision Making.Panagiota N. Panagopoulou, Paul G. Spirakis
2007Approximating Largest Convex Hulls for Imprecise Points.Maarten Lffler, Marc J. van Kreveld
2007Pricing Commodities, or How to Sell When Buyers Have Restricted Valuations.Robert Krauthgamer, Aranyak Mehta, Atri Rudra
2007Online Algorithm for Parallel Job Scheduling and Strip Packing.Johann L. Hurink, Jacob Jan Paulus
2007Covering the Edges of Bipartite Graphs UsingDorit S. Hochbaum, Asaf Levin
2007The Minimum Substring Cover Problem.Danny Hermelin, Dror Rawitz, Romeo Rizzi, Stphane Vialette
2007Improved Lower Bounds for Non-utilitarian Truthfulness.Iftah Gamzu
2007Approximation Schemes for Packing Splittable Items with Cardinality Constraints.Leah Epstein, Rob van Stee
2007On the Online Unit Clustering Problem.Leah Epstein, Rob van Stee
2007Minimum Weighted Sum Bin Packing.Leah Epstein, Asaf Levin
2007On the Max Coloring Problem.Leah Epstein, Asaf Levin
2007Buyer-Supplier Games: Optimization over the Core.Nedialko B. Dimitrov, C. Greg Plaxton
2007A 5/3-Approximation for Finding Spanning Trees with Many Leaves in Cubic Graphs.Jos R. Correa, Cristina G. Fernandes, Martn Matamala, Yoshiko Wakabayashi
2007Better Bounds for Incremental Medians.Marek Chrobak, Mathilde Hurand
2007Very Large-Scale Neighborhoods with Performance Guarantees for Minimizing Makespan on Parallel Machines.Tobias Brggemann, Johann L. Hurink, Tjark Vredeveld, Gerhard J. Woeginger
2007Geometric Spanners with Small Chromatic Number.Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh
2007A Randomized Algorithm for Two Servers in Cross Polytope Spaces.Wolfgang W. Bein, Kazuo Iwama, Jun Kawahara, Lawrence L. Larmore, James A. Oravec
2007On Min-MaxAmitai Armon
2007A 2-Approximation Algorithm for the Metric 2-Peripatetic Salesman Problem.Alexander A. Ageev, Artem V. Pyatkin
326350 of 450← PreviousNext →

Comparable venues

Other A*/A conferences filed under the same field of research.