<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Giordano Da Lozzo | AC Group | TU Wien</title><link>https://ac.notready.eu/author/giordano-da-lozzo/</link><atom:link href="https://ac.notready.eu/author/giordano-da-lozzo/index.xml" rel="self" type="application/rss+xml"/><description>Giordano Da Lozzo</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>Giordano Da Lozzo</title><link>https://ac.notready.eu/author/giordano-da-lozzo/</link></image><item><title>Quantum Speedups for Polynomial-Time Dynamic Programming Algorithms</title><link>https://ac.notready.eu/publication/quantum-speedups-for-polynomial-time-dynamic-programming-algorithms/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://ac.notready.eu/publication/quantum-speedups-for-polynomial-time-dynamic-programming-algorithms/</guid><description/></item><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>On the Upward Book Thickness Problem: Combinatorial and Complexity Results</title><link>https://ac.notready.eu/publication/on-the-upward-book-thickness-problem-combinatorial-and-complexity-results-2/</link><pubDate>Sun, 01 Jan 2023 00:00:00 +0000</pubDate><guid>https://ac.notready.eu/publication/on-the-upward-book-thickness-problem-combinatorial-and-complexity-results-2/</guid><description/></item><item><title>On the Upward Book Thickness Problem: Combinatorial and Complexity Results</title><link>https://ac.notready.eu/publication/on-the-upward-book-thickness-problem-combinatorial-and-complexity-results/</link><pubDate>Fri, 01 Jan 2021 00:00:00 +0000</pubDate><guid>https://ac.notready.eu/publication/on-the-upward-book-thickness-problem-combinatorial-and-complexity-results/</guid><description/></item><item><title>Planar L-Drawings of Directed Graphs</title><link>https://ac.notready.eu/publication/planar-l-drawings-of-directed-graphs/</link><pubDate>Mon, 01 Jan 2018 00:00:00 +0000</pubDate><guid>https://ac.notready.eu/publication/planar-l-drawings-of-directed-graphs/</guid><description/></item></channel></rss>