<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Vaishali Surianarayanan | AC Group | TU Wien</title><link>https://ac.tuwien.ac.at/team/vaishali-surianarayanan/</link><atom:link href="https://ac.tuwien.ac.at/team/vaishali-surianarayanan/index.xml" rel="self" type="application/rss+xml"/><description>Vaishali Surianarayanan</description><generator>Hugo Blox Builder (https://hugoblox.com)</generator><language>en-us</language><lastBuildDate>Thu, 01 Jan 2026 00:00:00 +0000</lastBuildDate><image><url>https://ac.tuwien.ac.at/media/logo_hu10234977157890132473.png</url><title>Vaishali Surianarayanan</title><link>https://ac.tuwien.ac.at/team/vaishali-surianarayanan/</link></image><item><title>A Quasi-Polynomial Time Algorithm for 3-Coloring Circle Graphs</title><link>https://ac.tuwien.ac.at/publication/a-quasi-polynomial-time-algorithm-for-3-coloring-circle-graphs/</link><pubDate>Thu, 01 Jan 2026 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-quasi-polynomial-time-algorithm-for-3-coloring-circle-graphs/</guid><description/></item><item><title>Circle Graph 3-Coloring: Can Simplicity Beat SAT?</title><link>https://ac.tuwien.ac.at/publication/circle-graph-3-coloring-can-simplicity-beat-sat/</link><pubDate>Thu, 01 Jan 2026 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/circle-graph-3-coloring-can-simplicity-beat-sat/</guid><description/></item><item><title>Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms</title><link>https://ac.tuwien.ac.at/publication/linear-layouts-revisited-stacks-queues-and-exact-algorithms/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/linear-layouts-revisited-stacks-queues-and-exact-algorithms/</guid><description/></item></channel></rss>