Skip to main content
Skip to navigation
Skip to toolbar

Browse by Author

4 Results for Feldmann, Andreas Emil

Subscribe to RSS feed for this result set

Sort results by

Results per page

1. An O(n4) time algorithm to compute the bisection width of solid grid graphs

Feldmann, Andreas Emil and Widmayer, Peter (2011)

Reports Reports

2. Balanced partitioning of grids and related graphs

Feldmann, Andreas Emil (2012)

Doctoral and Habilitation Theses

3. Balanced partitions of trees and applications

Feldmann, Andreas Emil and Foschini, Luca (2011)

Reports Reports

4. Restricted cuts for bisections in solid grids: a proof via polygons

Feldmann, Andreas Emil, Das, Shantanu and Widmayer, Peter (2011)

Reports Reports