Data Structures and Algorithms

Authors and titles for cs.DS in Oct 2022

[1]  arXiv:2210.00243 [pdf, ps, other]

Title: An experimental study of algorithms for obtaining a singly connected subgraph

Authors: Ahmed Zahloote, Al-hasan Saleh, Ayman Ghanem, Hiba Hasan, Asem Dreibaty, Ali Abodaraa, Nermeen Suleiman, Nour Naameh, Ali Ibrahim, Zeinab mahfoud

Subjects: Data Structures and Algorithms (cs.DS)

[2]  arXiv:2210.00655 [pdf, other]

Title: Online Pen Testing

Authors: Mingda Qiao, Gregory Valiant

Comments: To appear at ITCS 2023; v2 added discussion on a closely related work of Awerbuch, Azar, Fiat, and Leighton (1996)

Subjects: Data Structures and Algorithms (cs.DS); Computer Science and Game Theory (cs.GT)

[3]  arXiv:2210.01104 [pdf, ps, other]

Title: Local Computation of Maximal Independent Set

Authors: Mohsen Ghaffari

Comments: An extended abstract appears at FOCS'22

Subjects: Data Structures and Algorithms (cs.DS)

[4]  arXiv:2210.01475 [pdf, ps, other]

Title: Designing a parallel suffix sort

Authors: Kunal Chowdhury

Subjects: Data Structures and Algorithms (cs.DS)

[5]  arXiv:2210.01523 [pdf, other]

Title: Scheduling with Many Shared Resources

Authors: Max A. Deppert, Klaus Jansen, Marten Maack, Simon Pukrop, Malin Rau

Subjects: Data Structures and Algorithms (cs.DS)

[6]  arXiv:2210.01560 [pdf, other]

Title: SicHash -- Small Irregular Cuckoo Tables for Perfect Hashing

Authors: Hans-Peter Lehmann, Peter Sanders, Stefan Walzer

Subjects: Data Structures and Algorithms (cs.DS)

[7]  arXiv:2210.01888 [pdf, other]

Title: Bicriteria Approximation Algorithms for Priority Matroid Median

Authors: Tanvi Bajpai, Chandra Chekuri

Comments: 22 pages, 2 figures

Subjects: Data Structures and Algorithms (cs.DS); Machine Learning (cs.LG)

[8]  arXiv:2210.01897 [pdf, other]

Title: The DAG Visit approach for Pebbling and I/O Lower Bounds

Authors: Gianfranco Bilardi, Lorenzo De Stefani

Comments: Extended version of manuscript published in the Proceedings of FSTTCS22

Subjects: Data Structures and Algorithms (cs.DS)

[9]  arXiv:2210.01954 [pdf, other]

Title: Ruler Rolling

Authors: Xing Lyu, Travis Gagie, Meng He

Subjects: Data Structures and Algorithms (cs.DS)

[10]  arXiv:2210.02000 [pdf, other]

Title: Finding Top-k Longest Palindromes in Substrings

Authors: Kazuki Mitani, Takuya Mieno, Kazuhisa Seto, Takashi Horiyama

Subjects: Data Structures and Algorithms (cs.DS)

[11]  arXiv:2210.02067 [pdf, other]

Title: Computing maximal generalized palindromes

Authors: Mitsuru Funakoshi, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

Subjects: Data Structures and Algorithms (cs.DS)

[12]  arXiv:2210.02117 [pdf, other]

Title: Tight Lower Bounds for Problems Parameterized by Rank-width

Authors: Benjamin Bergougnoux, Tuukka Korhonen, Jesper Nederlof

Comments: Accepted to STACS'23

Subjects: Data Structures and Algorithms (cs.DS)

[13]  arXiv:2210.02167 [pdf, other]

Title: Faster parameterized algorithms for modification problems to minor-closed classes

Authors: Laure Morelle, Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos

Comments: 63 pages, 7 figures, abstract abbreviated to fit arXiv limitation

Subjects: Data Structures and Algorithms (cs.DS); Computational Complexity (cs.CC); Combinatorics (math.CO)

[14]  arXiv:2210.02292 [pdf, ps, other]

Title: Double-Ended Palindromic Trees: A Linear-Time Data Structure and Its Applications

Authors: Qisheng Wang, Ming Yang, Xinrui Zhu

