<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Tomohiro Koana | AC Group | TU Wien</title><link>https://ac.notready.eu/author/tomohiro-koana/</link><atom:link href="https://ac.notready.eu/author/tomohiro-koana/index.xml" rel="self" type="application/rss+xml"/><description>Tomohiro Koana</description><generator>Hugo Blox Builder (https://hugoblox.com)</generator><language>en-us</language><lastBuildDate>Sun, 01 Jan 2023 00:00:00 +0000</lastBuildDate><image><url>https://ac.notready.eu/media/logo_hu10234977157890132473.png</url><title>Tomohiro Koana</title><link>https://ac.notready.eu/author/tomohiro-koana/</link></image><item><title>Computing Dense and Sparse Subgraphs of Weakly Closed Graphs</title><link>https://ac.notready.eu/publication/computing-dense-and-sparse-subgraphs-of-weakly-closed-graphs-2/</link><pubDate>Sun, 01 Jan 2023 00:00:00 +0000</pubDate><guid>https://ac.notready.eu/publication/computing-dense-and-sparse-subgraphs-of-weakly-closed-graphs-2/</guid><description/></item><item><title>Essentially Tight Kernels for (Weakly) Closed Graphs</title><link>https://ac.notready.eu/publication/essentially-tight-kernels-for-weakly-closed-graphs-2/</link><pubDate>Sun, 01 Jan 2023 00:00:00 +0000</pubDate><guid>https://ac.notready.eu/publication/essentially-tight-kernels-for-weakly-closed-graphs-2/</guid><description/></item><item><title>Covering Many (Or Few) Edges with k Vertices in Sparse Graphs</title><link>https://ac.notready.eu/publication/covering-many-or-few-edges-with-k-vertices-in-sparse-graphs/</link><pubDate>Sat, 01 Jan 2022 00:00:00 +0000</pubDate><guid>https://ac.notready.eu/publication/covering-many-or-few-edges-with-k-vertices-in-sparse-graphs/</guid><description/></item><item><title>Exploiting \textdollarc\textdollar-Closure in Kernelization Algorithms for Graph Problems</title><link>https://ac.notready.eu/publication/exploiting-textdollarc-textdollar-closure-in-kernelization-algorithms-for-graph-problems/</link><pubDate>Sat, 01 Jan 2022 00:00:00 +0000</pubDate><guid>https://ac.notready.eu/publication/exploiting-textdollarc-textdollar-closure-in-kernelization-algorithms-for-graph-problems/</guid><description/></item><item><title>Essentially Tight Kernels For (Weakly) Closed Graphs</title><link>https://ac.notready.eu/publication/essentially-tight-kernels-for-weakly-closed-graphs/</link><pubDate>Fri, 01 Jan 2021 00:00:00 +0000</pubDate><guid>https://ac.notready.eu/publication/essentially-tight-kernels-for-weakly-closed-graphs/</guid><description/></item><item><title>Computing Dense and Sparse Subgraphs of Weakly Closed Graphs</title><link>https://ac.notready.eu/publication/computing-dense-and-sparse-subgraphs-of-weakly-closed-graphs/</link><pubDate>Wed, 01 Jan 2020 00:00:00 +0000</pubDate><guid>https://ac.notready.eu/publication/computing-dense-and-sparse-subgraphs-of-weakly-closed-graphs/</guid><description/></item><item><title>Exploiting c-Closure in Kernelization Algorithms for Graph Problems</title><link>https://ac.notready.eu/publication/exploiting-c-closure-in-kernelization-algorithms-for-graph-problems/</link><pubDate>Wed, 01 Jan 2020 00:00:00 +0000</pubDate><guid>https://ac.notready.eu/publication/exploiting-c-closure-in-kernelization-algorithms-for-graph-problems/</guid><description/></item></channel></rss>