-
Diverse Pairs of Matchings Algorithmica (IF 1.1) Pub Date : 2024-03-15 Fedor V. Fomin, Petr A. Golovach, Lars Jaffke, Geevarghese Philip, Danil Sagunov
-
Linear Space Data Structures for Finite Groups with Constant Query-Time Algorithmica (IF 1.1) Pub Date : 2024-03-11
Abstract A finite group of order n can be represented by its Cayley table. In the word-RAM model the Cayley table of a group of order n can be stored using \(O(n^2)\) words and can be used to answer a multiplication query in constant time. It is interesting to ask if we can design a data structure to store a group of order n that uses \(o(n^2)\) space but can still answer a multiplication query in
-
Pattern Masking for Dictionary Matching: Theory and Practice Algorithmica (IF 1.1) Pub Date : 2024-03-06
Abstract Data masking is a common technique for sanitizing sensitive data maintained in database systems which is becoming increasingly important in various application areas, such as in record linkage of personal data. This work formalizes the Pattern Masking for Dictionary Matching (PMDM) problem: given a dictionary \(\mathscr {D}\) of d strings, each of length \(\ell \) , a query string q of length
-
Finding Optimal Solutions with Neighborly Help Algorithmica (IF 1.1) Pub Date : 2024-03-06 Elisabet Burjons, Fabian Frei, Edith Hemaspaandra, Dennis Komm, David Wehner
-
Stable Matchings, One-Sided Ties, and Approximate Popularity Algorithmica (IF 1.1) Pub Date : 2024-03-02 Telikepalli Kavitha
-
Minimal Roman Dominating Functions: Extensions and Enumeration Algorithmica (IF 1.1) Pub Date : 2024-02-14
Abstract Roman domination is one of the many variants of domination that keeps most of the complexity features of the classical domination problem. We prove that Roman domination behaves differently in two aspects: enumeration and extension. We develop non-trivial enumeration algorithms for minimal Roman dominating functions with polynomial delay and polynomial space. Recall that the existence of a
-
The Time Complexity of Consensus Under Oblivious Message Adversaries Algorithmica (IF 1.1) Pub Date : 2024-02-13 Kyrill Winkler, Ami Paz, Hugo Rincon Galeana, Stefan Schmid, Ulrich Schmid
-
Sublinear Time Eigenvalue Approximation via Random Sampling Algorithmica (IF 1.1) Pub Date : 2024-02-12 Rajarshi Bhattacharjee, Gregory Dexter, Petros Drineas, Cameron Musco, Archan Ray
-
On the Parameterized Intractability of Determinant Maximization Algorithmica (IF 1.1) Pub Date : 2024-02-03
Abstract In the Determinant Maximization problem, given an \(n \times n\) positive semi-definite matrix \({\textbf {A}} \) in \(\mathbb {Q}^{n \times n}\) and an integer k, we are required to find a \(k \times k\) principal submatrix of \({\textbf {A}} \) having the maximum determinant. This problem is known to be NP-hard and further proven to be W[1]-hard with respect to k by Koutis (Inf Process Lett
-
Exploration of High-Dimensional Grids by Finite State Machines Algorithmica (IF 1.1) Pub Date : 2024-01-29
Abstract We consider the problem of finding a “treasure” at an unknown point of an n-dimensional infinite grid, \(n\ge 3\) , by initially collocated finite automaton (FA) agents. Recently, the problem has been well characterized for 2 dimensions for deterministic as well as randomized FA agents, both in synchronous and semi-synchronous models (Brandt et al. in Proceedings of 32nd International Symposium
-
Improved FPT Algorithms for Deletion to Forest-Like Structures Algorithmica (IF 1.1) Pub Date : 2024-01-27 Kishen N. Gowda, Aditya Lonkar, Fahad Panolan, Vraj Patel, Saket Saurabh
-
An Efficient Algorithm for All-Pairs Bounded Edge Connectivity Algorithmica (IF 1.1) Pub Date : 2024-01-22 Shyan Akmal, Ce Jin
-
Truthful Matching with Online Items and Offline Agents Algorithmica (IF 1.1) Pub Date : 2024-01-16 Michal Feldman, Federico Fusco, Stefano Leonardi, Simon Mauras, Rebecca Reiffenhäuser
-
Predecessor on the Ultra-Wide Word RAM Algorithmica (IF 1.1) Pub Date : 2024-01-10 Philip Bille, Inge Li Gørtz, Tord Stordalen
-
Approximations for Throughput Maximization Algorithmica (IF 1.1) Pub Date : 2024-01-09 Dylan Hyatt-Denesik, Mirmahdi Rahgoshay, Mohammad R. Salavatipour
-
On Structural Parameterizations of the Harmless Set Problem Algorithmica (IF 1.1) Pub Date : 2024-01-09 Ajinkya Gaikwad, Soumen Maity
-
Connectivity with Uncertainty Regions Given as Line Segments Algorithmica (IF 1.1) Pub Date : 2024-01-09 Sergio Cabello, David Gajser
-
Domination and Cut Problems on Chordal Graphs with Bounded Leafage Algorithmica (IF 1.1) Pub Date : 2023-12-29 Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale
-
Approximation Algorithms for Multiprocessor Scheduling with Testing to Minimize the Total Job Completion Time Algorithmica (IF 1.1) Pub Date : 2023-12-23
Abstract In offline scheduling models, jobs are given with their exact processing times. In their online counterparts, jobs arrive in sequence together with their processing times and the scheduler makes irrevocable decisions on how to execute each of them upon its arrival. We consider a semi-online variant which has equally rich application background, called scheduling with testing, where the exact
-
Theoretical Analysis of Git Bisect Algorithmica (IF 1.1) Pub Date : 2023-12-21 Julien Courtiel, Paul Dorbec, Romain Lecoq
-
Stochastic Variance Reduction for DR-Submodular Maximization Algorithmica (IF 1.1) Pub Date : 2023-12-19 Yuefang Lian, Donglei Du, Xiao Wang, Dachuan Xu, Yang Zhou
Stochastic optimization has experienced significant growth in recent decades, with the increasing prevalence of variance reduction techniques in stochastic optimization algorithms to enhance computational efficiency. In this paper, we introduce two projection-free stochastic approximation algorithms for maximizing diminishing return (DR) submodular functions over convex constraints, building upon the
-
Maximum Weighted Independent Set: Effective Reductions and Fast Algorithms on Sparse Graphs Algorithmica (IF 1.1) Pub Date : 2023-12-15 Mingyu Xiao, Sen Huang, Xiaoyu Chen
-
Partial and Simultaneous Transitive Orientations via Modular Decompositions Algorithmica (IF 1.1) Pub Date : 2023-12-14 Miriam Münch, Ignaz Rutter, Peter Stumpf
-
Combinatorial Reallocation Mechanisms Algorithmica (IF 1.1) Pub Date : 2023-12-13 Liad Blumrosen, Shahar Dobzinski
We consider reallocation problems in settings where the initial endowment of each agent consists of a subset of the resources. The private information of the players is their value for every possible subset of the resources. The goal is to redistribute resources among agents to maximize efficiency. Monetary transfers are allowed, but participation is voluntary. We develop incentive-compatible, individually-rational
-
Server Cloud Scheduling Algorithmica (IF 1.1) Pub Date : 2023-12-10 Marten Maack, Friedhelm Meyer auf der Heide, Simon Pukrop
-
Complexity Issues on of Secondary Domination Number Algorithmica (IF 1.1) Pub Date : 2023-11-27 Joanna Raczek
-
Maximum Matching Sans Maximal Matching: A New Approach for Finding Maximum Matchings in the Data Stream Model Algorithmica (IF 1.1) Pub Date : 2023-11-28 Moran Feldman, Ariel Szarf
-
Approximation Algorithms for the Min–Max Mixed Rural Postmen Cover Problem and Its Variants Algorithmica (IF 1.1) Pub Date : 2023-11-23 Liting Huang, Wei Yu, Zhaohui Liu
-
On Maximizing Sums of Non-monotone Submodular and Linear Functions Algorithmica (IF 1.1) Pub Date : 2023-11-13 Benjamin Qi
-
Near-Optimal Search Time in $$\delta $$ -Optimal Space, and Vice Versa Algorithmica (IF 1.1) Pub Date : 2023-11-06 Tomasz Kociumaka, Gonzalo Navarro, Francisco Olivares
Two recent lower bounds on the compressibility of repetitive sequences, \(\delta \le \gamma \), have received much attention. It has been shown that a length-n string S over an alphabet of size \(\sigma \) can be represented within the optimal \(O(\delta \log \tfrac{n\log \sigma }{\delta \log n})\) space, and further, that within that space one can find all the occ occurrences in S of any length-m
-
A Deterministic Parallel Reduction from Weighted Matroid Intersection Search to Decision Algorithmica (IF 1.1) Pub Date : 2023-11-06 Sumanta Ghosh, Rohit Gurjar, Roshan Raj
-
On Finding Constrained Independent Sets in Cycles Algorithmica (IF 1.1) Pub Date : 2023-11-04 Ishay Haviv
-
Parameterised and Fine-Grained Subgraph Counting, Modulo 2 Algorithmica (IF 1.1) Pub Date : 2023-11-02 Leslie Ann Goldberg, Marc Roth
-
Minimizing the Maximum Flow Time in the Online Food Delivery Problem Algorithmica (IF 1.1) Pub Date : 2023-10-31 Xiangyu Guo, Shi Li, Kelin Luo, Yuhao Zhang
-
Counting Cycles on Planar Graphs in Subexponential Time Algorithmica (IF 1.1) Pub Date : 2023-10-30 Jin-Yi Cai, Ashwin Maran
-
Token Sliding on Graphs of Girth Five Algorithmica (IF 1.1) Pub Date : 2023-10-28 Valentin Bartier, Nicolas Bousquet, Jihad Hanna, Amer E. Mouawad, Sebastian Siebertz
-
Recognizing Map Graphs of Bounded Treewidth Algorithmica (IF 1.1) Pub Date : 2023-10-27 Patrizio Angelini, Michael A. Bekos, Giordano Da Lozzo, Martin Gronemann, Fabrizio Montecchiani, Alessandra Tappini
-
A Meta-Theorem for Distributed Certification Algorithmica (IF 1.1) Pub Date : 2023-10-25 Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Ioan Todinca
-
Randomized Strategies for Robust Combinatorial Optimization with Approximate Separation Algorithmica (IF 1.1) Pub Date : 2023-10-10 Yasushi Kawase, Hanna Sumita
-
Computing Generalized Convolutions Faster Than Brute Force Algorithmica (IF 1.1) Pub Date : 2023-10-06 Barış Can Esmer, Ariel Kulik, Dániel Marx, Philipp Schepper, Karol Węgrzycki
-
On Parameterized Complexity of Binary Networked Public Goods Game Algorithmica (IF 1.1) Pub Date : 2023-09-28 Arnab Maiti, Palash Dey
-
Comparison of Matrix Norm Sparsification Algorithmica (IF 1.1) Pub Date : 2023-09-25 Robert Krauthgamer, Shay Sapir
A well-known approach in the design of efficient algorithms, called matrix sparsification, approximates a matrix A with a sparse matrix \(A'\). Achlioptas and McSherry (J ACM 54(2):9-es, 2007) initiated a long line of work on spectral-norm sparsification, which aims to guarantee that \(\Vert A'-A\Vert \le \epsilon \Vert A\Vert \) for error parameter \(\epsilon >0\). Various forms of matrix approximation
-
The Subfield and Extended Codes of a Subclass of Optimal Three-Weight Cyclic Codes Algorithmica (IF 1.1) Pub Date : 2023-09-25 Félix Hernández, Gerardo Vega
-
The Online Broadcast Range-Assignment Problem Algorithmica (IF 1.1) Pub Date : 2023-09-05 Mark de Berg, Aleksandar Markovic, Seeun William Umboh
-
Unique Response Roman Domination: Complexity and Algorithms Algorithmica (IF 1.1) Pub Date : 2023-09-04 Sumanta Banerjee, Juhi Chaudhary, Dinabandhu Pradhan
-
Opinion Dynamics with Limited Information Algorithmica (IF 1.1) Pub Date : 2023-09-04 Dimitris Fotakis, Vardis Kandiros, Vasilis Kontonis, Stratis Skoulakis
-
Inapproximability of Positive Semidefinite Permanents and Quantum State Tomography Algorithmica (IF 1.1) Pub Date : 2023-09-03 Alexander Meiburg
-
Computing and Listing Avoidable Vertices and Paths Algorithmica (IF 1.1) Pub Date : 2023-09-04 Charis Papadopoulos, Athanasios E. Zisis
-
Data Structures for Computing Unique Palindromes in Static and Non-Static Strings Algorithmica (IF 1.1) Pub Date : 2023-08-30 Takuya Mieno, Mitsuru Funakoshi
-
On Colorful Vertex and Edge Cover Problems Algorithmica (IF 1.1) Pub Date : 2023-08-30 Sayan Bandyapadhyay, Aritra Banik, Sujoy Bhore
-
Probabilistic Analysis of Optimization Problems on Sparse Random Shortest Path Metrics Algorithmica (IF 1.1) Pub Date : 2023-08-26 Stefan Klootwijk, Bodo Manthey
Simple heuristics for (combinatorial) optimization problems often show a remarkable performance in practice. Worst-case analysis often falls short of explaining this performance. Because of this, “beyond worst-case analysis” of algorithms has recently gained a lot of attention, including probabilistic analysis of algorithms. The instances of many (combinatorial) optimization problems are essentially
-
Best-of-Both-Worlds Analysis of Online Search Algorithmica (IF 1.1) Pub Date : 2023-08-26 Spyros Angelopoulos, Christoph Dürr, Shendan Jin
-
List Covering of Regular Multigraphs with Semi-edges Algorithmica (IF 1.1) Pub Date : 2023-08-25 Jan Bok, Jiří Fiala, Nikola Jedličková, Jan Kratochvíl, Paweł Rzążewski
-
Deterministic Dynamic Matching in Worst-Case Update Time Algorithmica (IF 1.1) Pub Date : 2023-08-17 Peter Kiss
-
The Need for Seed (in the Abstract Tile Assembly Model) Algorithmica (IF 1.1) Pub Date : 2023-08-11 Andrew Alseth, Matthew J. Patitz
-
Refined Bounds on the Number of Eulerian Tours in Undirected Graphs Algorithmica (IF 1.1) Pub Date : 2023-08-11 Giulia Punzi, Alessio Conte, Roberto Grossi, Romeo Rizzi
-
Fully Dynamic k-Center Clustering with Outliers Algorithmica (IF 1.1) Pub Date : 2023-08-10 T.-H. Hubert Chan, Silvio Lattanzi, Mauro Sozio, Bo Wang
-
Even More Effort Towards Improved Bounds and Fixed-Parameter Tractability for Multiwinner Rules Algorithmica (IF 1.1) Pub Date : 2023-08-08 Sushmita Gupta, Pallavi Jain, Saket Saurabh, Nimrod Talmon
Multiwinner elections have proven to be a fruitful research topic with many real-world applications. We contribute to this line of research by improving the state of the art regarding the computational complexity of computing good committees. More formally, given a set of candidates \(\mathcal{C}\), a set of voters \(\mathcal{V}\)—each ranking the candidates according to their preferences, and an integer
-
Extended MSO Model Checking via Small Vertex Integrity Algorithmica (IF 1.1) Pub Date : 2023-08-08 Tatsuya Gima, Yota Otachi
-
Faster Algorithm for Finding Maximum 1-Restricted Simple 2-Matchings Algorithmica (IF 1.1) Pub Date : 2023-08-04 Stepan Artamonov, Maxim Babenko