Algorithmica

Article	Citations
Monotone Arithmetic Complexity of Graph Homomorphism Polynomials	33
Parameterized Complexity of Minimum Membership Dominating Set	19
Grundy Coloring and Friends, Half-Graphs, Bicliques	15
Faster Algorithm for Finding Maximum 1-Restricted Simple 2-Matchings	14
Correlation Clustering and Two-Edge-Connected Augmentation for Planar Graphs	13
Preface to the Special Issue on Parameterized and Exact Computation	13
Editor’s Note: Special Issue Dedicated to the 14th Latin American Theoretical Informatics Symposium	12
$$\alpha _i$$-Metric Graphs: Radius, Diameter and all Eccentricities	11
A Cubic Vertex-Kernel for Trivially Perfect Editing	10
Unique Assembly Verification in Two-Handed Self-Assembly	10
Social Distancing Network Creation	9
The Subfield and Extended Codes of a Subclass of Optimal Three-Weight Cyclic Codes	8
Structural Parameterizations with Modulator Oblivion	8
On the Parameterized Complexity of Compact Set Packing	7
Recovering the Original Simplicity: Succinct and Exact Quantum Algorithm for the Welded Tree Problem	7
Best Fit Bin Packing with Random Order Revisited	7
New Partitioning Techniques and Faster Algorithms for Approximate Interval Scheduling	7
Efficient Isomorphism for $$S_d$$-Graphs and T-Graphs	7
Finding Optimal Solutions with Neighborly Help	7
Self-Adjusting Evolutionary Algorithms for Multimodal Optimization	6
On the Fine-grained Parameterized Complexity of Partial Scheduling to Minimize the Makespan	6
Finding Temporal Paths Under Waiting Time Constraints	6
Combinatorics and Algorithms for Quasi-Chain Graphs	6
Finding Optimal Triangulations Parameterized by Edge Clique Cover	6
Local Geometric Spanners	6

Tight Approximation Algorithms for Geometric Bin Packing with Skewed Items	6
Leader Election in Well-Connected Graphs	5
Stochastic Variance Reduction for DR-Submodular Maximization	5
Minimizing Energy Consumption for Real-Time Tasks on Heterogeneous Platforms Under Deadline and Reliability Constraints	5
A Color-Avoiding Approach to Subgraph Counting in Bounded Expansion Classes	5
Practical Budgeted Submodular Maximization	5
Particle-Based Assembly Using Precise Global Control	5
Public Bayesian Persuasion: Being Almost Optimal and Almost Persuasive	5
Even More Effort Towards Improved Bounds and Fixed-Parameter Tractability for Multiwinner Rules	5
Data Structures for Computing Unique Palindromes in Static and Non-Static Strings	5
On the Complexity of Binary Polynomial Optimization Over Acyclic Hypergraphs	5
Fast Exact Algorithms for Survivable Network Design with Uniform Requirements	5
Approximation Algorithms for the Two-Watchman Route in a Simple Polygon	5
Partial and Simultaneous Transitive Orientations via Modular Decompositions	5
A Comparative Study of Dictionary Matching with Gaps: Limitations, Techniques and Challenges	4
Online Bin Packing of Squares and Cubes	4
On Structural Parameterizations of the Harmless Set Problem	4
Tree Automata and Pigeonhole Classes of Matroids: I	4
Vertex Deletion into Bipartite Permutation Graphs	4
Graph Modification for Edge-Coloured and Signed Graph Homomorphism Problems: Parameterized and Classical Complexity	4
Probabilistic Analysis of Optimization Problems on Sparse Random Shortest Path Metrics	4
A New Lower Bound for Deterministic Truthful Scheduling	4
A #SAT Algorithm for Small Constant-Depth Circuits with PTF gates	4
$$\ell _p$$-Norm Multiway Cut	4
Producing Genomic Sequences after Genome Scaffolding with Ambiguous Paths: Complexity, Approximation and Lower Bounds	4
Minimum Hitting Set of Interval Bundles Problem: Computational Complexity and Approximability	4
Agglomerative Clustering of Growing Squares	4
Computing The Maximum Exponent in a Stream	4
Online Coloring and a New Type of Adversary for Online Graph Problems	4
Contraction Bidimensionality of Geometric Intersection Graphs	4
Space-Efficient Vertex Separators for Treewidth	4
On the Kernel and Related Problems in Interval Digraphs	4
The Compact Genetic Algorithm Struggles on Cliff Functions	3
Unique Response Roman Domination: Complexity and Algorithms	3
Dynamic Dictionaries for Multisets and Counting Filters with Constant Time Operations	3
A Polynomial Kernel for Bipartite Permutation Vertex Deletion	3
The Complexity of Two Colouring Games	3
Parameterized Complexity of Small Weight Automorphisms and Isomorphisms	3
Parameterized Approximation Algorithms and Lower Bounds for k-Center Clustering and Variants	3
A Deterministic Parallel Reduction from Weighted Matroid Intersection Search to Decision	3
Editor’s Note: Special Issue on Genetic and Evolutionary Computation	3
Maximum Matching Sans Maximal Matching: A New Approach for Finding Maximum Matchings in the Data Stream Model	3
1-Extendability of Independent Sets	3
Sample-Based Distance-Approximation for Subsequence-Freeness	3
Stagnation Detection in Highly Multimodal Fitness Landscapes	3
Rare Siblings Speed-Up Deterministic Detection and Counting of Small Pattern Graphs	3
On the Parameterized Complexity of Maximum Degree Contraction Problem	3
Special Issue Dedicated to the 14th International Symposium on Parameterized and Exact Computation	3
Maximum Box Problem on Stochastic Points	3
Online Metric Matching on the Line with Recourse	3

