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
2009The Routing Open Shop Problem: New Approximation Algorithms.Ilya Chernykh, Nikita Dryuck, Alexander V. Kononov, Sergey Sevastyanov
2009Longest Wait First for Broadcast Scheduling [Extended Abstract].Chandra Chekuri, Sungjin Im, Benjamin Moseley
2009Approximating Frequent Items in Asynchronous Data Stream over a Sliding Window.Ho-Leung Chan, Tak Wah Lam, Lap-Kei Lee, Hing-Fung Ting
2009Approximation Algorithms for Multiple Strip Packing.Marin Bougeret, Pierre-Franois Dutot, Klaus Jansen, Christina Otte, Denis Trystram
2009Price Fluctuations: To Buy or to Rent.Marcin Bienkowski
2009Extension of the Nemhauser and Trotter Theorem to Generalized Vertex Cover with Applications.Reuven Bar-Yehuda, Danny Hermelin, Dror Rawitz
2009On the Competitiveness of the Online Asymmetric and Euclidean Steiner Tree Problems.Spyros Angelopoulos
2008Local PTAS for Dominating and Connected Dominating Set in Location Aware Unit Disk Graphs.Andreas Wiese, Evangelos Kranakis
2008A General Scheme for Designing Monotone Algorithms for Scheduling Problems with Precedence Constraints.Clemens Thielen, Sven Oliver Krumke
2008Minimizing Average Flow Time on Unrelated Machines.Ren A. Sitters
2008Approximation Algorithms for Prize-Collecting Network Design Problems with General Connectivity Requirements.Chandrashekhar Nagarajan, Yogeshwer Sharma, David P. Williamson
2008On the Maximum Edge Coloring Problem.Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos
2008On Lagrangian Relaxation and Subset Selection Problems.Ariel Kulik, Hadas Shachnai
2008Max-Weight Integral Multicommodity Flow in Spiders and High-Capacity Trees.Jochen Knemann, Ojas Parekh, David Pritchard
2008Experimental Analysis of Scheduling Algorithms for Aggregated Links.Wojciech Jawor, Marek Chrobak, Mart L. Molle
2008Stackelberg Strategies and Collusion in Network Games with Splittable Flow.Tobias Harks
2008Smoothing Imprecise 1.5D Terrains.Chris Gray, Maarten Lffler, Rodrigo I. Silveira
2008Cooperation in Multiorganization Matching.Laurent Gourvs, Jrme Monnot, Fanny Pascual
2008A Approximation Algorithm for the Minimum Maximal Matching Problem.Zvi Gotthilf, Moshe Lewenstein, Elad Rainshmidt
2008Malicious Bayesian Congestion Games.Martin Gairing
2008Improved Randomized Online Scheduling of Unit Length Intervals and Jobs.Stanley P. Y. Fung, Chung Keung Poon, Feifeng Zheng
2008Caching Content under Digital Rights Management.Leah Epstein, Amos Fiat, Meital Levy
2008A Lower Bound for Scheduling of Unit Jobs with Immediate Decision on Parallel Machines.Toms Ebenlendr, Jir Sgall
2008Dynamic Offline Conflict-Free Coloring for Unit Disks.Joseph Wun-Tat Chan, Francis Y. L. Chin, Xiangyu Hong, Hing-Fung Ting
2008Size Versus Stability in the Marriage Problem.Pter Bir, David F. Manlove, Shubham Mittal
301325 of 450← PreviousNext →

Comparable venues

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