<?xml version="1.0" encoding="US-ASCII"?>
<dblp>
<article key="journals/algorithms/ChenRRV18" mdate="2025-01-19">
<author orcid="0009-0007-6528-7064">Li-Hsuan Chen</author>
<author orcid="0000-0002-2354-3003">Felix Reidl</author>
<author>Peter Rossmanith</author>
<author>Fernando S&#225;nchez Villaamil</author>
<title>Width, Depth, and Space: Tradeoffs between Branching and Dynamic Programming.</title>
<pages>98</pages>
<year>2018</year>
<volume>11</volume>
<journal>Algorithms</journal>
<number>7</number>
<ee type="oa">https://doi.org/10.3390/a11070098</ee>
<ee>https://www.wikidata.org/entity/Q129599117</ee>
<url>db/journals/algorithms/algorithms11.html#ChenRRV18</url>
</article>
</dblp>
