Induction of M-convex functions by linking systems. - Yusuke Kobayashi 001; Kazuo Murota (Discret. Appl. Math., 2007)

Operations on M-Convex Functions on Jump Systems. - Yusuke Kobayashi 001; Kazuo Murota; Ken'ichiro Tanaka (SIAM J. Discret. Math., 2007)

The Induced Disjoint Paths Problem. - Ken-ichi Kawarabayashi; Yusuke Kobayashi 001 (IPCO, 2008)

Algorithms for finding an induced cycle in planar graphs and bounded genus graphs. - Yusuke Kobayashi 001; Ken-ichi Kawarabayashi (SODA, 2009)

Induced disjoint paths problem in a planar digraph. - Yusuke Kobayashi 001 (Discret. Appl. Math., 2009)

Even factors, jump systems, and discrete convexity. - Yusuke Kobayashi 001; Kenjiro Takazawa (J. Comb. Theory B, 2009)

An O(logn)-Approximation Algorithm for the Disjoint Paths Problem in Eulerian Planar Graphs and 4-Edge-Connected Planar Graphs. - Ken-ichi Kawarabayashi; Yusuke Kobayashi 001 (APPROX-RANDOM, 2010)

Improved Algorithm for the Half-Disjoint Paths Problem. - Ken-ichi Kawarabayashi; Yusuke Kobayashi 001 (APPROX-RANDOM, 2010)

An Algorithm for Minimum Cost Arc-Connectivity Orientations. - Satoru Iwata 001; Yusuke Kobayashi 001 (Algorithmica, 2010)

Algorithms for finding an induced cycle in planar graphs. - Ken-ichi Kawarabayashi; Yusuke Kobayashi 001 (Comb., 2010)

A simple algorithm for finding a maximum triangle-free 2-matching in subcubic graphs. - Yusuke Kobayashi 001 (Discret. Optim., 2010)

On shortest disjoint paths in planar graphs. - Yusuke Kobayashi 001; Christian Sommer 001 (Discret. Optim., 2010)

Algorithms for Finding a Maximum Non-k-linked Graph. - Yusuke Kobayashi 001; Yuichi Yoshida (ESA, 2011)

Breaking o(n1/2)-approximation algorithms for the edge-disjoint paths problem with congestion two. - Ken-ichi Kawarabayashi; Yusuke Kobayashi 001 (STOC, 2011)

An Improved Algorithm for the Half-Disjoint Paths Problem. - Ken-ichi Kawarabayashi; Yusuke Kobayashi 001 (SIAM J. Discret. Math., 2011)

Erdös-Pósa property and its algorithmic applications: parity constraints, subset feedback set, and subset packing. - Naonori Kakimura; Ken-ichi Kawarabayashi; Yusuke Kobayashi 001 (SODA, 2012)

List-coloring graphs without subdivisions and without immersions. - Ken-ichi Kawarabayashi; Yusuke Kobayashi 001 (SODA, 2012)

Linear min-max relation between the treewidth of H-minor-free graphs and its largest grid. - Ken-ichi Kawarabayashi; Yusuke Kobayashi 001 (STACS, 2012)

An algorithm for finding a maximum t-matching excluding complete partite subgraphs. - Yusuke Kobayashi 001; Xin Yin (Discret. Optim., 2012)

A linear time algorithm for the induced disjoint paths problem in planar graphs. - Ken-ichi Kawarabayashi; Yusuke Kobayashi 001 (J. Comput. Syst. Sci., 2012)

An algorithm for (n-3)-connectivity augmentation problem: Jump system approach. - Kristóf Bérczi; Yusuke Kobayashi 001 (J. Comb. Theory B, 2012)

Fixed-parameter tractability for the subset feedback set problem and the S-cycle packing problem. - Ken-ichi Kawarabayashi; Yusuke Kobayashi 001 (J. Comb. Theory B, 2012)

The disjoint paths problem in quadratic time. - Ken-ichi Kawarabayashi; Yusuke Kobayashi 001; Bruce A. Reed (J. Comb. Theory B, 2012)

A proof of Cunningham's conjecture on restricted subgraphs and jump systems. - Yusuke Kobayashi 001; Jácint Szabó; Kenjiro Takazawa (J. Comb. Theory B, 2012)

Cone superadditivity of discrete convex functions. - Yusuke Kobayashi 001; Kazuo Murota; Robert Weismantel (Math. Program., 2012)

The complexity of the node capacitated in-tree packing problem. - Shinji Imahori; Yuichiro Miyamoto; Hideki Hashimoto; Yusuke Kobayashi 001; Mihiro Sasaki; Mutsunori Yagiura (Networks, 2012)

