The following pages link to Yusuke Kobayashi (Q273162):
Displaying 50 items.
- Edge-disjoint odd cycles in 4-edge-connected graphs (Q2904762) (← links)
- Linear min-max relation between the treewidth of \(H\)-minor-free graphs and its largest grid (Q2904769) (← links)
- Algorithms for finding a maximum non-\(k\)-linked graph (Q2910937) (← links)
- An O(log n)-Approximation Algorithm for the Edge-Disjoint Paths Problem in Eulerian Planar Graphs (Q2933646) (← links)
- Minimum-Cost $$b$$-Edge Dominating Sets on Trees (Q2942628) (← links)
- The Generalized Terminal Backup Problem (Q2947440) (← links)
- Algorithms for Finding a Maximum Non-k-linked Graph (Q3092223) (← links)
- An Improved Algorithm for the Half-Disjoint Paths Problem (Q3225124) (← links)
- The Induced Disjoint Paths Problem (Q3503839) (← links)
- An O(logn)-Approximation Algorithm for the Disjoint Paths Problem in Eulerian Planar Graphs and 4-Edge-Connected Planar Graphs (Q3588414) (← links)
- Improved Algorithm for the Half-Disjoint Paths Problem (Q3588415) (← links)
- On Shortest Disjoint Paths in Planar Graphs (Q3652216) (← links)
- All-or-Nothing Multicommodity Flow Problem with Bounded Fractionality in Planar Graphs (Q4577772) (← links)
- (Q4633929) (← links)
- Selecting vertex disjoint paths in plane graphs (Q4642445) (← links)
- An Improved Approximation Algorithm for the Edge-Disjoint Paths Problem with Congestion Two (Q4962640) (← links)
- A weighted linear matroid parity algorithm (Q4977977) (← links)
- Market Pricing for Matroid Rank Valuations (Q5013570) (← links)
- Tight Approximation for Unconstrained XOS Maximization (Q5026453) (← links)
- Parameterized Complexity of $$(A,\ell )$$-Path Packing (Q5041178) (← links)
- The Steiner Problem for Count Matroids (Q5041203) (← links)
- Weighted Triangle-Free 2-Matching Problem with Edge-Disjoint Forbidden Triangles (Q5041752) (← links)
- Shortest Reconfiguration of Perfect Matchings via Alternating Cycles (Q5074950) (← links)
- (Q5075806) (← links)
- The Perfect Matching Reconfiguration Problem (Q5092444) (← links)
- The Directed Disjoint Shortest Paths Problem (Q5111698) (← links)
- Complexity of the multi-service center problem (Q5136268) (← links)
- A Weighted Linear Matroid Parity Algorithm (Q5149751) (← links)
- Randomized Strategies for Cardinality Robustness in the Knapsack Problem (Q5194940) (← links)
- An excluded half-integral grid theorem for digraphs and the directed disjoint paths problem (Q5259540) (← links)
- Packing Edge-Disjoint Odd Eulerian Subgraphs Through Prescribed Vertices in 4-Edge-Connected Graphs (Q5346553) (← links)
- (Q5376371) (← links)
- The Generalized Terminal Backup Problem (Q5384083) (← links)
- (Q5417629) (← links)
- Breaking o(n <sup>1/2</sup> )-approximation algorithms for the edge-disjoint paths problem with congestion two (Q5419077) (← links)
- Operations on M‐Convex Functions on Jump Systems (Q5454265) (← links)
- (Q5743487) (← links)
- (Q5743513) (← links)
- An FPT Algorithm for Minimum Additive Spanner Problem. (Q5874282) (← links)
- Shortest Reconfiguration of Colorings Under Kempe Changes (Q5874308) (← links)
- Reconfiguration of Spanning Trees with Many or Few Leaves (Q5874492) (← links)
- (Q5875545) (← links)
- (Q5875556) (← links)
- APPROXIMATION ALGORITHM FOR STEINER TREE PROBLEM WITH NEIGHBOR-INDUCED COST (Q5888150) (← links)
- Robust matchings and matroid intersections (Q5891380) (← links)
- A strongly polynomial time algorithm for the maximum supply rate problem on trees (Q5896083) (← links)
- Robust Matchings and Matroid Intersections (Q5901161) (← links)
- Linear-time recognition of double-threshold graphs (Q5918597) (← links)
- Diameter of colorings under Kempe changes (Q5918932) (← links)
- Subgraph isomorphism on graph classes that exclude a substructure (Q5919029) (← links)
