13 citations · 16 across the 10 of their papers we have counts for
10 papers
Optimal Scalability-Aware Allocation of Swarm Robots: From Linear to Retrograde Performance via Marginal Gains
Simay Atasoy Bingöl, Tobias Töpfer, Sven Kosub +2
In collective systems, the available agents are a limited resource that must be allocated among tasks to maximize collective performance. Computing the optimal allocation of severa…
A Note on Polynomial Certificates for Walk Inequalities
Nadja Willenborg, Sven Kosub
Let denote the total number of walks of length in an undirected graph . Spectral decomposition shows that is a moment sequence of a finite posit…
Global Evaluation for Decision Tree Learning
Fabian Spaeh, Sven Kosub
We transfer distances on clusterings to the building process of decision trees, and as a consequence extend the classical ID3 algorithm to perform modifications based on the global…
Smoothed Analysis of Trie Height by Star-like PFAs
Stefan Eckhardt, Sven Kosub, Johannes Nowak
Tries are general purpose data structures for information retrieval. The most significant parameter of a trie is its height which equals the length of the longest common prefix…
A Note on the Complexity of Manipulating Weighted Schulze Voting
Julian Müller, Sven Kosub
We prove that the constructive weighted coalitional manipulation problem for the Schulze voting rule can be solved in polynomial time for an unbounded number of candidates and an u…
A note on the triangle inequality for the Jaccard distance
Sven Kosub
Two simple proofs of the triangle inequality for the Jaccard distance in terms of nonnegative, monotone, submodular functions are given and discussed.