Yusuke Kobayashi

ORCID

Publication Activity (10 Years)

Years Active: 2007-2024
Publications (10 Years): 120

Top Venues

Publications

Yusuke Kobayashi, Tatsuya Terao
Subquadratic Submodular Maximization with a General Matroid Constraint. ICALP (2024)
Kristóf Bérczi, Erika R. Bérczi-Kovács, Endre Boros, Fekadu Tolessa Gedefa, Naoyuki Kamiyama, Telikepalli Kavitha, Yusuke Kobayashi, Kazuhisa Makino
Envy-free relaxations for goods, chores, and mixed items. Theor. Comput. Sci. 1002 (2024)
Yusuke Kobayashi, Tatsuya Terao
Subquadratic Submodular Maximization with a General Matroid Constraint. CoRR (2024)
Kristóf Bérczi, Tamás Király, Yusuke Kobayashi, Yutaro Yamaguchi, Yu Yokoi
Finding Spanning Trees with Perfect Matchings. CoRR (2024)
Yusuke Kobayashi, Ryoga Mahara, Tamás Schwarcz
Reconfiguration of the Union of Arborescences. ISAAC (2023)
Toshimasa Ishii, Akitoshi Kawamura, Yusuke Kobayashi, Kazuhisa Makino
Trade-offs among degree, diameter, and number of paths. Discret. Appl. Math. 327 (2023)
Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Paul Ouvrard, Akira Suzuki, Kunihiro Wasa
Reconfiguration of Spanning Trees with Degree Constraints or Diameter Constraints. Algorithmica 85 (9) (2023)
Takehiro Ito, Yuni Iwamasa, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
Reconfiguration of Colorings in Triangulations of the Sphere. SoCG (2023)
Yusuke Kobayashi, Takashi Noguchi
An Approximation Algorithm for Two-Edge-Connected Subgraph Problem via Triangle-free Two-Edge-Cover. CoRR (2023)
Yusuke Kobayashi, Ryoga Mahara, Tamás Schwarcz
Reconfiguration of the Union of Arborescences. CoRR (2023)
Yusuke Kobayashi
Optimal General Factor Problem and Jump System Intersection. IPCO (2023)
Tatsuhiko Hatanaka, Felix Hommelsheim, Takehiro Ito, Yusuke Kobayashi, Moritz Mühlenthaler, Akira Suzuki
Fixed-parameter algorithms for graph constraint logic. Theor. Comput. Sci. 959 (2023)
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto
Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra. CoRR (2023)
Yusuke Kobayashi, Takashi Noguchi
An Approximation Algorithm for Two-Edge-Connected Subgraph Problem via Triangle-Free Two-Edge-Cover. ISAAC (2023)
Yuni Iwamasa, Yusuke Kobayashi, Kenjiro Takazawa
Finding a Maximum Restricted t-Matching via Boolean Edge-CSP. CoRR (2023)
Takehiro Ito, Yuni Iwamasa, Naoyuki Kamiyama, Yasuaki Kobayashi, Yusuke Kobayashi, Shun-ichi Maezawa, Akira Suzuki
Reconfiguration of Time-Respecting Arborescences. WADS (2023)
Nicolas Bousquet, Felix Hommelsheim, Yusuke Kobayashi, Moritz Mühlenthaler, Akira Suzuki
Feedback vertex set reconfiguration in planar graphs. Theor. Comput. Sci. 979 (2023)
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
Algorithmic Theory of Qubit Routing. WADS (2023)
Yusuke Kobayashi, Ryoga Mahara, Souta Sakamoto
EFX Allocations for Indivisible Chores: Matching-Based Approach. SAGT (2023)
Yusuke Kobayashi, Ryoga Mahara, Souta Sakamoto
EFX Allocations for Indivisible Chores: Matching-Based Approach. CoRR (2023)
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto
Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra. ICALP (2023)
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
On reachable assignments under dichotomous preferences. Theor. Comput. Sci. 979 (2023)
Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Kazuhiro Kurita, Yota Otachi
A Framework to Design Approximation Algorithms for Finding Diverse Solutions in Combinatorial Problems. AAAI (2023)
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
Algorithmic Theory of Qubit Routing. CoRR (2023)
Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
Rerouting Planar Curves and Disjoint Paths. ICALP (2023)
Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
Monotone Edge Flips to an Orientation of Maximum Edge-Connectivity à la Nash-Williams. ACM Trans. Algorithms 19 (1) (2023)
Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Paul Ouvrard, Akira Suzuki, Kunihiro Wasa
Reconfiguration of Spanning Trees with Degree Constraint or Diameter Constraint. CoRR (2022)
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
A parameterized view to the robust recoverable base problem of matroids under structural uncertainty. Oper. Res. Lett. 50 (3) (2022)
Yusuke Kobayashi
Weighted Triangle-free 2-matching Problem with Edge-disjoint Forbidden Triangles. Math. Program. 192 (1) (2022)
Satoru Iwata, Yusuke Kobayashi
A Weighted Linear Matroid Parity Algorithm. SIAM J. Comput. 51 (2) (2022)
Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
Rerouting Planar Curves and Disjoint Paths. CoRR (2022)
Yuuki Aoike, Tatsuya Gima, Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Kazuhiro Kurita, Yota Otachi
An Improved Deterministic Parameterized Algorithm for Cactus Vertex Deletion. Theory Comput. Syst. 66 (2) (2022)
Takehiro Ito, Yuni Iwamasa, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
Reconfiguration of colorings in triangulations of the sphere. CoRR (2022)
Rémy Belmonte, Tesshu Hanaka, Masaaki Kanzaki, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Michael Lampis, Hirotaka Ono, Yota Otachi
Parameterized Complexity of (A, ℓ )-Path Packing. Algorithmica 84 (4) (2022)
Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
Monotone edge flips to an orientation of maximum edge-connectivity à la Nash-Williams. SODA (2022)
Yusuke Kobayashi, Ryoga Mahara
Proportional Allocation of Indivisible Goods up to the Least Valued Good on Average. CoRR (2022)
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
Shortest Reconfiguration of Perfect Matchings via Alternating Cycles. SIAM J. Discret. Math. 36 (2) (2022)
Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Paul Ouvrard, Akira Suzuki, Kunihiro Wasa
Reconfiguration of Spanning Trees with Degree Constraint or Diameter Constraint. STACS (2022)
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
On Reachable Assignments under Dichotomous Preferences. CoRR (2022)
Yusuke Kobayashi, Tatsuya Terao
One-Face Shortest Disjoint Paths with a Deviation Terminal. ISAAC (2022)
Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
Reforming an Envy-Free Matching. CoRR (2022)
Yusuke Kobayashi, Yoshio Okamoto, Yota Otachi, Yushi Uno
Linear-Time Recognition of Double-Threshold Graphs. Algorithmica 84 (4) (2022)
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
On Reachable Assignments Under Dichotomous Preferences. PRIMA (2022)
Yusuke Kobayashi, Ryoga Mahara
Proportional Allocation of Indivisible Goods up to the Least Valued Good on Average. ISAAC (2022)
Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
Reforming an Envy-Free Matching. AAAI (2022)
Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
Submodular reassignment problem for reallocating agents to tasks with synergy effects. Discret. Optim. 44 (Part) (2022)
Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Kazuhiro Kurita, Yota Otachi
A Framework to Design Approximation Algorithms for Finding Diverse Solutions in Combinatorial Problems. CoRR (2022)
Kristóf Bérczi, Naonori Kakimura, Yusuke Kobayashi
Market Pricing for Matroid Rank Valuations. SIAM J. Discret. Math. 35 (4) (2021)
Yoichi Iwata, Yusuke Kobayashi
Improved Analysis of Highest-Degree Branching for Feedback Vertex Set. Algorithmica 83 (8) (2021)
Takehiro Ito, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
Algorithms for gerrymandering over graphs. Theor. Comput. Sci. 868 (2021)
Yuval Filmus, Yasushi Kawase, Yusuke Kobayashi, Yutaro Yamaguchi
Tight Approximation for Unconstrained XOS Maximization. Math. Oper. Res. 46 (4) (2021)
Gabriel L. Duarte, Hiroshi Eto, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi, Daniel Lokshtanov, Lehilton L. C. Pedrosa, Rafael C. S. Schouery, Uéverton S. Souza
Computing the Largest Bond and the Maximum Connected Cut of a Graph. Algorithmica 83 (5) (2021)
Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi, Tsuyoshi Yagita
Finding a maximum minimal separator: Graph classes and fixed-parameter tractability. Theor. Comput. Sci. 865 (2021)
Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
Monotone edge flips to an orientation of maximum edge-connectivity à la Nash-Williams. CoRR (2021)
Rémy Belmonte, Tesshu Hanaka, Masaaki Kanzaki, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Michael Lampis, Hirotaka Ono, Yota Otachi
Parameterized Complexity of (A, 𝓁)-Path Packing. CoRR (2020)
Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Paul Ouvrard, Akira Suzuki, Kunihiro Wasa
Reconfiguration of Spanning Trees with Many or Few Leaves. ESA (2020)
Gabriel L. Duarte, Hiroshi Eto, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi, Daniel Lokshtanov, Lehilton L. C. Pedrosa, Rafael C. S. Schouery, Uéverton S. Souza
Computing the Largest Bond and the Maximum Connected Cut of a Graph. CoRR (2020)
Kristóf Bérczi, Erika R. Bérczi-Kovács, Endre Boros, Fekadu Tolessa Gedefa, Naoyuki Kamiyama, Telikepalli Kavitha, Yusuke Kobayashi, Kazuhisa Makino
Envy-free Relaxations for Goods, Chores, and Mixed Items. CoRR (2020)
Tatsuhiko Hatanaka, Felix Hommelsheim, Takehiro Ito, Yusuke Kobayashi, Moritz Mühlenthaler, Akira Suzuki
Fixed-Parameter Algorithms for Graph Constraint Logic. IPEC (2020)
Rémy Belmonte, Tesshu Hanaka, Masaaki Kanzaki, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Michael Lampis, Hirotaka Ono, Yota Otachi
Parameterized Complexity of (A, ℓ )-Path Packing. IWOCA (2020)
Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Paul Ouvrard, Akira Suzuki, Kunihiro Wasa
Reconfiguration of Spanning Trees with Many or Few Leaves. CoRR (2020)
Takehiro Ito, Naonori Kakimura, Yusuke Kobayashi
Complexity of the multi-service center problem. Theor. Comput. Sci. 842 (2020)
Kristóf Bérczi, Naonori Kakimura, Yusuke Kobayashi
Market Pricing for Matroid Rank Valuations. CoRR (2020)
Marthe Bonamy, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Moritz Mühlenthaler, Akira Suzuki, Kunihiro Wasa
Diameter of colorings under Kempe changes. Theor. Comput. Sci. 838 (2020)
Tatsuhiko Hatanaka, Felix Hommelsheim, Takehiro Ito, Yusuke Kobayashi, Moritz Mühlenthaler, Akira Suzuki
Fixed-Parameter Algorithms for Graph Constraint Logic. CoRR (2020)
Marthe Bonamy, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Moritz Mühlenthaler, Akira Suzuki, Kunihiro Wasa
Shortest Reconfiguration of Colorings Under Kempe Changes. STACS (2020)
Yasushi Kawase, Yusuke Kobayashi, Yutaro Yamaguchi
Finding a path with two labels forbidden in group-labeled graphs. J. Comb. Theory, Ser. B 143 (2020)
Yusuke Kobayashi, Yoshio Okamoto, Yota Otachi, Yushi Uno
Linear-Time Recognition of Double-Threshold Graphs. WG (2020)
Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi, Tsuyoshi Yagita
Finding a Maximum Minimal Separator: Graph Classes and Fixed-Parameter Tractability. CoRR (2020)
Koki Takayama, Yusuke Kobayashi
A strongly polynomial time algorithm for the maximum supply rate problem on trees. Theor. Comput. Sci. 806 (2020)
Koki Takayama, Yusuke Kobayashi
On the number of edges in a graph with many two-hop disjoint paths. Discret. Appl. Math. 283 (2020)
Yusuke Kobayashi
Weighted Triangle-Free 2-Matching Problem with Edge-Disjoint Forbidden Triangles. IPCO (2020)
Kristóf Bérczi, Naonori Kakimura, Yusuke Kobayashi
Market Pricing for Matroid Rank Valuations. ISAAC (2020)
Hans L. Bodlaender, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi, Yoshio Okamoto, Yota Otachi, Tom C. van der Zanden
Subgraph Isomorphism on Graph Classes that Exclude a Substructure. Algorithmica 82 (12) (2020)
Yusuke Kobayashi
An FPT Algorithm for Minimum Additive Spanner Problem. STACS (2020)
Ken-ichi Kawarabayashi, Yusuke Kobayashi
-minor-free graph and its largest grid minor. J. Comb. Theory, Ser. B 141 (2020)
Yuuki Aoike, Tatsuya Gima, Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Kazuhiro Kurita, Yota Otachi
An Improved Deterministic Parameterized Algorithm for Cactus Vertex Deletion. CoRR (2020)
Tibor Jordán, Yusuke Kobayashi, Ryoga Mahara, Kazuhisa Makino
The Steiner Problem for Count Matroids. IWOCA (2020)
Hiroshi Eto, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi
Parameterized Algorithms for Maximum Cut with Connectivity Constraints. IPEC (2019)
Yoichi Iwata, Yusuke Kobayashi
Improved Analysis of Highest-Degree Branching for Feedback Vertex Set. IPEC (2019)
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
Shortest Reconfiguration of Perfect Matchings via Alternating Cycles. ESA (2019)
Yoichi Iwata, Yusuke Kobayashi
Improved Analysis of Highest-Degree Branching for Feedback Vertex Set. CoRR (2019)
Yusuke Kobayashi, Yoshio Okamoto, Yota Otachi, Yushi Uno
Linear-Time Recognition of Double-Threshold Graphs. CoRR (2019)
Hiroshi Eto, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi
Parameterized Algorithms for Maximum Cut with Connectivity Constraints. CoRR (2019)
Yusuke Kobayashi, Ryo Sako
Two disjoint shortest paths problem with non-negative edge length. Oper. Res. Lett. 47 (1) (2019)
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
Minimum-Cost b-Edge Dominating Sets on Trees. Algorithmica 81 (1) (2019)
Hans L. Bodlaender, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi, Yoshio Okamoto, Yota Otachi, Tom C. van der Zanden
Subgraph Isomorphism on Graph Classes that Exclude a Substructure. CoRR (2019)
Yusuke Kobayashi
An FPT Algorithm for Minimum Additive Spanner Problem. CoRR (2019)
Satoru Iwata, Yusuke Kobayashi
A Weighted Linear Matroid Parity Algorithm. CoRR (2019)
Marthe Bonamy, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Moritz Mühlenthaler, Akira Suzuki, Kunihiro Wasa
Diameter of Colorings Under Kempe Changes. COCOON (2019)
Yasuaki Kobayashi, Yusuke Kobayashi, Shuichi Miyazaki, Suguru Tamaki
An FPT Algorithm for Max-Cut Parameterized by Crossing Number. CoRR (2019)
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
Shortest Reconfiguration of Perfect Matchings via Alternating Cycles. CoRR (2019)
Marthe Bonamy, Nicolas Bousquet, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Arnaud Mary, Moritz Mühlenthaler, Kunihiro Wasa
The Perfect Matching Reconfiguration Problem. MFCS (2019)
Marthe Bonamy, Nicolas Bousquet, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Arnaud Mary, Moritz Mühlenthaler, Kunihiro Wasa
The Perfect Matching Reconfiguration Problem. CoRR (2019)
Yasuaki Kobayashi, Yusuke Kobayashi, Shuichi Miyazaki, Suguru Tamaki
An Improved Fixed-Parameter Algorithm for Max-Cut Parameterized by Crossing Number. IWOCA (2019)
Yusuke Kobayashi
Weighted Triangle-free 2-matching Problem with Edge-disjoint Forbidden Triangles. CoRR (2019)
Takehiro Ito, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
Algorithms for Gerrymandering over Graphs. AAMAS (2019)
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
Reconfiguration of maximum-weight b-matchings in a graph. J. Comb. Optim. 37 (2) (2019)
Ken-ichi Kawarabayashi, Yusuke Kobayashi
All-or-Nothing Multicommodity Flow Problem with Bounded Fractionality in Planar Graphs. SIAM J. Comput. 47 (4) (2018)
Yasushi Kawase, Yusuke Kobayashi, Yutaro Yamaguchi
Tight Approximation for Unconstrained XOS Maximization. CoRR (2018)

Yusuke Kobayashi.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Yusuke Kobayashi