<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Meirav Zehavi | AC Group | TU Wien</title><link>https://ac.notready.eu/author/meirav-zehavi/</link><atom:link href="https://ac.notready.eu/author/meirav-zehavi/index.xml" rel="self" type="application/rss+xml"/><description>Meirav Zehavi</description><generator>Hugo Blox Builder (https://hugoblox.com)</generator><language>en-us</language><lastBuildDate>Mon, 01 Jan 2024 00:00:00 +0000</lastBuildDate><image><url>https://ac.notready.eu/media/logo_hu10234977157890132473.png</url><title>Meirav Zehavi</title><link>https://ac.notready.eu/author/meirav-zehavi/</link></image><item><title>Exact Algorithms for Clustered Planarity with Linear Saturators</title><link>https://ac.notready.eu/publication/exact-algorithms-for-clustered-planarity-with-linear-saturators/</link><pubDate>Mon, 01 Jan 2024 00:00:00 +0000</pubDate><guid>https://ac.notready.eu/publication/exact-algorithms-for-clustered-planarity-with-linear-saturators/</guid><description/></item><item><title>New Frontiers of Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 23162)</title><link>https://ac.notready.eu/publication/new-frontiers-of-parameterized-complexity-in-graph-drawing-dagstuhl-seminar-23162/</link><pubDate>Sun, 01 Jan 2023 00:00:00 +0000</pubDate><guid>https://ac.notready.eu/publication/new-frontiers-of-parameterized-complexity-in-graph-drawing-dagstuhl-seminar-23162/</guid><description/></item><item><title>Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 21293)</title><link>https://ac.notready.eu/publication/parameterized-complexity-in-graph-drawing-dagstuhl-seminar-21293/</link><pubDate>Fri, 01 Jan 2021 00:00:00 +0000</pubDate><guid>https://ac.notready.eu/publication/parameterized-complexity-in-graph-drawing-dagstuhl-seminar-21293/</guid><description/></item></channel></rss>