Computer Science and Engineering Dept
University of California, San Diego
La Jolla, CA 92093-0114

Phone: (404) 819-3193
Fax: (815) 301-8557
Email: mandoiu@cs.ucsd.edu

Home page of Ion Mandoiu
 

Biographical Sketch

Ion Mandoiu received the M.S. degree in Computer Science from the University of Bucharest in June 1992. In December 2000 he received the Ph.D. degree in Computer Science from Georgia Institute of Technology, with a thesis on approximation algorithms for VLSI routing. He joined the VLSI CAD Group lead by Prof. Andrew B. Kahng as a postgraduate researcher in August 2000. 

Areas of Interest

Design, analysis, and implementation of exact and approximation algorithms, combinatorial optimization, algorithmic problems in coding and information theory, and VLSI computer-aided design. 

Current Research

Algorithms for buffered Steiner routing and timing-driven floorplaning. 

Recent Publications

• Practical Approximation Algorithms for Separable Packing Linear Programs (with F.F. Dragan, A.B. Kahng, S. Muddu, and Alexander Zelikovsky). Proc. 7th International Workshop on Algorithms and Data Structures (WADS 2001), pp. 325-337.
• Provably good global buffering by multiterminal multicommodity flow approximation (with F.F. Dragan, A.B. Kahng, S. Muddu, and Alexander Zelikovsky). Proc. 2001 Asia and South Pacific Design Automation Conference, pp. 120-125.
• Practical Approximation Algorithms for Zero-Skew Trees
  (with Alexander Zelikovsky). Proc. 12th ACM-SIAM Symp. on Discrete Algorithms (2001), pp. 407-416. 
• Provably good global buffering using an available buffer block plan
  (with F.F. Dragan, A.B. Kahng, S. Muddu, and Alexander Zelikovsky). Proc. 2000 IEEE-ACM International Conference 
  on Computer Aided Design, pp. 104-109.