Algorithmica

Article	Citations
Coloring Bridge-Free Antiprismatic Graphs	18
Conflict-Free Coloring: Graphs of Bounded Clique-Width and Intersection Graphs	14
$$\alpha _i$$-Metric Graphs: Radius, Diameter and all Eccentricities	13
Faster Algorithm for Finding Maximum 1-Restricted Simple 2-Matchings	12
Even More Effort Towards Improved Bounds and Fixed-Parameter Tractability for Multiwinner Rules	12
A Color-Avoiding Approach to Subgraph Counting in Bounded Expansion Classes	12
The Subfield and Extended Codes of a Subclass of Optimal Three-Weight Cyclic Codes	12
Correlation Clustering and Two-Edge-Connected Augmentation for Planar Graphs	11
Maximum Matching Sans Maximal Matching: A New Approach for Finding Maximum Matchings in the Data Stream Model	11
Parameterized Complexity of Minimum Membership Dominating Set	10
Minimizing Energy Consumption for Real-Time Tasks on Heterogeneous Platforms Under Deadline and Reliability Constraints	10
On the Tractability of Covering a Graph with 2-Clubs	9
A Simple Algorithm for Higher-Order Delaunay Mosaics and Alpha Shapes	8
Few Cuts Meet Many Point Sets	8
Permutation-constrained Common String Partitions with Applications	8
Preface to the Special Issue on the 17th Algorithms and Data Structures Symposium (WADS 2021)	7
Special Issue Dedicated to the 16th International Symposium on Parameterized and Exact Computation	7
Anti-factor is FPT Parameterized by Treewidth and List Size (but Counting is Hard)	7
Segment Proximity Graphs and Nearest Neighbor Queries amid Disjoint Segments	7
The Time Complexity of Consensus Under Oblivious Message Adversaries	6
List Covering of Regular Multigraphs with Semi-edges	6
Parity Permutation Pattern Matching	6
Faster Graph Coloring in Polynomial Space	6
The Fine-Grained Complexity of Multi-Dimensional Ordering Properties	6
Computing Pivot-Minors	5

