<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Bastian Katz | AC Group | TU Wien</title><link>https://ac.notready.eu/author/bastian-katz/</link><atom:link href="https://ac.notready.eu/author/bastian-katz/index.xml" rel="self" type="application/rss+xml"/><description>Bastian Katz</description><generator>Hugo Blox Builder (https://hugoblox.com)</generator><language>en-us</language><lastBuildDate>Sat, 01 Jan 2011 00:00:00 +0000</lastBuildDate><image><url>https://ac.notready.eu/media/logo_hu10234977157890132473.png</url><title>Bastian Katz</title><link>https://ac.notready.eu/author/bastian-katz/</link></image><item><title>Connecting Two Trees with Optimal Routing Cost</title><link>https://ac.notready.eu/publication/connecting-two-trees-with-optimal-routing-cost/</link><pubDate>Sat, 01 Jan 2011 00:00:00 +0000</pubDate><guid>https://ac.notready.eu/publication/connecting-two-trees-with-optimal-routing-cost/</guid><description/></item></channel></rss>