| Optimal Static and Self-Adjusting Parameter Choices for the (1+(lambda plus lambda)) Genetic Algorithm |
12 |
| The (1+lambda) Evolutionary Algorithm with Self-Adjusting Mutation Rate |
6 |
| Upper Bounds on the Running Time of the Univariate Marginal Distribution Algorithm on OneMax |
6 |
| On the Choice of the Update Strength in Estimation-of-Distribution Algorithms and Ant Colony Optimization |
5 |
| LZ77 Computation Based on the Run-Length Encoded BWT |
5 |
| Level-Based Analysis of the Univariate Marginal Distribution Algorithm |
5 |
| Subexponential-Time Algorithms for Maximum Independent Set in P-t-Free and Broom-Free Graphs |
4 |
| A Theory and Algorithms for Combinatorial Reoptimization |
4 |
| Independent Feedback Vertex Set for P5-Free Graphs |
4 |
| Model-Based Segmentation and Classification of Trajectories |
4 |
| How to Escape Local Optima in Black Box Optimisation: When Non-elitism Outperforms Elitism |
3 |
| Effect of Gromov-Hyperbolicity Parameter on Cuts and Expansions in Graphs and Some Algorithmic Implications |
3 |
| Sublinear-Time Algorithms for Counting Star Subgraphs via Edge Sampling |
3 |
| Dictionary Matching with a Bounded Gap in Pattern or in Text |
3 |
| Deleting Vertices to Graphs of Bounded Genus |
3 |
| How Much Does a Treedepth Modulator Help to Obtain Polynomial Kernels Beyond Sparse Graphs? |
3 |
| Track Layouts, Layered Path Decompositions, and Leveled Planarity |
3 |
| Explicit Linear Kernels for Packing Problems |
3 |
| Lempel-Ziv Factorization Powered by Space Efficient Suffix Trees |
3 |
| The (1+1) Elitist Black-Box Complexity of LeadingOnes |
3 |
| Approximation Schemes for Minimizing the Maximum Lateness on a Single Machine with Release Times Under Non-availability or Deadline Constraints |
3 |
| Improved Approximation Algorithms for the Maximum Happy Vertices and Edges Problems |
3 |
| Running Time Analysis of the (1+1)-EA for OneMax and LeadingOnes Under Bit-Wise Noise |
3 |
| Clustered Planarity with Pipes |
3 |
| Mind the Gap!: Online Dictionary Matching with One Gap |
3 |
| Computing the Number of Induced Copies of a Fixed Graph in a Bounded Degree Graph |
3 |
| An -Approximation for Covering and Packing Minor Models of |
2 |
| Stretch and Diameter in Random Geometric Graphs |
2 |
| Tree Compression Using String Grammars |
2 |
| On the Planar Split Thickness of Graphs |
2 |
| Polynomial Cases for the Vertex Coloring Problem |
2 |
| Distributed Methods for Computing Approximate Equilibria |
2 |
| An Efficient Randomized Algorithm for Higher-Order Abstract Voronoi Diagrams |
2 |
| How Unsplittable-Flow-Covering Helps Scheduling with Job-Dependent Cost Functions |
2 |
| Algorithms Parameterized by Vertex Cover and Modular Width, Through Potential Maximal Cliques |
2 |
| Simpler and Better Approximation Algorithms for the Unweighted Minimum Label s-t Cut Problem |
2 |
| Reoptimization Time Analysis of Evolutionary Algorithms on Linear Functions Under Dynamic Uniform Constraints |
2 |
| Algorithms for Communication Scheduling in Data Gathering Network with Data Compression |
2 |
| The Densest Subgraph Problem with a Convex/Concave Size Function |
2 |
| Approximating (Unweighted) Tree Augmentation via Lift-and-Project, Part II |
2 |
| Linear Kernels and Linear-Time Algorithms for Finding Large Cuts |
2 |
| Frechet Distance Between a Line and Avatar Point Set |
2 |
| Discovering Small Target Sets in Social Networks: A Fast and Effective Algorithm |
2 |
| Optimal Approximation Algorithms for Maximum Distance-Bounded Subgraph Problems |
2 |
| Optimal Mutation Rates for the (1+lambda) EA on OneMax Through Asymptotically Tight Drift Analysis |
2 |
| Static and Self-Adjusting Mutation Strengths for Multi-valued Decision Variables |
2 |
| Temporal Network Optimization Subject to Connectivity Constraints |
2 |
| Optimal Composition Ordering Problems for Piecewise Linear Functions |
2 |
| The A Priori Traveling Repairman Problem |
2 |
| Upper Domination: Towards a Dichotomy Through Boundary Properties |
2 |