Algorithms for Finding a Maximum Non-k-Linked Graph. - Yusuke Kobayashi 001; Yuichi Yoshida (SIAM J. Discret. Math., 2012)

Testing the (s, t)-disconnectivity of graphs and digraphs. - Yuichi Yoshida; Yusuke Kobayashi 001 (Theor. Comput. Sci., 2012)

Robust Matchings and Matroid Intersections. - Ryo Fujita; Yusuke Kobayashi 001; Kazuhisa Makino (SIAM J. Discret. Math., 2013)

An O(log n)-Approximation Algorithm for the Edge-Disjoint Paths Problem in Eulerian Planar Graphs. - Ken-ichi Kawarabayashi; Yusuke Kobayashi 001 (ACM Trans. Algorithms, 2013)

Max-flow min-cut theorem and faster algorithms in a circular disk failure model. - Yusuke Kobayashi 001; Kensuke Otsuki (INFOCOM, 2014)

The Generalized Terminal Backup Problem. - Attila Bernáth; Yusuke Kobayashi 001 (SODA, 2014)

An excluded half-integral grid theorem for digraphs and the directed disjoint paths problem. - Ken-ichi Kawarabayashi; Yusuke Kobayashi 001; Stephan Kreutzer (STOC, 2014)

Triangle-free 2-matchings and M-concave functions on jump systems. - Yusuke Kobayashi 001 (Discret. Appl. Math., 2014)

Finding a Path in Group-Labeled Graphs with Two Labels Forbidden. - Yasushi Kawase; Yusuke Kobayashi 001; Yutaro Yamaguchi 001 (ICALP (1), 2015)

The edge-disjoint paths problem in Eulerian graphs and 4-edge-connected graphs. - Ken-ichi Kawarabayashi; Yusuke Kobayashi 001 (Comb., 2015)

Fence patrolling by mobile agents with distinct speeds. - Akitoshi Kawamura; Yusuke Kobayashi 001 (Distributed Comput., 2015)

Selecting vertex disjoint paths in plane graphs. - Holger Flier; Matús Mihalák; Peter Widmayer; Anna Zych; Yusuke Kobayashi 001; Anita Schöbel (Networks, 2015)

The complexity of minimizing the difference of two M♮-convex set functions. - Yusuke Kobayashi 001 (Oper. Res. Lett., 2015)

The Generalized Terminal Backup Problem. - Attila Bernáth; Yusuke Kobayashi 001; Tatsuya Matsuoka (SIAM J. Discret. Math., 2015)

Improved max-flow min-cut algorithms in a Circular Disk Failure Model with application to a road network. - Kensuke Otsuki; Yusuke Kobayashi 001; Kazuo Murota (Eur. J. Oper. Res., 2016)

Edge-disjoint odd cycles in 4-edge-connected graphs. - Ken-ichi Kawarabayashi; Yusuke Kobayashi 001 (J. Comb. Theory B, 2016)

Covering Intersecting Bi-set Families under Matroid Constraints. - Kristóf Bérczi; Tamás Király; Yusuke Kobayashi 001 (SIAM J. Discret. Math., 2016)

An Improved Approximation Algorithm for the Edge-Disjoint Paths Problem with Congestion Two. - Ken-ichi Kawarabayashi; Yusuke Kobayashi 001 (ACM Trans. Algorithms, 2016)

Tight Approximability of the Server Allocation Problem for Real-Time Applications. - Takehiro Ito; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi 001; Yoshio Okamoto; Taichi Shiitada (ALGOCLOUD, 2017)

The Directed Disjoint Shortest Paths Problem. - Kristóf Bérczi; Yusuke Kobayashi 001 (ESA, 2017)

Finding a Shortest Non-zero Path in Group-Labeled Graphs via Permanent Computation. - Yusuke Kobayashi 001; Sho Toyooka (Algorithmica, 2017)

An algorithm for identifying cycle-plus-triangles graphs. - Kristóf Bérczi; Yusuke Kobayashi 001 (Discret. Appl. Math., 2017)

Packing Edge-Disjoint Odd Eulerian Subgraphs Through Prescribed Vertices in 4-Edge-Connected Graphs. - Naonori Kakimura; Ken-ichi Kawarabayashi; Yusuke Kobayashi 001 (SIAM J. Discret. Math., 2017)

Efficient stabilization of cooperative matching games. - Takehiro Ito; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi 001; Yoshio Okamoto (Theor. Comput. Sci., 2017)

Randomized strategies for cardinality robustness in the knapsack problem. - Yusuke Kobayashi 001; Kenjiro Takazawa (Theor. Comput. Sci., 2017)

