<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Giacomo Paesani | AC Group | TU Wien</title><link>https://ac.tuwien.ac.at/team/giacomo-paesani/</link><atom:link href="https://ac.tuwien.ac.at/team/giacomo-paesani/index.xml" rel="self" type="application/rss+xml"/><description>Giacomo Paesani</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.tuwien.ac.at/media/logo_hu10234977157890132473.png</url><title>Giacomo Paesani</title><link>https://ac.tuwien.ac.at/team/giacomo-paesani/</link></image><item><title>A General Theoretical Framework for Learning Smallest Interpretable Models</title><link>https://ac.tuwien.ac.at/publication/a-general-theoretical-framework-for-learning-smallest-interpretable-models-2/</link><pubDate>Thu, 01 Jan 2026 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-general-theoretical-framework-for-learning-smallest-interpretable-models-2/</guid><description/></item><item><title>A General Theoretical Framework for Learning Smallest Interpretable Models</title><link>https://ac.tuwien.ac.at/publication/a-general-theoretical-framework-for-learning-smallest-interpretable-models/</link><pubDate>Mon, 01 Jan 2024 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-general-theoretical-framework-for-learning-smallest-interpretable-models/</guid><description/></item><item><title>A Tight Subexponential-Time Algorithm for Two-Page Book Embedding</title><link>https://ac.tuwien.ac.at/publication/a-tight-subexponential-time-algorithm-for-two-page-book-embedding/</link><pubDate>Mon, 01 Jan 2024 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-tight-subexponential-time-algorithm-for-two-page-book-embedding/</guid><description/></item><item><title>Explaining Decisions in ML Models: A Parameterized Complexity Analysis</title><link>https://ac.tuwien.ac.at/publication/explaining-decisions-in-ml-models-a-parameterized-complexity-analysis/</link><pubDate>Mon, 01 Jan 2024 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/explaining-decisions-in-ml-models-a-parameterized-complexity-analysis/</guid><description/></item><item><title>Learning Small Decision Trees for Data of Low Rank-Width</title><link>https://ac.tuwien.ac.at/publication/learning-small-decision-trees-for-data-of-low-rank-width/</link><pubDate>Mon, 01 Jan 2024 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/learning-small-decision-trees-for-data-of-low-rank-width/</guid><description/></item><item><title>Learning Small Decision Trees with Large Domain</title><link>https://ac.tuwien.ac.at/publication/learning-small-decision-trees-with-large-domain/</link><pubDate>Sun, 01 Jan 2023 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/learning-small-decision-trees-with-large-domain/</guid><description/></item><item><title>The Parameterized Complexity of Finding Concise Local Explanations</title><link>https://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-finding-concise-local-explanations/</link><pubDate>Sun, 01 Jan 2023 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-finding-concise-local-explanations/</guid><description/></item></channel></rss>