<?xml version="1.0"?>
<dblp>
<inproceedings key="conf/ispd/AlpertHHKLLQSSV01" mdate="2006-03-14">
<author>Charles J. Alpert</author>
<author>Milos Hrkic</author>
<author>Jiang Hu</author>
<author>Andrew B. Kahng</author>
<author>John Lillis</author>
<author>Bao Liu</author>
<author>Stephen T. Quay</author>
<author>Sachin S. Sapatnekar</author>
<author>A. J. Sullivan</author>
<author>Paul Villarrubia</author>
<title>Buffered Steiner trees for difficult instances.</title>
<pages>4-9</pages>
<year>2001</year>
<booktitle>ISPD</booktitle>
<ee>http://doi.acm.org/10.1145/369691.369699</ee>
<url>db/conf/ispd/ispd2001.html#AlpertHHKLLQSSV01</url>
</inproceedings>
</dblp>
