<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Karolina Okrasa | AC Group | TU Wien</title><link>https://ac.notready.eu/author/karolina-okrasa/</link><atom:link href="https://ac.notready.eu/author/karolina-okrasa/index.xml" rel="self" type="application/rss+xml"/><description>Karolina Okrasa</description><generator>Hugo Blox Builder (https://hugoblox.com)</generator><language>en-us</language><lastBuildDate>Mon, 01 Jan 2024 00:00:00 +0000</lastBuildDate><image><url>https://ac.notready.eu/media/logo_hu10234977157890132473.png</url><title>Karolina Okrasa</title><link>https://ac.notready.eu/author/karolina-okrasa/</link></image><item><title>The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width</title><link>https://ac.notready.eu/publication/the-fine-grained-complexity-of-graph-homomorphism-parameterized-by-clique-width-2/</link><pubDate>Mon, 01 Jan 2024 00:00:00 +0000</pubDate><guid>https://ac.notready.eu/publication/the-fine-grained-complexity-of-graph-homomorphism-parameterized-by-clique-width-2/</guid><description/></item><item><title>The Complexity of k-Means Clustering when Little is Known</title><link>https://ac.notready.eu/publication/the-complexity-of-k-means-clustering-when-little-is-known/</link><pubDate>Sat, 01 Jan 2022 00:00:00 +0000</pubDate><guid>https://ac.notready.eu/publication/the-complexity-of-k-means-clustering-when-little-is-known/</guid><description/></item><item><title>The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width</title><link>https://ac.notready.eu/publication/the-fine-grained-complexity-of-graph-homomorphism-parameterized-by-clique-width/</link><pubDate>Sat, 01 Jan 2022 00:00:00 +0000</pubDate><guid>https://ac.notready.eu/publication/the-fine-grained-complexity-of-graph-homomorphism-parameterized-by-clique-width/</guid><description/></item></channel></rss>