16 results on '"Kim, Eun Jung"'
Search Results
2. Twin-width and Polynomial Kernels
3. Towards Constant-Factor Approximation for Chordal/Distance-Hereditary Vertex Deletion
4. A Polynomial Kernel for Distance-Hereditary Vertex Deletion
5. An FPT Algorithm and a Polynomial Kernel for Linear Rankwidth-1 Vertex Deletion
6. Complexity and Approximability of Parameterized MAX-CSPs
7. A Polynomial Kernel for Block Graph Deletion
8. An FPT 2-Approximation for Tree-Cut Decomposition
9. Grundy Coloring and Friends, Half-Graphs, Bicliques
10. On Subexponential and FPT-Time Inapproximability
11. Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming
12. Solving MAX-r-SAT Above a Tight Lower Bound
13. An FPT Algorithm and a Polynomial Kernel for Linear Rankwidth-1 Vertex Deletion
14. On Subexponential and FPT-Time Inapproximability
15. Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming
16. Solving MAX-r-SAT Above a Tight Lower Bound
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.