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
Most published authors
WAOA papers
450 records sourced from DBLP. Search titles, filter by year, sort by recency.
| Year | Title | Authors |
|---|---|---|
| 2016 | Non-greedy Online Steiner Trees on Outerplanar Graphs. | Akira Matsubayashi |
| 2016 | Scenario Submodular Cover. | Nathaniel Grammel, Lisa Hellerstein, Devorah Kletenik, Patrick Lin |
| 2016 | Vertex Sparsification in Trees. | Gramoz Goranci, Harald Rcke |
| 2016 | Balanced Optimization with Vector Costs. | Annette M. C. Ficker, Frits C. R. Spieksma, Gerhard J. Woeginger |
| 2016 | A Multiplicative Weights Update Algorithm for Packing and Covering Semi-infinite Linear Programs. | Khaled M. Elbassioni, Kazuhisa Makino, Waleed Najy |
| 2016 | A priori TSP in the Scenario Model. | Martijn van Ee, Leo van Iersel, Teun Janssen, Ren Sitters |
| 2016 | A Refined Analysis of Online Path Coloring in Trees. | Astha Chauhan, N. S. Narayanaswamy |
| 2016 | New Integrality Gap Results for the Firefighters Problem on Trees. | Parinya Chalermsook, Daniel Vaz |
| 2016 | Batch Coloring of Graphs. | Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin |
| 2016 | Bin Packing with Colocations. | Jean-Claude Bermond, Nathann Cohen, David Coudert, Dimitrios Letsios, Ioannis Milis, Stphane Prennes, Vassilis Zissimopoulos |
| 2016 | A PTAS for the Cluster Editing Problem on Planar Graphs. | Andr Berger, Alexander Grigoriev, Andrej Winokurow |
| 2016 | Tight Approximation Bounds for the Seminar Assignment Problem. | Amotz Bar-Noy, George Rabanca |
| 2016 | Dynamic Traveling Repair Problem with an Arbitrary Time Window. | Yossi Azar, Adi Vardi |
| 2016 | The Shortest Separating Cycle Problem. | Esther M. Arkin, Jie Gao, Adam Hesterberg, Joseph S. B. Mitchell, Jiemin Zeng |
| 2015 | Scheduling with State-Dependent Machine Speed. | Veerle Timmermans, Tjark Vredeveld |
| 2015 | On the Smoothness of Paging Algorithms. | Jan Reineke, Alejandro Salinger |
| 2015 | Maximum ATSP with Weights Zero and One via Half-Edges. | Katarzyna E. Paluch |
| 2015 | Efficient Vertex-Label Distance Oracles for Planar Graphs. | Shay Mozes, Eyal E. Skop |
| 2015 | Approximation Algorithms for k-Connected Graph Factors. | Bodo Manthey, Marten Waanders |
| 2015 | Constant-Time Local Computation Algorithms. | Yishay Mansour, Boaz Patt-Shamir, Shai Vardi |
| 2015 | An FPT 2-Approximation for Tree-cut Decomposition. | Eunjung Kim, Sang-il Oum, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos |
| 2015 | Improved Approximation Algorithms for Unsplittable Flow on a Path with Time Windows. | Fabrizio Grandoni, Salvatore Ingala, Sumedha Uniyal |
| 2015 | Submodular Function Maximization on the Bounded Integer Lattice. | Corinna Gottschalk, Britta Peis |
| 2015 | Buyback Problem with Discrete Concave Valuation Functions. | Shun Fukuda, Akiyoshi Shioura, Takeshi Tokuyama |
| 2015 | Geometric Hitting Set for Segments of Few Orientations. | Sndor P. Fekete, Kan Huang, Joseph S. B. Mitchell, Ojas Parekh, Cynthia A. Phillips |
151–175 of 450← PreviousNext →
Comparable venues
Other A*/A conferences filed under the same field of research.
- A*SODAACM/SIAM Symposium on Discrete Algorithms
- A*ICALPInternational Colloquium on Automata Languages and Programming
- A*STOCACM Symposium on Theory of Computing
- A*FOCSIEEE Symposium on Foundations of Computer Science
- AESAEuropean Symposium on Algorithms
- ASTACSInternational Symposium on Theoretical Aspects of Computer Science
- A*LICSIEEE Symposium on Logic in Computer Science
- AGDGraph Drawing