Andreas Emil Feldmann Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
DBLP keys2013
j3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Andreas Emil Feldmann, Shantanu Das, Peter Widmayer: Corner cuts are close to optimal: From solid grids to polygons and back. Discrete Applied Mathematics 161(7-8): 970-998 (2013)
j2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Andreas Emil Feldmann: Fast balanced partitioning is hard even on grids and trees. Theor. Comput. Sci. 485: 61-68 (2013)
c7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Yann Disser, Andreas Emil Feldmann, Max Klimm, Matús Mihalák: Improving the H k -Bound on the Price of Stability in Undirected Shapley Network Design Games. CIAC 2013: 158-169
2012
j1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Andreas Emil Feldmann, Heiko Röglin, Berthold Vöcking: Computing approximate Nash equilibria in network congestion games. Networks 59(4): 380-386 (2012)
c6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Andreas Emil Feldmann: Fast Balanced Partitioning Is Hard Even on Grids and Trees. MFCS 2012: 372-382
c5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Andreas Emil Feldmann, Luca Foschini: Balanced Partitions of Trees and Applications. STACS 2012: 100-111
i2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Yann Disser, Andreas Emil Feldmann, Max Klimm, Matús Mihalák: Improving the $H_k$-Bound on the Price of Stability in Undirected Shapley Network Design Games. CoRR abs/1211.2090 (2012)
2011
c4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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
c3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Andreas Emil Feldmann, Shantanu Das, Peter Widmayer: Restricted Cuts for Bisections in Solid Grids: A Proof via Polygons. WG 2011: 143-154
i1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Andreas Emil Feldmann: Fast Balanced Partitioning of Grid Graphs is Hard. CoRR abs/1111.6745 (2011)
2010
c2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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
c1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Andreas Emil Feldmann, Heiko Röglin, Berthold Vöcking: Computing Approximate Nash Equilibria in Network Congestion Games. SIROCCO 2008: 209-220

Coauthor Index

1Shantanu Das 0001
[j3] [c3] [c2]
2Yann Disser
[c7] [i2]
3Luca Foschini
[c5]
4Max Klimm
[c7] [i2]
5Matús Mihalák
[c7] [i2]
6Heiko Röglin (Heiko Roeglin)
[j1] [c1]
7Berthold Vöcking
[j1] [c1]
8Peter Widmayer
[j3] [c4] [c3] [c2]

Colors in the list of coauthors

Home | Conferences | Journals | Series | FAQ — Search: Faceted | Free | Complete | Author
Last update Sat May 25 17:28:19 2013 CET by the DBLP Team — This material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page