<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Yoshio Okamoto | AC Group | TU Wien</title><link>https://ac.notready.eu/author/yoshio-okamoto/</link><atom:link href="https://ac.notready.eu/author/yoshio-okamoto/index.xml" rel="self" type="application/rss+xml"/><description>Yoshio Okamoto</description><generator>Hugo Blox Builder (https://hugoblox.com)</generator><language>en-us</language><lastBuildDate>Fri, 01 Jan 2021 00:00:00 +0000</lastBuildDate><image><url>https://ac.notready.eu/media/logo_hu10234977157890132473.png</url><title>Yoshio Okamoto</title><link>https://ac.notready.eu/author/yoshio-okamoto/</link></image><item><title>ClusterSets: Optimizing Planar Clusters in Categorical Point Data</title><link>https://ac.notready.eu/publication/clustersets-optimizing-planar-clusters-in-categorical-point-data/</link><pubDate>Fri, 01 Jan 2021 00:00:00 +0000</pubDate><guid>https://ac.notready.eu/publication/clustersets-optimizing-planar-clusters-in-categorical-point-data/</guid><description/></item><item><title>Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity</title><link>https://ac.notready.eu/publication/orthogonal-and-smooth-orthogonal-layouts-of-1-planar-graphs-with-low-edge-complexity/</link><pubDate>Mon, 01 Jan 2018 00:00:00 +0000</pubDate><guid>https://ac.notready.eu/publication/orthogonal-and-smooth-orthogonal-layouts-of-1-planar-graphs-with-low-edge-complexity/</guid><description/></item><item><title>Semantic Word Cloud Representations: Hardness and Approximation Algorithms</title><link>https://ac.notready.eu/publication/semantic-word-cloud-representations-hardness-and-approximation-algorithms/</link><pubDate>Wed, 01 Jan 2014 00:00:00 +0000</pubDate><guid>https://ac.notready.eu/publication/semantic-word-cloud-representations-hardness-and-approximation-algorithms/</guid><description/></item><item><title>Drawing (Complete) Binary Tanglegrams</title><link>https://ac.notready.eu/publication/drawing-complete-binary-tanglegrams/</link><pubDate>Sun, 01 Jan 2012 00:00:00 +0000</pubDate><guid>https://ac.notready.eu/publication/drawing-complete-binary-tanglegrams/</guid><description/></item><item><title>Drawing (Complete) Binary Tanglegrams: Hardness, Approximation, Fixed-Parameter Tractability</title><link>https://ac.notready.eu/publication/drawing-complete-binary-tanglegrams-hardness-approximation-fixed-parameter-tractability/</link><pubDate>Thu, 01 Jan 2009 00:00:00 +0000</pubDate><guid>https://ac.notready.eu/publication/drawing-complete-binary-tanglegrams-hardness-approximation-fixed-parameter-tractability/</guid><description/></item></channel></rss>