Eun Jung Kim

Available identifiers

zbMath Open kim.eun-jungWikidataQ111155166 ScholiaQ111155166MaRDI QIDQ632806

List of research outcomes

Publication	Date of Publication	Type
https://portal.mardi4nfdi.de/entity/Q6192478	2024-02-12	Paper
https://portal.mardi4nfdi.de/entity/Q6147374	2024-01-15	Paper
Grundy Coloring and friends, half-graphs, bicliques	2023-04-21	Paper
https://portal.mardi4nfdi.de/entity/Q5874335	2023-02-07	Paper
https://portal.mardi4nfdi.de/entity/Q5874480	2023-02-07	Paper
EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs	2022-12-08	Paper
Twin-width II: small classes	2022-11-23	Paper
Algorithmic Applications of Tree-Cut Width	2022-11-15	Paper
Twin-width and polynomial kernels	2022-10-27	Paper
Grundy Distinguishes Treewidth from Pathwidth	2022-08-18	Paper
https://portal.mardi4nfdi.de/entity/Q5090459	2022-07-18	Paper
Sum-of-Products with Default Values: Algorithms and Complexity Results	2022-05-16	Paper
Twin-width VIII: delineation and win-wins	2022-04-01	Paper
Twin-width I: Tractable FO Model Checking	2022-03-31	Paper
Twin-width VI: the lens of contraction sequences	2021-10-30	Paper
On the tree-width of even-hole-free graphs	2021-09-02	Paper
Token sliding on split graphs	2021-08-05	Paper
New Results on Directed Edge Dominating Set	2021-08-04	Paper
Twin-width and polynomial kernels	2021-07-06	Paper
Complexity and algorithms for constant diameter augmentation problems	2020-10-01	Paper
https://portal.mardi4nfdi.de/entity/Q5115779	2020-08-18	Paper
Twin-width III: Max Independent Set, Min Dominating Set, and Coloring	2020-07-28	Paper
Grundy Coloring & friends, Half-Graphs, Bicliques	2020-01-11	Paper
Complexity of Grundy coloring and its variants	2018-05-24	Paper
Complexity and approximability of parameterized MAX-CSPs	2017-10-10	Paper
Complexity and Approximability of Parameterized MAX-CSPs	2017-09-29	Paper
Complexity of Grundy coloring and its variants	2015-10-29	Paper
Algorithmic Applications of Tree-Cut Width	2015-09-16	Paper
On subexponential and FPT-time inapproximability	2015-05-04	Paper
https://portal.mardi4nfdi.de/entity/Q5417644	2014-05-22	Paper
The Complexity of Repairing, Adjusting, and Aggregating of Extensions in Abstract Argumentation	2014-03-31	Paper
On subexponential and FPT-time inapproximability	2013-12-10	Paper
Parameterized complexity results for general factors in bipartite graphs with an application to constraint programming	2012-11-21	Paper
Algorithms and complexity results for persuasive argumentation	2011-11-17	Paper
Solving MAX-\(r\)-SAT above a tight lower bound	2011-11-07	Paper
Vertex cover problem parameterized above and below tight bounds	2011-03-30	Paper
A probabilistic approach to problems parameterized above or below tight bounds	2011-03-28	Paper
Parameterized complexity results for general factors in bipartite graphs with an application to constraint programming	2010-12-07	Paper
Betweenness parameterized above tight lower bound	2010-10-07	Paper
https://portal.mardi4nfdi.de/entity/Q3565872	2010-06-07	Paper
The complexity of the minimum cost homomorphism problem for semicomplete digraphs with possible loops	2010-05-05	Paper
On complexity of minimum leaf out-branching problem	2010-04-28	Paper
FPT algorithms and kernels for the directed \(k\)-leaf problem	2010-02-12	Paper
A Probabilistic Approach to Problems Parameterized above or below Tight Bounds	2010-01-14	Paper
Properly Coloured Cycles and Paths: Results and Open Problems	2010-01-07	Paper
Minimum leaf out-branching and related problems	2009-11-04	Paper
https://portal.mardi4nfdi.de/entity/Q3615793	2009-03-24	Paper
Minimum Leaf Out-Branching Problems	2008-07-10	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Eun Jung Kim