<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Subrahmanyam Kalyanasundaram | AC Group | TU Wien</title><link>https://ac.tuwien.ac.at/team/subrahmanyam-kalyanasundaram/</link><atom:link href="https://ac.tuwien.ac.at/team/subrahmanyam-kalyanasundaram/index.xml" rel="self" type="application/rss+xml"/><description>Subrahmanyam Kalyanasundaram</description><generator>Hugo Blox Builder (https://hugoblox.com)</generator><language>en-us</language><lastBuildDate>Wed, 01 Jan 2025 00:00:00 +0000</lastBuildDate><image><url>https://ac.tuwien.ac.at/media/logo_hu10234977157890132473.png</url><title>Subrahmanyam Kalyanasundaram</title><link>https://ac.tuwien.ac.at/team/subrahmanyam-kalyanasundaram/</link></image><item><title>The complexity of optimizing atomic congestion</title><link>https://ac.tuwien.ac.at/publication/the-complexity-of-optimizing-atomic-congestion-2/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/the-complexity-of-optimizing-atomic-congestion-2/</guid><description/></item><item><title>Conflict-Free Coloring: Graphs of Bounded Clique-Width and Intersection Graphs</title><link>https://ac.tuwien.ac.at/publication/conflict-free-coloring-graphs-of-bounded-clique-width-and-intersection-graphs/</link><pubDate>Mon, 01 Jan 2024 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/conflict-free-coloring-graphs-of-bounded-clique-width-and-intersection-graphs/</guid><description/></item><item><title>The Complexity of Optimizing Atomic Congestion</title><link>https://ac.tuwien.ac.at/publication/the-complexity-of-optimizing-atomic-congestion/</link><pubDate>Mon, 01 Jan 2024 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/the-complexity-of-optimizing-atomic-congestion/</guid><description/></item></channel></rss>