<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Petr A. Golovach | AC Group | TU Wien</title><link>https://ac.tuwien.ac.at/team/petr-a.-golovach/</link><atom:link href="https://ac.tuwien.ac.at/team/petr-a.-golovach/index.xml" rel="self" type="application/rss+xml"/><description>Petr A. Golovach</description><generator>Hugo Blox Builder (https://hugoblox.com)</generator><language>en-us</language><lastBuildDate>Sat, 01 Jan 2022 00:00:00 +0000</lastBuildDate><image><url>https://ac.tuwien.ac.at/media/logo_hu10234977157890132473.png</url><title>Petr A. Golovach</title><link>https://ac.tuwien.ac.at/team/petr-a.-golovach/</link></image><item><title>Detours in Directed Graphs</title><link>https://ac.tuwien.ac.at/publication/detours-in-directed-graphs/</link><pubDate>Sat, 01 Jan 2022 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/detours-in-directed-graphs/</guid><description/></item><item><title>FPT Approximation for Fair Minimum-Load Clustering</title><link>https://ac.tuwien.ac.at/publication/fpt-approximation-for-fair-minimum-load-clustering/</link><pubDate>Sat, 01 Jan 2022 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/fpt-approximation-for-fair-minimum-load-clustering/</guid><description/></item><item><title>How to Find a Good Explanation for Clustering?</title><link>https://ac.tuwien.ac.at/publication/how-to-find-a-good-explanation-for-clustering/</link><pubDate>Sat, 01 Jan 2022 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/how-to-find-a-good-explanation-for-clustering/</guid><description/></item><item><title>Longest Cycle above Erdős–Gallai Bound</title><link>https://ac.tuwien.ac.at/publication/longest-cycle-above-erdos-gallai-bound/</link><pubDate>Sat, 01 Jan 2022 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/longest-cycle-above-erdos-gallai-bound/</guid><description/></item><item><title>Lossy Kernelization of Same-Size Clustering</title><link>https://ac.tuwien.ac.at/publication/lossy-kernelization-of-same-size-clustering/</link><pubDate>Sat, 01 Jan 2022 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/lossy-kernelization-of-same-size-clustering/</guid><description/></item><item><title>EPTAS for \emphk-means Clustering of Affine Subspaces</title><link>https://ac.tuwien.ac.at/publication/eptas-for-emphk-means-clustering-of-affine-subspaces/</link><pubDate>Fri, 01 Jan 2021 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/eptas-for-emphk-means-clustering-of-affine-subspaces/</guid><description/></item><item><title>Parameterized Complexity of Feature Selection for Categorical Data Clustering</title><link>https://ac.tuwien.ac.at/publication/parameterized-complexity-of-feature-selection-for-categorical-data-clustering/</link><pubDate>Fri, 01 Jan 2021 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/parameterized-complexity-of-feature-selection-for-categorical-data-clustering/</guid><description/></item><item><title>Parameterized k-Clustering: Tractability island</title><link>https://ac.tuwien.ac.at/publication/parameterized-k-clustering-tractability-island/</link><pubDate>Fri, 01 Jan 2021 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/parameterized-k-clustering-tractability-island/</guid><description/></item><item><title>Low-Rank Binary Matrix Approximation in Column-Sum Norm</title><link>https://ac.tuwien.ac.at/publication/low-rank-binary-matrix-approximation-in-column-sum-norm/</link><pubDate>Wed, 01 Jan 2020 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/low-rank-binary-matrix-approximation-in-column-sum-norm/</guid><description/></item><item><title>Refined Complexity of PCA with Outliers</title><link>https://ac.tuwien.ac.at/publication/refined-complexity-of-pca-with-outliers/</link><pubDate>Tue, 01 Jan 2019 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/refined-complexity-of-pca-with-outliers/</guid><description/></item><item><title>Metric Dimension of Bounded Tree-length Graphs</title><link>https://ac.tuwien.ac.at/publication/metric-dimension-of-bounded-tree-length-graphs/</link><pubDate>Sun, 01 Jan 2017 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/metric-dimension-of-bounded-tree-length-graphs/</guid><description/></item><item><title>Metric Dimension of Bounded Width Graphs</title><link>https://ac.tuwien.ac.at/publication/metric-dimension-of-bounded-width-graphs/</link><pubDate>Thu, 01 Jan 2015 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/metric-dimension-of-bounded-width-graphs/</guid><description/></item><item><title>Parameterized Algorithms to Preserve Connectivity</title><link>https://ac.tuwien.ac.at/publication/parameterized-algorithms-to-preserve-connectivity/</link><pubDate>Wed, 01 Jan 2014 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/parameterized-algorithms-to-preserve-connectivity/</guid><description/></item><item><title>k-Gap Interval Graphs</title><link>https://ac.tuwien.ac.at/publication/k-gap-interval-graphs/</link><pubDate>Sun, 01 Jan 2012 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/k-gap-interval-graphs/</guid><description/></item><item><title>Algorithmic Extensions of Dirac's Theorem</title><link>https://ac.tuwien.ac.at/publication/algorithmic-extensions-of-dirac-s-theorem/</link><pubDate>Thu, 01 Jan 1970 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/algorithmic-extensions-of-dirac-s-theorem/</guid><description/></item></channel></rss>