![]() | ![]() |
Ask others: ACM DL/Guide -
- CSB - MetaPress - Google - Bing - Yahoo
| 157 | Thomas Eschbach, Wolfgang Günther, Bernd Becker: Orthogonal Hypergraph Drawing for Improved Visibility. J. Graph Algorithms Appl. 10(2): 141-157 (2006) | |
| 152 | Martina Welte, Thomas Eschbach, Bernd Becker: Automated Text Extraction And Indexing Of Video Presentation Recordings For Keyword Search Via A Web Interface. DeLFI Workshops 2005: 61-66 | |
| 144 | Thomas Eschbach, Wolfgang Günther, Bernd Becker: Orthogonal Circuit Visualization Improved by Merging the Placement and Routing Phases. VLSI Design 2005: 433-438 | |
| 138 | Thomas Eschbach, Wolfgang Günther, Bernd Becker: Orthogonal hypergraph routing for improved visibility. ACM Great Lakes Symposium on VLSI 2004: 385-388 | |
| 135 | Thomas Eschbach, Rolf Dreschler, Bernd Becker: Placement and routing optimization for circuits derived from BDDs. ISCAS (5) 2004: 229-232 | |
| 121 | Thomas Eschbach, Wolfgang Günther, Bernd Becker: Cross Reduction for Orthogonal Circuit Visualization. VLSI 2003: 107-113 | |
| 113 | Thomas Eschbach, Wolfgang Günther, Rolf Drechsler, Bernd Becker: Crossing Reduction by Windows Optimization. Graph Drawing 2002: 285-294 | |
| 101 | Bernd Becker, Thomas Eschbach, Rolf Drechsler, Wolfgang Günther: Greedy_IIP: Partitioning Large Graphs by Greedy Iterative Improvement. DSD 2001: 54-61 |
Selection of 8 from 264 records - Bernd Becker has 166 coauthors
Last update 2012-09-10 CET by the DBLP Team —
Content released under the ODC-BY 1.0 license — See also our legal information page