Author image not provided
 Eunjung Kim

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article6.65
Citation Count173
Publication count26
Publication years2008-2017
Available for download2
Average downloads per article91.00
Downloads (cumulative)182
Downloads (12 Months)50
Downloads (6 Weeks)5
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author




BOOKMARK & SHARE


27 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 20 of 27
Result page: 1 2

Sort by:

1
January 2018 Algorithmica: Volume 80 Issue 1, January 2018
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0

The tree-cut width of a graph is a graph parameter defined by Wollan (J Combin Theory, Ser B, 110:47---66, 2015) with the help of tree-cut decompositions. In certain cases, tree-cut width appears to be more adequate than treewidth as an invariant that, when bounded, can accelerate the resolution of intractable ...
Keywords: Fixed-parameter tractable algorithm, Tree-cut width, Approximation algorithm

2
September 2017 Algorithmica: Volume 79 Issue 1, September 2017
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0

We study the optimization version of constraint satisfaction problems (Max-CSPs) in the framework of parameterized complexity; the goal is to compute the maximum fraction of constraints that can be satisfied simultaneously. In standard CSPs, we want to decide whether this fraction equals one. The parameters we investigate are structural measures, ...
Keywords: Parameterized complexity, Approximation, Constraint satisfaction problems, Clique width, Neighborhood diversity

3
June 2017 Journal of Computer and System Sciences: Volume 86 Issue C, June 2017
Publisher: Academic Press, Inc.
Bibliometrics:
Citation Count: 0

We design FPT-algorithms for the following two parameterized problems:List Digraph Homomorphism, which is a list version of the classical Digraph Homomorphism problem.Min-Max Multiway Cut, which is a variant of Multiway Cut.We introduce a general problem, List Allocation, and we present parameterized reductions of both aforementioned problems to it.We provide an ...
Keywords: Digraph homomorphism, Parameterized complexity, Fixed-Parameter Tractable algorithm, Multiway Cut

4 published by ACM
December 2015 ACM Transactions on Algorithms (TALG): Volume 12 Issue 2, February 2016
Publisher: ACM
Bibliometrics:
Citation Count: 9
Downloads (6 Weeks): 5,   Downloads (12 Months): 40,   Downloads (Overall): 113

Full text available: PDFPDF
We present a linear-time algorithm to compute a decomposition scheme for graphs G that have a set X ⊆ V ( G ), called a treewidth-modulator , such that the treewidth of G − X is bounded by a constant. Our decomposition, called a protrusion decomposition , is the cornerstone ...
Keywords: graph minors, algorithmic meta-theorems, Parameterized complexity, hitting minors, sparse graphs

5
October 2014 Journal of Computer and System Sciences: Volume 81 Issue 1, February, 2015
Publisher: Academic Press, Inc.
Bibliometrics:
Citation Count: 1

Given a graph G and a parameter k � N , the parameterized K 4 -minor cover problem asks whether at most k vertices can be deleted to turn G into a K 4 -minor-free graph, or equivalently in a graph of treewidth at most 2. This problem is inspired ...
Keywords: Fixed-parameter tractable algorithms, K 4 -minor cover, Treewidth-2 Deletion

6
July 2013 ICALP'13: Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 4

We present a linear-time algorithm to compute a decomposition scheme for graphs G that have a set X ⊆ V ( G ), called a treewidth-modulator , such that the treewidth of G − X is bounded by a constant. Our decomposition, called a protrusion decomposition , is the cornerstone ...
Keywords: parameterized complexity, algorithmic metatheorems, graph minors, linear kernels, single-exponential algorithms, sparse graphs

7
September 2012 Algorithmica: Volume 64 Issue 1, September 2012
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0

The NP-hard general factor problem asks, given a graph and for each vertex a list of integers, whether the graph has a spanning subgraph where each vertex has a degree that belongs to its assigned list. The problem remains NP-hard even if the given graph is bipartite with partition UźV, ...
Keywords: General factor, Global constraint, Fixed-parameter tractable

8
September 2012 Algorithmica - Special Issue: Parameterized and Exact Computation, Part I: Volume 64 Issue 1, September 2012
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0

The NP-hard general factor problem asks, given a graph and for each vertex a list of integers, whether the graph has a spanning subgraph where each vertex has a degree that belongs to its assigned list. The problem remains NP-hard even if the given graph is bipartite with partition U ...
Keywords: Global constraint, Fixed-parameter tractable

9
July 2012 AAAI'12: Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence
Publisher: AAAI Press
Bibliometrics:
Citation Count: 1

Local Search is one of the fundamental approaches to combinatorial optimization and it is used throughout AI. Several local search algorithms are based on searching the k -exchange neighborhood. This is the set of solutions that can be obtained from the current solution by exchanging at most k elements. As ...

10
November 2011 Algorithmica: Volume 61 Issue 3, November 2011
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 23

We present an exact algorithm that decides, for every fixed r ≥2 in time $O(m)+2^{O(k^{2})}$ whether a given multiset of m clauses of size  r admits a truth assignment that satisfies at least ((2 r −1) m + k )/2 r clauses. Thus Max - r - Sat is fixed-parameter ...
Keywords: Max SAT, Fixed-parameter tractable, Kernel, Bikernel, Above lower bound

