no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
1 |
Atomic Congestion Games: Fast, Myopic and Concurrent
|
Fotakis, D. |
|
2009 |
47 |
1 |
p. 38-59 |
article |
2 |
Border Correlations of Partial Words
|
Blanchet-Sadri, F. |
|
2008 |
47 |
1 |
p. 179-195 |
article |
3 |
Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchy
|
Fotakis, Dimitris |
|
2009 |
47 |
1 |
p. 113-136 |
article |
4 |
Facets of the Fully Mixed Nash Equilibrium Conjecture
|
Feldmann, Rainer |
|
2009 |
47 |
1 |
p. 60-112 |
article |
5 |
Fixed-Parameter Algorithms for Cluster Vertex Deletion
|
Hüffner, Falk |
|
2008 |
47 |
1 |
p. 196-217 |
article |
6 |
Non-Cooperative Cost Sharing Games via Subsidies
|
Buchbinder, Niv |
|
2009 |
47 |
1 |
p. 15-37 |
article |
7 |
Preface
|
Monien, Burkhard |
|
2009 |
47 |
1 |
p. 1-2 |
article |
8 |
Reductions to Graph Isomorphism
|
Torán, Jacobo |
|
2008 |
47 |
1 |
p. 288-299 |
article |
9 |
Sensitivity of Wardrop Equilibria
|
Englert, Matthias |
|
2009 |
47 |
1 |
p. 3-14 |
article |
10 |
Stackelberg Strategies for Atomic Congestion Games
|
Fotakis, Dimitris |
|
2008 |
47 |
1 |
p. 218-249 |
article |
11 |
Strongly Terminating Early-Stopping k-Set Agreement in Synchronous Systems with General Omission Failures
|
Raïpin Parvédy, Philippe |
|
2008 |
47 |
1 |
p. 259-287 |
article |
12 |
TCP is Competitive with Resource Augmentation
|
Edmonds, Jeff |
|
2010 |
47 |
1 |
p. 137-161 |
article |
13 |
The Deduction Theorem for Strong Propositional Proof Systems
|
Beyersdorff, Olaf |
|
2008 |
47 |
1 |
p. 162-178 |
article |
14 |
The Solvability Problem for Quadratic Equations over Free Groups is NP-Complete
|
Kharlampovich, O. |
|
2008 |
47 |
1 |
p. 250-258 |
article |