Algorithmica

Article	Citations
$$\alpha _i$$-Metric Graphs: Radius, Diameter and all Eccentricities	22
The Subfield and Extended Codes of a Subclass of Optimal Three-Weight Cyclic Codes	22
Parameterized Complexity of Minimum Membership Dominating Set	16
Minimum Hitting Set of Interval Bundles Problem: Computational Complexity and Approximability	14
Minimizing Energy Consumption for Real-Time Tasks on Heterogeneous Platforms Under Deadline and Reliability Constraints	12
Maximum Matching Sans Maximal Matching: A New Approach for Finding Maximum Matchings in the Data Stream Model	12
Particle-Based Assembly Using Precise Global Control	12
Agglomerative Clustering of Growing Squares	10
A Color-Avoiding Approach to Subgraph Counting in Bounded Expansion Classes	9
Conflict-Free Coloring: Graphs of Bounded Clique-Width and Intersection Graphs	9
Correlation Clustering and Two-Edge-Connected Augmentation for Planar Graphs	8
An Axiomatic Approach to Time-Dependent Shortest Path Oracles	8
Coloring Bridge-Free Antiprismatic Graphs	8
Few Cuts Meet Many Point Sets	8
Faster Algorithm for Finding Maximum 1-Restricted Simple 2-Matchings	8
Even More Effort Towards Improved Bounds and Fixed-Parameter Tractability for Multiwinner Rules	8
Maximum Matching in Almost Linear Time on Graphs of Bounded Clique-Width	8
Maximum Box Problem on Stochastic Points	7
On Approximating Degree-Bounded Network Design Problems	7
Online Unit Clustering and Unit Covering in Higher Dimensions	7
Enumeration of Maximal Common Subsequences Between Two Strings	7
Bounding the Inefficiency of Compromise in Opinion Formation	7
On the Tractability of Covering a Graph with 2-Clubs	7
Permutation-constrained Common String Partitions with Applications	7
Parameterised and Fine-Grained Subgraph Counting, Modulo 2	6

CNF Satisfiability in a Subspace and Related Problems	6
Faster Graph Coloring in Polynomial Space	6
Anti-factor is FPT Parameterized by Treewidth and List Size (but Counting is Hard)	6
Preface to the Special Issue on the 17th Algorithms and Data Structures Symposium (WADS 2021)	6
Restricted Max-Min Allocation: Integrality Gap and Approximation Algorithm	6
Parity Permutation Pattern Matching	6
A Simple Algorithm for Higher-Order Delaunay Mosaics and Alpha Shapes	6
The Fine-Grained Complexity of Multi-Dimensional Ordering Properties	6
The Time Complexity of Consensus Under Oblivious Message Adversaries	6
Special Issue Dedicated to the 16th International Symposium on Parameterized and Exact Computation	6
Conflict-Free Coloring Bounds on Open Neighborhoods	5
Group Activity Selection with Few Agent Types	5
Better Hardness Results for the Minimum Spanning Tree Congestion Problem	5
Additive Approximation of Generalized Turán Questions	5
Online Geometric Covering and Piercing	5
Graph Searches and Their End Vertices	5
Fast Mutation in Crossover-Based Algorithms	5
List Covering of Regular Multigraphs with Semi-edges	5
On the Maximum Number of Edges in Chordal Graphs of Bounded Degree and Matching Number	5
Mincut Sensitivity Data Structures for the Insertion of an Edge	4
Publisher Correction: Longest Common Substring with Approximately k Mismatches	4
Convergence of the Number of Period sets in Strings	4
Structure and Complexity of 2-Intersection Graphs of 3-Hypergraphs	4
Machine Covering in the Random-Order Model	4
Faster Cut Sparsification of Weighted Graphs	4
Computing Dense and Sparse Subgraphs of Weakly Closed Graphs	4
Linear-Time Recognition of Double-Threshold Graphs	4
A Combinatorial Cut-Toggling Algorithm for Solving Laplacian Linear Systems	4
Quantum Meets Fine-Grained Complexity: Sublinear Time Quantum Algorithms for String Problems	4
Improved FPT Algorithms for Deletion to Forest-Like Structures	4
Token Sliding on Graphs of Girth Five	4
Enumerating Minimal Solution Sets for Metric Graph Problems	4
General Lower Bounds and Improved Algorithms for Infinite–Domain CSPs	4
Guest Editorial: Special Issue on Theoretical Informatics	4
Linear-Time Algorithms for Maximum-Weight Induced Matchings and Minimum Chain Covers in Convex Bipartite Graphs	4
Nearly Time-Optimal Kernelization Algorithms for the Line-Cover Problem with Big Data	4
Connectivity with Uncertainty Regions Given as Line Segments	4
Computing Minimal Unique Substrings for a Sliding Window	4
Computing a Minimum Subset Feedback Vertex Set on Chordal Graphs Parameterized by Leafage	4
Lower Bounds from Fitness Levels Made Easy	4
On Scheduling Mechanisms Beyond the Worst Case	4
Special Issue Dedicated to 16th International Conference and Workshops on Algorithms and Computation, WALCOM 2022	4
Dynamic Averaging Load Balancing on Cycles	3
Contraction Bidimensionality of Geometric Intersection Graphs	3
Safety in s-t Paths, Trails and Walks	3
Introducing lop-Kernels: A Framework for Kernelization Lower Bounds	3
Self-Stabilizing and Private Distributed Shared Atomic Memory in Seldomly Fair Message Passing Networks	3
Dynamic Programming Approach to the Generalized Minimum Manhattan Network Problem	3
Fully Dynamic k-Center Clustering with Outliers	3
On Structural Parameterizations of the Harmless Set Problem	3

