<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Boris Klemz | AC Group | TU Wien</title><link>https://ac.notready.eu/author/boris-klemz/</link><atom:link href="https://ac.notready.eu/author/boris-klemz/index.xml" rel="self" type="application/rss+xml"/><description>Boris Klemz</description><generator>Hugo Blox Builder (https://hugoblox.com)</generator><language>en-us</language><lastBuildDate>Thu, 01 Jan 2026 00:00:00 +0000</lastBuildDate><image><url>https://ac.notready.eu/media/logo_hu10234977157890132473.png</url><title>Boris Klemz</title><link>https://ac.notready.eu/author/boris-klemz/</link></image><item><title>Point Set Embeddability with List Constraints</title><link>https://ac.notready.eu/publication/point-set-embeddability-with-list-constraints/</link><pubDate>Thu, 01 Jan 2026 00:00:00 +0000</pubDate><guid>https://ac.notready.eu/publication/point-set-embeddability-with-list-constraints/</guid><description/></item><item><title>Partial Level Planarity Parameterized by the Size of the Missing Graph</title><link>https://ac.notready.eu/publication/partial-level-planarity-parameterized-by-the-size-of-the-missing-graph/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://ac.notready.eu/publication/partial-level-planarity-parameterized-by-the-size-of-the-missing-graph/</guid><description/></item><item><title>Recognizing Weighted and Seeded Disk Graphs</title><link>https://ac.notready.eu/publication/recognizing-weighted-and-seeded-disk-graphs/</link><pubDate>Sat, 01 Jan 2022 00:00:00 +0000</pubDate><guid>https://ac.notready.eu/publication/recognizing-weighted-and-seeded-disk-graphs/</guid><description/></item><item><title>Recognizing Weighted Disk Contact Graphs</title><link>https://ac.notready.eu/publication/recognizing-weighted-disk-contact-graphs/</link><pubDate>Thu, 01 Jan 2015 00:00:00 +0000</pubDate><guid>https://ac.notready.eu/publication/recognizing-weighted-disk-contact-graphs/</guid><description/></item><item><title>Minimum Tree Supports for Hypergraphs and Low-Concurrency Euler Diagrams</title><link>https://ac.notready.eu/publication/minimum-tree-supports-for-hypergraphs-and-low-concurrency-euler-diagrams/</link><pubDate>Wed, 01 Jan 2014 00:00:00 +0000</pubDate><guid>https://ac.notready.eu/publication/minimum-tree-supports-for-hypergraphs-and-low-concurrency-euler-diagrams/</guid><description/></item></channel></rss>