Eun Jung Kim - RankMe

161 papers A* 15A 6B 16C 4Misc 2Journal 109Unranked 8

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Fast Shortest Path in Graphs With Sparse Signed Tree Models and Applications. CoRR Édouard Bonnet, Colin Geniet, Eun Jung Kim, Sungmin Moon
2025	J	`jnl`	A Tight Meta-theorem for LOCAL Certification of MSO CoRR Linda Cook, Eun Jung Kim, Tomás Masarík
2025	J	`jnl`	A constant-factor approximation for weighted bond cover. J. Comput. Syst. Sci. Eun Jung Kim, Euiwoong Lee, Dimitrios M. Thilikos
2025	A*	`conf`	A tight meta-theorem for LOCAL certification of MSO2 properties within bounded treewidth graphs. PODC Linda Cook, Eun Jung Kim, Tomás Masarík
2025	A	`conf`	Approximating Maximum Cut on Interval Graphs and Split Graphs Beyond Goemans-Williamson. APPROX/RANDOM Jungho Ahn, Ian DeHaan, Eun Jung Kim, Euiwoong Lee
2025	J	`jnl`	Approximating Maximum Cut on Interval Graphs and Split Graphs beyond Goemans-Williamson. CoRR Jungho Ahn, Ian DeHaan, Eun Jung Kim, Euiwoong Lee
2025	J	`jnl`	Bandwidth Parameterized by Cluster Vertex Deletion Number. Algorithmica Tatsuya Gima, Eun Jung Kim, Noleen Köhler, Nikolaos Melissinos, Manolis Vasilakis
2025	A	`conf`	CMSO-Transducing Tree-Like Graph Decompositions. STACS Rutger Campbell, Bruno Guillon, Mamadou Moustapha Kanté, Eun Jung Kim, Noleen Köhler
2025	J	`jnl`	Flow-Augmentation III: Complexity Dichotomy for Boolean CSPs Parameterized by the Number of Unsatisfied Constraints. SIAM J. Comput. Eun Jung Kim, Stefan Kratsch, Marcin Pilipczuk, Magnus Wahlström
2025	J	`jnl`	Flow-augmentation I: Directed graphs. J. ACM Eun Jung Kim, Stefan Kratsch, Marcin Pilipczuk, Magnus Wahlström
2025	J	`jnl`	Introduction: ACM-SIAM Symposium on Discrete Algorithms (SODA) 2023 Special Issue. ACM Trans. Algorithms Nikhil Bansal, Eun Jung Kim, Viswanath Nagarajan, Aaron Potechin, Lars Rohwedder
2025	A*	`conf`	Recognisability Equals Definability for Finitely Representable Matroids of Bounded Path-Width. LICS Rutger Campbell, Bruno Guillon, Mamadou Moustapha Kanté, Eun Jung Kim, Sang-il Oum
2024	J	`jnl`	CMSO-transducing tree-like graph decompositions. CoRR Rutger Campbell, Bruno Guillon, Mamadou Moustapha Kanté, Eun Jung Kim, Noleen Köhler
2024	J	`jnl`	Flow-augmentation II: Undirected Graphs. ACM Trans. Algorithms Eun Jung Kim, Stefan Kratsch, Marcin Pilipczuk, Magnus Wahlström
2024	J	`jnl`	On Weighted Graph Separation Problems and Flow Augmentation. SIAM J. Discret. Math. Eun Jung Kim, Tomás Masarík, Marcin Pilipczuk, Roohani Sharma, Magnus Wahlström
2024	J	`jnl`	Representing Matroids over the Reals is ∃ℝ-complete. Discret. Math. Theor. Comput. Sci. Eun Jung Kim, Arnaud de Mesmay, Tillmann Miltzow
2024	J	`jnl`	Twin-Width III: Max Independent Set, Min Dominating Set, and Coloring. SIAM J. Comput. Édouard Bonnet, Colin Geniet, Eun Jung Kim, Stéphan Thomassé, Rémi Watrigant
2023	B	`conf`	Bandwidth Parameterized by Cluster Vertex Deletion Number. IPEC Tatsuya Gima, Eun Jung Kim, Noleen Köhler, Nikolaos Melissinos, Manolis Vasilakis
2023	J	`jnl`	Bandwidth Parameterized by Cluster Vertex Deletion Number. CoRR Tatsuya Gima, Eun Jung Kim, Noleen Köhler, Nikolaos Melissinos, Manolis Vasilakis
2023	A*	`conf`	Flow-augmentation III: Complexity dichotomy for Boolean CSPs parameterized by the number of unsatisfied constraints. SODA Eun Jung Kim, Stefan Kratsch, Marcin Pilipczuk, Magnus Wahlström
2023	J	`jnl`	Grundy Coloring and Friends, Half-Graphs, Bicliques. Algorithmica Pierre Aboulker, Édouard Bonnet, Eun Jung Kim, Florian Sikora
2023	J	`jnl`	New Results on Directed Edge Dominating Set. Discret. Math. Theor. Comput. Sci. Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Eun Jung Kim, Michael Lampis
2023	J	`jnl`	Obstructions for matroids of path-width at most J. Comb. Theory B Mamadou Moustapha Kanté, Eun Jung Kim, O-joung Kwon, Sang-il Oum
2022	J	`jnl`	Algorithmic Applications of Tree-Cut Width. CoRR Robert Ganian, Eun Jung Kim, Stefan Szeider
2022	J	`jnl`	Algorithmic Applications of Tree-Cut Width. SIAM J. Discret. Math. Robert Ganian, Eun Jung Kim, Stefan Szeider
2022	J	`jnl`	Complexity and algorithms for constant diameter augmentation problems. Theor. Comput. Sci. Eun Jung Kim, Martin Milanic, Jérôme Monnot, Christophe Picouleau
2022	A*	`conf`	Directed flow-augmentation. STOC Eun Jung Kim, Stefan Kratsch, Marcin Pilipczuk, Magnus Wahlström
2022	J	`jnl`	Flow-augmentation III: Complexity dichotomy for Boolean CSPs parameterized by the number of unsatisfied constraints. CoRR Eun Jung Kim, Stefan Kratsch, Marcin Pilipczuk, Magnus Wahlström
2022	J	`jnl`	Grundy Distinguishes Treewidth from Pathwidth. SIAM J. Discret. Math. Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi
2022	A	`conf`	Obstructions for Matroids of Path-Width at most k and Graphs of Linear Rank-Width at most k. STACS Mamadou Moustapha Kanté, Eun Jung Kim, O-joung Kwon, Sang-il Oum
2022	J	`jnl`	On weighted graph separation problems and flow-augmentation. CoRR Eun Jung Kim, Marcin Pilipczuk, Roohani Sharma, Magnus Wahlström
2022	J	`jnl`	Sum-of-Products with Default Values: Algorithms and Complexity Results. J. Artif. Intell. Res. Robert Ganian, Eun Jung Kim, Friedrich Slivovsky, Stefan Szeider
2022	J	`jnl`	Towards Constant-Factor Approximation for Chordal/Distance-Hereditary Vertex Deletion. Algorithmica Jungho Ahn, Eun Jung Kim, Euiwoong Lee
2022	B	`conf`	Twin-Width VIII: Delineation and Win-Wins. IPEC Édouard Bonnet, Dibyayan Chakraborty, Eun Jung Kim, Noleen Köhler, Raul Lopes, Stéphan Thomassé
2022	J	`jnl`	Twin-width I: Tractable FO Model Checking. J. ACM Édouard Bonnet, Eun Jung Kim, Stéphan Thomassé, Rémi Watrigant
2022	J	`jnl`	Twin-width II: small classes. Comb. Theory Édouard Bonnet, Colin Geniet, Eun Jung Kim, Stéphan Thomassé, Rémi Watrigant
2022	A*	`conf`	Twin-width VI: the lens of contraction sequences. SODA Édouard Bonnet, Eun Jung Kim, Amadeus Reinald, Stéphan Thomassé
2022	J	`jnl`	Twin-width VIII: delineation and win-wins. CoRR Édouard Bonnet, Dibyayan Chakraborty, Eun Jung Kim, Noleen Köhler, Raul Lopes, Stéphan Thomassé
2022	J	`jnl`	Twin-width and Polynomial Kernels. Algorithmica Édouard Bonnet, Eun Jung Kim, Amadeus Reinald, Stéphan Thomassé, Rémi Watrigant
2021	—	`conf`	A Constant-Factor Approximation for Weighted Bond Cover. APPROX-RANDOM Eun Jung Kim, Euiwoong Lee, Dimitrios M. Thilikos
2021	J	`jnl`	A Constant-factor Approximation for Weighted Bond Cover. CoRR Eun Jung Kim, Euiwoong Lee, Dimitrios M. Thilikos
2021	J	`jnl`	A Polynomial Kernel for Distance-Hereditary Vertex Deletion. Algorithmica Eun Jung Kim, O-joung Kwon
2021	J	`jnl`	Directed flow-augmentation. CoRR Eun Jung Kim, Stefan Kratsch, Marcin Pilipczuk, Magnus Wahlström
2021	J	`jnl`	EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs. CoRR Marthe Bonamy, Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Panos Giannopoulos, Eun Jung Kim, Pawel Rzazewski, Florian Sikora, Stéphan Thomassé
2021	J	`jnl`	EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs. J. ACM Marthe Bonamy, Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Panos Giannopoulos, Eun Jung Kim, Pawel Rzazewski, Florian Sikora, Stéphan Thomassé
2021	J	`jnl`	Finding Branch-Decompositions of Matroids, Hypergraphs, and More. SIAM J. Discret. Math. Jisu Jeong, Eun Jung Kim, Sang-il Oum
2021	J	`jnl`	On the tree-width of even-hole-free graphs. Eur. J. Comb. Pierre Aboulker, Isolde Adler, Eun Jung Kim, Ni Luh Dewi Sintiari, Nicolas Trotignon
2021	A*	`conf`	Solving hard cut problems via flow-augmentation. SODA Eun Jung Kim, Stefan Kratsch, Marcin Pilipczuk, Magnus Wahlström
2021	J	`jnl`	Token Sliding on Split Graphs. Theory Comput. Syst. Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi, Florian Sikora
2021	B	`conf`	Twin-Width and Polynomial Kernels. IPEC Édouard Bonnet, Eun Jung Kim, Amadeus Reinald, Stéphan Thomassé, Rémi Watrigant
2021	A*	`conf`	Twin-width II: small classes. SODA Édouard Bonnet, Colin Geniet, Eun Jung Kim, Stéphan Thomassé, Rémi Watrigant
2021	A*	`conf`	Twin-width III: Max Independent Set, Min Dominating Set, and Coloring. ICALP Édouard Bonnet, Colin Geniet, Eun Jung Kim, Stéphan Thomassé, Rémi Watrigant
2021	J	`jnl`	Twin-width VI: the lens of contraction sequences. CoRR Édouard Bonnet, Eun Jung Kim, Amadeus Reinald, Stéphan Thomassé
2021	J	`jnl`	Twin-width and polynomial kernels. CoRR Édouard Bonnet, Eun Jung Kim, Amadeus Reinald, Stéphan Thomassé, Rémi Watrigant
2020	J	`jnl`	Erdős-Pósa property of chordless cycles and its applications. J. Comb. Theory B Eun Jung Kim, O-joung Kwon
2020	A	`conf`	Grundy Coloring & Friends, Half-Graphs, Bicliques. STACS Pierre Aboulker, Édouard Bonnet, Eun Jung Kim, Florian Sikora
2020	J	`jnl`	Grundy Coloring & friends, Half-Graphs, Bicliques. CoRR Pierre Aboulker, Édouard Bonnet, Eun Jung Kim, Florian Sikora
2020	A	`conf`	Grundy Distinguishes Treewidth from Pathwidth. ESA Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi
2020	J	`jnl`	Grundy Distinguishes Treewidth from Pathwidth. CoRR Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi
2020	J	`jnl`	On the tree-width of even-hole-free graphs. CoRR Pierre Aboulker, Isolde Adler, Eun Jung Kim, Ni Luh Dewi Sintiari, Nicolas Trotignon
2020	J	`jnl`	Solving hard cut problems via flow-augmentation. CoRR Eun Jung Kim, Stefan Kratsch, Marcin Pilipczuk, Magnus Wahlström
2020	B	`conf`	Towards Constant-Factor Approximation for Chordal / Distance-Hereditary Vertex Deletion. ISAAC Jungho Ahn, Eun Jung Kim, Euiwoong Lee
2020	J	`jnl`	Towards constant-factor approximation for chordal / distance-hereditary vertex deletion. CoRR Jungho Ahn, Eun Jung Kim, Euiwoong Lee
2020	A*	`conf`	Twin-width I: tractable FO model checking. FOCS Édouard Bonnet, Eun Jung Kim, Stéphan Thomassé, Rémi Watrigant
2020	J	`jnl`	Twin-width I: tractable FO model checking. CoRR Édouard Bonnet, Eun Jung Kim, Stéphan Thomassé, Rémi Watrigant
2020	J	`jnl`	Twin-width II: small classes. CoRR Édouard Bonnet, Colin Geniet, Eun Jung Kim, Stéphan Thomassé, Rémi Watrigant
2020	J	`jnl`	Twin-width III: Max Independent Set and Coloring. CoRR Édouard Bonnet, Colin Geniet, Eun Jung Kim, Stéphan Thomassé, Rémi Watrigant
2019	J	`jnl`	New Results on Directed Edge Dominating Set. CoRR Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Eun Jung Kim, Michael Lampis
2019	A	`conf`	Token Sliding on Split Graphs. STACS Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi, Florian Sikora
2018	J	`jnl`	An FPT 2-Approximation for Tree-Cut Decomposition. Algorithmica Eun Jung Kim, Sang-il Oum, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos
2018	J	`jnl`	Complexity of Grundy coloring and its variants. Discret. Appl. Math. Édouard Bonnet, Florent Foucaud, Eun Jung Kim, Florian Sikora
2018	B	`conf`	Data-Compression for Parametrized Counting Problems on Sparse Graphs. ISAAC Eun Jung Kim, Maria J. Serna, Dimitrios M. Thilikos
2018	J	`jnl`	Data-compression for Parametrized Counting Problems on Sparse graphs. CoRR Eun Jung Kim, Maria J. Serna, Dimitrios M. Thilikos
2018	A*	`conf`	Erdős-Pósa property of chordless cycles and its applications. SODA Eun Jung Kim, O-joung Kwon
2018	A*	`conf`	Finding Branch-Decompositions of Matroids, Hypergraphs, and More. ICALP Jisu Jeong, Eun Jung Kim, Sang-il Oum
2018	B	`conf`	New Results on Directed Edge Dominating Set. MFCS Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Eun Jung Kim, Michael Lampis
2018	A*	`conf`	QPTAS and Subexponential Algorithm for Maximum Clique on Disk Graphs. SoCG Édouard Bonnet, Panos Giannopoulos, Eun Jung Kim, Pawel Rzazewski, Florian Sikora
2018	B	`conf`	Sum-of-Products with Default Values: Algorithms and Complexity Results. ICTAI Robert Ganian, Eun Jung Kim, Friedrich Slivovsky, Stefan Szeider
2018	J	`jnl`	Token Sliding on Split Graphs. CoRR Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi, Florian Sikora
2017	J	`jnl`	A Polynomial Kernel for Block Graph Deletion. Algorithmica Eun Jung Kim, O-joung Kwon
2017	B	`conf`	A Polynomial Kernel for Distance-Hereditary Vertex Deletion. WADS Eun Jung Kim, O-joung Kwon
2017	J	`jnl`	A polynomial-time algorithm for Outerplanar Diameter Improvement. J. Comput. Syst. Sci. Nathann Cohen, Daniel Gonçalves, Eun Jung Kim, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos, Mathias Weller
2017	J	`jnl`	An FPT Algorithm and a Polynomial Kernel for Linear Rankwidth-1 Vertex Deletion. Algorithmica Mamadou Moustapha Kanté, Eun Jung Kim, O-joung Kwon, Christophe Paul
2017	J	`jnl`	Complexity and Approximability of Parameterized MAX-CSPs. Algorithmica Holger Dell, Eun Jung Kim, Michael Lampis, Valia Mitsou, Tobias Mömke
2017	J	`jnl`	Erdős-Pósa property of chordless cycles and its applications. CoRR Eun Jung Kim, O-joung Kwon
2017	J	`jnl`	Finding branch-decompositions of matroids, hypergraphs, and more. CoRR Jisu Jeong, Eun Jung Kim, Sang-il Oum
2017	J	`jnl`	Parameterized algorithms for min-max multiway cut and list digraph homomorphism. J. Comput. Syst. Sci. Eun Jung Kim, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos
2017	J	`jnl`	QPTAS and Subexponential Algorithm for Maximum Clique on Disk Graphs. CoRR Édouard Bonnet, Panos Giannopoulos, Eun Jung Kim, Pawel Rzazewski, Florian Sikora
2017	J	`jnl`	The "Art of Trellis Decoding" Is Fixed-Parameter Tractable. IEEE Trans. Inf. Theory Jisu Jeong, Eun Jung Kim, Sang-il Oum
2016	J	`jnl`	A Polynomial Kernel for Distance-Hereditary Vertex Deletion. CoRR Eun Jung Kim, O-joung Kwon
2016	A*	`conf`	Constructive algorithm for path-width of matroids. SODA Jisu Jeong, Eun Jung Kim, Sang-il Oum
2016	J	`jnl`	Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions. ACM Trans. Algorithms Eun Jung Kim, Alexander Langer, Christophe Paul, Felix Reidl, Peter Rossmanith, Ignasi Sau, Somnath Sikdar
2015	B	`conf`	A Polynomial Kernel for Block Graph Deletion. IPEC Eun Jung Kim, O-joung Kwon
2015	J	`jnl`	A polynomial kernel for Block Graph Vertex Deletion. CoRR Eun Jung Kim, O-joung Kwon
2015	J	`jnl`	A single-exponential FPT algorithm for the K J. Comput. Syst. Sci. Eun Jung Kim, Christophe Paul, Geevarghese Philip
2015	—	`conf`	Algorithmic Applications of Tree-Cut Width. MFCS (2) Robert Ganian, Eun Jung Kim, Stefan Szeider
2015	B	`conf`	An FPT Algorithm and a Polynomial Kernel for Linear Rankwidth-1 Vertex Deletion. IPEC Mamadou Moustapha Kanté, Eun Jung Kim, O-joung Kwon, Christophe Paul
2015	B	`conf`	Complexity and Approximability of Parameterized MAX-CSPs. IPEC Holger Dell, Eun Jung Kim, Michael Lampis, Valia Mitsou, Tobias Mömke
2015	J	`jnl`	Complexity and Approximability of Parameterized MAX-CSPs. CoRR Holger Dell, Eun Jung Kim, Michael Lampis, Valia Mitsou, Tobias Mömke
2015	Misc	`conf`	Complexity of Grundy Coloring and Its Variants. COCOON Edouard Bonnet, Florent Foucaud, Eun Jung Kim, Florian Sikora
2015	J	`jnl`	Constructive algorithm for path-width of matroids. CoRR Jisu Jeong, Eun Jung Kim, Sang-il Oum
2015	J	`jnl`	FPT Algorithm and Polynomial Kernel for Linear Rank-width One Vertex Deletion. CoRR Mamadou Moustapha Kanté, Eun Jung Kim, O-joung Kwon, Christophe Paul
2015	J	`jnl`	On Subexponential and FPT-Time Inapproximability. Algorithmica Edouard Bonnet, Bruno Escoffier, Eun Jung Kim, Vangelis Th. Paschos
2015	B	`conf`	Parameterized Algorithms for Min-Max Multiway Cut and List Digraph Homomorphism. IPEC Eun Jung Kim, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos
2015	B	`conf`	Recognizing k-equistable Graphs in FPT Time. WG Eun Jung Kim, Martin Milanic, Oliver Schaudt
2015	J	`jnl`	Recognizing k-equistable graphs in FPT time. CoRR Eun Jung Kim, Martin Milanic, Oliver Schaudt
2014	J	`jnl`	A Polynomial-time Algorithm for Outerplanar Diameter Improvement. CoRR Nathann Cohen, Daniel Gonçalves, Eun Jung Kim, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos, Mathias Weller
2014	J	`jnl`	Complexity of Grundy coloring and its variants. CoRR Edouard Bonnet, Florent Foucaud, Eun Jung Kim, Florian Sikora
2014	J	`jnl`	Satisfying more than half of a system of linear equations over GF(2): A multivariate approach. J. Comput. Syst. Sci. Robert Crowston, Michael R. Fellows, Gregory Z. Gutin, Mark Jones, Eun Jung Kim, Fran Rosamond, Imre Z. Ruzsa, Stéphan Thomassé, Anders Yeo
2014	J	`jnl`	The Complexity of Repairing, Adjusting, and Aggregating of Extensions in Abstract Argumentation. CoRR Eun Jung Kim, Sebastian Ordyniak, Stefan Szeider
2013	—	`conf`	Linear Kernels and Single-Exponential Algorithms via Protrusion Decompositions. ICALP (1) Eun Jung Kim, Alexander Langer, Christophe Paul, Felix Reidl, Peter Rossmanith, Ignasi Sau, Somnath Sikdar
2013	B	`conf`	On Subexponential and FPT-Time Inapproximability. IPEC Edouard Bonnet, Bruno Escoffier, Eun Jung Kim, Vangelis Th. Paschos
2013	J	`jnl`	On exact algorithms for the permutation CSP. Theor. Comput. Sci. Eun Jung Kim, Daniel Gonçalves
2013	—	`conf`	The Complexity of Repairing, Adjusting, and Aggregating of Extensions in Abstract Argumentation. TAFA Eun Jung Kim, Sebastian Ordyniak, Stefan Szeider
2012	—	`conf`	A Single-Exponential FPT Algorithm for the K 4-Minor Cover Problem. SWAT Eun Jung Kim, Christophe Paul, Geevarghese Philip
2012	J	`jnl`	A single-exponential FPT algorithm for the $K_4$-minor cover problem CoRR Eun Jung Kim, Christophe Paul, Geevarghese Philip
2012	A*	`conf`	Don't Be Strict in Local Search! AAAI Serge Gaspers, Eun Jung Kim, Sebastian Ordyniak, Saket Saurabh, Stefan Szeider
2012	J	`jnl`	Don't Be Strict in Local Search! CoRR Serge Gaspers, Eun Jung Kim, Sebastian Ordyniak, Saket Saurabh, Stefan Szeider
2012	J	`jnl`	Linear kernels and single-exponential algorithms via protrusion decompositions CoRR Eun Jung Kim, Alexander Langer, Christophe Paul, Felix Reidl, Peter Rossmanith, Ignasi Sau, Somnath Sikdar
2012	J	`jnl`	On Exact Algorithms for Permutation CSP CoRR Eun Jung Kim, Daniel Gonçalves
2012	J	`jnl`	Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming. Algorithmica Gregory Z. Gutin, Eun Jung Kim, Arezou Soleimanfallah, Stefan Szeider, Anders Yeo
2012	J	`jnl`	Subexponential and FPT-time Inapproximability of Independent Set and Related Problems CoRR Bruno Escoffier, Eun Jung Kim, Vangelis Th. Paschos
2012	C	`conf`	Valued-Based Argumentation for Tree-like Value Graphs. COMMA Eun Jung Kim, Sebastian Ordyniak
2011	J	`jnl`	A probabilistic approach to problems parameterized above or below tight bounds. J. Comput. Syst. Sci. Gregory Z. Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo
2011	J	`jnl`	Algorithms and Complexity Results for Persuasive Argumentation CoRR Eun Jung Kim, Sebastian Ordyniak, Stefan Szeider
2011	J	`jnl`	Algorithms and complexity results for persuasive argumentation. Artif. Intell. Eun Jung Kim, Sebastian Ordyniak, Stefan Szeider
2011	B	`conf`	Improved Parameterized Algorithms for above Average Constraint Satisfaction. IPEC Eun Jung Kim, Ryan Williams
2011	J	`jnl`	Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming CoRR Gregory Z. Gutin, Eun Jung Kim, Arezou Soleimanfallah, Stefan Szeider, Anders Yeo
2011	J	`jnl`	Solving MAX- Algorithmica Noga Alon, Gregory Z. Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo
2011	J	`jnl`	Vertex Cover Problem Parameterized Above and Below Tight Bounds. Theory Comput. Syst. Gregory Z. Gutin, Eun Jung Kim, Michael Lampis, Valia Mitsou
2010	J	`jnl`	Algorithm for finding k-vertex out-trees and its application to k-internal out-branching problem. J. Comput. Syst. Sci. Nathann Cohen, Fedor V. Fomin, Gregory Z. Gutin, Eun Jung Kim, Saket Saurabh, Anders Yeo
2010	C	`conf`	Algorithms and Complexity Results for Persuasive Argumentation. COMMA Eun Jung Kim, Sebastian Ordyniak, Stefan Szeider
2010	J	`jnl`	Betweenness parameterized above tight lower bound. J. Comput. Syst. Sci. Gregory Z. Gutin, Eun Jung Kim, Matthias Mnich, Anders Yeo
2010	J	`jnl`	FPT algorithms and kernels for the Directed k-Leaf problem. J. Comput. Syst. Sci. Jean Daligault, Gregory Z. Gutin, Eun Jung Kim, Anders Yeo
2010	J	`jnl`	Improved Parameterized Algorithms for Constraint Satisfaction CoRR Eun Jung Kim, Ryan Williams
2010	J	`jnl`	Minimum cost homomorphisms to locally semicomplete digraphs and quasi-transitive digraphs. Australas. J Comb. Arvind Gupta, Gregory Z. Gutin, Mehdi Karimi, Eun Jung Kim, Arash Rafiey
2010	B	`conf`	Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming. IPEC Gregory Z. Gutin, Eun Jung Kim, Arezou Soleimanfallah, Stefan Szeider, Anders Yeo
2010	—	`—`	Parameterized algorithms on digraph and constraint satisfaction problems. Eun Jung Kim
2010	A*	`conf`	Solving MAX-r-SAT Above a Tight Lower Bound. SODA Noga Alon, Gregory Z. Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo
2010	—	`conf`	Systems of Linear Equations over F SWAT Robert Crowston, Gregory Z. Gutin, Mark Jones, Eun Jung Kim, Imre Z. Ruzsa
2010	J	`jnl`	Systems of Linear Equations over F CoRR Robert Crowston, Gregory Z. Gutin, Mark Jones, Eun Jung Kim, Imre Z. Ruzsa
2010	J	`jnl`	The complexity of the minimum cost homomorphism problem for semicomplete digraphs with possible loops. Discret. Appl. Math. Gregory Z. Gutin, Eun Jung Kim
2009	J	`jnl`	A Probabilistic Approach to Problems Parameterized Above Tight Lower Bound CoRR Gregory Z. Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo
2009	—	`conf`	A Probabilistic Approach to Problems Parameterized above or below Tight Bounds. IWPEC Gregory Z. Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo
2009	Misc	`conf`	Algorithm for Finding COCOON Nathann Cohen, Fedor V. Fomin, Gregory Z. Gutin, Eun Jung Kim, Saket Saurabh, Anders Yeo
2009	J	`jnl`	Algorithm for Finding $k$-Vertex Out-trees and its Application to $k$-Internal Out-branching Problem CoRR Nathann Cohen, Fedor V. Fomin, Gregory Z. Gutin, Eun Jung Kim, Saket Saurabh, Anders Yeo
2009	J	`jnl`	Minimum leaf out-branching and related problems. Theor. Comput. Sci. Gregory Z. Gutin, Igor Razgon, Eun Jung Kim
2009	J	`jnl`	On complexity of Minimum Leaf Out-Branching problem. Discret. Appl. Math. Peter Dankelmann, Gregory Z. Gutin, Eun Jung Kim
2009	J	`jnl`	Ordinal Embedding Relaxations Parameterized Above Tight Lower Bound CoRR Gregory Z. Gutin, Eun Jung Kim, Matthias Mnich, Anders Yeo
2009	—	`conf`	Properly Coloured Cycles and Paths: Results and Open Problems. Graph Theory, Computational Intelligence and Thought Gregory Z. Gutin, Eun Jung Kim
2009	J	`jnl`	Solving MAX-2-SAT Above a Tight Lower Bound CoRR Gregory Z. Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo
2009	J	`jnl`	Vertex Cover Problem Parameterized Above and Below Tight Bounds CoRR Gregory Z. Gutin, Eun Jung Kim, Michael Lampis, Valia Mitsou
2008	J	`jnl`	FPT Algorithms and Kernels for the Directed $k$-Leaf Problem CoRR Jean Daligault, Gregory Z. Gutin, Eun Jung Kim, Anders Yeo
2008	C	`conf`	Minimum Cost Homomorphism Dichotomy for Locally In-Semicomplete Digraphs. COCOA Arvind Gupta, Mehdi Karimi, Eun Jung Kim, Arash Rafiey
2008	J	`jnl`	Minimum Leaf Out-Branching Problems CoRR Gregory Z. Gutin, Eun Jung Kim, Igor Razgon
2008	C	`conf`	Minimum Leaf Out-Branching Problems. AAIM Gregory Z. Gutin, Igor Razgon, Eun Jung Kim
2008	J	`jnl`	On Complexity of Minimum Leaf Out-branching Problem CoRR Peter Dankelmann, Gregory Z. Gutin, Eun Jung Kim
2008	J	`jnl`	Properly Coloured Cycles and Paths: Results and Open Problems CoRR Gregory Z. Gutin, Eun Jung Kim
2007	J	`jnl`	Complexity of the Minimum Cost Homomorphism Problem for Semicomplete Digraphs with Possible Loops CoRR Eun Jung Kim, Gregory Z. Gutin
2007	J	`jnl`	Minimum Cost Homomorphisms to Locally Semicomplete and Quasi-Transitive Digraphs CoRR Arvind Gupta, Gregory Z. Gutin, Mehdi Karimi, Eun Jung Kim, Arash Rafiey
2007	J	`jnl`	On the Complexity of the Minimum Cost Homomorphism Problem for Reflexive Multipartite Tournaments CoRR Gregory Z. Gutin, Eun Jung Kim