会议文集


文集名Algorithms and Data Structures
会议名17th International Symposium on Algorithms and Data Structures (WADS 2021)
中译名《第十七届国际算法与数据结构专题讨论会》
会议日期August 9-11, 2021
会议地点Online
出版年2021
馆藏号340144


题名作者出版年
On the Spanning and Routing Ratios of the Directed Θ_6-GraphHugo A. Akitaya; Ahmad Biniaz; Prosenjit Bose2021
The Minimum Moving Spanning Tree ProblemHugo A. Akitaya; Ahmad Biniaz; Prosenjit Bose; Jean-Lou De Carufel; Anil Maheshwari; Luis Fernando Schultz Xavier da Silveira; Michiel Smid2021
Scheduling with Testing on Multiple Identical Parallel MachinesSusanne Albers; Alexander Eckl2021
Online Makespan Minimization with Budgeted UncertaintySusanne Albers; Maximilian Janke2021
Pattern Matching in Doubling SpacesCorentin Allair; Antoine Vigneron2021
Reachability Problems for Transmission GraphsShinwoo An; Eunjin Oh2021
On Minimum Generalized Manhattan ConnectionsAntonios Antoniadis; Margarita Capretto; Parinya Chalermsook; Christoph Damerius; Peter Kling; Lukas Nolke; Nidia Obscura Acosta; Joachim Spoerhase2021
HalftimeHash: Modern Hashing Without 64-Bit Multipliers or Finite FieldsJim Apple2021
Generalized Disk GraphsIvar Marrow Arnporsson; Steven Chaplick; Jokull Snaer Gylfason; Magnus M. Halldorsson; Jokull Mani Reynisson; Tigran Tonoyan2021
A 4-Approximation of the 2π/3-MSTStav Ashur; Matthew J. Katz2021
Dynamic Dictionaries for Multisets and Counting Filters with Constant Time OperationsIoana O. Bercea; Guy Even2021
The Neighborhood Polynomial of Chordal GraphsHelena Bergold; Winfried Hochstattler; Uwe Mayer2021
Incomplete Directed Perfect Phylogeny in Linear TimeGiulia Bernardini; Paola Bonizzoni; Pawel Gawrychowski2021
Euclidean Maximum Matchings in the Plane - Local to GlobalAhmad Biniaz; Anil Maheshwari; Michiel Smid2021
Solving Problems on Generalized Convex Graphs via Mim-WidthFlavia Bonomo-Braberman; Nick Brettell; Andrea Munaro; Daniel Paulusma2021
Improved Bounds on the Spanning Ratio of the Theta-5-GraphProsenjit Bose; Darryl Hill; Aurelien Ooms2021
Computing Weighted Subset Transversals in H-Free GraphsNick Brettell; Matthew Johnson; Daniel Paulusma2021
Computing the Frechet Distance Between Uncertain Curves in One DimensionKevin Buchin; Maarten Loffler; Tim Ophelders; Aleksandr Popov; Jerome Urhausen; Kevin Verbeek2021
Finding a Largest-Area Triangle in a Terrain in Near-Linear TimeSergio Cabello; Arun Kumar Das; Sandip Das; Joydeep Mukherjee2021
Planar Drawings with Few Slopes of Halin Graphs and Nested PseudotreesSteven Chaplick; Giordano Da Lozzo; Emilio Di Giacomo; Giuseppe Liotta; Fabrizio Montecchiani2021
123