<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Geevarghese Philip | AC Group | TU Wien</title><link>https://ac.notready.eu/author/geevarghese-philip/</link><atom:link href="https://ac.notready.eu/author/geevarghese-philip/index.xml" rel="self" type="application/rss+xml"/><description>Geevarghese Philip</description><generator>Hugo Blox Builder (https://hugoblox.com)</generator><language>en-us</language><lastBuildDate>Wed, 01 Jan 2014 00:00:00 +0000</lastBuildDate><image><url>https://ac.notready.eu/media/logo_hu10234977157890132473.png</url><title>Geevarghese Philip</title><link>https://ac.notready.eu/author/geevarghese-philip/</link></image><item><title>Vertex Exponential Algorithms for Connected f-Factors</title><link>https://ac.notready.eu/publication/vertex-exponential-algorithms-for-connected-f-factors/</link><pubDate>Wed, 01 Jan 2014 00:00:00 +0000</pubDate><guid>https://ac.notready.eu/publication/vertex-exponential-algorithms-for-connected-f-factors/</guid><description/></item><item><title>Hardness of r-dominating set on Graphs of Diameter (r + 1)</title><link>https://ac.notready.eu/publication/hardness-of-r-dominating-set-on-graphs-of-diameter-r-1/</link><pubDate>Tue, 01 Jan 2013 00:00:00 +0000</pubDate><guid>https://ac.notready.eu/publication/hardness-of-r-dominating-set-on-graphs-of-diameter-r-1/</guid><description/></item><item><title>On the Kernelization Complexity of Colorful Motifs</title><link>https://ac.notready.eu/publication/on-the-kernelization-complexity-of-colorful-motifs/</link><pubDate>Fri, 01 Jan 2010 00:00:00 +0000</pubDate><guid>https://ac.notready.eu/publication/on-the-kernelization-complexity-of-colorful-motifs/</guid><description/></item></channel></rss>