Issue 3/2011
Special Issue: Selected Papers from the 15th International Computing and Combinatorics Conference
Content (13 Articles)
Open Access
On the readability of monotone Boolean formulae
Khaled Elbassioni, Kazuhisa Makino, Imran Rauf
Honeynet games: a game theoretic approach to defending network monitors
Jin-Yi Cai, Vinod Yegneswaran, Chris Alfeld, Paul Barford
Online tree node assignment with resource augmentation
Joseph Wun-Tat Chan, Francis Y. L. Chin, Hing-Fung Ting, Yong Zhang
On the performances of Nash equilibria in isolation games
Vittorio Bilò, Michele Flammini, Gianpiero Monaco, Luca Moscardelli
A polynomial-time perfect sampler for the Q-Ising with a vertex-independent noise
Masaki Yamamoto, Shuji Kijima, Yasuko Matsui
Convex partitions with 2-edge connected dual graphs
Marwan Al-Jubeh, Michael Hoffmann, Mashhood Ishaque, Diane L. Souvaine, Csaba D. Tóth
Why locally-fair maximal flows in client-server networks perform well
Kenneth A. Berman, Chad Yoshikawa
Strongly chordal and chordal bipartite graphs are sandwich monotone
Pinar Heggernes, Federico Mancini, Charis Papadopoulos, R. Sritharan
On the Diaconis-Gangolli Markov chain for sampling contingency tables with cell-bounded entries
Ivona Bezáková, Nayantara Bhatnagar, Dana Randall
Separating NE from some nonuniform nondeterministic complexity classes
Bin Fu, Angsheng Li, Liyu Zhang