Anders Yeo | AC Group | TU Wienhttps://ac.tuwien.ac.at/team/anders-yeo/Anders YeoHugo Blox Builder (https://hugoblox.com)en-usSun, 01 Jan 2012 00:00:00 +0000https://ac.tuwien.ac.at/media/logo_hu10234977157890132473.pngAnders Yeohttps://ac.tuwien.ac.at/team/anders-yeo/Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programminghttps://ac.tuwien.ac.at/publication/parameterized-complexity-results-for-general-factors-in-bipartite-graphs-with-an-application-to-constraint-programming-2/Sun, 01 Jan 2012 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-complexity-results-for-general-factors-in-bipartite-graphs-with-an-application-to-constraint-programming-2/A probabilistic approach to problems parameterized above or below tight boundshttps://ac.tuwien.ac.at/publication/a-probabilistic-approach-to-problems-parameterized-above-or-below-tight-bounds-2/Sat, 01 Jan 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-probabilistic-approach-to-problems-parameterized-above-or-below-tight-bounds-2/Solving MAX-r-SAT above a tight lower boundhttps://ac.tuwien.ac.at/publication/solving-max-r-sat-above-a-tight-lower-bound-2/Sat, 01 Jan 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/solving-max-r-sat-above-a-tight-lower-bound-2/Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programminghttps://ac.tuwien.ac.at/publication/parameterized-complexity-results-for-general-factors-in-bipartite-graphs-with-an-application-to-constraint-programming/Fri, 01 Jan 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-complexity-results-for-general-factors-in-bipartite-graphs-with-an-application-to-constraint-programming/Solving MAX-r-SAT Above a Tight Lower Boundhttps://ac.tuwien.ac.at/publication/solving-max-r-sat-above-a-tight-lower-bound/Fri, 01 Jan 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/solving-max-r-sat-above-a-tight-lower-bound/A Probabilistic Approach to Problems Parameterized above or below Tight Boundshttps://ac.tuwien.ac.at/publication/a-probabilistic-approach-to-problems-parameterized-above-or-below-tight-bounds/Thu, 01 Jan 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-probabilistic-approach-to-problems-parameterized-above-or-below-tight-bounds/Fixed-parameter complexity of minimum profile problemshttps://ac.tuwien.ac.at/publication/fixed-parameter-complexity-of-minimum-profile-problems-2/Tue, 01 Jan 2008 00:00:00 +0000https://ac.tuwien.ac.at/publication/fixed-parameter-complexity-of-minimum-profile-problems-2/The Linear Arrangement Problem Parameterized Above Guaranteed Valuehttps://ac.tuwien.ac.at/publication/the-linear-arrangement-problem-parameterized-above-guaranteed-value-2/Mon, 01 Jan 2007 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-linear-arrangement-problem-parameterized-above-guaranteed-value-2/Fixed-Parameter Complexity of Minimum Profile Problemshttps://ac.tuwien.ac.at/publication/fixed-parameter-complexity-of-minimum-profile-problems/Sun, 01 Jan 2006 00:00:00 +0000https://ac.tuwien.ac.at/publication/fixed-parameter-complexity-of-minimum-profile-problems/The Linear Arrangement Problem Parameterized Above Guaranteed Valuehttps://ac.tuwien.ac.at/publication/the-linear-arrangement-problem-parameterized-above-guaranteed-value/Sun, 01 Jan 2006 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-linear-arrangement-problem-parameterized-above-guaranteed-value/