output
20032026
most citedLatency-Bounded Target Set Selection in Social Networks

66 citations

researchers with a paper here

Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.

collaborating institutions
Showing cs.DSShow all

5 papers · 1 filter

cs.DS2025★ 1 cited

Improving Online Bin Covering with Little Advice

Andrej Brodnik, Bengt J. Nilsson, Gordana Vujović

The online bin covering problem is: given an input sequence of items find a placement of the items in the maximum number of bins such that the sum of the items' sizes in each bin i…

cs.DS2015★ 2 cited

Parallel Query in the Suffix Tree

Matevž Jekovec, Andrej Brodnik

Given the query string of length , we explore a parallel query in a static suffix tree based data structure for , where is the number of processors and is the l…

cs.DS2013★ 66 cited

Latency-Bounded Target Set Selection in Social Networks

Ferdinando Cicalese, Gennaro Cordasco, Luisa Gargano +2

Motivated by applications in sociology, economy and medicine, we study variants of the Target Set Selection problem, first proposed by Kempe, Kleinberg and Tardos. In our scenario…

cs.DS2012

Speeding up shortest path algorithms

Andrej Brodnik, Marko Grgurovič

Given an arbitrary, non-negatively weighted, directed graph we present an algorithm that computes all pairs shortest paths in time $\mathcal{O}(m^* n + m \lg n + nT_ψ(m^*…

cs.DS2010★ 14 cited

Competitive Boolean Function Evaluation: Beyond Monotonicity, and the Symmetric Case

Ferdinando Cicalese, Travis Gagie, Eduardo Laber +1

We study the extremal competitive ratio of Boolean function evaluation. We provide the first non-trivial lower and upper bounds for classes of Boolean functions which are not inclu…