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
2019Robust Online Algorithms for Certain Dynamic Packing Problems.Sebastian Berndt, Valentin Dreismann, Kilian Grage, Klaus Jansen, Ingmar Knof
2019Improved Deterministic Strategy for the Canadian Traveller Problem Exploiting Small Max-(s, t)-Cuts.Pierre Berg, Lou Salan
2019A New Lower Bound for Classic Online Bin Packing.Jnos Balogh, Jzsef Bksi, Gyrgy Dsa, Leah Epstein, Asaf Levin
2019Terrain-Like Graphs: PTASs for Guarding Weakly-Visible Polygons and Terrains.Stav Ashur, Omrit Filtser, Matthew J. Katz, Rachel Saban
2019Fair Coresets and Streaming Algorithms for Fair k-means.Melanie Schmidt, Chris Schwiegelshohn, Christian Sohler
2018Some Easy and Some Not so Easy Geometric Optimization Problems.Gerhard J. Woeginger
2018The Price of Fixed Assignments in Stochastic Extensible Bin Packing.Guillaume Sagnol, Daniel Schmidt genannt Waldschmidt, Alexander Tesch
2018The Itinerant List Update Problem.Neil Olver, Kirk Pruhs, Kevin Schewior, Ren Sitters, Leen Stougie
2018Cut Sparsifiers for Balanced Digraphs.Motoki Ikeda, Shin-ichi Tanigawa
2018Longest Increasing Subsequence Under Persistent Comparison Errors.Barbara Geissmann
2018Algorithms for Dynamic NFV Workload.Yaron Fairstein, Seffi Naor, Danny Raz
2018Probabilistic Embeddings of the Frchet Distance.Anne Driemel, Amer Krivosija
2018Bin Packing Games with Weight Decision: How to Get a Small Value for the Price of Anarchy.Gyrgy Dsa, Hans Kellerer, Zsolt Tuza
2018Sublinear Graph Augmentation for Fast Query Implementation.Artur Czumaj, Yishay Mansour, Shai Vardi
2018DISPATCH: An Optimally-Competitive Algorithm for Maximum Online Perfect Bipartite Matching with i.i.d. Arrivals.Minjun Chang, Dorit S. Hochbaum, Quico Spaen, Mark Velednitsky
2018Improved Approximation Algorithms for Minimum Power Covering Problems.Gruia Calinescu, Guy Kortsarz, Zeev Nutov
2018Approximating Node-Weighted k-MST on Planar Graphs.Jaroslaw Byrka, Mateusz Lewandowski, Joachim Spoerhase
2018Reconfiguration of Graphs with Connectivity Constraints.Nicolas Bousquet, Arnaud Mary
2018Advice Complexity of Priority Algorithms.Allan Borodin, Joan Boyar, Kim S. Larsen, Denis Pankratov
2018Call Admission Problems on Grids with Advice (Extended Abstract).Hans-Joachim Bckenhauer, Dennis Komm, Raphael Wegner
2018Exploring Sparse Graphs with Advice (Extended Abstract).Hans-Joachim Bckenhauer, Janosch Fuchs, Walter Unger
2018A Primal-Dual Online Deterministic Algorithm for Matching with Delays.Marcin Bienkowski, Artur Kraska, Hsiang-Hsuan Liu, Pawel Schmidt
2018Sequential Metric Dimension.Julien Bensmail, Dorian Mazauric, Fionn Mc Inerney, Nicolas Nisse, Stphane Prennes
2018Deterministic Min-Cost Matching with Delays.Yossi Azar, Amit Jacob Fanani
2018Strategic Contention Resolution in Multiple Channels.George Christodoulou, Themistoklis Melissourgos, Paul G. Spirakis
101125 of 450← PreviousNext →

Comparable venues

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