| | |
- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| 6 |      | Andreas Emil Feldmann, Luca Foschini: Balanced Partitions of Trees and Applications. STACS 2012: 100-111 |
| 2011 | ||
| 5 | | Andreas Emil Feldmann, Peter Widmayer: An $\mathcal{O}(n^4)$ Time Algorithm to Compute the Bisection Width of Solid Grid Graphs. ESA 2011: 143-154 |
| 4 | | Andreas Emil Feldmann, Shantanu Das, Peter Widmayer: Restricted Cuts for Bisections in Solid Grids: A Proof via Polygons. WG 2011: 143-154 |
| 3 | | Andreas Emil Feldmann: Fast Balanced Partitioning of Grid Graphs is Hard CoRR abs/1111.6745: (2011) |
| 2010 | ||
| 2 | | Andreas Emil Feldmann, Shantanu Das, Peter Widmayer: Simple Cuts Are Fast and Good: Optimum Right-Angled Cuts in Solid Grids. COCOA (1) 2010: 11-20 |
| 2008 | ||
| 1 | | Andreas Emil Feldmann, Heiko Röglin, Berthold Vöcking: Computing Approximate Nash Equilibria in Network Congestion Games. SIROCCO 2008: 209-220 |
| 1 | Shantanu Das | [2] [4] |
| 2 | Luca Foschini | [6] |
| 3 | Heiko Röglin (Heiko Roeglin) | [1] |
| 4 | Berthold Vöcking | [1] |
| 5 | Peter Widmayer | [2] [4] [5] |
Colors in the list of coauthors
Last update Wed May 30 22:34:44 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page