Tight Approximation for Unconstrained XOS Maximization. - Yasushi Kawase; Yusuke Kobayashi 001; Yutaro Yamaguchi 001 (CoRR, 2018)

The parity Hamiltonian cycle problem. - Hiroshi Nishiyama; Yusuke Kobayashi 001; Yukiko Yamauchi; Shuji Kijima; Masafumi Yamashita (Discret. Math., 2018)

All-or-Nothing Multicommodity Flow Problem with Bounded Fractionality in Planar Graphs. - Ken-ichi Kawarabayashi; Yusuke Kobayashi 001 (SIAM J. Comput., 2018)

NP-hardness and fixed-parameter tractability of the minimum spanner problem. - Yusuke Kobayashi 001 (Theor. Comput. Sci., 2018)

An Improved Fixed-Parameter Algorithm for Max-Cut Parameterized by Crossing Number. - Yasuaki Kobayashi; Yusuke Kobayashi 001; Shuichi Miyazaki; Suguru Tamaki (IWOCA, 2019)

Parameterized Algorithms for Maximum Cut with Connectivity Constraints. - Hiroshi Eto; Tesshu Hanaka; Yasuaki Kobayashi; Yusuke Kobayashi 001 (IPEC, 2019)

The Perfect Matching Reconfiguration Problem. - Marthe Bonamy; Nicolas Bousquet 001; Marc Heinrich; Takehiro Ito; Yusuke Kobayashi 001; Arnaud Mary; Moritz Mühlenthaler; Kunihiro Wasa (MFCS, 2019)

Minimum-Cost b-Edge Dominating Sets on Trees. - Takehiro Ito; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi 001; Yoshio Okamoto (Algorithmica, 2019)

An FPT Algorithm for Max-Cut Parameterized by Crossing Number. - Yasuaki Kobayashi; Yusuke Kobayashi 001; Shuichi Miyazaki; Suguru Tamaki (CoRR, 2019)

Reconfiguration of maximum-weight b-matchings in a graph. - Takehiro Ito; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi 001; Yoshio Okamoto (J. Comb. Optim., 2019)

Two disjoint shortest paths problem with non-negative edge length. - Yusuke Kobayashi 001; Ryo Sako (Oper. Res. Lett., 2019)

Reconfiguration of Spanning Trees with Many or Few Leaves. - Nicolas Bousquet 001; Takehiro Ito; Yusuke Kobayashi 001; Haruka Mizuta; Paul Ouvrard; Akira Suzuki 001; Kunihiro Wasa (ESA, 2020)

The Steiner Problem for Count Matroids. - Tibor Jordán; Yusuke Kobayashi 001; Ryoga Mahara; Kazuhisa Makino (IWOCA, 2020)

An FPT Algorithm for Minimum Additive Spanner Problem. - Yusuke Kobayashi 001 (STACS, 2020)

Shortest Reconfiguration of Colorings Under Kempe Changes. - Marthe Bonamy; Marc Heinrich; Takehiro Ito; Yusuke Kobayashi 001; Haruka Mizuta; Moritz Mühlenthaler; Akira Suzuki 001; Kunihiro Wasa (STACS, 2020)

Subgraph Isomorphism on Graph Classes that Exclude a Substructure. - Hans L. Bodlaender; Tesshu Hanaka; Yasuaki Kobayashi; Yusuke Kobayashi 001; Yoshio Okamoto; Yota Otachi; Tom C. van der Zanden (Algorithmica, 2020)

On the number of edges in a graph with many two-hop disjoint paths. - Koki Takayama; Yusuke Kobayashi 001 (Discret. Appl. Math., 2020)

Linear min-max relation between the treewidth of an H-minor-free graph and its largest grid minor. - Ken-ichi Kawarabayashi; Yusuke Kobayashi 001 (J. Comb. Theory B, 2020)

Finding a path with two labels forbidden in group-labeled graphs. - Yasushi Kawase; Yusuke Kobayashi 001; Yutaro Yamaguchi 001 (J. Comb. Theory B, 2020)

Diameter of colorings under Kempe changes. - Marthe Bonamy; Marc Heinrich; Takehiro Ito; Yusuke Kobayashi 001; Haruka Mizuta; Moritz Mühlenthaler; Akira Suzuki 001; Kunihiro Wasa (Theor. Comput. Sci., 2020)

Complexity of the multi-service center problem. - Takehiro Ito; Naonori Kakimura; Yusuke Kobayashi 001 (Theor. Comput. Sci., 2020)

A strongly polynomial time algorithm for the maximum supply rate problem on trees. - Koki Takayama; Yusuke Kobayashi 001 (Theor. Comput. Sci., 2020)

