Kirill Simonov | AC Group | TU Wienhttps://ac.tuwien.ac.at/team/kirill-simonov/Kirill SimonovHugo Blox Builder (https://hugoblox.com)en-usMon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/media/logo_hu10234977157890132473.pngKirill Simonovhttps://ac.tuwien.ac.at/team/kirill-simonov/Counting Vanishing Matrix-Vector Productshttps://ac.tuwien.ac.at/publication/counting-vanishing-matrix-vector-products/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/counting-vanishing-matrix-vector-products/The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Widthhttps://ac.tuwien.ac.at/publication/the-fine-grained-complexity-of-graph-homomorphism-parameterized-by-clique-width-2/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-fine-grained-complexity-of-graph-homomorphism-parameterized-by-clique-width-2/A Parameterized Theory of PAC Learninghttps://ac.tuwien.ac.at/publication/a-parameterized-theory-of-pac-learning/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-parameterized-theory-of-pac-learning/Consistency Checking Problems: A Gateway to Parameterized Sample Complexityhttps://ac.tuwien.ac.at/publication/consistency-checking-problems-a-gateway-to-parameterized-sample-complexity/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/consistency-checking-problems-a-gateway-to-parameterized-sample-complexity/The Parameterized Complexity of Network Microaggregationhttps://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-network-microaggregation/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-parameterized-complexity-of-network-microaggregation/Upward and Orthogonal Planarity are W[1]-Hard Parameterized by Treewidthhttps://ac.tuwien.ac.at/publication/upward-and-orthogonal-planarity-are-w-1-hard-parameterized-by-treewidth/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/upward-and-orthogonal-planarity-are-w-1-hard-parameterized-by-treewidth/Detours in Directed Graphshttps://ac.tuwien.ac.at/publication/detours-in-directed-graphs/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/detours-in-directed-graphs/Fine-grained Complexity of Partial Minimum Satisfiabilityhttps://ac.tuwien.ac.at/publication/fine-grained-complexity-of-partial-minimum-satisfiability/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/fine-grained-complexity-of-partial-minimum-satisfiability/FPT Approximation for Fair Minimum-Load Clusteringhttps://ac.tuwien.ac.at/publication/fpt-approximation-for-fair-minimum-load-clustering/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/fpt-approximation-for-fair-minimum-load-clustering/How to Find a Good Explanation for Clustering?https://ac.tuwien.ac.at/publication/how-to-find-a-good-explanation-for-clustering/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/how-to-find-a-good-explanation-for-clustering/Longest Cycle above Erdős–Gallai Boundhttps://ac.tuwien.ac.at/publication/longest-cycle-above-erdos-gallai-bound/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/longest-cycle-above-erdos-gallai-bound/Parameterized Algorithms for Upward Planarityhttps://ac.tuwien.ac.at/publication/parameterized-algorithms-for-upward-planarity/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-upward-planarity/Testing Upward Planarity of Partial 2-Treeshttps://ac.tuwien.ac.at/publication/testing-upward-planarity-of-partial-2-trees/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/testing-upward-planarity-of-partial-2-trees/The Complexity of k-Means Clustering when Little is Knownhttps://ac.tuwien.ac.at/publication/the-complexity-of-k-means-clustering-when-little-is-known/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-complexity-of-k-means-clustering-when-little-is-known/The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Widthhttps://ac.tuwien.ac.at/publication/the-fine-grained-complexity-of-graph-homomorphism-parameterized-by-clique-width/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-fine-grained-complexity-of-graph-homomorphism-parameterized-by-clique-width/Weighted Model Counting with Twin-Widthhttps://ac.tuwien.ac.at/publication/weighted-model-counting-with-twin-width/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/weighted-model-counting-with-twin-width/EPTAS for \emphk-means Clustering of Affine Subspaceshttps://ac.tuwien.ac.at/publication/eptas-for-emphk-means-clustering-of-affine-subspaces/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/eptas-for-emphk-means-clustering-of-affine-subspaces/On Coresets for Fair Clustering in Metric and Euclidean Spaces and Their Applicationshttps://ac.tuwien.ac.at/publication/on-coresets-for-fair-clustering-in-metric-and-euclidean-spaces-and-their-applications/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-coresets-for-fair-clustering-in-metric-and-euclidean-spaces-and-their-applications/Parameterized Complexity of Feature Selection for Categorical Data Clusteringhttps://ac.tuwien.ac.at/publication/parameterized-complexity-of-feature-selection-for-categorical-data-clustering/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-complexity-of-feature-selection-for-categorical-data-clustering/Parameterized k-Clustering: Tractability islandhttps://ac.tuwien.ac.at/publication/parameterized-k-clustering-tractability-island/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-k-clustering-tractability-island/Building Large k-Cores from Sparse Graphshttps://ac.tuwien.ac.at/publication/building-large-k-cores-from-sparse-graphs/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/building-large-k-cores-from-sparse-graphs/Low-Rank Binary Matrix Approximation in Column-Sum Normhttps://ac.tuwien.ac.at/publication/low-rank-binary-matrix-approximation-in-column-sum-norm/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/low-rank-binary-matrix-approximation-in-column-sum-norm/Manipulating Districts to Win Elections: Fine-Grained Complexityhttps://ac.tuwien.ac.at/publication/manipulating-districts-to-win-elections-fine-grained-complexity/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/manipulating-districts-to-win-elections-fine-grained-complexity/Refined Complexity of PCA with Outliershttps://ac.tuwien.ac.at/publication/refined-complexity-of-pca-with-outliers/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/refined-complexity-of-pca-with-outliers/Algorithmic Extensions of Dirac's Theoremhttps://ac.tuwien.ac.at/publication/algorithmic-extensions-of-dirac-s-theorem/Thu, 01 Jan 1970 00:00:00 +0000https://ac.tuwien.ac.at/publication/algorithmic-extensions-of-dirac-s-theorem/