| Conditional Value-At-Risk: Structure and complexity of equilibria | 1 | 0.41 | 2020 |
| Balanced caterpillars of maximum degree 3 and with hairs of arbitrary length are subgraphs of their optimal hypercube. | 0 | 0.34 | 2018 |
| NP NP -Hardness of Equilibria in Case of Risk-Averse Players. | 0 | 0.34 | 2018 |
| The complexity of pure equilibria in mix-weighted congestion games on parallel links | 0 | 0.34 | 2015 |
| Preface To The Self-Portrayals Of The Gi Junior Fellows | 0 | 0.34 | 2014 |
| Computing Nash Equilibria for Two-Player Restricted Network Congestion Games is -Complete. | 0 | 0.34 | 2012 |
| Minimizing expectation plus variance | 2 | 0.42 | 2012 |
| Exact Price of Anarchy for Polynomial Congestion Games | 51 | 2.01 | 2011 |
| Routing (un-) splittable flow in games with player-specific affine latency functions | 21 | 0.83 | 2011 |
| Fair cost-sharing methods for scheduling jobs on parallel machines | 11 | 0.58 | 2009 |
| From State-of-the-Art Static Fleet Assignment to Flexible Stochastic Planning of the Future | 3 | 0.43 | 2009 |
| Graph partitioning and disturbed diffusion | 20 | 0.68 | 2009 |
| A new diffusion-based multilevel algorithm for computing graph partitions | 21 | 0.78 | 2009 |
| A new diffusion-based multilevel algorithm for computing graph partitions of very high quality | 21 | 1.06 | 2008 |
| Algorithmic Game Theory, First International Symposium, SAGT 2008, Paderborn, Germany, April 30-May 2, 2008. Proceedings | 25 | 1.54 | 2008 |
| On the Road to -Completeness: 8 Agents in a Singleton Congestion Game | 0 | 0.34 | 2008 |
| The power of two prices: beyond cross-monotonicity | 3 | 0.41 | 2007 |
| A faster combinatorial approximation algorithm for scheduling unrelated parallel machines | 15 | 0.82 | 2007 |
| Weighted Boolean formula games | 13 | 0.73 | 2007 |
| Routing and scheduling with incomplete information | 0 | 0.34 | 2007 |
| Congestion games with player-specific constants | 34 | 1.45 | 2007 |
| Accelerating shape optimizing load balancing for parallel fem simulations by algebraic multigrid | 13 | 0.62 | 2006 |
| Wardrop equilibria and price of stability for bottleneck games with splittable traffic | 6 | 0.55 | 2006 |
| Edge-disjoint spanning trees for the generalized butterfly networks and their applications | 4 | 0.41 | 2005 |
| IPDPS 2005 Organization | 0 | 0.34 | 2005 |
| Nash equilibria, the price of anarchy and the fully mixed nash equilibrium conjecture | 15 | 1.85 | 2005 |
| Graph Partitioning with the Party Library: Helpful-Sets in Practice | 8 | 0.71 | 2004 |
| Load Balancing in Dynamic Networks | 12 | 0.66 | 2004 |
| Improved bounds on cutwidths of shuffle-exchange and de Bruijn graphs | 1 | 0.35 | 2004 |
| SAT-Based Techniques in System Synthesis | 11 | 0.68 | 2003 |
| Nashification and the coordination ratio for a selfish routing game | 65 | 4.10 | 2003 |
| Fault Tolerances Analysis of Distributed Reconfigurable Systems Using SAT-Based Techniques | 4 | 0.53 | 2003 |
| Selfish Routing in Non-cooperative Networks: A Survey. | 19 | 1.91 | 2003 |
| On Spectral Bounds for the k-Partitioning of Graphs | 1 | 0.40 | 2003 |
| Extreme Nash Equilibria | 17 | 2.34 | 2003 |
| Which Is the Worst-Case Nash Equilibrium? | 25 | 2.49 | 2003 |
| The Secret of Selective Game Tree Search, When Using Random-Error Evaluations | 2 | 0.43 | 2002 |
| On the Problem of Scheduling Flows on Distributed Networks | 1 | 0.37 | 2002 |
| Toward Optimal Diffusion Matrices | 7 | 0.59 | 2002 |
| Scalable Sparse Topologies with Small Spectrum | 3 | 0.42 | 2001 |
| A Distributed Algorithm to Evaluate Quantified Boolean Formulae | 66 | 3.11 | 2000 |
| Quality matching and local improvement for multilevel graph-partitioning | 33 | 2.77 | 2000 |
| Towards Optimal Load Balancing Topologies | 8 | 0.94 | 2000 |
| Programme of the ACC9 Conference. | 0 | 0.34 | 1999 |
| Efficient schemes for nearest neighbor load balancing | 98 | 4.79 | 1999 |
| More Information on the 9th World Computer-Chess Championship. | 0 | 0.34 | 1999 |
| The Latest Information on the 9th World Computer-Chess Championship. | 0 | 0.34 | 1999 |
| Call for Papers Advances in Computer Chess 9 Conference. | 0 | 0.34 | 1999 |
| Optimal and Alternating-Direction Load Balancing Schemes | 15 | 1.11 | 1999 |
| Nearest Neighbor Load Balancing on Graphs | 3 | 0.53 | 1998 |
