<?xml version="1.0"?>
<dblp>
<article key="journals/algorithmica/KalpakisY99" mdate="2002-01-03">
<author>Konstantinos Kalpakis</author>
<author>Yaacov Yesha</author>
<title>Upper and Lower Bounds on the Makespan of Schedules for Tree Dags on Linear Arrays.</title>
<pages>159-179</pages>
<year>1999</year>
<volume>23</volume>
<journal>Algorithmica</journal>
<number>2</number>
<ee>http://link.springer.de/link/service/journals/00453/bibs/23n2p159.html</ee>
<url>db/journals/algorithmica/algorithmica23.html#KalpakisY99</url>
</article>
</dblp>
