The following pages link to Yusuke Kobayashi (Q273162):
Displaying 50 items.
- Edge-disjoint odd cycles in 4-edge-connected graphs (Q273163) (← links)
- Improved max-flow min-cut algorithms in a circular disk failure model with application to a road network (Q320688) (← links)
- Triangle-free 2-matchings and M-concave functions on jump systems (Q401132) (← links)
- The disjoint paths problem in quadratic time (Q412168) (← links)
- An algorithm for \((n-3)\)-connectivity augmentation problem: jump system approach (Q414633) (← links)
- A linear time algorithm for the induced disjoint paths problem in planar graphs (Q414938) (← links)
- Testing the \((s,t)\) connectivity of graphs and digraphs (Q428880) (← links)
- A simple algorithm for finding a maximum triangle-free \(2\)-matching in subcubic graphs (Q429657) (← links)
- On shortest disjoint paths in planar graphs (Q429668) (← links)
- A proof of Cunningham's conjecture on restricted subgraphs and jump systems (Q444382) (← links)
- Fixed-parameter tractability for the subset feedback set problem and the \(S\)-cycle packing problem (Q444386) (← links)
- An algorithm for finding a maximum \(t\)-matching excluding complete partite subgraphs (Q448969) (← links)
- The edge-disjoint paths problem in Eulerian graphs and 4-edge-connected graphs (Q520046) (← links)
- Finding a shortest non-zero path in group-labeled graphs via permanent computation (Q524371) (← links)
- Efficient stabilization of cooperative matching games (Q526875) (← links)
- Algorithms for finding an induced cycle in planar graphs (Q653839) (← links)
- Cone superadditivity of discrete convex functions (Q715073) (← links)
- Algorithms for gerrymandering over graphs (Q831130) (← links)
- An algorithm for minimum cost arc-connectivity orientations (Q848842) (← links)
- Induced disjoint paths problem in a planar digraph (Q967379) (← links)
- Induction of M-convex functions by linking systems (Q997074) (← links)
- Randomized strategies for cardinality robustness in the knapsack problem (Q1675929) (← links)
- The parity Hamiltonian cycle problem (Q1690220) (← links)
- Minimum-cost \(b\)-edge dominating sets on trees (Q1755793) (← links)
- NP-hardness and fixed-parameter tractability of the minimum spanner problem (Q1784745) (← links)
- The complexity of minimizing the difference of two \(M^{\natural}\)-convex set functions (Q1785434) (← links)
- Complexity of the multi-service center problem (Q2006773) (← links)
- Improved analysis of highest-degree branching for feedback vertex set (Q2041981) (← links)
- Trade-offs among degree, diameter, and number of paths (Q2112655) (← links)
- Weighted triangle-free 2-matching problem with edge-disjoint forbidden triangles (Q2118149) (← links)
- Parameterized complexity of \((A,\ell)\)-path packing (Q2118381) (← links)
- An improved deterministic parameterized algorithm for cactus vertex deletion (Q2135634) (← links)
- A parameterized view to the robust recoverable base problem of matroids under structural uncertainty (Q2157911) (← links)
- An additive approximation scheme for the Nash social welfare maximization with identical additive valuations (Q2169968) (← links)
- Finding a path with two labels forbidden in group-labeled graphs (Q2173429) (← links)
- On the number of edges in a graph with many two-hop disjoint paths (Q2192123) (← links)
- Linear min-max relation between the treewidth of an \(H\)-minor-free graph and its largest grid minor (Q2284742) (← links)
- Two disjoint shortest paths problem with non-negative edge length (Q2294269) (← links)
- An improved fixed-parameter algorithm for max-cut parameterized by crossing number (Q2301753) (← links)
- Fence patrolling by mobile agents with distinct speeds (Q2353252) (← links)
- An algorithm for identifying cycle-plus-triangles graphs (Q2357769) (← links)
- Reconfiguration of maximum weight \(b\)-matchings in a graph (Q2412417) (← links)
- Reconfiguration of maximum-weight \(b\)-matchings in a graph (Q2420651) (← links)
- Even factors, jump systems, and discrete convexity (Q2519019) (← links)
- Finding a maximum minimal separator: graph classes and fixed-parameter tractability (Q2661784) (← links)
- Computing the largest bond and the maximum connected cut of a graph (Q2663713) (← links)
- Submodular reassignment problem for reallocating agents to tasks with synergy effects (Q2673247) (← links)
- ROUTING ALGORITHMS UNDER MUTUAL INTERFERENCE CONSTRAINTS (Q2793581) (← links)
- Covering Intersecting Bi-set Families under Matroid Constraints (Q2820858) (← links)
- The complexity of the node capacitated in-tree packing problem (Q2892141) (← links)
