How to Morph Graphs on the Torus

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:ACM-SIAM Symposium on Discrete Algorithms (32. : 2021 : Online) Thirty-second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2021) ; Volume 4 of 4
1. Verfasser: Chambers, Erin Wolf (VerfasserIn)
Weitere Verfasser: Erickson, Jeff (VerfasserIn), Lin, Patrick (VerfasserIn), Parsa, Salman (VerfasserIn)
Pages:2021
Format: UnknownFormat
Sprache:eng
Veröffentlicht: 2021
Schlagworte:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Titel Jahr Verfasser
The Fine-Grained Complexity of Computing the Tutte Polynomial of a Linear Matroid 2021 Björklund, Andreas
Nearly Optimal Average-Case Complexity of Counting Bicliques under SETH 2021 Hirahara, Shuichi
Concentration Bounds for almost k-Wise Independence with Applications to Non-Uniform Security 2021 Gravin, Nick
Dimension-Preserving Reductions between SVP and CVP in Different p-Norms 2021 Aggarwal, Divesh
Incremental Single Source Shortest Paths in Sparse Digraphs 2021 Chechik, Shiri
Approximate Distance Oracles Subject to Multiple Vertex Failures 2021 Duan, Ran
Deep Weisfeiler Leman 2021 Grohe, Martin
2-Level Quasi-Planarity or How Caterpillars Climb (SPQR-)Trees 2021 Angelini, Patrizio
Two-stage Stochastic Matching with Application to Ride Hailing 2021 Feng, Yiding
A Time-Optimal Randomized Parallel Algorithm for MIS 2021 Ghaffari, Mohsen
Optimal Vertex Fault-Tolerant Spanners in Polynomial Time 2021 Bodwin, Greg
Non-uniform Geometric Set Cover and Scheduling on Multiple Machines 2021 Bansal, Nikhil
Towards PTAS for Precedence Constrained Scheduling via Combinatorial Algorithms 2021 Li, Shi
Optimal Oblivious Priority Queues 2021 Jafargholi, Zahra
Connecting Robust Shuffle Privacy and Pan-Privacy 2021 Balcer, Victor
Efficient Document Exchange and Error Correcting Codes with Asymmetric Information 2021 Cheng, Kuan
Deterministic Algorithms for Decremental Shortest Paths via Layered Core Decomposition 2021 Chuzhoy, Julia
On Approximability of Clustering Problems without Candidate Centers 2021 Cohen-Addad, Vincent
EPTAS for k-Means Clustering of Affine Subspaces 2021 Eiben, Eduard
Online Generalized Network Design under (Dis)Economies of Scale 2021 Nagarajan, Viswanath
Alle Artikel auflisten