No. Title Author Year
1 Noisy Sorting Without Searching: Data Oblivious Sorting with Comparison Errors Afshar, Ramtin et al. 2023
2 Efficient Exact Learning Algorithms for Road Networks and Other Graphs with Bounded Clustering Degrees Afshar, Ramtin et al. 2022
3 Mapping Networks via Parallel kth-Hop Traceroute Queries Afshar, Ramtin et al. 2022
4 Reconstructing Biological and Digital Phylogenetic Trees in Parallel Afshar, Ramtin et al. 2020
5 C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual Carving-Width Da Lozzo, Giordano et al. 2019
6 Computing k-Modal Embeddings of Planar Digraphs Besa, Juan José et al. 2019
7 New Applications of Nearest-Neighbor Chains: Euclidean TSP and Motorcycle Graphs Mamano, Nil et al. 2019
8 Tracking Paths in Planar Graphs Eppstein, David et al. 2019
9 Optimally Sorting Evolving Data Besa, Juan Jose et al. 2018
10 Stable-Matching Voronoi Diagrams: Combinatorial Complexity and Algorithms Barequet, Gill et al. 2018
11 The Online House Numbering Problem: Min-Max Online List Labeling Devanny, William E. et al. 2017
12 Scheduling Autonomous Vehicle Platoons Through an Unregulated Intersection Besa Vial, Juan José et al. 2016
Current Page :
Number of result pages: 1
Number of documents: 12

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI