<?xml version="1.0"?>
<dblp>
<article key="journals/cpc/CharbitTY07" mdate="2008-11-20">
<author>Pierre Charbit</author>
<author>St&#233;phan Thomass&#233;</author>
<author>Anders Yeo</author>
<title>The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments.</title>
<pages>1-4</pages>
<year>2007</year>
<volume>16</volume>
<journal>Combinatorics, Probability &amp; Computing</journal>
<number>1</number>
<ee>http://dx.doi.org/10.1017/S0963548306007887</ee>
<url>db/journals/cpc/cpc16.html#CharbitTY07</url>
</article>
</dblp>
