知识中心主页
文献服务
文献资源
外文期刊
外文会议
专业机构
智能制造
高级检索
版权声明
使用帮助
会议文集
文集名
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-Graph
Hugo A. Akitaya; Ahmad Biniaz; Prosenjit Bose
2021
The Minimum Moving Spanning Tree Problem
Hugo A. Akitaya; Ahmad Biniaz; Prosenjit Bose; Jean-Lou De Carufel; Anil Maheshwari; Luis Fernando Schultz Xavier da Silveira; Michiel Smid
2021
Scheduling with Testing on Multiple Identical Parallel Machines
Susanne Albers; Alexander Eckl
2021
Online Makespan Minimization with Budgeted Uncertainty
Susanne Albers; Maximilian Janke
2021
Pattern Matching in Doubling Spaces
Corentin Allair; Antoine Vigneron
2021
Reachability Problems for Transmission Graphs
Shinwoo An; Eunjin Oh
2021
On Minimum Generalized Manhattan Connections
Antonios Antoniadis; Margarita Capretto; Parinya Chalermsook; Christoph Damerius; Peter Kling; Lukas Nolke; Nidia Obscura Acosta; Joachim Spoerhase
2021
HalftimeHash: Modern Hashing Without 64-Bit Multipliers or Finite Fields
Jim Apple
2021
Generalized Disk Graphs
Ivar Marrow Arnporsson; Steven Chaplick; Jokull Snaer Gylfason; Magnus M. Halldorsson; Jokull Mani Reynisson; Tigran Tonoyan
2021
A 4-Approximation of the 2π/3-MST
Stav Ashur; Matthew J. Katz
2021
Dynamic Dictionaries for Multisets and Counting Filters with Constant Time Operations
Ioana O. Bercea; Guy Even
2021
The Neighborhood Polynomial of Chordal Graphs
Helena Bergold; Winfried Hochstattler; Uwe Mayer
2021
Incomplete Directed Perfect Phylogeny in Linear Time
Giulia Bernardini; Paola Bonizzoni; Pawel Gawrychowski
2021
Euclidean Maximum Matchings in the Plane - Local to Global
Ahmad Biniaz; Anil Maheshwari; Michiel Smid
2021
Solving Problems on Generalized Convex Graphs via Mim-Width
Flavia Bonomo-Braberman; Nick Brettell; Andrea Munaro; Daniel Paulusma
2021
Improved Bounds on the Spanning Ratio of the Theta-5-Graph
Prosenjit Bose; Darryl Hill; Aurelien Ooms
2021
Computing Weighted Subset Transversals in H-Free Graphs
Nick Brettell; Matthew Johnson; Daniel Paulusma
2021
Computing the Frechet Distance Between Uncertain Curves in One Dimension
Kevin Buchin; Maarten Loffler; Tim Ophelders; Aleksandr Popov; Jerome Urhausen; Kevin Verbeek
2021
Finding a Largest-Area Triangle in a Terrain in Near-Linear Time
Sergio Cabello; Arun Kumar Das; Sandip Das; Joydeep Mukherjee
2021
Planar Drawings with Few Slopes of Halin Graphs and Nested Pseudotrees
Steven Chaplick; Giordano Da Lozzo; Emilio Di Giacomo; Giuseppe Liotta; Fabrizio Montecchiani
2021
1
2
3
制造业外文文献服务平台