14 citations · 26 across the 10 of their papers we have counts for
22 papers
The Keplerian Traveling Salesperson Problem
Max Bannach, Giacomo Acciarini, Dario Izzo
We address a fundamental challenge in space mission design and space logistics: planning interplanetary trajectories for missions that must rendezvous with multiple bodies. Such mi…
#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought?
Max Bannach, Erik D. Demaine, Timothy Gomez +1
The canonical class in the realm of counting complexity is #P. It is well known that the problem of counting the models of a propositional formula in disjunctive normal form (#DNF)…
Strong Structural Bounds for MaxSAT: The Fine Details of Using Neuromorphic and Quantum Hardware Accelerators
Max Bannach, Jai Grover, Markus Hecher
Hardware accelerators like quantum annealers or neuromorphic chips are capable of finding the ground state of a Hamiltonian. A promising route in utilizing these devices is via met…
Asteroid Mining: ACT&Friends' Results for the GTOC 12 Problem
Dario Izzo, Marcus Märtens, Laurent Beauregard +8
In 2023, the 12th edition of Global Trajectory Competition was organised around the problem referred to as "Sustainable Asteroid Mining". This paper reports the developments that l…
Certifying Guidance & Control Networks: Uncertainty Propagation to an Event Manifold
Sebastien Origer, Dario Izzo, Giacomo Acciarini +4
We perform uncertainty propagation on an event manifold for Guidance & Control Networks (G&CNETs), aiming to enhance the certification tools for neural networks in this field. This…
On the Descriptive Complexity of Vertex Deletion Problems
Max Bannach, Florian Chudigiewitsch, Till Tantau
Vertex deletion problems for graphs are studied intensely in classical and parameterized complexity theory. They ask whether we can delete at most k vertices from an input graph su…