11
September 2011 IPEC'11: Proceedings of the 6th international conference on Parameterized and Exact Computation
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 6

For many constraint satisfaction problems, the algorithm which chooses a random assignment achieves the best possible approximation ratio. For instance, a simple random assignment for Max-E3-Sat allows 7/8-approximation and for every ε >0 there is no polynomial-time (7/8+ ε )-approximation unless P=NP. Another example is the Permutation CSP of bounded ...

12
June 2011 Artificial Intelligence: Volume 175 Issue 9-10, June, 2011
Publisher: Elsevier Science Publishers Ltd.
Bibliometrics:
Citation Count: 6

The study of arguments as abstract entities and their interaction as introduced by Dung (1995) [1] has become one of the most active research branches within Artificial Intelligence and Reasoning. A main issue for abstract argumentation systems is the selection of acceptable sets of arguments. Value-based argumentation, as introduced by ...
Keywords: Abstract argumentation, Graphical models, Value-based argumentation frameworks, Computational complexity, Bounded treewidth

13
March 2011 Journal of Computer and System Sciences: Volume 77 Issue 2, March, 2011
Publisher: Academic Press, Inc.
Bibliometrics:
Citation Count: 15

We introduce a new approach for establishing fixed-parameter tractability of problems parameterized above tight lower bounds or below tight upper bounds. To illustrate the approach we consider two problems of this type of unknown complexity that were introduced by Mahajan, Raman and Sikdar [M. Mahajan, V. Raman, S. Sikdar, Parameterizing ...
Keywords: Above tight bounds, Hypercontractive Inequality, Probabilistic method, Parameterized problems, Fixed-parameter tractable, Kernel

14
February 2011 Theory of Computing Systems: Volume 48 Issue 2, February 2011
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 8

We study the well-known Vertex Cover problem parameterized above and below tight bounds. We show that two of the parameterizations (both were suggested by Mahajan et al. in J. Comput. Syst. Sci. 75(2):137–153, 2009) are fixed-parameter tractable and two other parameterizations are W[1]-hard (one of them is, in fact, W[2]-hard).
Keywords: Parameterized complexity, Vertex cover

15
December 2010 Journal of Computer and System Sciences: Volume 76 Issue 8, December, 2010
Publisher: Academic Press, Inc.
Bibliometrics:
Citation Count: 10

We study ordinal embedding relaxations in the realm of parameterized complexity. We prove the existence of a quadratic kernel for the Betweenness problem parameterized above its tight lower bound, which is stated as follows. For a set V of variables and set C of constraints ''v"i is between v"j and ...
Keywords: Betweenness, Probabilistic method, Parameterized problems, Fixed-parameter tractable, Kernel, Polynomial kernel

16
November 2010 Journal of Computer and System Sciences: Volume 76 Issue 7, November, 2010
Publisher: Academic Press, Inc.
Bibliometrics:
Citation Count: 8

An out-tree T is an oriented tree with only one vertex of in-degree zero. A vertex x of T is internal if its out-degree is positive. We design randomized and deterministic algorithms for deciding whether an input digraph contains a given out-tree with k vertices. The algorithms are of running ...
Keywords: Out-branching, Divide-and-conquer, Out-tree, Internal vertices

17
August 2010 Proceedings of the 2010 conference on Computational Models of Argument: Proceedings of COMMA 2010
Publisher: IOS Press
Bibliometrics:
Citation Count: 1

Value-based argumentation frameworks, as introduced by Bench-Capon, allow the abstract representation of persuasive argumentation. This formalism takes into account the relative strength of arguments with respect to some ordering which represents an audience. Deciding subjective or objective acceptance (i.e., acceptance with respect to at least one or with respect to ...

18
June 2010 SWAT'10: Proceedings of the 12th Scandinavian conference on Algorithm Theory
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 15

In the problem Max Lin, we are given a system Az = b of m linear equations with n variables over $\mathbb{F}_2$ in which each equation is assigned a positive weight and we wish to find an assignment of values to the variables that maximizes the excess, which is the ...

19
March 2010 Journal of Computer and System Sciences: Volume 76 Issue 2, March, 2010
Publisher: Academic Press, Inc.
Bibliometrics:
Citation Count: 11

A subgraph T of a digraph D is an out-branching if T is an oriented spanning tree with only one vertex of in-degree zero (called the root). The vertices of T of out-degree zero are leaves. In the Directed Max Leaf problem, we wish to find the maximum number of ...
Keywords: Leaves, Out-branching, Fixed-parameter tractable, Kernel

20
February 2010 Discrete Applied Mathematics: Volume 158 Issue 4, February, 2010
Publisher: Elsevier Science Publishers B. V.
Bibliometrics:
Citation Count: 0

For digraphs D and H, a mapping f:V(D)->V(H) is a homomorphism of D to H if [email protected]?A(D) implies f(u)f(v)@?A(H). For a fixed digraph H, the homomorphism problem is to decide whether an input digraph D admits a homomorphism to H or not, and is denoted as HOM(H). An optimization version ...
Keywords: Dichotomy, Semicomplete digraphs, Homomorphisms, Minimum cost homomorphisms



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us