<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Petr Hlin{\v E}n{\'{y}} | AC Group | TU Wien</title><link>https://ac.notready.eu/author/petr-hlin%5Cv-en%5Cy/</link><atom:link href="https://ac.notready.eu/author/petr-hlin%5Cv-en%5Cy/index.xml" rel="self" type="application/rss+xml"/><description>Petr Hlin{\v E}n{\'{y}}</description><generator>Hugo Blox Builder (https://hugoblox.com)</generator><language>en-us</language><lastBuildDate>Fri, 01 Jan 2010 00:00:00 +0000</lastBuildDate><image><url>https://ac.notready.eu/media/logo_hu10234977157890132473.png</url><title>Petr Hlin{\v E}n{\'{y}}</title><link>https://ac.notready.eu/author/petr-hlin%5Cv-en%5Cy/</link></image><item><title>Are There Any Good Digraph Width Measures?</title><link>https://ac.notready.eu/publication/are-there-any-good-digraph-width-measures/</link><pubDate>Fri, 01 Jan 2010 00:00:00 +0000</pubDate><guid>https://ac.notready.eu/publication/are-there-any-good-digraph-width-measures/</guid><description/></item><item><title>On Digraph Width Measures in Parameterized Algorithmics</title><link>https://ac.notready.eu/publication/on-digraph-width-measures-in-parameterized-algorithmics/</link><pubDate>Thu, 01 Jan 2009 00:00:00 +0000</pubDate><guid>https://ac.notready.eu/publication/on-digraph-width-measures-in-parameterized-algorithmics/</guid><description/></item></channel></rss>