Andrew B. Kahng

Available identifiers

Publication	Date of Publication	Type
VLSI Physical Design: From Graph Partitioning to Timing Closure	2023-11-06	Paper
VLSI Physical Design: From Graph Partitioning to Timing Closure	2010-08-03	Paper
Improved large-step Markov chain variants for the symmetric TSP	2005-10-13	Paper
Design and implementation of move-based heuristics for VLSI hypergraph partitioning	2005-08-04	Paper
https://portal.mardi4nfdi.de/entity/Q3024759	2005-07-04	Paper
Match twice and stitch: a new TSP tour construction heuristic.	2005-01-11	Paper
https://portal.mardi4nfdi.de/entity/Q4471869	2004-07-30	Paper
https://portal.mardi4nfdi.de/entity/Q4410160	2003-07-02	Paper
Asymmetric binary covering codes.	2003-03-26	Paper
https://portal.mardi4nfdi.de/entity/Q4778566	2002-11-18	Paper
Efficient optimization by modifying the objective function: applications to timing-driven VLSI layout	2002-07-21	Paper
How to test a tree	2002-07-21	Paper
Spectral partitioning with multiple eigenvectors	1999-08-23	Paper
Splitting an ordering into a partition to minimize diameter	1998-09-23	Paper
Recent directions in netlist partitioning: a survey	1997-02-27	Paper
https://portal.mardi4nfdi.de/entity/Q4764186	1995-05-01	Paper
A new adaptive multi-start technique for combinatorial global optimizations	1995-01-11	Paper
Best-so-far vs. where-you-are: Implications for optimal finite-time annealing	1994-04-19	Paper
Zero skew clock routing with minimum wirelength	1993-06-29	Paper

This page was built for person: Andrew B. Kahng