203 results on '"Sang-il Oum"'
Search Results
2. Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth.
3. Γ-Graphic Delta-Matroids and Their Applications.
4. A Polynomial Kernel for 3-Leaf Power Deletion.
5. Obstructions for matroids of path-width at most k and graphs of linear rank-width at most k.
6. Independent domination of graphs with bounded maximum degree.
7. Intertwining Connectivities for Vertex-Minors and Pivot-Minors.
8. Prime vertex-minors of a prime graph.
9. Obstructions for Matroids of Path-Width at most k and Graphs of Linear Rank-Width at most k.
10. 3-Degenerate induced subgraph of a planar graph.
11. Obstructions for partitioning into forests and outerplanar graphs.
12. Bounds for the Twin-Width of Graphs.
13. Computing pivot-minors.
14. Reuniting χ-boundedness with polynomial χ-boundedness.
15. Twin-width of subdivisions of multigraphs.
16. Γ-Graphic Delta-Matroids and Their Applications.
17. A Polynomial Kernel for 3-Leaf Power Deletion.
18. Graphs of bounded depth-2 rank-brittleness.
19. Obstructions for bounded shrub-depth and rank-depth.
20. Finding Branch-Decompositions of Matroids, Hypergraphs, and More.
21. Tree Pivot-Minors and Linear Rank-Width.
22. Classes of graphs with no long cycle as a vertex-minor are polynomially χ-bounded.
23. Scattered Classes of Graphs.
24. The proper conflict-free $k$-coloring problem and the odd $k$-coloring problem are NP-complete on bipartite graphs.
25. Twin-width of random graphs.
26. Rank connectivity and pivot-minors of graphs.
27. A chain theorem for sequentially 3-rank-connected graphs with respect to vertex-minors.
28. Finding Branch-Decompositions of Matroids, Hypergraphs, and More.
29. Computing Small Pivot-Minors.
30. Online Ramsey theory for a triangle on -free graphs.
31. Deciding whether there are infinitely many prime graphs with forbidden induced subgraphs.
32. Defective Colouring of Graphs Excluding A Subgraph or Minor.
33. Tangle-Tree Duality: In Graphs, Matroids and Beyond.
34. Improper colouring of graphs with no odd clique minor.
35. Chi-boundedness of graph classes excluding wheel vertex-minors.
36. Bounds for the Twin-width of Graphs.
37. Tree pivot-minors and linear rank-width.
38. Characterizing matroids whose bases form graphic delta-matroids.
39. A Remark on the Paper 'Properties of Intersecting Families of Ordered Sets' by O. Einstein.
40. An FPT 2-Approximation for Tree-Cut Decomposition.
41. Partitioning H-minor free graphs into three subgraphs with no large components.
42. Characterization of Cycle Obstruction Sets for Improper Coloring Planar Graphs.
43. Constructive algorithm for path-width of matroids.
44. How to Decompose a Graph into a Tree-Like Structure (Invited Talk).
45. Problems
46. Strongly Even-Cycle Decomposable Graphs.
47. Rank-width: Algorithmic and structural results.
48. Chi-boundedness of graph classes excluding wheel vertex-minors.
49. The 'Art of Trellis Decoding' Is Fixed-Parameter Tractable.
50. Coloring graphs without fan vertex-minors and graphs without cycle pivot-minors.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.