Computing the Largest Bond and the Maximum Connected Cut of a Graph. - Gabriel L. Duarte; Hiroshi Eto; Tesshu Hanaka; Yasuaki Kobayashi; Yusuke Kobayashi 001; Daniel Lokshtanov; Lehilton L. C. Pedrosa; Rafael C. S. Schouery; Uéverton S. Souza (Algorithmica, 2021)

Improved Analysis of Highest-Degree Branching for Feedback Vertex Set. - Yoichi Iwata; Yusuke Kobayashi 001 (Algorithmica, 2021)

Tight Approximation for Unconstrained XOS Maximization. - Yuval Filmus; Yasushi Kawase; Yusuke Kobayashi 001; Yutaro Yamaguchi 001 (Math. Oper. Res., 2021)

Market Pricing for Matroid Rank Valuations. - Kristóf Bérczi; Naonori Kakimura; Yusuke Kobayashi 001 (SIAM J. Discret. Math., 2021)

Finding a maximum minimal separator: Graph classes and fixed-parameter tractability. - Tesshu Hanaka; Yasuaki Kobayashi; Yusuke Kobayashi 001; Tsuyoshi Yagita (Theor. Comput. Sci., 2021)

Algorithms for gerrymandering over graphs. - Takehiro Ito; Naoyuki Kamiyama; Yusuke Kobayashi 001; Yoshio Okamoto (Theor. Comput. Sci., 2021)

One-Face Shortest Disjoint Paths with a Deviation Terminal. - Yusuke Kobayashi 001; Tatsuya Terao (ISAAC, 2022)

Reconfiguration of Spanning Trees with Degree Constraint or Diameter Constraint. - Nicolas Bousquet 001; Takehiro Ito; Yusuke Kobayashi 001; Haruka Mizuta; Paul Ouvrard; Akira Suzuki 001; Kunihiro Wasa (STACS, 2022)

Parameterized Complexity of (A, ℓ )-Path Packing. - Rémy Belmonte; Tesshu Hanaka; Masaaki Kanzaki; Masashi Kiyomi; Yasuaki Kobayashi; Yusuke Kobayashi 001; Michael Lampis; Hirotaka Ono 001; Yota Otachi (Algorithmica, 2022)

Linear-Time Recognition of Double-Threshold Graphs. - Yusuke Kobayashi 001; Yoshio Okamoto; Yota Otachi; Yushi Uno (Algorithmica, 2022)

Submodular reassignment problem for reallocating agents to tasks with synergy effects. - Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi 001; Yoshio Okamoto (Discret. Optim., 2022)

Weighted Triangle-free 2-matching Problem with Edge-disjoint Forbidden Triangles. - Yusuke Kobayashi 001 (Math. Program., 2022)

An Improved Deterministic Parameterized Algorithm for Cactus Vertex Deletion. - Yuuki Aoike; Tatsuya Gima; Tesshu Hanaka; Masashi Kiyomi; Yasuaki Kobayashi; Yusuke Kobayashi 001; Kazuhiro Kurita; Yota Otachi (Theory Comput. Syst., 2022)

A parameterized view to the robust recoverable base problem of matroids under structural uncertainty. - Takehiro Ito; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi 001; Yoshio Okamoto (Oper. Res. Lett., 2022)

A Weighted Linear Matroid Parity Algorithm. - Satoru Iwata 001; Yusuke Kobayashi 001 (SIAM J. Comput., 2022)

Shortest Reconfiguration of Perfect Matchings via Alternating Cycles. - Takehiro Ito; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi 001; Yoshio Okamoto (SIAM J. Discret. Math., 2022)

A Framework to Design Approximation Algorithms for Finding Diverse Solutions in Combinatorial Problems. - Tesshu Hanaka; Masashi Kiyomi; Yasuaki Kobayashi; Yusuke Kobayashi 001; Kazuhiro Kurita; Yota Otachi (AAAI, 2023)

Reconfiguration of Colorings in Triangulations of the Sphere. - Takehiro Ito; Yuni Iwamasa; Yusuke Kobayashi 001; Shun-ichi Maezawa; Yuta Nozaki; Yoshio Okamoto; Kenta Ozeki (SoCG, 2023)

Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra. - Takehiro Ito; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi 001; Shun-ichi Maezawa; Yuta Nozaki; Yoshio Okamoto (ICALP, 2023)

Reconfiguration of the Union of Arborescences. - Yusuke Kobayashi 001; Ryoga Mahara; Tamás Schwarcz (ISAAC, 2023)

