🏛️ The Data Structures & Algorithms Crypt

R.I.P. 👻 Ghosted

Binarization Trees and Random Number Generation

Sung-il Pae

cs.DS 🏛 ISIT 📚 4 cites 10 years ago

R.I.P. 👻 Ghosted

Unshuffling Permutations

Samuele Giraudo, Stéphane Vialette

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

R.I.P. 👻 Ghosted

On Competitive Algorithms for Approximations of Top-k-Position Monitoring of Distributed Streams

Alexander Mäcker, Manuel Malatyali, Friedhelm Meyer auf der Heide

cs.DS 🏛 IPDPS 📚 4 cites 10 years ago

R.I.P. 👻 Ghosted

Constant-factor approximations for asymmetric TSP on nearly-embeddable graphs

Daniel Marx, Ario Salmasi, Anastasios Sidiropoulos

cs.DS 🏛 APPROX W 📚 4 cites 10 years ago

R.I.P. 👻 Ghosted

MRF-ZOOM: A Fast Dictionary Searching Algorithm for Magnetic Resonance Fingerprinting

Ze Wang

cs.DS 🏛 EMBC 📚 4 cites 11 years ago

R.I.P. 👻 Ghosted

Graph edit distance : a new binary linear programming formulation

Julien Lerouge, Zeina Abu-Aisheh, ... (+3 more)

cs.DS 🏛 arXiv 📚 4 cites 11 years ago

R.I.P. 👻 Ghosted

Maximium Priority Matchings

Jonathan Turner

cs.DS 🏛 arXiv 📚 4 cites 10 years ago

R.I.P. 👻 Ghosted

Tight Bounds for Gomory-Hu-like Cut Counting

Rajesh Chitnis, Lior Kamma, Robert Krauthgamer

cs.DS 🏛 WG W 📚 4 cites 10 years ago

R.I.P. 👻 Ghosted

Approximation Algorithms for Route Planning with Nonlinear Objectives

Ger Yang, Evdokia Nikolova

cs.DS 🏛 AAAI 📚 4 cites 10 years ago

R.I.P. 👻 Ghosted

Linear-Vertex Kernel for the Problem of Packing $r$-Stars into a Graph without Long Induced Paths

Florian Barbero, Gregory Gutin, ... (+3 more)

cs.DS 🏛 IPL 📚 4 cites 10 years ago

R.I.P. 👻 Ghosted

A Still Simpler Way of Introducing the Interior-Point Method for Linear Programming

Kurt Mehlhorn, Sanjeev Saxena

cs.DS 🏛 Computer Science Review 📚 4 cites 10 years ago

R.I.P. 👻 Ghosted

Parallel Query in the Suffix Tree

Matevž Jekovec, Andrej Brodnik

cs.DS 🏛 arXiv 📚 4 cites 10 years ago

R.I.P. 👻 Ghosted

Stable Nash Equilibria in the Gale-Shapley Matching Game

Sushmita Gupta, Kazuo Iwama, Shuichi Miyazaki

cs.DS 🏛 arXiv 📚 4 cites 10 years ago

R.I.P. 👻 Ghosted

L-Drawings of Directed Graphs

Patrizio Angelini, Giordano Da Lozzo, ... (+5 more)

cs.DS 🏛 ICCTTPI 📚 4 cites 10 years ago

R.I.P. 👻 Ghosted

Random Walks and Evolving Sets: Faster Convergences and Limitations

Siu On Chan, Tsz Chiu Kwok, Lap Chi Lau

cs.DS 🏛 SODA 📚 4 cites 11 years ago

R.I.P. 👻 Ghosted

A Fixed Parameter Tractable Approximation Scheme for the Optimal Cut Graph of a Surface

Vincent Cohen-Addad, Arnaud de Mesmay

cs.DS 🏛 ESA 📚 4 cites 11 years ago

R.I.P. 👻 Ghosted

Enumerating Cyclic Orientations of a Graph

Alessio Conte, Roberto Grossi, ... (+2 more)

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

R.I.P. 👻 Ghosted

Evaluate and Compare Two Utilization-Based Schedulability-Test Frameworks for Real-Time Systems

Jian-Jia Chen, Wen-Hung Huang, Cong Liu

cs.DS 🏛 arXiv 📚 4 cites 11 years ago

R.I.P. 👻 Ghosted

Evaluating the Potential of a Dual Randomized Kaczmarz Solver for Laplacian Linear Systems

Erik G. Boman, Kevin Deweese, John R. Gilbert

cs.DS 🏛 arXiv 📚 4 cites 11 years ago

R.I.P. 👻 Ghosted

Smoothed Analysis of the Minimum-Mean Cycle Canceling Algorithm and the Network Simplex Algorithm

Kamiel Cornelissen, Bodo Manthey

cs.DS 🏛 Cologne Twente Workshop on Graphs and Combinatorial Optimization 📚 4 cites 11 years ago

R.I.P. 👻 Ghosted

A Solution Merging Heuristic for the Steiner Problem in Graphs Using Tree Decompositions

Thomas Bosman

cs.DS 🏛 The Sea 📚 4 cites 11 years ago

R.I.P. 👻 Ghosted

Tabulation of Noncrossing Acyclic Digraphs

Marco Kuhlmann

cs.DS 🏛 arXiv 📚 4 cites 11 years ago

R.I.P. 👻 Ghosted

The Hardness of Subgraph Isomorphism

Marek Cygan, Jakub Pachocki, Arkadiusz Socała

cs.DS 🏛 arXiv 📚 4 cites 11 years ago

R.I.P. 👻 Ghosted

Random Projections for k-Means: Maintaining Coresets Beyond Merge & Reduce

Marc Bury, Chris Schwiegelshohn

cs.DS 🏛 arXiv 📚 4 cites 11 years ago