Data Structures and Algorithms

Authors and titles for cs.DS in Feb 2023

[1]  arXiv:2302.00052 [pdf, other]

Title: Exploring Wedges of an Oriented Grid by an Automaton with Pebbles

Authors: Subhash Bhagat, Andrzej Pelc

Subjects: Data Structures and Algorithms (cs.DS)

[2]  arXiv:2302.00112 [pdf, ps, other]

Title: Adding an Edge in a $P_4$-sparse Graph

Authors: Anna Mpanti, Stavros D. Nikolopoulos, Leonidas Palios

Subjects: Data Structures and Algorithms (cs.DS)

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

Title: Sublinear Approximation Schemes for Scheduling Precedence Graphs of Bounded Depth

Authors: Bin Fu, Yumei Huo, Hairong Zhao

Subjects: Data Structures and Algorithms (cs.DS)

[4]  arXiv:2302.00213 [pdf, other]

Title: Approximating Red-Blue Set Cover and Minimum Monotone Satisfying Assignment

Authors: Eden Chlamtáč, Yury Makarychev, Ali Vakilian

Comments: APPROX 2023

Subjects: Data Structures and Algorithms (cs.DS)

[5]  arXiv:2302.00248 [pdf, ps, other]

Title: A Nearly-Optimal Bound for Fast Regression with $\ell_\infty$ Guarantee

Authors: Zhao Song, Mingquan Ye, Junze Yin, Lichen Zhang

Comments: Abstract shortened to meet arxiv requirement

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

[6]  arXiv:2302.00360 [pdf, other]

Title: Faster maximal clique enumeration in large real-world link streams

Authors: Alexis Baudin, Clémence Magnien, Lionel Tabourier

Comments: 28 pages, 6 figure, 5 tables, tu be published in Journal of Graph Algorithms and Applications

Subjects: Data Structures and Algorithms (cs.DS); Computational Complexity (cs.CC); Information Retrieval (cs.IR); Social and Information Networks (cs.SI)

[7]  arXiv:2302.00458 [pdf, other]

Title: Improved Exact and Heuristic Algorithms for Maximum Weight Clique

Authors: Roman Erhardt, Kathrin Hanauer, Nils Kriege, Christian Schulz, Darren Strash

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

[8]  arXiv:2302.00630 [pdf, ps, other]

Title: Parameterized Algorithms for Colored Clustering

Authors: Leon Kellerhals, Tomohiro Koana, Pascal Kunz, Rolf Niedermeier

Subjects: Data Structures and Algorithms (cs.DS)

[9]  arXiv:2302.00657 [pdf, ps, other]

Title: Adding a Tail in Classes of Perfect Graphs

Authors: Anna Mpanti, Stavros D. Nikolopoulos, Leonidas Palios

Subjects: Data Structures and Algorithms (cs.DS)

[10]  arXiv:2302.00724 [pdf, other]

Title: Order-Preserving Squares in Strings

Authors: Paweł Gawrychowski, Samah Ghazawi, Gad M. Landau

Subjects: Data Structures and Algorithms (cs.DS); Formal Languages and Automata Theory (cs.FL)

[11]  arXiv:2302.00985 [pdf, other]

Title: Speed-Oblivious Online Scheduling: Knowing (Precise) Speeds is not Necessary

Authors: Alexander Lindermayr, Nicole Megow, Martin Rapp

Comments: To appear at ICML 2023

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

[12]  arXiv:2302.01373 [pdf, ps, other]

Title: Optimal Heaviest Induced Ancestors

Authors: Panagiotis Charalampopoulos, Bartłomiej Dudek, Paweł Gawrychowski, Karol Pokorski

Subjects: Data Structures and Algorithms (cs.DS)

[13]  arXiv:2302.01748 [pdf, other]

Title: Chaining of Maximal Exact Matches in Graphs

Authors: Nicola Rizzo, Manuel Cáceres, Veli Mäkinen

Comments: 17 pages, 2 figures

Subjects: Data Structures and Algorithms (cs.DS)

[14]  arXiv:2302.02056 [pdf, other]

Title: Sketch-Flip-Merge: Mergeable Sketches for Private Distinct Counting

Authors: Jonathan Hehir, Daniel Ting, Graham Cormode

Comments: 28 pages, 5 figures

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

[15]  arXiv:2302.02215 [pdf, other]

Title: On 2-strong connectivity orientations of mixed graphs and related problems

Authors: Loukas Georgiadis, Dionysios Kefallinos, Evangelos Kosinas

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

[16]  arXiv:2302.02290 [pdf, other]

Title: Maximal $k$-Edge-Connected Subgraphs in Weighted Graphs via Local Random Contraction

Authors: Chaitanya Nalam, Thatchaphol Saranurak

Subjects: Data Structures and Algorithms (cs.DS)

[17]  arXiv:2302.02567 [pdf, other]

Title: Stochastic Minimum Vertex Cover in General Graphs: a $3/2$-Approximation

Authors: Mahsa Derakhshan, Naveen Durvasula, Nika Haghtalab

Subjects: Data Structures and Algorithms (cs.DS)

[18]  arXiv:2302.02586 [pdf, other]

Title: Optimal LZ-End Parsing is Hard

Authors: Hideo Bannai, Mitsuru Funakoshi, Kazuhiro Kurita, Yuto Nakashima, Kazuhisa Seto, Takeaki Uno

Subjects: Data Structures and Algorithms (cs.DS)

[19]  arXiv:2302.02644 [pdf, other]

Title: Models and algorithms for simple disjunctive temporal problems

Authors: Carlo S. Sartori, Pieter Smet, Greet Vanden Berghe

Comments: 29 pages, under review

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

[20]  arXiv:2302.03143 [pdf, ps, other]

Title: Sparsification of Monotone $k$-Submodular Functions of Low Curvature

Authors: Jannik Kudla, Stanislav Živný

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

[21]  arXiv:2302.03239 [pdf, ps, other]

Title: Calibrated Recommendations for Users with Decaying Attention

Authors: Jon Kleinberg, Emily Ryu, Éva Tardos

Comments: 24 pages, 1 figure. This paper incorporates and supersedes our earlier paper arXiv:2203.00233

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

[22]  arXiv:2302.03245 [pdf, other]

Title: Two Parallel PageRank Algorithms via Improving Forward Push

Authors: Qi Zhang, Rongxia Tang, Zhengan Yao, Jun Liang

Subjects: Data Structures and Algorithms (cs.DS); Numerical Analysis (math.NA)

[23]  arXiv:2302.03317 [pdf, other]

Title: Engineering Shared-Memory Parallel Shuffling to Generate Random Permutations In-Place

Authors: Manuel Penschuck

Subjects: Data Structures and Algorithms (cs.DS)

[24]  arXiv:2302.03451 [pdf, other]

Title: The Solidarity Cover Problem

Authors: Eran Rosenbluth

Subjects: Data Structures and Algorithms (cs.DS); Computational Complexity (cs.CC); Computational Geometry (cs.CG); Combinatorics (math.CO); Optimization and Control (math.OC)

[25]  arXiv:2302.03627 [pdf, other]

Title: Tight algorithms for connectivity problems parameterized by clique-width

Authors: Falko Hegerfeld, Stefan Kratsch

Comments: shortened abstract due to character limit; 56 pages, 11 figures

Subjects: Data Structures and Algorithms (cs.DS)