<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Gregory Gutin | AC Group | TU Wien</title><link>https://ac.tuwien.ac.at/team/gregory-gutin/</link><atom:link href="https://ac.tuwien.ac.at/team/gregory-gutin/index.xml" rel="self" type="application/rss+xml"/><description>Gregory Gutin</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>Gregory Gutin</title><link>https://ac.tuwien.ac.at/team/gregory-gutin/</link></image><item><title>Path-Contractions, Edge Deletions and Connectivity Preservation</title><link>https://ac.tuwien.ac.at/publication/path-contractions-edge-deletions-and-connectivity-preservation/</link><pubDate>Sun, 01 Jan 2017 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/path-contractions-edge-deletions-and-connectivity-preservation/</guid><description/></item><item><title>Fixed-Parameter Tractability of Workflow Satisfiability in the Presence of Seniority Constraints</title><link>https://ac.tuwien.ac.at/publication/fixed-parameter-tractability-of-workflow-satisfiability-in-the-presence-of-seniority-constraints/</link><pubDate>Tue, 01 Jan 2013 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/fixed-parameter-tractability-of-workflow-satisfiability-in-the-presence-of-seniority-constraints/</guid><description/></item><item><title>Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming</title><link>https://ac.tuwien.ac.at/publication/parameterized-complexity-results-for-general-factors-in-bipartite-graphs-with-an-application-to-constraint-programming-2/</link><pubDate>Sun, 01 Jan 2012 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/parameterized-complexity-results-for-general-factors-in-bipartite-graphs-with-an-application-to-constraint-programming-2/</guid><description/></item><item><title>A probabilistic approach to problems parameterized above or below tight bounds</title><link>https://ac.tuwien.ac.at/publication/a-probabilistic-approach-to-problems-parameterized-above-or-below-tight-bounds-2/</link><pubDate>Sat, 01 Jan 2011 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-probabilistic-approach-to-problems-parameterized-above-or-below-tight-bounds-2/</guid><description/></item><item><title>Solving MAX-r-SAT above a tight lower bound</title><link>https://ac.tuwien.ac.at/publication/solving-max-r-sat-above-a-tight-lower-bound-2/</link><pubDate>Sat, 01 Jan 2011 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/solving-max-r-sat-above-a-tight-lower-bound-2/</guid><description/></item><item><title>Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming</title><link>https://ac.tuwien.ac.at/publication/parameterized-complexity-results-for-general-factors-in-bipartite-graphs-with-an-application-to-constraint-programming/</link><pubDate>Fri, 01 Jan 2010 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/parameterized-complexity-results-for-general-factors-in-bipartite-graphs-with-an-application-to-constraint-programming/</guid><description/></item><item><title>Solving MAX-r-SAT Above a Tight Lower Bound</title><link>https://ac.tuwien.ac.at/publication/solving-max-r-sat-above-a-tight-lower-bound/</link><pubDate>Fri, 01 Jan 2010 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/solving-max-r-sat-above-a-tight-lower-bound/</guid><description/></item><item><title>A Probabilistic Approach to Problems Parameterized above or below Tight Bounds</title><link>https://ac.tuwien.ac.at/publication/a-probabilistic-approach-to-problems-parameterized-above-or-below-tight-bounds/</link><pubDate>Thu, 01 Jan 2009 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-probabilistic-approach-to-problems-parameterized-above-or-below-tight-bounds/</guid><description/></item><item><title>Fixed-parameter complexity of minimum profile problems</title><link>https://ac.tuwien.ac.at/publication/fixed-parameter-complexity-of-minimum-profile-problems-2/</link><pubDate>Tue, 01 Jan 2008 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/fixed-parameter-complexity-of-minimum-profile-problems-2/</guid><description/></item><item><title>The Linear Arrangement Problem Parameterized Above Guaranteed Value</title><link>https://ac.tuwien.ac.at/publication/the-linear-arrangement-problem-parameterized-above-guaranteed-value-2/</link><pubDate>Mon, 01 Jan 2007 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/the-linear-arrangement-problem-parameterized-above-guaranteed-value-2/</guid><description/></item><item><title>Fixed-Parameter Complexity of Minimum Profile Problems</title><link>https://ac.tuwien.ac.at/publication/fixed-parameter-complexity-of-minimum-profile-problems/</link><pubDate>Sun, 01 Jan 2006 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/fixed-parameter-complexity-of-minimum-profile-problems/</guid><description/></item><item><title>The Linear Arrangement Problem Parameterized Above Guaranteed Value</title><link>https://ac.tuwien.ac.at/publication/the-linear-arrangement-problem-parameterized-above-guaranteed-value/</link><pubDate>Sun, 01 Jan 2006 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/the-linear-arrangement-problem-parameterized-above-guaranteed-value/</guid><description/></item></channel></rss>