Dynamic Data Structures for Timed Automata Acceptance	3
Rare Siblings Speed-Up Deterministic Detection and Counting of Small Pattern Graphs	3
A Polynomial Kernel for Funnel Arc Deletion Set	3
Editor’s Note: Special Issue Dedicated to the 14th Latin American Theoretical Informatics Symposium	3
Posimodular Function Optimization	3
A Refined Branching Algorithm for the Maximum Satisfiability Problem	3
Fault Tolerant Depth First Search in Undirected Graphs: Simple Yet Efficient	3
How Fitness Aggregation Methods Affect the Performance of Competitive CoEAs on Bilinear Problems	3
Towards Constant-Factor Approximation for Chordal/Distance-Hereditary Vertex Deletion	3
Approximating Multistage Matching Problems	3
Parameterized Complexity of Directed Spanner Problems	3
Leader Election in Well-Connected Graphs	3
Preclustering Algorithms for Imprecise Points	3
Editorial	3
On the Parameterized Complexity of Maximum Degree Contraction Problem	3
Runtime Analysis with Variable Cost	3
Approximation Algorithms for Cost-robust Discrete Minimization Problems Based on their LP-Relaxations	3
Trade-Offs in Dynamic Coloring for Bipartite and General Graphs	3
Minimum Eccentricity Shortest Path Problem with Respect to Structural Parameters	3
Interweaving Real-Time Jobs with Energy Harvesting to Maximize Throughput	3
(Sub)linear Kernels for Edge Modification Problems Toward Structured Graph Classes	3
A #SAT Algorithm for Small Constant-Depth Circuits with PTF gates	3
Linear-Time MaxCut in Multigraphs Parameterized Above the Poljak-Turzík Bound	2
Approximation Algorithm for Vertex Cover with Multiple Covering Constraints	2
Finding Matching Cuts in H-Free Graphs	2
Component Order Connectivity in Directed Graphs	2
Computing Generalized Convolutions Faster Than Brute Force	2
Does Comma Selection Help to Cope with Local Optima?	2
Computing and Listing Avoidable Vertices and Paths	2
The Complexity of Finding and Enumerating Optimal Subgraphs to Represent Spatial Correlation	2
Analysis of Surrogate-Assisted Information-Geometric Optimization Algorithms	2
Shortest Beer Path Queries in Outerplanar Graphs	2
Enumeration of Support-Closed Subsets in Confluent Systems	2
Perfect Matchings with Crossings	2
Resource-Constrained Scheduling Algorithms for Stochastic Independent Tasks With Unknown Probability Distribution	2
Linear Space Data Structures for Finite Groups with Constant Query-Time	2
MAX CUT in Weighted Random Intersection Graphs and Discrepancy of Sparse Random Set Systems	2
Faster Minimization of Tardy Processing Time on a Single Machine	2
Streaming Dictionary Matching with Mismatches	2
An Extended Jump Functions Benchmark for the Analysis of Randomized Search Heuristics	2
Reforming an Envy-Free Matching	2
Matching Cuts in Graphs of High Girth and H-Free Graphs	2
The Farthest Color Voronoi Diagram in the Plane	2
Reconfiguration of the Union of Arborescences	2
Finding Geometric Facilities with Location Privacy	2
Constructing the first (and coolest) fixed-content universal cycle	2
Testing Connectedness of Images	2
Approximate Minimum Selection with Unreliable Comparisons	2
Correction: On the Parameterized Complexity of Controlling Amendment and Successive Winners	2
Connected Reconfiguration of Lattice-Based Cellular Structures by Finite-Memory Robots	2
Reconstructing Phylogenetic Trees from Multipartite Quartet Systems	2
Efficiently Approximating Vertex Cover on Scale-Free Networks with Underlying Hyperbolic Geometry	2
Refined Bounds on the Number of Eulerian Tours in Undirected Graphs	2
Reducing Graph Parameters by Contractions and Deletions	2
Small Candidate Set for Translational Pattern Search	2
Solving Target Set Selection with Bounded Thresholds Faster than $$2^n$$	2
Adaptive Succinctness	2
Online Paging with Heterogeneous Cache Slots	2
A Rigorous Runtime Analysis of the $$(1 + (\lambda , \lambda ))$$ GA on Jump Functions	2
Space-Efficient Data Structure for Next/Previous Larger/Smaller Value Queries	2
Competitive Vertex Recoloring	2
Algorithmic Meta-Theorems for Combinatorial Reconfiguration Revisited	2
Connected Subgraph Defense Games	2
On Finding the Best and Worst Orientations for the Metric Dimension	2
Selected Papers of the 32nd International Workshop on Combinatorial Algorithms, IWOCA 2021	2
Optimized Silent Self-Stabilizing Scheme for Tree-Based Constructions	2
A Constant–Factor Approximation Algorithm for Red–Blue Set Cover with Unit Disks	2
Bitonic st-Orderings for Upward Planar Graphs: Splits and Bends in the Variable Embedding Scenario	2
Tight Bounds for Online Weighted Tree Augmentation	2
Approximation Schemes for the Generalized Extensible Bin Packing Problem	2
On 3-Coloring of ($$2P_4,C_5$$)-Free Graphs	2
Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees	2
Level-Planar Drawings with Few Slopes	2
Reconfiguring Shortest Paths in Graphs	2
On the Complexity of Recognizing Wheeler Graphs	2
Stable Matchings, One-Sided Ties, and Approximate Popularity	1
Bounded-Angle Minimum Spanning Trees	1
The Online Broadcast Range-Assignment Problem	1
Integer Feasibility and Refutations in UTVPI Constraints Using Bit-Scaling	1
Local Geometric Spanners	1