Comments: Minor corrections and modifications. 67 pages, 3 tables, 15 algorithms

Subjects: Data Structures and Algorithms (cs.DS); Discrete Mathematics (cs.DM); Information Retrieval (cs.IR)

[15]  arXiv:2210.02361 [pdf, other]

Title: The Power of Duality: Response Time Analysis meets Integer Programming

Authors: Max A. Deppert, Klaus Jansen

Subjects: Data Structures and Algorithms (cs.DS); Discrete Mathematics (cs.DM)

[16]  arXiv:2210.02582 [pdf, other]

Title: Romeo and Juliet Meeting in Forest Like Regions

Authors: Neeldhara Misra, Manas Mulpuri, Prafullkumar Tale, Gaurav Viramgami

Comments: A shorter version of this work has been accepted for presentation at the 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), 2022

Subjects: Data Structures and Algorithms (cs.DS); Discrete Mathematics (cs.DM)

[17]  arXiv:2210.02611 [pdf, ps, other]

Title: $(1-ε)$-approximate fully dynamic densest subgraph: linear space and faster update time

Authors: Chandra Chekuri, Kent Quanrud

Subjects: Data Structures and Algorithms (cs.DS)

[18]  arXiv:2210.02672 [pdf, other]

Title: A Novel Maximum-Entropy-Driven Technique for Low-Rank Orthogonal Nonnegative Matrix Factorization with $\ell_0$-Norm sparsity Constraint

Authors: Salar Basiri, Srinivasa Salapaka

Subjects: Data Structures and Algorithms (cs.DS); Information Theory (cs.IT); Machine Learning (cs.LG); Probability (math.PR)

[19]  arXiv:2210.02835 [pdf, other]

Title: Sequentially Swapping Tokens: Further on Graph Classes

Authors: Hironori Kiya, Yuto Okada, Hirotaka Ono, Yota Otachi

Comments: 24 pages, 15 figures, SOFSEM 2023

Subjects: Data Structures and Algorithms (cs.DS)

[20]  arXiv:2210.03166 [pdf, other]

Title: The Power of Greedy for Online Minimum Cost Matching on the Line

Authors: Eric Balkanski, Yuri Faenza, Noemie Perivier

Subjects: Data Structures and Algorithms (cs.DS)

[21]  arXiv:2210.03811 [pdf, other]

Title: An Approximation Algorithm for Distance-Constrained Vehicle Routing on Trees

Authors: Marc Dufay, Claire Mathieu, Hang Zhou

Subjects: Data Structures and Algorithms (cs.DS)

[22]  arXiv:2210.03831 [pdf, ps, other]

Title: How to Make Your Approximation Algorithm Private: A Black-Box Differentially-Private Transformation for Tunable Approximation Algorithms of Functions with Low Sensitivity

Authors: Jeremiah Blocki, Elena Grigorescu, Tamalika Mukherjee, Samson Zhou

Subjects: Data Structures and Algorithms (cs.DS); Cryptography and Security (cs.CR)

[23]  arXiv:2210.03932 [pdf, other]

Title: A Finite Algorithm for the Realizabilty of a Delaunay Triangulation

Authors: Akanksha Agrawal, Saket Saurabh, Meirav Zehavi

Journal-ref: 17th International Symposium on Parameterized and Exact Computation (IPEC), 2022

Subjects: Data Structures and Algorithms (cs.DS); Computational Geometry (cs.CG)

[24]  arXiv:2210.03961 [pdf, ps, other]

Title: Dynamic Tensor Product Regression

Authors: Aravind Reddy, Zhao Song, Lichen Zhang

Comments: NeurIPS 2022

Subjects: Data Structures and Algorithms (cs.DS); Machine Learning (cs.LG)

[25]  arXiv:2210.04059 [pdf, other]

Title: Selection and Ordering Policies for Hiring Pipelines via Linear Programming

Authors: Boris Epstein, Will Ma (Columbia University)

Subjects: Data Structures and Algorithms (cs.DS)

[26]  arXiv:2210.04068 [pdf, other]

Title: IcebergHT: High Performance PMEM Hash Tables Through Stability and Low Associativity

Authors: Prashant Pandey, Michael A. Bender, Alex Conway, Martín Farach-Colton, William Kuszmaul, Guido Tagliavini, Rob Johnson

