<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Somnath Sikdar | AC Group | TU Wien</title><link>https://ac.tuwien.ac.at/team/somnath-sikdar/</link><atom:link href="https://ac.tuwien.ac.at/team/somnath-sikdar/index.xml" rel="self" type="application/rss+xml"/><description>Somnath Sikdar</description><generator>Hugo Blox Builder (https://hugoblox.com)</generator><language>en-us</language><lastBuildDate>Sun, 01 Jan 2017 00:00:00 +0000</lastBuildDate><image><url>https://ac.tuwien.ac.at/media/logo_hu10234977157890132473.png</url><title>Somnath Sikdar</title><link>https://ac.tuwien.ac.at/team/somnath-sikdar/</link></image><item><title>Kernelization using structural parameters on sparse graph classes</title><link>https://ac.tuwien.ac.at/publication/kernelization-using-structural-parameters-on-sparse-graph-classes-2/</link><pubDate>Sun, 01 Jan 2017 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/kernelization-using-structural-parameters-on-sparse-graph-classes-2/</guid><description/></item><item><title>Are There Any Good Digraph Measures?</title><link>https://ac.tuwien.ac.at/publication/are-there-any-good-digraph-measures/</link><pubDate>Fri, 01 Jan 2016 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/are-there-any-good-digraph-measures/</guid><description/></item><item><title>Finite Integer Index of Pathwidth and Treewidth</title><link>https://ac.tuwien.ac.at/publication/finite-integer-index-of-pathwidth-and-treewidth/</link><pubDate>Wed, 01 Jan 2014 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/finite-integer-index-of-pathwidth-and-treewidth/</guid><description/></item><item><title>Lower bounds on the complexity of MSO1 model-checking</title><link>https://ac.tuwien.ac.at/publication/lower-bounds-on-the-complexity-of-mso1-model-checking-2/</link><pubDate>Wed, 01 Jan 2014 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/lower-bounds-on-the-complexity-of-mso1-model-checking-2/</guid><description/></item><item><title>Kernelization Using Structural Parameters on Sparse Graph Classes</title><link>https://ac.tuwien.ac.at/publication/kernelization-using-structural-parameters-on-sparse-graph-classes/</link><pubDate>Tue, 01 Jan 2013 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/kernelization-using-structural-parameters-on-sparse-graph-classes/</guid><description/></item><item><title>Lower Bounds on the Complexity of MSO1 Model-Checking</title><link>https://ac.tuwien.ac.at/publication/lower-bounds-on-the-complexity-of-mso1-model-checking/</link><pubDate>Sun, 01 Jan 2012 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/lower-bounds-on-the-complexity-of-mso1-model-checking/</guid><description/></item><item><title>Are There Any Good Digraph Width Measures?</title><link>https://ac.tuwien.ac.at/publication/are-there-any-good-digraph-width-measures/</link><pubDate>Fri, 01 Jan 2010 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/are-there-any-good-digraph-width-measures/</guid><description/></item></channel></rss>