Tight Runtime Bounds for Evolutionary Algorithms on Sorting and Crossing Minimisation for Layered Graph Drawings	5
A Combinatorial Cut-Toggling Algorithm for Solving Laplacian Linear Systems	5
Parameterised and Fine-Grained Subgraph Counting, Modulo 2	5
Fault-Tolerant ST-Diameter Oracles	5
Special Issue Dedicated to 16th International Conference and Workshops on Algorithms and Computation, WALCOM 2022	5
Publisher Correction: Longest Common Substring with Approximately k Mismatches	5
Connectivity with Uncertainty Regions Given as Line Segments	5
Certificates in P and Subquadratic-Time Computation of Radius, Diameter, and all Eccentricities in Graphs	5
Better Hardness Results for the Minimum Spanning Tree Congestion Problem	5
Quantum Meets Fine-Grained Complexity: Sublinear Time Quantum Algorithms for String Problems	5
Computing the Minimum Bottleneck Moving Spanning Tree	5
Online Geometric Covering and Piercing	5
Convergence of the Number of Period sets in Strings	5
Group Activity Selection with Few Agent Types	5
Approximation Algorithms for Clustering with Minimum Sum of Radii, Diameters, and Squared Radii	5
Nearly Time-Optimal Kernelization Algorithms for the Line-Cover Problem with Big Data	4
A Flexible Evolutionary Algorithm with Dynamic Mutation Rate Archive	4
Self-Stabilizing and Private Distributed Shared Atomic Memory in Seldomly Fair Message Passing Networks	4
On Structural Parameterizations of the Harmless Set Problem	4
Editor’s Note: Special Issue Dedicated to the 14th Latin American Theoretical Informatics Symposium	4
How Fitness Aggregation Methods Affect the Performance of Competitive CoEAs on Bilinear Problems	4
A General Upper Bound for the Runtime of a Coevolutionary Algorithm on Impartial Combinatorial Games	4
On Scheduling Mechanisms Beyond the Worst Case	4
A Fast Algorithm for Computing Zigzag Representatives	4
Computing Dense and Sparse Subgraphs of Weakly Closed Graphs	4
Guest Editorial: Special Issue on Theoretical Informatics	4
Trade-Offs in Dynamic Coloring for Bipartite and General Graphs	4
Fully Dynamic k-Center Clustering with Outliers	4
Leader Election in Well-Connected Graphs	4
Minimum Eccentricity Shortest Path Problem with Respect to Structural Parameters	4
Interweaving Real-Time Jobs with Energy Harvesting to Maximize Throughput	4
Faster Cut Sparsification of Weighted Graphs	4
Ex-post Stability under Two-Sided Matching: Complexity and Characterization	4
Enumerating Minimal Solution Sets for Metric Graph Problems	4
Dynamic Data Structures for Timed Automata Acceptance	4
Improved FPT Algorithms for Deletion to Forest-Like Structures	4
Reforming an Unfair Allocation by Exchanging Goods	4
Rare Siblings Speed-Up Deterministic Detection and Counting of Small Pattern Graphs	4
General Lower Bounds and Improved Algorithms for Infinite–Domain CSPs	4
Bipartite Independent Set Reconfiguration: General and RNA-Inspired Parameterized Algorithms	4
Computing a Minimum Subset Feedback Vertex Set on Chordal Graphs Parameterized by Leafage	4
Token Sliding on Graphs of Girth Five	4
A General Technique for Searching in Implicit Sets via Function Inversion	3
A Constant–Factor Approximation Algorithm for Red–Blue Set Cover with Unit Disks	3
From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem	3
The Farthest Color Voronoi Diagram in the Plane	3
Plus Strategies are Exponentially Slower for Planted Optima of Random Height	3
Correction: On the Parameterized Complexity of Controlling Amendment and Successive Winners	3
Efficiently Approximating Vertex Cover on Scale-Free Networks with Underlying Hyperbolic Geometry	3
Linear Space Data Structures for Finite Groups with Constant Query-Time	3