Subjects: Data Structures and Algorithms (cs.DS); Databases (cs.DB)

[27]  arXiv:2210.05000 [pdf, other]

Title: A Hierarchical Grouping Algorithm for the Multi-Vehicle Dial-a-Ride Problem

Authors: Kelin Luo, Alexandre M. Florio, Syamantak Das, Xiangyu Guo

Subjects: Data Structures and Algorithms (cs.DS)

[28]  arXiv:2210.05294 [pdf, other]

Title: Identifying Difficult exercises in an eTextbook Using Item Response Theory and Logged Data Analysis

Authors: Ahmed Abd Elrahman, Ahmed I. Taloba, Mohammed F. Farghally, Taysir Hassan A Soliman

Comments: 6 pages,5 figures

Subjects: Data Structures and Algorithms (cs.DS); Logic in Computer Science (cs.LO)

[29]  arXiv:2210.05385 [pdf, other]

Title: Enhancing Branch-and-Bound for Multi-Objective 0-1 Programming

Authors: Nicolas Forget, Sophie N. Parragh

Subjects: Data Structures and Algorithms (cs.DS)

[30]  arXiv:2210.05403 [pdf, other]

Title: Hierarchical Categories in Colored Searching

Authors: Peyman Afshani, Rasmus Killman, Kasper Green Larsen

Subjects: Data Structures and Algorithms (cs.DS); Computational Geometry (cs.CG)

[31]  arXiv:2210.05543 [pdf, ps, other]

Title: Parallel solutions for preemptive makespan scheduling on two identical machines

Authors: Leah Epstein

Subjects: Data Structures and Algorithms (cs.DS); Discrete Mathematics (cs.DM); Combinatorics (math.CO); Optimization and Control (math.OC)

[32]  arXiv:2210.05965 [pdf, ps, other]

Title: Resolving the Approximability of Offline and Online Non-monotone DR-Submodular Maximization over General Convex Sets

Authors: Loay Mualem, Moran Feldman

Comments: 29 pages, 4 figures

Subjects: Data Structures and Algorithms (cs.DS); Machine Learning (cs.LG)

[33]  arXiv:2210.05982 [pdf, other]

Title: A nearly optimal randomized algorithm for explorable heap selection

Authors: Sander Borst, Daniel Dadush, Sophie Huiberts, Danish Kashaev

Subjects: Data Structures and Algorithms (cs.DS); Optimization and Control (math.OC)

[34]  arXiv:2210.05992 [pdf, ps, other]

Title: Fast Convergence to Unanimity in Dense Erdős-Rényi Graphs

Authors: Ran Tamir

Comments: The introduction has been edited. arXiv admin note: text overlap with arXiv:2104.04996

Subjects: Data Structures and Algorithms (cs.DS); Distributed, Parallel, and Cluster Computing (cs.DC); Discrete Mathematics (cs.DM); Probability (math.PR)

[35]  arXiv:2210.06559 [pdf, other]

Title: Exact and approximation algorithms for sensor placement against DDoS attacks

Authors: Konstanty Junosza-Szaniawski, Dariusz Nogalski, Paweł Rzążewski

Subjects: Data Structures and Algorithms (cs.DS)

[36]  arXiv:2210.06703 [pdf, other]

Title: On the Minimum Cycle Cover problem on graphs with bounded co-degeneracy

Authors: Gabriel L. Duarte, Uéverton S. Souza

Subjects: Data Structures and Algorithms (cs.DS); Combinatorics (math.CO)

[37]  arXiv:2210.06714 [pdf, ps, other]

Title: Perfect matching cuts partitioning a graph into complementary subgraphs

Authors: Diane Castonguay, Erika M. M. Coelho, Hebert Coelho, Julliano R. Nascimento, Uéverton S. Souza

Subjects: Data Structures and Algorithms (cs.DS); Combinatorics (math.CO)

[38]  arXiv:2210.07018 [pdf, ps, other]

Title: Online matching with delays and stochastic arrival times

Authors: Mathieu Mari, Michał Pawłowski, Runtian Ren, Piotr Sankowski

Comments: 34 pages, 7 figures, accepted at AAMAS'23

Subjects: Data Structures and Algorithms (cs.DS)

[39]  arXiv:2210.07040 [pdf, other]

