<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Niels Gr{ü}ttemeier | AC Group | TU Wien</title><link>https://ac.notready.eu/author/niels-gruttemeier/</link><atom:link href="https://ac.notready.eu/author/niels-gruttemeier/index.xml" rel="self" type="application/rss+xml"/><description>Niels Gr{ü}ttemeier</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>Niels Gr{ü}ttemeier</title><link>https://ac.notready.eu/author/niels-gruttemeier/</link></image><item><title>Efficient Branch-and-Bound Algorithms for Finding Triangle-Constrained 2-Clubs</title><link>https://ac.notready.eu/publication/efficient-branch-and-bound-algorithms-for-finding-triangle-constrained-2-clubs/</link><pubDate>Mon, 01 Jan 2024 00:00:00 +0000</pubDate><guid>https://ac.notready.eu/publication/efficient-branch-and-bound-algorithms-for-finding-triangle-constrained-2-clubs/</guid><description/></item><item><title>On Critical Node Problems with Vulnerable Vertices</title><link>https://ac.notready.eu/publication/on-critical-node-problems-with-vulnerable-vertices-2/</link><pubDate>Mon, 01 Jan 2024 00:00:00 +0000</pubDate><guid>https://ac.notready.eu/publication/on-critical-node-problems-with-vulnerable-vertices-2/</guid><description/></item><item><title>Destroying Multicolored Paths and Cycles in Edge-Colored Graphs</title><link>https://ac.notready.eu/publication/destroying-multicolored-paths-and-cycles-in-edge-colored-graphs/</link><pubDate>Sun, 01 Jan 2023 00:00:00 +0000</pubDate><guid>https://ac.notready.eu/publication/destroying-multicolored-paths-and-cycles-in-edge-colored-graphs/</guid><description/></item><item><title>Multi-Parameter Analysis of Finding Minors and Subgraphs in Edge-Periodic Temporal Graphs</title><link>https://ac.notready.eu/publication/multi-parameter-analysis-of-finding-minors-and-subgraphs-in-edge-periodic-temporal-graphs/</link><pubDate>Sun, 01 Jan 2023 00:00:00 +0000</pubDate><guid>https://ac.notready.eu/publication/multi-parameter-analysis-of-finding-minors-and-subgraphs-in-edge-periodic-temporal-graphs/</guid><description/></item><item><title>Colored cut games</title><link>https://ac.notready.eu/publication/colored-cut-games-2/</link><pubDate>Sat, 01 Jan 2022 00:00:00 +0000</pubDate><guid>https://ac.notready.eu/publication/colored-cut-games-2/</guid><description/></item><item><title>On Critical Node Problems with Vulnerable Vertices</title><link>https://ac.notready.eu/publication/on-critical-node-problems-with-vulnerable-vertices/</link><pubDate>Sat, 01 Jan 2022 00:00:00 +0000</pubDate><guid>https://ac.notready.eu/publication/on-critical-node-problems-with-vulnerable-vertices/</guid><description/></item><item><title>Refined Parameterizations for Computing Colored Cuts in Edge-Colored Graphs</title><link>https://ac.notready.eu/publication/refined-parameterizations-for-computing-colored-cuts-in-edge-colored-graphs-2/</link><pubDate>Sat, 01 Jan 2022 00:00:00 +0000</pubDate><guid>https://ac.notready.eu/publication/refined-parameterizations-for-computing-colored-cuts-in-edge-colored-graphs-2/</guid><description/></item><item><title>Destroying Bicolored $P_3$s by Deleting Few Edges</title><link>https://ac.notready.eu/publication/destroying-bicolored-p-3-s-by-deleting-few-edges-2/</link><pubDate>Fri, 01 Jan 2021 00:00:00 +0000</pubDate><guid>https://ac.notready.eu/publication/destroying-bicolored-p-3-s-by-deleting-few-edges-2/</guid><description/></item><item><title>Preventing Small (s,t)Cuts by Protecting Edges</title><link>https://ac.notready.eu/publication/preventing-small-s-t-cuts-by-protecting-edges/</link><pubDate>Fri, 01 Jan 2021 00:00:00 +0000</pubDate><guid>https://ac.notready.eu/publication/preventing-small-s-t-cuts-by-protecting-edges/</guid><description/></item><item><title>Colored Cut Games</title><link>https://ac.notready.eu/publication/colored-cut-games/</link><pubDate>Wed, 01 Jan 2020 00:00:00 +0000</pubDate><guid>https://ac.notready.eu/publication/colored-cut-games/</guid><description/></item><item><title>Refined Parameterizations for Computing Colored Cuts in Edge-Colored Graphs</title><link>https://ac.notready.eu/publication/refined-parameterizations-for-computing-colored-cuts-in-edge-colored-graphs/</link><pubDate>Wed, 01 Jan 2020 00:00:00 +0000</pubDate><guid>https://ac.notready.eu/publication/refined-parameterizations-for-computing-colored-cuts-in-edge-colored-graphs/</guid><description/></item><item><title>String Factorizations Under Various Collision Constraints</title><link>https://ac.notready.eu/publication/string-factorizations-under-various-collision-constraints/</link><pubDate>Wed, 01 Jan 2020 00:00:00 +0000</pubDate><guid>https://ac.notready.eu/publication/string-factorizations-under-various-collision-constraints/</guid><description/></item><item><title>Destroying Bicolored $P_3$s by Deleting Few Edges</title><link>https://ac.notready.eu/publication/destroying-bicolored-p-3-s-by-deleting-few-edges/</link><pubDate>Tue, 01 Jan 2019 00:00:00 +0000</pubDate><guid>https://ac.notready.eu/publication/destroying-bicolored-p-3-s-by-deleting-few-edges/</guid><description/></item></channel></rss>