The following pages link to Eun Jung Kim (Q632806):
Displaying 44 items.
- A probabilistic approach to problems parameterized above or below tight bounds (Q632807) (← links)
- Vertex cover problem parameterized above and below tight bounds (Q633768) (← links)
- Solving MAX-\(r\)-SAT above a tight lower bound (Q644808) (← links)
- Algorithms and complexity results for persuasive argumentation (Q646518) (← links)
- FPT algorithms and kernels for the directed \(k\)-leaf problem (Q847265) (← links)
- On complexity of minimum leaf out-branching problem (Q967352) (← links)
- The complexity of the minimum cost homomorphism problem for semicomplete digraphs with possible loops (Q968147) (← links)
- Minimum leaf out-branching and related problems (Q1035689) (← links)
- Complexity of Grundy coloring and its variants (Q1752449) (← links)
- Parameterized complexity results for general factors in bipartite graphs with an application to constraint programming (Q1759676) (← links)
- Betweenness parameterized above tight lower bound (Q1959433) (← links)
- On the tree-width of even-hole-free graphs (Q1979431) (← links)
- Token sliding on split graphs (Q2048202) (← links)
- Twin-width and polynomial kernels (Q2093574) (← links)
- On subexponential and FPT-time inapproximability (Q2343081) (← links)
- Complexity and approximability of parameterized MAX-CSPs (Q2408203) (← links)
- Grundy Coloring and friends, half-graphs, bicliques (Q2700380) (← links)
- Algorithmic Applications of Tree-Cut Width (Q2946405) (← links)
- Minimum Leaf Out-Branching Problems (Q3511432) (← links)
- (Q3565872) (← links)
- (Q3615793) (← links)
- Properly Coloured Cycles and Paths: Results and Open Problems (Q3655153) (← links)
- A Probabilistic Approach to Problems Parameterized above or below Tight Bounds (Q3656865) (← links)
- New Results on Directed Edge Dominating Set (Q5005171) (← links)
- Algorithmic Applications of Tree-Cut Width (Q5048301) (← links)
- Twin-width II: small classes (Q5051371) (← links)
- EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs (Q5056440) (← links)
- Twin-width I: Tractable FO Model Checking (Q5066940) (← links)
- Sum-of-Products with Default Values: Algorithms and Complexity Results (Q5076308) (← links)
- (Q5090459) (← links)
- Grundy Distinguishes Treewidth from Pathwidth (Q5096586) (← links)
- (Q5115779) (← links)
- Complexity and Approximability of Parameterized MAX-CSPs (Q5363783) (← links)
- The Complexity of Repairing, Adjusting, and Aggregating of Extensions in Abstract Argumentation (Q5405018) (← links)
- (Q5417644) (← links)
- (Q5874335) (← links)
- (Q5874480) (← links)
- (Q6192478) (← links)
- Grundy Coloring & friends, Half-Graphs, Bicliques (Q6332689) (← links)
- Flow-augmentation. III: Complexity dichotomy for Boolean CSPs parameterized by the number of unsatisfied constraints (Q6538652) (← links)
- Twin-width. VI: The lens of contraction sequences (Q6575118) (← links)
- Representing matroids over the reals is \(\exists \mathbb{R}\)-complete (Q6606993) (← links)
- Twin-width. III: Max independent set, min dominating set, and coloring (Q6631356) (← links)
- A constant-factor approximation for weighted bond cover (Q6671673) (← links)