Reducing Graph Parameters by Contractions and Deletions	3
Finding Matching Cuts in H-Free Graphs	3
Linear-Time MaxCut in Multigraphs Parameterized Above the Poljak-Turzík Bound	3
ShockHash: Near Optimal-Space Minimal Perfect Hashing Beyond Brute-Force	3
Computing Generalized Convolutions Faster Than Brute Force	3
Testing Connectedness of Images	3
Towards a Practical, Budget-Oblivious Algorithm for the Adwords Problem Under Small Bids	3
Correction: Certificates in P and Subquadratic-Time Computation of Radius, Diameter, and all Eccentricities in Graphs	3
Computing and Listing Avoidable Vertices and Paths	3
Bitonic st-Orderings for Upward Planar Graphs: Splits and Bends in the Variable Embedding Scenario	3
Runtime Analysis with Variable Cost	3
Refined Bounds on the Number of Eulerian Tours in Undirected Graphs	3
Finding Geometric Facilities with Location Privacy	3
Reconfiguring Shortest Paths in Graphs	3
The Voronoi Diagram of Rotating Rays with Applications to Floodlight Illumination	3
Selected Papers of the 32nd International Workshop on Combinatorial Algorithms, IWOCA 2021	3
On the Parameterized Complexity of Eulerian Strong Component Arc Deletion	3
Analysis of Surrogate-Assisted Information-Geometric Optimization Algorithms	3
Concentration of Submodular Functions and Read-k Families Under Negative Dependence	3
The Complexity of Finding and Enumerating Optimal Subgraphs to Represent Spatial Correlation	3
Resource-Constrained Scheduling Algorithms for Stochastic Independent Tasks With Unknown Probability Distribution	3
MAX CUT in Weighted Random Intersection Graphs and Discrepancy of Sparse Random Set Systems	3
Constructing the first (and coolest) fixed-content universal cycle	3
On computing vertex connectivity of 1-planar graphs	3
Reforming an Envy-Free Matching	3
Boosting Double Coverage for k-Server via Imperfect Predictions	2
On Flipping the Fréchet Distance	2
Combination Algorithms for Steiner Tree Variants	2
Online Paging with Heterogeneous Cache Slots	2
Space-Efficient Data Structure for Next/Previous Larger/Smaller Value Queries	2
A Lower Bound on the Trace Norm of Boolean Matrices and its Applications	2
A Clique-Based Separator for Intersection Graphs of Geodesic Disks in $$\mathbb {R}^2$$	2
One-Pass Additive-Error Subset Selection for $$\ell _{p}$$ Subspace Approximation and (k, p)-Clustering	2
Maximum Independent Set when Excluding an Induced Minor: $$K_1 + tK_2$$ and $$tC_3 \uplus C_4$$	2
Double String Tandem Repeats	2
Approximation Algorithms for Directed Weighted Spanners	2
Monotone Arithmetic Complexity of Graph Homomorphism Polynomials	2
Min Orderings and List Homomorphism Dichotomies for Graphs and Signed Graphs	2
Finding Optimal Solutions with Neighborly Help	2
Multistage s–t Path: Confronting Similarity with Dissimilarity	2
Convex relaxation for the generalized maximum-entropy sampling problem	2
Matching Cuts in Graphs of High Girth and H-Free Graphs	2
Shortest Beer Path Queries in Outerplanar Graphs	2
Recognition Complexity of Subgraphs of $${\textbf {k}}$$-Connected Planar Cubic Graphs	2
A Weight-Scaling Algorithm for f-Factors of Multigraphs	2
Oriented Spanners	2
Line Intersection Searching Amid Unit Balls in 3-Space	2
The Price of Hierarchical Clustering	2
Fully Characterizing Lossy Catalytic Computation	2
The Compact Genetic Algorithm Struggles on Cliff Functions	2
Counting Polyominoes, Revisited	2
Stable Matchings, One-Sided Ties, and Approximate Popularity	2
Solving Target Set Selection with Bounded Thresholds Faster than $$2^n$$	2
Perfect Matchings with Crossings	2
Reconfiguration of the Union of Arborescences	2
Competitive Vertex Recoloring	2
On Finding the Best and Worst Orientations for the Metric Dimension	2
Algorithmic Meta-Theorems for Combinatorial Reconfiguration Revisited	2
Lazy Queue Layouts of Posets	2
On the Complexity of Binary Polynomial Optimization Over Acyclic Hypergraphs	2
Algorithms for Counting Minimum-Perimeter Lattice Animals	2
More Precise Runtime Analyses of Non-elitist Evolutionary Algorithms in Uncertain Environments	1
Improved Approximation Algorithms by Generalizing the Primal-Dual Method Beyond Uncrossable Functions	1
Shortest Two Disjoint Paths in Conservative Graphs	1
Geometric Thickness of Multigraphs is $$\exists \mathbb {R}$$-Complete	1
Online Metric Matching on the Line with Recourse	1
Sub-exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number	1
Delaunay-Like Triangulation of Smooth Orientable Submanifolds by $$\ell _1$$-Norm Minimization	1
Galloping in Fast-Growth Natural Merge Sorts	1
On a Traveling Salesman Problem for Points in the Unit Cube	1
The Near Exact Bin Covering Problem	1
Better Distance Labeling for Unweighted Planar Graphs	1
Recognizing Map Graphs of Bounded Treewidth	1
Eulerian Walks in Temporal Graphs	1
Complexity Issues on of Secondary Domination Number	1
Structural Parameterizations for Equitable Coloring: Complexity, FPT Algorithms, and Kernelization	1
Distinct Fringe Subtrees in Random Trees	1
Fast Exact Dynamic Time Warping on Run-Length Encoded Time Series	1
Fourier Analysis Meets Runtime Analysis: Precise Runtimes on Plateaus	1
A Framework for Adversarial Streaming Via Differential Privacy and Difference Estimators	1

