This work proves an adaptive running time bound O(kn), where k < m is the size of a minimum feedback edge set of the input graph, and provides a strengthened worst-case running time analysis for betweenness centrality algorithms.Expand

For the new betweenness centrality algorithm, the running time upper bound O(kn), where k is the size of a minimum feedback edge set of the input graph, is proved.Expand

This work studies the constructive and destructive voter control problems when adding and deleting voters have a combinatorial flavor, and analyzes the computational complexity of the four Voter control problems for the Plurality rule.Expand

We consider the setting of asynchronous opinion diffusion with majority threshold: given a social network with each agent assigned to one opinion, an agent will update its opinion if more than half… Expand

The semidefinite approach is abandoned and purely combinatorial approximation algorithms for special cases of MaxQP where $A$ is sparse are designed, which are superior to the semideFinite approach in terms of running time, yet are still competitive in Terms of their approximation guarantees.Expand

Ran Yaacoby, Nathan Schaar, Leon Kellerhals, Oren Raz, Danny Hermelin, and Rami Pugatch 4 Dept. of Complex Systems, Weizmann Institute of Science, Rehovot 7610001, Israel Technische Universität… Expand

Different problem models for placing wildlife crossings, such as green bridges, over human-made obstacles to challenge habitat fragmentation are developed from a computational complexity and parameterized algorithmics perspective.Expand

This paper provides the first fixed-parameter algorithm for the VNEP with running time O(3r(s+r²)) for requests and substrates of r and s nodes, respectively, which makes it comparable in speed to the well-established ViNE heuristic while providing optimal solutions.Expand