🏛️ The Data Structures & Algorithms Crypt

R.I.P. 👻 Ghosted

Euclidean Capacitated Vehicle Routing in Random Setting: A $1.55$-Approximation Algorithm

Zipei Nie, Hang Zhou

cs.DS 🏛 arXiv 📚 3 cites 3 years ago

R.I.P. 👻 Ghosted

Polylog-Competitive Algorithms for Dynamic Balanced Graph Partitioning for Ring Demands

Harald Räcke, Stefan Schmid, Ruslan Zabrodin

cs.DS 🏛 SPAA 📚 3 cites 3 years ago

R.I.P. 👻 Ghosted

Provably-Efficient and Internally-Deterministic Parallel Union-Find

Alexander Fedorov, Diba Hashemi, ... (+2 more)

cs.DS 🏛 SPAA 📚 3 cites 3 years ago

R.I.P. 👻 Ghosted

Revisiting Block-Diagonal SDP Relaxations for the Clique Number of the Paley Graphs

Vladimir A. Kobzar, Krishnan Mody

cs.DS 🏛 ICSTA 📚 3 cites 3 years ago

R.I.P. 👻 Ghosted

MANTRA: Temporal Betweenness Centrality Approximation through Sampling

Antonio Cruciani

cs.DS 🏛 ECML/PKDD 📚 3 cites 3 years ago

R.I.P. 👻 Ghosted

Pseudorandom Hashing for Space-bounded Computation with Applications in Streaming

Praneeth Kacham, Rasmus Pagh, ... (+2 more)

cs.DS 🏛 FOCS 📚 3 cites 3 years ago

R.I.P. 👻 Ghosted

(Almost) Ruling Out SETH Lower Bounds for All-Pairs Max-Flow

Ohad Trabelsi

cs.DS 🏛 SODA 📚 3 cites 3 years ago

R.I.P. 👻 Ghosted

A Simple 1.5-Approximation Algorithm for a Wide Range of Max-SMTI Problems

Gergely Csáji

cs.DS 🏛 arXiv 📚 3 cites 3 years ago

R.I.P. 👻 Ghosted

Distribution Testing Under the Parity Trace

Renato Ferreira Pinto, Nathaniel Harms

cs.DS 🏛 arXiv 📚 3 cites 3 years ago

R.I.P. 👻 Ghosted

Advice Complexity bounds for Online Delayed F-Node-, H-Node- and H-Edge-Deletion Problems

Niklas Berndt, Henri Lotze

cs.DS 🏛 ICCA W 📚 3 cites 3 years ago

R.I.P. 👻 Ghosted

Universal Coating by 3D Hybrid Programmable Matter

Irina Kostitsyna, David Liedtke, Christian Scheideler

cs.DS 🏛 SIROCCO 📚 3 cites 3 years ago

R.I.P. 👻 Ghosted

Algorithms for subgraph complementation to some classes of graphs

Dhanyamol Antony, Sagartanu Pal, R. B. Sandeep

cs.DS 🏛 IPL 📚 3 cites 3 years ago

R.I.P. 👻 Ghosted

Overcoming Probabilistic Faults in Disoriented Linear Search

Konstantinos Georgiou, Nikos Giachoudis, Evangelos Kranakis

cs.DS 🏛 SIROCCO 📚 3 cites 3 years ago

R.I.P. 👻 Ghosted

Polyhedral Aspects of Feedback Vertex Set and Pseudoforest Deletion Set

Karthekeyan Chandrasekaran, Chandra Chekuri, ... (+3 more)

cs.DS 🏛 Math. Prog. 📚 3 cites 3 years ago

R.I.P. 👻 Ghosted

Almost-Optimal Sublinear Additive Spanners

Zihan Tan, Tianyi Zhang

cs.DS 🏛 STOC 📚 3 cites 3 years ago

R.I.P. 👻 Ghosted

Polynomial-Time Approximation Schemes for Independent Packing Problems on Fractionally Tree-Independence-Number-Fragile Graphs

Esther Galby, Andrea Munaro, Shizhou Yang

cs.DS 🏛 SoCG 📚 3 cites 3 years ago

R.I.P. 👻 Ghosted

Investigating the complexity of the double distance problems

Marilia D. V. Braga, Leonie R. Brockmann, ... (+2 more)

cs.DS 🏛 Algorithms for Molecular Biology 📚 3 cites 3 years ago

R.I.P. 👻 Ghosted

Optimizing Low Dimensional Functions over the Integers

Daniel Dadush, Arthur Léonard, ... (+2 more)

cs.DS 🏛 IPCO 📚 3 cites 3 years ago

R.I.P. 👻 Ghosted

On Maximum Bipartite Matching with Separation

Pasin Manurangsi, Erel Segal-Halevi, Warut Suksompong

cs.DS 🏛 IPL 📚 3 cites 3 years ago

R.I.P. 👻 Ghosted

Improved Algorithms for Monotone Moldable Job Scheduling using Compression and Convolution

Kilian Grage, Klaus Jansen, Felix Ohnesorge

cs.DS 🏛 Euro-Par 📚 3 cites 3 years ago

R.I.P. 👻 Ghosted

Beyond Moments: Robustly Learning Affine Transformations with Asymptotically Optimal Error

He Jia, Pravesh K . Kothari, Santosh S. Vempala

cs.DS 🏛 FOCS 📚 3 cites 3 years ago

R.I.P. 👻 Ghosted

Fully Dynamic $k$-Center in Low Dimensions via Approximate Furthest Neighbors

Jinxiang Gan, Mordecai Jay Golin

cs.DS 🏛 SOSA 📚 3 cites 3 years ago

R.I.P. 👻 Ghosted

Realizing temporal graphs from fastest travel times

Nina Klobas, George B. Mertzios, ... (+2 more)

cs.DS 🏛 arXiv 📚 3 cites 3 years ago

R.I.P. 👻 Ghosted

Grouped Domination Parameterized by Vertex Cover, Twin Cover, and Beyond

Tesshu Hanaka, Hirotaka Ono, ... (+2 more)

cs.DS 🏛 International/Italian Conference on Algorithms and Complexity 📚 3 cites 3 years ago