Special Issue of Algorithmica for the 28th London Stringology Days & London Algorithmic Workshop (LSD & LAW)	3
On the Parameterized Intractability of Determinant Maximization	3
Preface of the Special Issue Dedicated to Selected Papers from IWOCA 2022	3
Fixed Parameter Multi-Objective Evolutionary Algorithms for the W-Separator Problem	3
Conflict-Free Coloring: Graphs of Bounded Clique-Width and Intersection Graphs	3
Minimum Eccentricity Shortest Path Problem with Respect to Structural Parameters	3
A Refined Branching Algorithm for the Maximum Satisfiability Problem	3
Winner Determination Algorithms for Graph Games with Matching Structures	3
A Stronger Lower Bound on Parametric Minimum Spanning Trees	3
Translation Invariant Fréchet Distance Queries	3
Diverse Pairs of Matchings	3
Galloping in Fast-Growth Natural Merge Sorts	3
Improved Algorithms for Distance Selection and Related Problems	3
Truthful Matching with Online Items and Offline Agents	3
Counting Temporal Paths	3
A Simple Algorithm for Higher-Order Delaunay Mosaics and Alpha Shapes	2
Internal Dictionary Matching	2
Analysing Equilibrium States for Population Diversity	2
Online Minimization of the Maximum Starting Time: Migration Helps	2
Counting Cycles on Planar Graphs in Subexponential Time	2
Approximation Algorithms for Replenishment Problems with Fixed Turnover Times	2
Bounded-Angle Minimum Spanning Trees	2
On H-Topological Intersection Graphs	2
Asymptotic Quasi-Polynomial Time Approximation Scheme for Resource Minimization for Fire Containment	2
Approximation Algorithms for Covering Vertices by Long Paths	2
Lazy Queue Layouts of Posets	2
Local Routing in Sparse and Lightweight Geometric Graphs	2
Line Intersection Searching Amid Unit Balls in 3-Space	2
Improved Bounds for Open Online Dial-a-Ride on the Line	2
$${\mathcal {U}}$$-Bubble Model for Mixed Unit Interval Graphs and Its Applications: The MaxCut Problem Revisited	2
On the Tractability of Covering a Graph with 2-Clubs	2
Approximation Algorithms for Cost-robust Discrete Minimization Problems Based on their LP-Relaxations	2
Few Cuts Meet Many Point Sets	2
Euclidean Maximum Matchings in the Plane—Local to Global	2
FREIGHT: Fast Streaming Hypergraph Partitioning	2
Reachability of Fair Allocations via Sequential Exchanges	2
On the d-Claw Vertex Deletion Problem	2
The Impacts of Dimensionality, Diffusion, and Directedness on Intrinsic Cross-Model Simulation in Tile-Based Self-Assembly	2
Complexity Framework for Forbidden Subgraphs I: The Framework	2
Asymptotic Analysis of q-Recursive Sequences	2
Almost-Smooth Histograms and Sliding-Window Graph Algorithms	2
Double String Tandem Repeats	2
Dynamic Programming Approach to the Generalized Minimum Manhattan Network Problem	2
More Precise Runtime Analyses of Non-elitist Evolutionary Algorithms in Uncertain Environments	2
A General Framework for Enumerating Equivalence Classes of Solutions	2
On Girth and the Parameterized Complexity of Token Sliding and Token Jumping	2
Introducing lop-Kernels: A Framework for Kernelization Lower Bounds	2
Improved Upper Bounds on the Growth Constants of Polyominoes and Polycubes	2
Extending Partial Representations of Circle Graphs in Near-Linear Time	2
Approximating Long Cycle Above Dirac’s Guarantee	2
Fault Tolerant Depth First Search in Undirected Graphs: Simple Yet Efficient	2
Runtime Analysis of Competitive Co-evolutionary Algorithms for Maximin Optimisation of a Bilinear Function	2
Convex-Straight-Skeleton Voronoi Diagrams for Segments and Convex Polygons	2
The Online Broadcast Range-Assignment Problem	2
On Parameterized Complexity of Binary Networked Public Goods Game	2
Minmax Centered k-Partitioning of Trees and Applications to Sink Evacuation with Dynamic Confluent Flows	2
The Largest Connected Subgraph Game	2
Near-Optimal Search Time in $$\delta $$-Optimal Space, and Vice Versa	2
Parameterized Complexity of Computing Maximum Minimal Blocking and Hitting Sets	2
Algorithms for p-Faulty Search on a Half-Line	2
On the Parameterized Complexity of Reconfiguration of Connected Dominating Sets	2
Parameterized Complexity of $$(A,\ell )$$-Path Packing	1
Randomized Online Computation with High Probability Guarantees	1
Bounding the Inefficiency of Compromise in Opinion Formation	1
Linear-Time Recognition of Double-Threshold Graphs	1
Simulated Annealing is a Polynomial-Time Approximation Scheme for the Minimum Spanning Tree Problem	1
Additive Approximation of Generalized Turán Questions	1
Permutation-constrained Common String Partitions with Applications	1
Subexponential Parameterized Algorithms and Kernelization on Almost Chordal Graphs	1
The Near Exact Bin Covering Problem	1
Computing Bend-Minimum Orthogonal Drawings of Plane Series–Parallel Graphs in Linear Time	1
Algorithms for Counting Minimum-Perimeter Lattice Animals	1
Approximation Algorithms for Maximally Balanced Connected Graph Partition	1
List Covering of Regular Multigraphs with Semi-edges	1
Maximum Matching in Almost Linear Time on Graphs of Bounded Clique-Width	1
C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual Carving-Width	1
A Constant–Factor Approximation Algorithm for Red–Blue Set Cover with Unit Disks	1
Parameterised and Fine-Grained Subgraph Counting, Modulo 2	1
On Subgraph Complementation to H-free Graphs	1
Online Unit Profit Knapsack with Predictions	1

