Search

Your search keyword '"Kim, Eun-Jung"' showing total 3,664 results

Search Constraints

Start Over You searched for: Author "Kim, Eun-Jung" Remove constraint Author: "Kim, Eun-Jung"
3,664 results on '"Kim, Eun-Jung"'

Search Results

1. CMSO-transducing tree-like graph decompositions

Catalog

Books, media, physical & digital resources

6. Bandwidth Parameterized by Cluster Vertex Deletion Number

7. Adult dental epithelial stem cell-derived organoids deposit hydroxylapatite biomineral.

9. Representing Matroids over the Reals is $\exists \mathbb R$-complete

12. On weighted graph separation problems and flow-augmentation

13. Flow-augmentation III: Complexity dichotomy for Boolean CSPs parameterized by the number of unsatisfied constraints

14. Feasibility of an implantable bioreactor for renal cell therapy using silicon nanopore membranes

15. Algorithmic Applications of Tree-Cut Width

16. Twin-width VIII: delineation and win-wins

20. Attack of the Knights: A Non Uniform Cache Side-Channel Attack

21. Flow-augmentation I: Directed graphs

22. Twin-width VI: the lens of contraction sequences

23. EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs

27. Obstructions for matroids of path-width at most k and graphs of linear rank-width at most k

28. Twin-width and polynomial kernels

29. Subpial delivery of adeno-associated virus 9-synapsin-caveolin-1 (AAV9-SynCav1) preserves motor neuron and neuromuscular junction morphology, motor function, delays disease onset, and extends survival in hSOD1G93A mice

30. Twin-width II: small classes

31. A Constant-factor Approximation for Weighted Bond Cover

32. Continual Learning Approach for Improving the Data and Computation Mapping in Near-Memory Processing System

38. Complexity and algorithms for constant diameter augmentation problems

39. Towards constant-factor approximation for chordal / distance-hereditary vertex deletion

40. Grundy Distinguishes Treewidth from Pathwidth

41. On the tree-width of even-hole-free graphs

42. Twin-width III: Max Independent Set, Min Dominating Set, and Coloring

43. Flow-augmentation II: Undirected graphs

44. Twin-width II: small classes

45. Twin-width I: tractable FO model checking

46. Grundy Coloring & friends, Half-Graphs, Bicliques