Title: Threshold Treewidth and Hypertree Width

Authors: Andre Schidler, Robert Ganian, Manuel Sorge, Stefan Szeider

Comments: 24 pages, 4 figures. An extended abstract appeared at IJCAI 2020. A full version appeared in the Journal of Artificial Intelligence Research

Journal-ref: Journal of Artificial Intelligence Research, 74:1687-1713, 2022

Subjects: Data Structures and Algorithms (cs.DS); Artificial Intelligence (cs.AI)

[40]  arXiv:2210.07146 [pdf, other]

Title: Efficient Algorithms for Obnoxious Facility Location on a Line Segment or Circle

Authors: Bowei Zhang

Subjects: Data Structures and Algorithms (cs.DS); Computational Geometry (cs.CG)

[41]  arXiv:2210.07219 [pdf, ps, other]

Title: Condition-number-independent convergence rate of Riemannian Hamiltonian Monte Carlo with numerical integrators

Authors: Yunbum Kook, Yin Tat Lee, Ruoqi Shen, Santosh S. Vempala

Comments: Improved writing & Theory for arXiv:2202.01908

Subjects: Data Structures and Algorithms (cs.DS); Machine Learning (cs.LG); Numerical Analysis (math.NA); Machine Learning (stat.ML)

[42]  arXiv:2210.07363 [pdf, other]

Title: The Power of Multi-Step Vizing Chains

Authors: Aleksander B G Christiansen

Comments: 42 pages, 5 figures

Subjects: Data Structures and Algorithms (cs.DS)

[43]  arXiv:2210.07534 [pdf, other]

Title: Time-Space Tradeoffs for Element Distinctness and Set Intersection via Pseudorandomness

Authors: Xin Lyu, Weihao Zhu

Comments: To appear in SODA 2023. Abstract shortened to fit into the requirement of arXiv

Subjects: Data Structures and Algorithms (cs.DS); Computational Complexity (cs.CC)

[44]  arXiv:2210.07556 [pdf, ps, other]

Title: A Constructive Prophet Inequality Approach to The Adaptive ProbeMax Problem

Authors: Guillermo Gallego, Danny Segev

Subjects: Data Structures and Algorithms (cs.DS)

[45]  arXiv:2210.07639 [pdf, ps, other]

Title: Parallel solutions for ordinal scheduling with a small number of machines

Authors: Leah Epstein

Subjects: Data Structures and Algorithms (cs.DS); Discrete Mathematics (cs.DM); Combinatorics (math.CO); Optimization and Control (math.OC)

[46]  arXiv:2210.07699 [pdf, ps, other]

Title: s-Club Cluster Vertex Deletion on Interval and Well-Partitioned Chordal Graphs

Authors: Dibyayan Chakraborty, L. Sunil Chandran, Sajith Padinhatteeri, Raji. R. Pillai

Subjects: Data Structures and Algorithms (cs.DS); Computational Complexity (cs.CC); Discrete Mathematics (cs.DM)

[47]  arXiv:2210.07722 [pdf, ps, other]

Title: (1,1)-Cluster Editing is Polynomial-time Solvable

Authors: Gregory Gutin, Anders Yeo

Subjects: Data Structures and Algorithms (cs.DS); Discrete Mathematics (cs.DM); Machine Learning (cs.LG); Combinatorics (math.CO)

[48]  arXiv:2210.07979 [pdf, other]

Title: Faster Space-Efficient STR-IC-LCS Computation

Authors: Yuki Yonemoto, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai

Comments: This is a full version of "Space-Efficient STR-IC-LCS Computation" presented at SOFSEM 2023

Journal-ref: Theoretical Computer Science, Volume 1003, 1 July 2024, 114607

Subjects: Data Structures and Algorithms (cs.DS)

[49]  arXiv:2210.08361 [pdf, ps, other]

Title: A Nearly Optimal Size Coreset Algorithm with Nearly Linear Time

Authors: Yichuan Deng, Zhao Song, Yitan Wang, Yuanyuan Yang

Subjects: Data Structures and Algorithms (cs.DS)

[50]  arXiv:2210.09806 [pdf, other]

Title: Capacitated Vehicle Routing in Graphic Metrics

Authors: Tobias Mömke, Hang Zhou

Subjects: Data Structures and Algorithms (cs.DS)