<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Irene Parada | AC Group | TU Wien</title><link>https://ac.notready.eu/author/irene-parada/</link><atom:link href="https://ac.notready.eu/author/irene-parada/index.xml" rel="self" type="application/rss+xml"/><description>Irene Parada</description><generator>Hugo Blox Builder (https://hugoblox.com)</generator><language>en-us</language><lastBuildDate>Wed, 01 Jan 2025 00:00:00 +0000</lastBuildDate><image><url>https://ac.notready.eu/media/logo_hu10234977157890132473.png</url><title>Irene Parada</title><link>https://ac.notready.eu/author/irene-parada/</link></image><item><title>Crossing and Independent Families Among Polygons</title><link>https://ac.notready.eu/publication/crossing-and-independent-families-among-polygons/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://ac.notready.eu/publication/crossing-and-independent-families-among-polygons/</guid><description/></item><item><title>Crossing-Optimal Extension of Simple Drawings</title><link>https://ac.notready.eu/publication/crossing-optimal-extension-of-simple-drawings/</link><pubDate>Fri, 01 Jan 2021 00:00:00 +0000</pubDate><guid>https://ac.notready.eu/publication/crossing-optimal-extension-of-simple-drawings/</guid><description/></item></channel></rss>