Complexity Framework for Forbidden Subgraphs I: The Framework	1
Algorithms for Counting Minimum-Perimeter Lattice Animals	1
Complexity Issues on of Secondary Domination Number	1
On the Complexity of Binary Polynomial Optimization Over Acyclic Hypergraphs	1
Translation Invariant Fréchet Distance Queries	1
Lazy Queue Layouts of Posets	1
Reconfiguration of Spanning Trees with Degree Constraints or Diameter Constraints	1
Approximating the Geometric Edit Distance	1
Self-Adjusting Evolutionary Algorithms for Multimodal Optimization	1
Approximate Nearest Neighbor for Curves: Simple, Efficient, and Deterministic	1
Approximating Dynamic Weighted Vertex Cover with Soft Capacities	1
Editor’s Note: Special Issue on Genetic and Evolutionary Computation	1
A Practical Fixed-Parameter Algorithm for Constructing Tree-Child Networks from Multiple Binary Trees	1
Node Multiway Cut and Subset Feedback Vertex Set on Graphs of Bounded Mim-Width	1
Deterministic Dynamic Matching in Worst-Case Update Time	1
On The Closures of Monotone Algebraic Classes and Variants of the Determinant	1
Algorithms and Lower Bounds for Comparator Circuits from Shrinkage	1
Best-of-Both-Worlds Analysis of Online Search	1
Asymptotic Quasi-Polynomial Time Approximation Scheme for Resource Minimization for Fire Containment	1
Bandwidth Parameterized by Cluster Vertex Deletion Number	1
Improved Approximation Algorithms by Generalizing the Primal-Dual Method Beyond Uncrossable Functions	1
Preprocessing for Outerplanar Vertex Deletion: An Elementary Kernel of Quartic Size	1
Path Cover Problems with Length Cost	1
Data Structures for Computing Unique Palindromes in Static and Non-Static Strings	1
On Flipping the Fréchet Distance	1
Monotone Circuit Lower Bounds from Robust Sunflowers	1
Fast Exact Algorithms for Survivable Network Design with Uniform Requirements	1
A Weight-Scaling Algorithm for f-Factors of Multigraphs	1
Truthful Matching with Online Items and Offline Agents	1
The Compact Genetic Algorithm Struggles on Cliff Functions	1
On the Parameterized Complexity of Reconfiguration of Connected Dominating Sets	1
Online Metric Matching on the Line with Recourse	1
Combinatorics and Algorithms for Quasi-Chain Graphs	1
On the Fine-grained Parameterized Complexity of Partial Scheduling to Minimize the Makespan	1
More Precise Runtime Analyses of Non-elitist Evolutionary Algorithms in Uncertain Environments	1
Improved Bounds for Open Online Dial-a-Ride on the Line	1
Fast Exact Dynamic Time Warping on Run-Length Encoded Time Series	1
The Price of Hierarchical Clustering	1
Near-Optimal Quantum Algorithms for String Problems	1
Improved Upper Bounds on the Growth Constants of Polyominoes and Polycubes	1
Theoretical Analysis of Git Bisect	1
Sublinear Algorithms in T-Interval Dynamic Networks	1
Parameterized Complexity of Small Weight Automorphisms and Isomorphisms	1
Relaxing the Irrevocability Requirement for Online Graph Algorithms	1
Distinct Fringe Subtrees in Random Trees	1
Online Minimization of the Maximum Starting Time: Migration Helps	1
Optimal Algorithms for Online b-Matching with Variable Vertex Capacities	1
Parameterized Inapproximability of Independent Set in H-Free Graphs	1
Exponential-Time Quantum Algorithms for Graph Coloring Problems	1
Parameterized Complexity of Computing Maximum Minimal Blocking and Hitting Sets	1
Light Spanners for High Dimensional Norms via Stochastic Decompositions	1
Solving String Problems on Graphs Using the Labeled Direct Product	1
Monotone Arithmetic Complexity of Graph Homomorphism Polynomials	1
Fair Allocation of Indivisible Items with Conflict Graphs	1
A Framework for Adversarial Streaming Via Differential Privacy and Difference Estimators	1
Multistage s–t Path: Confronting Similarity with Dissimilarity	1
Hardness of Metric Dimension in Graphs of Constant Treewidth	1
$$\ell _p$$-Norm Multiway Cut	1
Min Orderings and List Homomorphism Dichotomies for Graphs and Signed Graphs	1
Structural Parameterizations for Equitable Coloring: Complexity, FPT Algorithms, and Kernelization	1
Composed Degree-Distance Realizations of Graphs	1
Combination Algorithms for Steiner Tree Variants	1
Strongly Polynomial FPTASes for Monotone Dynamic Programs	1
Polynomial Time Algorithms for Tracking Path Problems	1
Double String Tandem Repeats	1
Local Routing in Sparse and Lightweight Geometric Graphs	1
Line Intersection Searching Amid Unit Balls in 3-Space	1
Parameterized Study of Steiner Tree on Unit Disk Graphs	1
Finding Optimal Solutions with Neighborly Help	1
A Stronger Lower Bound on Parametric Minimum Spanning Trees	1
Recognizing Map Graphs of Bounded Treewidth	1
Boosting Double Coverage for k-Server via Imperfect Predictions	1
A Deterministic Parallel Reduction from Weighted Matroid Intersection Search to Decision	1
Symmetry Breaking in the Plane	1
Transmitting Once to Elect a Leader on Wireless Networks	1
The Near Exact Bin Covering Problem	1
Fourier Analysis Meets Runtime Analysis: Precise Runtimes on Plateaus	1
Galloping in Fast-Growth Natural Merge Sorts	1
Predecessor on the Ultra-Wide Word RAM	1
On Proper Labellings of Graphs with Minimum Label Sum	1
Online Coloring and a New Type of Adversary for Online Graph Problems	1
A Meta-Theorem for Distributed Certification	1
Parallel Online Algorithms for the Bin Packing Problem	1
Almost Universal Anonymous Rendezvous in the Plane	1
Computing Bend-Minimum Orthogonal Drawings of Plane Series–Parallel Graphs in Linear Time	1
Deterministic Constructions of High-Dimensional Sets with Small Dispersion	1
The Complexity of Routing Problems in Forbidden-Transition Graphs and Edge-Colored Graphs	1
A General Framework for Enumerating Equivalence Classes of Solutions	1
Fast and Simple Compact Hashing via Bucketing	1
Preface to the Special Issue on Parameterized and Exact Computation	1
Metric Violation Distance: Hardness and Approximation	1
On Maximizing Sums of Non-monotone Submodular and Linear Functions	1
Finding Optimal Triangulations Parameterized by Edge Clique Cover	1
One-Pass Additive-Error Subset Selection for $$\ell _{p}$$ Subspace Approximation and (k, p)-Clustering	1
Practical Budgeted Submodular Maximization	1