1 citations · 1 across the 4 of their papers we have counts for
4 papers
A Levelset Algorithm for 3D-Tarski
Sebastian Haslebacher, Jonas Lill
We present a simple new algorithm for finding a Tarski fixed point of a monotone function . Our algorithm runs in time and makes $O(\log^…
Query-Efficient Fixpoints of -Contractions
Sebastian Haslebacher, Jonas Lill, Patrick Schnider +1
We prove that an -approximate fixpoint of a map can be found with queries to if is $…
Linear-Time MaxCut in Multigraphs Parameterized Above the Poljak-Turzík Bound
Jonas Lill, Kalina Petrova, Simon Weber
MaxCut is a classical NP-complete problem and a crucial building block in many combinatorial algorithms. The famous Edwards-Erdős bound states that any connected graph on n vertice…
Graph-convolution neural network-based flexible docking utilizing coarse-grained distance matrix
Amr H. Mahmoud, Jonas F. Lill, Markus A. Lill
Prediction of protein-ligand complexes for flexible proteins remains still a challenging problem in computational structural biology and drug design. Here we present two novel deep…