Given a simple polygon P with m vertices and a set S of n points in the plane, we consider the problem of finding a rigid motion placement of P that contains the maximum number of...
Many computational problems in game theory, such as finding Nash equilibria, are algorithmically hard to solve. This limitation forces analysts to limit attention to restricted su...
This paper provides a comprehensive framework for the state space approach to Boolean networks. First, it surveys the authors' recent work on the topic: Using semitensor produ...
Background: Accurately covering the conformational space of amino acid side chains is essential for important applications such as protein design, docking and high resolution stru...
Tim Harder, Wouter Boomsma, Martin Paluszewski, Je...
Abstract. In this paper, we elaborate how decision space diversity can be integrated into indicator-based multiobjective search. We introduce DIOP, the diversity integrating multio...