Sciweavers

120
Voted
ICALP
2009
Springer
16 years 21 days ago
Rumor Spreading in Social Networks
Social networks are an interesting class of graphs likely to become of increasing importance in the future, not only theoretically, but also for its probable applications to ad hoc...
Flavio Chierichetti, Silvio Lattanzi, Alessandro P...
114
Voted
ICALP
2009
Springer
16 years 21 days ago
LTL Path Checking Is Efficiently Parallelizable
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
Lars Kuhtz, Bernd Finkbeiner
ICALP
2009
Springer
16 years 21 days ago
Counting Subgraphs via Homomorphisms
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
Omid Amini, Fedor V. Fomin, Saket Saurabh
130
Voted
ICALP
2009
Springer
16 years 21 days ago
SDP-Based Algorithms for Maximum Independent Set Problems on Hypergraphs
Abstract. This paper deals with approximations of maximum independent sets in non-uniform hypergraphs of low degree. We obtain the first performance ratio that is sublinear in term...
Elena Losievskaja, Geir Agnarsson, Magnús M...
108
Voted
ICALP
2009
Springer
15 years 7 months ago
Assigning Papers to Referees
Refereed conferences require every submission to be reviewed by members of a program committee (PC) in charge of selecting the conference program. There are many software packages...
Kurt Mehlhorn
Programming Languages
Top of PageReset Settings