Realizing quantum speedup for practically relevant, computationally hard problems is a
central challenge in quantum information science. Using Rydberg atom arrays with up to …

Surrogate-based optimization, nature-inspired metaheuristics, and hybrid combinations
have become state of the art in algorithm design for solving real-world optimization …

Optimization and its related solving methods are becoming increasingly important in most
academic and industrial fields. The goal of the optimization process is to make a system or a …

The goal of this textbook is twofold. First, the book serves as an introduction to the field of
parameterized algorithms and complexity accessible to graduate students and advanced …

Abstract Harris Hawks Optimizer (HHO) is one of the many recent algorithms in the field of
metaheuristics. The HHO algorithm mimics the cooperative behavior of Harris Hawks and …

The last decade witnessed an ever-increasing stream of successes in Machine Learning
(ML). These successes offer clear evidence that ML is bound to become pervasive in a wide …

Abstract The Exponential Time Hypothesis (ETH) is a conjecture stating that, roughly
speaking, n-variable 3-SAT cannot be solved in time 2 o (n). In this chapter, we prove lower …

Let M=(E, I) be a matroid and let S={S 1, ċ, S t} be a family of subsets of E of size p. A
subfamily Ŝ⊆ S is q-representative for S if for every set Y⊆ E of size at most q, if there is a …

Introduction Coalitions are a central part of economic, political, and social life, and coalition
formation has been studied extensively within the mathematical social sciences. Agents (be …

We show that the maximum independent set problem on an n-vertex graph can be solved in
1.1996 nn O (1) time and polynomial space, which even is faster than Robson's 1.2109 nn O …