Restricted Max-Min Allocation: Integrality Gap and Approximation Algorithm	1
Approximation Algorithms for the Min–Max Mixed Rural Postmen Cover Problem and Its Variants	1
Runtime Analyses of the Population-Based Univariate Estimation of Distribution Algorithms on LeadingOnes	1
Approximate and Randomized Algorithms for Computing a Second Hamiltonian Cycle	1
Tight Bounds for Chordal/Interval Vertex Deletion Parameterized by Treewidth	1
Polynomial-time Combinatorial Algorithm for General Max–Min Fair Allocation	1
Limitations of the Impagliazzo–Nisan–Wigderson Pseudorandom Generator Against Permutation Branching Programs	1
Towards Constant-Factor Approximation for Chordal/Distance-Hereditary Vertex Deletion	1
Algorithms for Matrix Multiplication via Sampling and Opportunistic Matrix Multiplication	1
Symmetry Breaking in the Plane	1
Connected k-Center and k-Diameter Clustering	1
Counting Induced Subgraphs: An Algebraic Approach to #W[1]-Hardness	1
On Colorful Vertex and Edge Cover Problems	1
CNF Satisfiability in a Subspace and Related Problems	1
An Axiomatic Approach to Time-Dependent Shortest Path Oracles	1
Analysis of Surrogate-Assisted Information-Geometric Optimization Algorithms	1
Resource-Constrained Scheduling Algorithms for Stochastic Independent Tasks With Unknown Probability Distribution	1
Reconstructing Phylogenetic Trees from Multipartite Quartet Systems	1
Special Issue Dedicated to the 16th International Symposium on Parameterized and Exact Computation	1
On The Closures of Monotone Algebraic Classes and Variants of the Determinant	1
Reconfiguration of Spanning Trees with Degree Constraints or Diameter Constraints	1
On 3-Coloring of ($$2P_4,C_5$$)-Free Graphs	1
Facility Reallocation on the Line	1
Efficient Parameter Estimation of Truncated Boolean Product Distributions	1
An Efficient Algorithm for All-Pairs Bounded Edge Connectivity	1
Tight Bounds for Online Weighted Tree Augmentation	1
Polynomial Time Algorithms for Tracking Path Problems	1
Publisher Correction: Longest Common Substring with Approximately k Mismatches	1
The Time Complexity of Consensus Under Oblivious Message Adversaries	1
Improved Merlin–Arthur Protocols for Central Problems in Fine-Grained Complexity	1
Theoretical Analysis of Git Bisect	1
Conflict-Free Coloring Bounds on Open Neighborhoods	1
Posimodular Function Optimization	1
Preface to the Special Issue on the 17th Algorithms and Data Structures Symposium (WADS 2021)	1
An Efficient Algorithm for Power Dominating Set	1
Edge Exploration of Temporal Graphs	1
On the Complexity of Broadcast Domination and Multipacking in Digraphs	1
Top Tree Compression of Tries	1
Enumeration of Support-Closed Subsets in Confluent Systems	1
Sub-exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number	1
Computing Balanced Convex Partitions of Lines	1
New Algorithms for Steiner Tree Reoptimization	1
Online Multiset Submodular Cover	1
Correction to: Outer 1-Planar Graphs	1
Encoding Two-Dimensional Range Top-k Queries	1
Comparison of Matrix Norm Sparsification	1
Safety in s-t Paths, Trails and Walks	1
Near Isometric Terminal Embeddings for Doubling Metrics	1
Parity Permutation Pattern Matching	1
Maximizing Dominance in the Plane and its Applications	1
Domination and Cut Problems on Chordal Graphs with Bounded Leafage	1
Eulerian Walks in Temporal Graphs	1
Approximate Nearest Neighbor for Curves: Simple, Efficient, and Deterministic	1
Relaxing the Irrevocability Requirement for Online Graph Algorithms	1
On Approximating Degree-Bounded Network Design Problems	1
Better Hardness Results for the Minimum Spanning Tree Congestion Problem	1
Predecessor on the Ultra-Wide Word RAM	1
On the Parameterized Complexity of Bend-Minimum Orthogonal Planarity	1
Multidimensional Period Recovery	1
On the Maximum Number of Edges in Chordal Graphs of Bounded Degree and Matching Number	1
Computing and Listing Avoidable Vertices and Paths	1
Opinion Dynamics with Limited Information	1
Strongly Polynomial FPTASes for Monotone Dynamic Programs	1
A Faster Reduction of the Dynamic Time Warping Distance to the Longest Increasing Subsequence Length	1
Anti-factor is FPT Parameterized by Treewidth and List Size (but Counting is Hard)	1
Improved Bounds for Metric Capacitated Covering Problems	1
Selected Papers of the 32nd International Workshop on Combinatorial Algorithms, IWOCA 2021	1
The Fine-Grained Complexity of Multi-Dimensional Ordering Properties	1
A Meta-Theorem for Distributed Certification	1
Fast Mutation in Crossover-Based Algorithms	1
On the Complexity of Finding Large Odd Induced Subgraphs and Odd Colorings	1
Approximations for Throughput Maximization	1
Universal Slope Sets for Upward Planar Drawings	1
Faster Graph Coloring in Polynomial Space	1
Optimal Algorithms for Online b-Matching with Variable Vertex Capacities	1
Online Unit Clustering and Unit Covering in Higher Dimensions	1
Fixed-Target Runtime Analysis	1
Online Geometric Covering and Piercing	1
A Practical Fixed-Parameter Algorithm for Constructing Tree-Child Networks from Multiple Binary Trees	1
Complexity and Approximation for Discriminating and Identifying Code Problems in Geometric Setups	1
Network Design under General Wireless Interference	1
Analysis of the (1+1) EA on LeadingOnes with Constraints	1
Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees	1
Enumeration of Maximal Common Subsequences Between Two Strings	1
Improved FPT Algorithms for Deletion to Forest-Like Structures	0
Enumerating Minimal Solution Sets for Metric Graph Problems	0
Non-crossing Hamiltonian Paths and Cycles in Output-Polynomial Time	0
Partition Strategies for the Maker–Breaker Domination Game	0
Mechanisms for (Mis)allocating Scientific Credit	0
Fast and Longest Rollercoasters	0
Approximation Schemes for the Generalized Extensible Bin Packing Problem	0
Planar Drawings with Few Slopes of Halin Graphs and Nested Pseudotrees	0
Energy Constrained Depth First Search	0
Hardness of Metric Dimension in Graphs of Constant Treewidth	0
Approximating Dynamic Weighted Vertex Cover with Soft Capacities	0