|
Search the dblp DataBase
Thomas Eschbach:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Rolf Drechsler, Wolfgang Günther, Thomas Eschbach, Lothar Linhard, Gerhard Angst
Recursive Bi-Partitioning of Netlists for Large Number of Partitions. [Citation Graph (0, 0)][DBLP] DSD, 2002, pp:38-44 [Conf]
- Bernd Becker, Thomas Eschbach, Rolf Drechsler, Wolfgang Günther
Greedy_IIP: Partitioning Large Graphs by Greedy Iterative Improvement. [Citation Graph (0, 0)][DBLP] DSD, 2001, pp:54-61 [Conf]
- Thomas Eschbach, Wolfgang Günther, Rolf Drechsler, Bernd Becker
Crossing Reduction by Windows Optimization. [Citation Graph (0, 0)][DBLP] Graph Drawing, 2002, pp:285-294 [Conf]
- Thomas Eschbach, Wolfgang Günther, Bernd Becker
Orthogonal hypergraph routing for improved visibility. [Citation Graph (0, 0)][DBLP] ACM Great Lakes Symposium on VLSI, 2004, pp:385-388 [Conf]
- Thomas Eschbach, Rolf Dreschler, Bernd Becker
Placement and routing optimization for circuits derived from BDDs. [Citation Graph (0, 0)][DBLP] ISCAS (5), 2004, pp:229-232 [Conf]
- Thomas Eschbach, Wolfgang Günther, Bernd Becker
Cross Reduction for Orthogonal Circuit Visualization. [Citation Graph (0, 0)][DBLP] VLSI, 2003, pp:107-113 [Conf]
- Thomas Eschbach, Wolfgang Günther, Bernd Becker
Orthogonal Circuit Visualization Improved by Merging the Placement and Routing Phases. [Citation Graph (0, 0)][DBLP] VLSI Design, 2005, pp:433-438 [Conf]
- Rolf Drechsler, Wolfgang Günther, Thomas Eschbach, Lothar Linhard, Gerhard Angst
Recursive bi-partitioning of netlists for large number of partitions. [Citation Graph (0, 0)][DBLP] Journal of Systems Architecture, 2003, v:49, n:12-15, pp:521-528 [Journal]
Search in 0.001secs, Finished in 0.002secs
|