6 citations · 18 across the 14 of their papers we have counts for
Showing 2016Show all
3 papers · 1 filter
cs.DS2016★ 1 cited
Incremental and Fully Dynamic Subgraph Connectivity For Emergency Planning
Monika Henzinger, Stefan Neumann
During the last 10 years it has become popular to study dynamic graph problems in a emergency planning or sensitivity setting: Instead of considering the general fully dynamic prob…
cs.DM2016
What You Will Gain By Rounding: Theory and Algorithms for Rounding Rank
Stefan Neumann, Rainer Gemulla, Pauli Miettinen
When factorizing binary matrices, we often have to make a choice between using expensive combinatorial methods that retain the discrete nature of the data and using continuous meth…
cs.CC2016★ 2 cited
This House Proves that Debating is Harder than Soccer
Stefan Neumann, Andreas Wiese
During the last twenty years, a lot of research was conducted on the sport elimination problem: Given a sports league and its remaining matches, we have to decide whether a given t…