Skip to content

Algorithms and Data Structures Symposium (was Workshop on Algorithms and Data Structures)

WADS

B

CORE rank

CORE rank (raw)

B

Fields of research

Theory of Computation

Papers indexed

896

1989–2025

Papers per year

198961 peak2025

WADS papers

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

YearTitleAuthors
2015Polynomial Delay Algorithm for Listing Minimal Edge Dominating Sets in Graphs.Mamadou Moustapha Kant, Vincent Limouzy, Arnaud Mary, Lhouari Nourine, Takeaki Uno
2015Sorting and Selection with Equality Comparisons.Varunkumar Jayapaul, J. Ian Munro, Venkatesh Raman, Srinivasa Rao Satti
2015Competitive Diffusion on Weighted Graphs.Takehiro Ito, Yota Otachi, Toshiki Saitoh, Hisayuki Satoh, Akira Suzuki, Kei Uchizawa, Ryuhei Uehara, Katsuhisa Yamanaka, Xiao Zhou
2015Editing Graphs Into Few Cliques: Complexity, Approximation, and Kernelization Schemes.Falk Hffner, Christian Komusiewicz, Andr Nichterlein
2015The Complexity of Dominating Set Reconfiguration.Arash Haddadan, Takehiro Ito, Amer E. Mouawad, Naomi Nishimura, Hirotaka Ono, Akira Suzuki, Youcef Tebbal
2015Universal Reconstruction of a String.Pawel Gawrychowski, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2015LP-Based Approximation Algorithms for Facility Location in Buy-at-Bulk Network Design.Zachary Friggstad, Mohsen Rezapour, Mohammad R. Salavatipour, Jos A. Soto
2015Finding Articulation Points of Large Graphs in Linear Time.Martin Farach-Colton, Tsan-sheng Hsu, Meng Li, Meng-Tsung Tsai
2015On the Chain Pair Simplification Problem.Chenglin Fan, Omrit Filtser, Matthew J. Katz, Tim Wylie, Binhai Zhu
2015Rooted Cycle Bases.David Eppstein, J. Michael McCarthy, Brian E. Parrish
2015The Parametric Closure Problem.David Eppstein
2015Solving Problems on Graphs of High Rank-Width.Eduard Eiben, Robert Ganian, Stefan Szeider
2015Straight-Line Drawability of a Planar Graph Plus an Edge.Peter Eades, Seok-Hee Hong, Giuseppe Liotta, Naoki Katoh, Sheung-Hung Poon
2015Convex Polygons in Geometric Triangulations.Adrian Dumitrescu, Csaba D. Tth
2015On the Minimum Eccentricity Shortest Path Problem.Feodor F. Dragan, Arne Leitert
2015Polylogarithmic Fully Retroactive Priority Queues via Hierarchical Checkpointing.Erik D. Demaine, Tim Kaler, Quanquan C. Liu, Aaron Sidford, Adam Yedidia
2015Cache-Oblivious Iterated Predecessor Queries via Range Coalescing.Erik D. Demaine, Vineet Gopal, William Hasenplaugh
2015On the Complexity of an Unregulated Traffic Crossing.Philip Dasler, David M. Mount
2015Linearity Is Strictly More Powerful Than Contiguity for Encoding Graphs.Christophe Crespelle, Tien-Nam Le, Kvin Perrot, Thi Ha Duong Phan
2015Approximating Nearest Neighbor Distances.Michael B. Cohen, Brittany Terese Fasy, Gary L. Miller, Amir Nayyeri, Donald R. Sheehy, Ameya Velingker
2015Select with Groups of 3 or 4.Ke Chen, Adrian Dumitrescu
2015Dealing with 4-Variables by Resolution: An Improved MaxSAT Algorithm.Jianer Chen, Chao Xu, Jianxin Wang
2015A New Approach for Contact Graph Representations and Its Applications.Yi-Jun Chang, Hsu-Chun Yen
2015Greedy Is an Almost Optimal Deque.Parinya Chalermsook, Mayank Goswami, Lszl Kozma, Kurt Mehlhorn, Thatchaphol Saranurak
2015On the Bounded-Hop Range Assignment Problem.Paz Carmi, Lilach Chaitman-Yerushalmi, Ohad Trabelsi
251275 of 896← PreviousNext →

Comparable venues

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