🏛️ The Data Structures & Algorithms Crypt

R.I.P. 👻 Ghosted

Chess is hard even for a single player

N. R. Aravind, Neeldhara Misra, Harshil Mittal

cs.DS 🏛 Fun with Algorithms 📚 3 cites 4 years ago

R.I.P. 👻 Ghosted

Efficient Pairing in Unknown Environments: Minimal Observations and TSP-based Optimization

Naoki Fujita, Nicolas Chauvet, ... (+5 more)

cs.DS 🏛 IEEE Access 📚 3 cites 4 years ago

R.I.P. 👻 Ghosted

Stronger 3SUM-Indexing Lower Bounds

Eldon Chung, Kasper Green Larsen

cs.DS 🏛 SODA 📚 3 cites 4 years ago

R.I.P. 👻 Ghosted

Maximizing Modular plus Non-monotone Submodular Functions

Xin Sun, Chenchen Wu, ... (+2 more)

cs.DS 🏛 arXiv 📚 3 cites 4 years ago

R.I.P. 👻 Ghosted

Beyond Time Complexity: Data Movement Complexity Analysis for Matrix Multiplication

Wesley Smith, Aidan Goldfarb, Chen Ding

cs.DS 🏛 ICS 📚 3 cites 4 years ago

R.I.P. 👻 Ghosted

Improved Approximation Algorithms and Lower Bounds for Search-Diversification Problems

Amir Abboud, Vincent Cohen-Addad, ... (+2 more)

cs.DS 🏛 ICALP 📚 3 cites 4 years ago

R.I.P. 👻 Ghosted

Structural Results for High-Multiplicity Scheduling on Uniform Machines

Hauke Brinkop, David Fischer, Klaus Jansen

cs.DS 🏛 arXiv 📚 3 cites 4 years ago

R.I.P. 👻 Ghosted

Cutting a tree with Subgraph Complementation is hard, except for some small trees

Dhanyamol Antony, Sagartanu Pal, ... (+2 more)

cs.DS 🏛 Latin American Symposium on Theoretical Informatics 📚 3 cites 4 years ago

R.I.P. 👻 Ghosted

Minimal Absent Words on Run-Length Encoded Strings

Tooru Akagi, Kouta Okabe, ... (+3 more)

cs.DS 🏛 CPM 📚 3 cites 4 years ago

R.I.P. 👻 Ghosted

List Locally Surjective Homomorphisms in Hereditary Graph Classes

Pavel Dvořák, Monika Krawczyk, ... (+4 more)

cs.DS 🏛 ISAAC 📚 3 cites 4 years ago

R.I.P. 👻 Ghosted

A QUBO formulation for the Tree Containment problem

Michael J. Dinneen, Pankaj S. Ghodla, Simone Linz

cs.DS 🏛 TCS 📚 3 cites 4 years ago

R.I.P. 👻 Ghosted

Improved Compression of the Okamura-Seymour Metric

Shay Mozes, Nathan Wallheimer, Oren Weimann

cs.DS 🏛 ISAAC 📚 3 cites 4 years ago

R.I.P. 👻 Ghosted

Approximation Algorithms for ROUND-UFP and ROUND-SAP

Debajyoti Kar, Arindam Khan, Andreas Wiese

cs.DS 🏛 ESA 📚 3 cites 4 years ago

R.I.P. 👻 Ghosted

Pivot Gray Codes for the Spanning Trees of a Graph ft. the Fan

Ben Cameron, Aaron Grubb, Joe Sawada

cs.DS 🏛 Graphs and Combinatorics 📚 3 cites 4 years ago

R.I.P. 👻 Ghosted

Polynomial kernels for edge modification problems towards block and strictly chordal graphs

Maël Dumas, Anthony Perez, ... (+2 more)

cs.DS 🏛 TCS 📚 3 cites 4 years ago

R.I.P. 👻 Ghosted

How Vulnerable is an Undirected Planar Graph with respect to Max Flow

Lorenzo Balzotti, Paolo G. Franciosa

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

R.I.P. 👻 Ghosted

Polynomial Turing Compressions for Some Graph Problems Parameterized by Modular-Width

Weidong Luo

cs.DS 🏛 International Computing and Combinatorics Conference 📚 3 cites 4 years ago

R.I.P. 👻 Ghosted

A polynomial-time approximation scheme for parallel two-stage flowshops under makespan constraint

Weitian Tong, Yao Xu, Huili Zhang

cs.DS 🏛 TCS 📚 3 cites 4 years ago

R.I.P. 👻 Ghosted

Eternal Vertex Cover on Bipartite and Co-Bipartite Graphs

Neeldhara Misra, Saraswati Nanoti

cs.DS 🏛 arXiv 📚 3 cites 4 years ago

R.I.P. 👻 Ghosted

An Additive Approximation Scheme for the Nash Social Welfare Maximization with Identical Additive Valuations

Asei Inoue, Yusuke Kobayashi

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

R.I.P. 👻 Ghosted

A Classical Quadratic Speedup for Planted $k$XOR

Meghal Gupta, William He, ... (+2 more)

cs.DS 🏛 arXiv 📚 2 cites 11 months ago

R.I.P. 👻 Ghosted

Efficiently Constructing Sparse Navigable Graphs

Alex Conway, Laxman Dhulipala, ... (+7 more)

cs.DS 🏛 arXiv 📚 2 cites 11 months ago

R.I.P. 👻 Ghosted

Smoothed Analysis of Online Metric Matching with a Single Sample: Beyond Metric Distortion

Yingxi Li, Ellen Vitercik, Mingwei Yang

cs.DS 🏛 ITCS 📚 2 cites 8 months ago

R.I.P. 👻 Ghosted

Explaining the Inherent Tradeoffs for Suffix Array Functionality: Equivalences between String Problems and Prefix Range Queries

Dominik Kempa, Tomasz Kociumaka

cs.DS 🏛 arXiv 📚 2 cites 8 months ago