An Approximation Algorithm for Two-Edge-Connected Subgraph Problem via Triangle-Free Two-Edge-Cover. - Yusuke Kobayashi 001; Takashi Noguchi (ISAAC, 2023)

Reconfiguration of Time-Respecting Arborescences. - Takehiro Ito; Yuni Iwamasa; Naoyuki Kamiyama; Yasuaki Kobayashi; Yusuke Kobayashi 001; Shun-ichi Maezawa; Akira Suzuki 001 (WADS, 2023)

Algorithmic Theory of Qubit Routing. - Takehiro Ito; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi 001; Yoshio Okamoto (WADS, 2023)

Trade-offs among degree, diameter, and number of paths. - Toshimasa Ishii; Akitoshi Kawamura; Yusuke Kobayashi 001; Kazuhisa Makino (Discret. Appl. Math., 2023)

Monotone Edge Flips to an Orientation of Maximum Edge-Connectivity à la Nash-Williams. - Takehiro Ito; Yuni Iwamasa; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi 001; Shun-ichi Maezawa; Yuta Nozaki; Yoshio Okamoto; Kenta Ozeki (ACM Trans. Algorithms, 2023)

Fixed-parameter algorithms for graph constraint logic. - Tatsuhiko Hatanaka; Felix Hommelsheim; Takehiro Ito; Yusuke Kobayashi 001; Moritz Mühlenthaler; Akira Suzuki 001 (Theor. Comput. Sci., 2023)

Reconfiguration of Spanning Trees with Degree Constraints or Diameter Constraints. - Nicolas Bousquet 001; Takehiro Ito; Yusuke Kobayashi 001; Haruka Mizuta; Paul Ouvrard; Akira Suzuki 001; Kunihiro Wasa (Algorithmica, 2023)

Feedback vertex set reconfiguration in planar graphs. - Nicolas Bousquet 001; Felix Hommelsheim; Yusuke Kobayashi 001; Moritz Mühlenthaler; Akira Suzuki 001 (Theor. Comput. Sci., 2023)

On reachable assignments under dichotomous preferences. - Takehiro Ito; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi 001; Yuta Nozaki; Yoshio Okamoto; Kenta Ozeki (Theor. Comput. Sci., 2023)

Finding a Maximum Restricted t-Matching via Boolean Edge-CSP. - Yuni Iwamasa; Yusuke Kobayashi 001; Kenjiro Takazawa (ESA, 2024)

Subquadratic Submodular Maximization with a General Matroid Constraint. - Yusuke Kobayashi 001; Tatsuya Terao (ICALP, 2024)

Loss Minimization for Electrical Flows over Spanning Trees on Grids. - Takehiro Ito; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi 001; Yoshio Okamoto (CoRR, 2024)

Envy-free relaxations for goods, chores, and mixed items. - Kristóf Bérczi; Erika R. Bérczi-Kovács; Endre Boros; Fekadu Tolessa Gedefa; Naoyuki Kamiyama; Telikepalli Kavitha; Yusuke Kobayashi 001; Kazuhisa Makino (Theor. Comput. Sci., 2024)

Pinwheel Covering. - Akitoshi Kawamura; Yusuke Kobayashi 001; Yosuke Kusano (CIAC (2), 2025)

Validating a PTAS for Triangle-Free 2-Matching via a Simple Decomposition Theorem. - Yusuke Kobayashi 001; Takashi Noguchi (SOSA, 2025)

Finding spanning trees with perfect matchings. - Kristóf Bérczi; Tamás Király; Yusuke Kobayashi 001; Yutaro Yamaguchi 001; Yu Yokoi (Discret. Appl. Math., 2025)

Proportional Allocation of Indivisible Goods up to the Least Valued Good on Average. - Yusuke Kobayashi 001; Ryoga Mahara (SIAM J. Discret. Math., 2025)

Rerouting Planar Curves and Disjoint Paths. - Takehiro Ito; Yuni Iwamasa; Naonori Kakimura; Yusuke Kobayashi 001; Shun-ichi Maezawa; Yuta Nozaki; Yoshio Okamoto; Kenta Ozeki (ACM Trans. Algorithms, 2025)

EFX allocations for indivisible chores: Matching-based approach. - Yusuke Kobayashi 001; Ryoga Mahara; Souta Sakamoto (Theor. Comput. Sci., 2025)

Optimal general factor problem and jump system intersection. - Yusuke Kobayashi 001 (Math. Program., 2025)

Reforming an Envy-Free Matching. - Takehiro Ito; Yuni Iwamasa; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi 001; Yuta Nozaki; Yoshio Okamoto; Kenta Ozeki (Algorithmica, 2025)