Constrained Truthful Obnoxious Two-Facility Location with Optional Preferences	1
Graph Exploration: The Impact of a Distance Constraint	1
Predecessor on the Ultra-Wide Word RAM	1
Complexity Framework for Forbidden Subgraphs I: The Framework	1
A Deterministic Parallel Reduction from Weighted Matroid Intersection Search to Decision	1
Fast and Simple Sorting Using Partial Information	1
Achieving Tight $$O(4^k)$$ Runtime Bounds on Jumpk by Proving that Genetic Algorithms Evolve Near-Maximal Population Diversity	1
Fair Allocation of Indivisible Items with Conflict Graphs	1
On Colorful Vertex and Edge Cover Problems	1
The Online Broadcast Range-Assignment Problem	1
Improved Bounds for Open Online Dial-a-Ride on the Line	1
MUL-Tree Pruning for Consistency and Compatibility	1
Symmetry Breaking in the Plane	1
Exploration of High-Dimensional Grids by Finite State Machines	1
A Meta-Theorem for Distributed Certification	1
Optimal Algorithms for Online b-Matching with Variable Vertex Capacities	1
Analysis of the (1+1) EA on LeadingOnes with Constraints	1
Deterministic Dynamic Matching in Worst-Case Update Time	1
On Equivalence of Parameterized Inapproximability of k-Median, k-Max-Coverage, and 2-CSP	1
On The Closures of Monotone Algebraic Classes and Variants of the Determinant	1
Integer Feasibility and Refutations in UTVPI Constraints Using Bit-Scaling	1
Distributed Model Checking on Graphs of Bounded Treedepth	1
Composed Degree-Distance Realizations of Graphs	1
Computing Bend-Minimum Orthogonal Drawings of Plane Series–Parallel Graphs in Linear Time	1
Parameterized Study of Steiner Tree on Unit Disk Graphs	1
Parallel Online Algorithms for the Bin Packing Problem	1
A Stronger Lower Bound on Parametric Minimum Spanning Trees	1
Data Structures for Computing Unique Palindromes in Static and Non-Static Strings	1
Parameterized Inapproximability of Independent Set in H-Free Graphs	1
Zip-zip Trees: Making Zip Trees More Balanced, Biased, Compact, or Persistent	1
Truthful Matching with Online Items and Offline Agents	1
Online Minimization of the Maximum Starting Time: Migration Helps	1
Tight Bounds for Chordal/Interval Vertex Deletion Parameterized by Treewidth	1
Approximation Algorithms for Covering Vertices by Long Paths	1
Finding d-Cuts in Graphs of Bounded Diameter, Graphs of Bounded Radius and H-Free Graphs	1
A General Framework for Enumerating Equivalence Classes of Solutions	1
Reconfiguration of Spanning Trees with Degree Constraints or Diameter Constraints	1
Peak Demand Minimization via Sliced Strip Packing	1
Approximate Nearest Neighbor for Curves: Simple, Efficient, and Deterministic	1
A Tight $$(3/2+\varepsilon )$$-Approximation for Skewed Strip Packing	1
Near-Optimal Quantum Algorithms for String Problems	1
Theoretical Analysis of Git Bisect	1
Decidability of Fully Quantum Nonlocal Games with Noisy Maximally Entangled States	1
Sublinear Algorithms in T-Interval Dynamic Networks	1
Path Cover Problems with Length Cost	1
Transmitting Once to Elect a Leader on Wireless Networks	1
Best-of-Both-Worlds Analysis of Online Search	1
Algorithms and Lower Bounds for Comparator Circuits from Shrinkage	1
The Complexity of Routing Problems in Forbidden-Transition Graphs and Edge-Colored Graphs	1
Parameterized Complexity of Computing Maximum Minimal Blocking and Hitting Sets	1
Combinatorics and Algorithms for Quasi-Chain Graphs	1
Bandwidth Parameterized by Cluster Vertex Deletion Number	1
On Maximizing Sums of Non-monotone Submodular and Linear Functions	1
Practical Budgeted Submodular Maximization	1
Almost Universal Anonymous Rendezvous in the Plane	1