Eun Jung Kim | AC Group | TU Wienhttps://ac.tuwien.ac.at/team/eun-jung-kim/Eun Jung KimHugo Blox Builder (https://hugoblox.com)en-usSat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/media/logo_hu10234977157890132473.pngEun Jung Kimhttps://ac.tuwien.ac.at/team/eun-jung-kim/Algorithmic Applications of Tree-Cut Widthhttps://ac.tuwien.ac.at/publication/algorithmic-applications-of-tree-cut-width-2/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/algorithmic-applications-of-tree-cut-width-2/Sum-of-Products with Default Values: Algorithms and Complexity Resultshttps://ac.tuwien.ac.at/publication/sum-of-products-with-default-values-algorithms-and-complexity-results-3/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/sum-of-products-with-default-values-algorithms-and-complexity-results-3/Sum-of-Products with Default Values: Algorithms and Complexity Resultshttps://ac.tuwien.ac.at/publication/sum-of-products-with-default-values-algorithms-and-complexity-results-2/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/sum-of-products-with-default-values-algorithms-and-complexity-results-2/Sum-of-Products with Default Values: Algorithms and Complexity Resultshttps://ac.tuwien.ac.at/publication/sum-of-products-with-default-values-algorithms-and-complexity-results/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/sum-of-products-with-default-values-algorithms-and-complexity-results/Algorithmic Applications of Tree-Cut Widthhttps://ac.tuwien.ac.at/publication/algorithmic-applications-of-tree-cut-width/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/algorithmic-applications-of-tree-cut-width/The Complexity of Repairing, Adjusting, and Aggregating of Extensions in Abstract Argumentationhttps://ac.tuwien.ac.at/publication/the-complexity-of-repairing-adjusting-and-aggregating-of-extensions-in-abstract-argumentation/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-complexity-of-repairing-adjusting-and-aggregating-of-extensions-in-abstract-argumentation/Don't Be Strict in Local Search!https://ac.tuwien.ac.at/publication/don-t-be-strict-in-local-search/Sun, 01 Jan 2012 00:00:00 +0000https://ac.tuwien.ac.at/publication/don-t-be-strict-in-local-search/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/Valued-Based Argumentation for Tree-like Value Graphshttps://ac.tuwien.ac.at/publication/valued-based-argumentation-for-tree-like-value-graphs/Sun, 01 Jan 2012 00:00:00 +0000https://ac.tuwien.ac.at/publication/valued-based-argumentation-for-tree-like-value-graphs/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/Algorithms and Complexity Results for Persuasive Argumentationhttps://ac.tuwien.ac.at/publication/algorithms-and-complexity-results-for-persuasive-argumentation-2/Sat, 01 Jan 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/algorithms-and-complexity-results-for-persuasive-argumentation-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/Algorithms and Complexity Results for Persuasive Argumentationhttps://ac.tuwien.ac.at/publication/algorithms-and-complexity-results-for-persuasive-argumentation/Fri, 01 Jan 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/algorithms-and-complexity-results-for-persuasive-argumentation/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/