Thomas Eschbach

Anschrift:

Albert-Ludwigs-Universität Freiburg

Institut für Informatik

Lehrstuhl für Rechnerarchitektur

Georges Köhler Allee, Gebäude 51

79110 Freiburg, Germany

e-mail: eschbach@informatik.uni-freiburg.de

Telefon: ++ 49 761 203 8148

Arbeitsgebiete und Interessen:

• CAD
• Partitioning
• Visualisierung von Schaltkreisen
• Visualisierung von Graphen

Veröffentlichungen:

• T. Eschbach, B. Becker.
  Interactive Circuit Diagram Visualization.
  Computer Graphics and Imaging (CGIM 2008), pages 218-223,
  Innsbruck, Austria, Feb. 2008

• T. Eschbach, W. Günther, B. Becker.
  Orthogonal Hypergraph Drawing for Improved Visibility.
  Journal of Graph Algorithms and Applications, Volume 10, no. 2, 2006

• M. Welte, T. Eschbach, B. Becker.
  Automated Text Extraction And Indexing Of Video Presentation Recordings For Keyword Search Via A Web Interface.
  In Proceedings of the AACE World Conference on E-Learning (E-Learn 2005), pages 3200-3205,
  Vancouver, Canada, Oct. 2005. AACE Press.

• M. Welte, T. Eschbach, B. Becker.
  Automated Text Extraction And Indexing Of Video Presentation Recordings For Keyword Search Via A Web Interface.
  Workshop "eLectures - Einsatzmöglichkeiten, Herausforderungen und Forschungsperspektiven",
  pages 61-66, September 2005, Rostock

• T. Eschbach, W. Günther, B. Becker.
  Orthogonal Circuit Visualization Improved by Merging the Placement and Routing Phases.
  VLSI Design 2005 (VLSID'05), pages 433-438, Januar 2005, Kalkutta

• T. Eschbach, W. Günther, B. Becker.
  Orthogonal Hypergraph Routing for Improved Visibility.
  2004 Great Lakes Symposium on VLSI (GLSVLSI'04), pages 385-388, April 2004, Boston

• T. Eschbach, R. Drechsler, B. Becker.
  Placement and Routing Optimization for Circuits Derived from BDDs.
  IEEE International Symposium on Circuits and Systems (ISCAS'04), pages V229-V232, May 2004, Vancouver

• R. Drechsler, W. Günther, T. Eschbach, L. Linhard, and G. Angst.
  Recursive Bi-Partitioning of Netlists for Large Number of Partitions.
  Journal of Systems Architecture - the Euromicro Journal, Volume 49, pp. 521-528, Dec. 2003.

• T. Eschbach and W. Günther and B. Becker.
  Crossing Reduction for Orthogonal Circuit Visualization, In Proceedings of the International Conference on VLSI (VLSI'03), pages 107-113, June 2003
  

• T. Eschbach, W. Günther, R. Drechsler and B. Becker.
  Crossing Reduction by Windows Optimization, In 10th International Symposium on Graph Drawing (GD'2002), pages 285-294, Irvine, 2002
  

• R. Drechsler, W. Günther, T. Eschbach, L. Linhard and G. Angst.
  Recursive Bi-Partitioning of Netlists for Large Number of Partitions, In Proceedings of Euromicro Symposium on Digital System Design (DSD'2002), pages 38-44, Dortmund, 2002
  

• B. Becker, R. Drechsler, T. Eschbach, and W. Günther.
  GREEDY_IIP: Partitioning Large Graphs by Greedy Iterative Improvement.
  EUROMICRO, pages 54-61, Warsaw, Poland, Sep. 2001.