default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYusuke Kobayashi 0001
小林 佑輔
Person information
- unicode name: 小林 佑輔
- affiliation: University of Kyoto, Japan
- affiliation (former): University of Tsukuba
- affiliation (former): University of Tokyo, Japan
Other persons with the same name
- Yusuke Kobayashi — disambiguation page
- Yusuke Kobayashi 0002 — Tokyo Institute of Technology, Dept. of Electronics and Applied Physics
- Yusuke Kobayashi 0003 — Tohoku University
- Yusuke Kobayashi 0004 — Yokohama National University
- Yusuke Kobayashi 0005 — NEC Corporation, Computers Division
- Yusuke Kobayashi 0006
![[0000-0002-4793-2548]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0002-4793-2548")
— Keio University - Yusuke Kobayashi 0007 — Okajama University
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j70]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: 114596 (2024)- [c62]Yuni Iwamasa, Yusuke Kobayashi, Kenjiro Takazawa:
Finding a Maximum Restricted t-Matching via Boolean Edge-CSP. ESA 2024: 75:1-75:15 - [c61]Yusuke Kobayashi, Tatsuya Terao:
Subquadratic Submodular Maximization with a General Matroid Constraint. ICALP 2024: 100:1-100:19 - [i40]Yusuke Kobayashi, Tatsuya Terao:
Subquadratic Submodular Maximization with a General Matroid Constraint. CoRR abs/2405.00359 (2024) - [i39]Kristóf Bérczi, Tamás Király, Yusuke Kobayashi, Yutaro Yamaguchi, Yu Yokoi:
Finding Spanning Trees with Perfect Matchings. CoRR abs/2407.02958 (2024) - 2023
- [j69]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): 2779-2816 (2023) - [j68]Toshimasa Ishii, Akitoshi Kawamura, Yusuke Kobayashi, Kazuhisa Makino:
Trade-offs among degree, diameter, and number of paths. Discret. Appl. Math. 327: 96-100 (2023) - [j67]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): 6:1-6:22 (2023) - [j66]Tatsuhiko Hatanaka, Felix Hommelsheim, Takehiro Ito, Yusuke Kobayashi, Moritz Mühlenthaler, Akira Suzuki:
Fixed-parameter algorithms for graph constraint logic. Theor. Comput. Sci. 959: 113863 (2023) - [j65]Nicolas Bousquet, Felix Hommelsheim, Yusuke Kobayashi, Moritz Mühlenthaler, Akira Suzuki:
Feedback vertex set reconfiguration in planar graphs. Theor. Comput. Sci. 979: 114188 (2023) - [j64]Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki:
On reachable assignments under dichotomous preferences. Theor. Comput. Sci. 979: 114196 (2023) - [c60]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: 3968-3976 - [c59]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: 43:1-43:16 - [c58]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: 81:1-81:19 - [c57]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: 82:1-82:17 - [c56]Yusuke Kobayashi:
Optimal General Factor Problem and Jump System Intersection. IPCO 2023: 291-305 - [c55]Yusuke Kobayashi, Ryoga Mahara, Tamás Schwarcz:
Reconfiguration of the Union of Arborescences. ISAAC 2023: 48:1-48:14 - [c54]Yusuke Kobayashi, Takashi Noguchi:
An Approximation Algorithm for Two-Edge-Connected Subgraph Problem via Triangle-Free Two-Edge-Cover. ISAAC 2023: 49:1-49:10 - [c53]Yusuke Kobayashi, Ryoga Mahara, Souta Sakamoto:
EFX Allocations for Indivisible Chores: Matching-Based Approach. SAGT 2023: 257-270 - [c52]Takehiro Ito, Yuni Iwamasa, Naoyuki Kamiyama, Yasuaki Kobayashi, Yusuke Kobayashi, Shun-ichi Maezawa, Akira Suzuki:
Reconfiguration of Time-Respecting Arborescences. WADS 2023: 521-532 - [c51]Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto:
Algorithmic Theory of Qubit Routing. WADS 2023: 533-546 - [i38]Yusuke Kobayashi, Ryoga Mahara, Tamás Schwarcz:
Reconfiguration of the Union of Arborescences. CoRR abs/2304.13217 (2023) - [i37]Yusuke Kobayashi, Takashi Noguchi:
An Approximation Algorithm for Two-Edge-Connected Subgraph Problem via Triangle-free Two-Edge-Cover. CoRR abs/2304.13228 (2023) - [i36]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 abs/2304.14782 (2023) - [i35]Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto:
Algorithmic Theory of Qubit Routing. CoRR abs/2305.02059 (2023) - [i34]Yusuke Kobayashi, Ryoga Mahara, Souta Sakamoto:
EFX Allocations for Indivisible Chores: Matching-Based Approach. CoRR abs/2305.04168 (2023) - [i33]Takehiro Ito, Yuni Iwamasa, Naoyuki Kamiyama, Yasuaki Kobayashi, Yusuke Kobayashi, Shun-ichi Maezawa, Akira Suzuki:
Reconfiguration of Time-Respecting Arborescences. CoRR abs/2305.07262 (2023) - [i32]Yuni Iwamasa, Yusuke Kobayashi, Kenjiro Takazawa:
Finding a Maximum Restricted t-Matching via Boolean Edge-CSP. CoRR abs/2310.20245 (2023) - 2022
- [j63]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): 871-895 (2022) - [j62]Yusuke Kobayashi, Yoshio Okamoto, Yota Otachi, Yushi Uno:
Linear-Time Recognition of Double-Threshold Graphs. Algorithmica 84(4): 1163-1181 (2022) - [j61]Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto:
Submodular reassignment problem for reallocating agents to tasks with synergy effects. Discret. Optim. 44(Part): 100631 (2022) - [j60]Yusuke Kobayashi:
Weighted Triangle-free 2-matching Problem with Edge-disjoint Forbidden Triangles. Math. Program. 192(1): 675-702 (2022) - [j59]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): 502-515 (2022) - [j58]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): 370-375 (2022) - [j57]Satoru Iwata, Yusuke Kobayashi:
A Weighted Linear Matroid Parity Algorithm. SIAM J. Comput. 51(2): 17-238 (2022) - [j56]Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto:
Shortest Reconfiguration of Perfect Matchings via Alternating Cycles. SIAM J. Discret. Math. 36(2): 1102-1123 (2022) - [c50]Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki:
Reforming an Envy-Free Matching. AAAI 2022: 5084-5091 - [c49]Yusuke Kobayashi, Tatsuya Terao:
One-Face Shortest Disjoint Paths with a Deviation Terminal. ISAAC 2022: 47:1-47:15 - [c48]Yusuke Kobayashi, Ryoga Mahara:
Proportional Allocation of Indivisible Goods up to the Least Valued Good on Average. ISAAC 2022: 55:1-55:13 - [c47]Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki:
On Reachable Assignments Under Dichotomous Preferences. PRIMA 2022: 650-658 - [c46]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: 1342-1355 - [c45]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: 15:1-15:21 - [i31]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 abs/2201.04354 (2022) - [i30]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 abs/2201.08940 (2022) - [i29]Yusuke Kobayashi, Ryoga Mahara:
Proportional Allocation of Indivisible Goods up to the Least Valued Good on Average. CoRR abs/2205.00236 (2022) - [i28]Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki:
Reforming an Envy-Free Matching. CoRR abs/2207.02641 (2022) - [i27]Yusuke Kobayashi:
Optimal General Factor Problem and Jump System Intersection. CoRR abs/2209.00779 (2022) - [i26]Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki:
On Reachable Assignments under Dichotomous Preferences. CoRR abs/2209.10262 (2022) - [i25]Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki:
Rerouting Planar Curves and Disjoint Paths. CoRR abs/2210.11778 (2022) - [i24]Takehiro Ito, Yuni Iwamasa, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki:
Reconfiguration of colorings in triangulations of the sphere. CoRR abs/2210.17105 (2022) - 2021
- [j55]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): 1421-1458 (2021) - [j54]Yoichi Iwata, Yusuke Kobayashi:
Improved Analysis of Highest-Degree Branching for Feedback Vertex Set. Algorithmica 83(8): 2503-2520 (2021) - [j53]Yuval Filmus, Yasushi Kawase, Yusuke Kobayashi, Yutaro Yamaguchi:
Tight Approximation for Unconstrained XOS Maximization. Math. Oper. Res. 46(4): 1599-1610 (2021) - [j52]Kristóf Bérczi, Naonori Kakimura, Yusuke Kobayashi:
Market Pricing for Matroid Rank Valuations. SIAM J. Discret. Math. 35(4): 2662-2678 (2021) - [j51]Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi, Tsuyoshi Yagita:
Finding a maximum minimal separator: Graph classes and fixed-parameter tractability. Theor. Comput. Sci. 865: 131-140 (2021) - [j50]Takehiro Ito, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto:
Algorithms for gerrymandering over graphs. Theor. Comput. Sci. 868: 30-45 (2021) - [i23]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 abs/2110.11585 (2021) - 2020
- [j49]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): 3566-3587 (2020) - [j48]Koki Takayama, Yusuke Kobayashi:
On the number of edges in a graph with many two-hop disjoint paths. Discret. Appl. Math. 283: 718-723 (2020) - [j47]Ken-ichi Kawarabayashi, Yusuke Kobayashi:
Linear min-max relation between the treewidth of an H-minor-free graph and its largest grid minor. J. Comb. Theory B 141: 165-180 (2020) - [j46]Yasushi Kawase, Yusuke Kobayashi, Yutaro Yamaguchi:
Finding a path with two labels forbidden in group-labeled graphs. J. Comb. Theory B 143: 65-122 (2020) - [j45]Koki Takayama, Yusuke Kobayashi:
A strongly polynomial time algorithm for the maximum supply rate problem on trees. Theor. Comput. Sci. 806: 323-331 (2020) - [j44]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: 45-57 (2020) - [j43]Takehiro Ito, Naonori Kakimura, Yusuke Kobayashi:
Complexity of the multi-service center problem. Theor. Comput. Sci. 842: 18-27 (2020) - [c44]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: 24:1-24:15 - [c43]Yusuke Kobayashi:
Weighted Triangle-Free 2-Matching Problem with Edge-Disjoint Forbidden Triangles. IPCO 2020: 280-293 - [c42]Kristóf Bérczi, Naonori Kakimura, Yusuke Kobayashi:
Market Pricing for Matroid Rank Valuations. ISAAC 2020: 39:1-39:15 - [c41]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: 43-55 - [c40]Tibor Jordán, Yusuke Kobayashi, Ryoga Mahara, Kazuhisa Makino:
The Steiner Problem for Count Matroids. IWOCA 2020: 330-342 - [c39]Tatsuhiko Hatanaka, Felix Hommelsheim, Takehiro Ito, Yusuke Kobayashi, Moritz Mühlenthaler, Akira Suzuki:
Fixed-Parameter Algorithms for Graph Constraint Logic. IPEC 2020: 15:1-15:15 - [c38]Yusuke Kobayashi:
An FPT Algorithm for Minimum Additive Spanner Problem. STACS 2020: 11:1-11:16 - [c37]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: 35:1-35:14 - [c36]Yusuke Kobayashi, Yoshio Okamoto, Yota Otachi, Yushi Uno:
Linear-Time Recognition of Double-Threshold Graphs. WG 2020: 286-297 - [i22]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 abs/2006.04428 (2020) - [i21]Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Paul Ouvrard, Akira Suzuki, Kunihiro Wasa:
Reconfiguration of Spanning Trees with Many or Few Leaves. CoRR abs/2006.14309 (2020) - [i20]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 abs/2007.04513 (2020) - [i19]Kristóf Bérczi, Naonori Kakimura, Yusuke Kobayashi:
Market Pricing for Matroid Rank Valuations. CoRR abs/2007.08759 (2020) - [i18]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 abs/2008.03448 (2020) - [i17]Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi, Tsuyoshi Yagita:
Finding a Maximum Minimal Separator: Graph Classes and Fixed-Parameter Tractability. CoRR abs/2009.12184 (2020) - [i16]Tatsuhiko Hatanaka, Felix Hommelsheim, Takehiro Ito, Yusuke Kobayashi, Moritz Mühlenthaler, Akira Suzuki:
Fixed-Parameter Algorithms for Graph Constraint Logic. CoRR abs/2011.10385 (2020) - [i15]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 abs/2012.04910 (2020)
2010 – 2019
- 2019
- [j42]Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto:
Minimum-Cost b-Edge Dominating Sets on Trees. Algorithmica 81(1): 343-366 (2019) - [j41]Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto:
Reconfiguration of maximum-weight b-matchings in a graph. J. Comb. Optim. 37(2): 454-464 (2019) - [j40]Yusuke Kobayashi, Ryo Sako:
Two disjoint shortest paths problem with non-negative edge length. Oper. Res. Lett. 47(1): 66-69 (2019) - [c35]Takehiro Ito, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto:
Algorithms for Gerrymandering over Graphs. AAMAS 2019: 1413-1421 - [c34]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: 52-64 - [c33]Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto:
Shortest Reconfiguration of Perfect Matchings via Alternating Cycles. ESA 2019: 61:1-61:15 - [c32]Yasuaki Kobayashi, Yusuke Kobayashi, Shuichi Miyazaki, Suguru Tamaki:
An Improved Fixed-Parameter Algorithm for Max-Cut Parameterized by Crossing Number. IWOCA 2019: 327-338 - [c31]Hiroshi Eto, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi:
Parameterized Algorithms for Maximum Cut with Connectivity Constraints. IPEC 2019: 13:1-13:15 - [c30]Yoichi Iwata, Yusuke Kobayashi:
Improved Analysis of Highest-Degree Branching for Feedback Vertex Set. IPEC 2019: 22:1-22:11 - [c29]Marthe Bonamy, Nicolas Bousquet, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Arnaud Mary, Moritz Mühlenthaler, Kunihiro Wasa:
The Perfect Matching Reconfiguration Problem. MFCS 2019: 80:1-80:14 - [i14]Yusuke Kobayashi:
An FPT Algorithm for Minimum Additive Spanner Problem. CoRR abs/1903.01047 (2019) - [i13]Yasuaki Kobayashi, Yusuke Kobayashi, Shuichi Miyazaki, Suguru Tamaki:
An FPT Algorithm for Max-Cut Parameterized by Crossing Number. CoRR abs/1904.05011 (2019) - [i12]Marthe Bonamy, Nicolas Bousquet, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Arnaud Mary, Moritz Mühlenthaler, Kunihiro Wasa:
The Perfect Matching Reconfiguration Problem. CoRR abs/1904.06184 (2019) - [i11]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 abs/1905.10670 (2019) - [i10]Yoichi Iwata, Yusuke Kobayashi:
Improved Analysis of Highest-Degree Branching for Feedback Vertex Set. CoRR abs/1905.12233 (2019) - [i9]Satoru Iwata, Yusuke Kobayashi:
A Weighted Linear Matroid Parity Algorithm. CoRR abs/1905.13371 (2019) - [i8]Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto:
Shortest Reconfiguration of Perfect Matchings via Alternating Cycles. CoRR abs/1907.01700 (2019) - [i7]Hiroshi Eto, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi:
Parameterized Algorithms for Maximum Cut with Connectivity Constraints. CoRR abs/1908.03389 (2019) - [i6]Yusuke Kobayashi, Yoshio Okamoto, Yota Otachi, Yushi Uno:
Linear-Time Recognition of Double-Threshold Graphs. CoRR abs/1909.09371 (2019) - [i5]Yusuke Kobayashi:
Weighted Triangle-free 2-matching Problem with Edge-disjoint Forbidden Triangles. CoRR abs/1911.06436 (2019) - 2018
- [j39]Hiroshi Nishiyama, Yusuke Kobayashi, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita:
The parity Hamiltonian cycle problem. Discret. Math. 341(3): 606-626 (2018) - [j38]Ken-ichi Kawarabayashi, Yusuke Kobayashi:
All-or-Nothing Multicommodity Flow Problem with Bounded Fractionality in Planar Graphs. SIAM J. Comput. 47(4): 1483-1504 (2018) - [j37]Yusuke Kobayashi:
NP-hardness and fixed-parameter tractability of the minimum spanner problem. Theor. Comput. Sci. 746: 88-97 (2018) - [c28]Koki Takayama, Yusuke Kobayashi:
A Strongly Polynomial Time Algorithm for the Maximum Supply Rate Problem on Trees. FAW 2018: 54-67 - [i4]Yasushi Kawase, Yusuke Kobayashi, Yutaro Yamaguchi:
Finding a Path in Group-Labeled Graphs with Two Labels Forbidden. CoRR abs/1807.00109 (2018) - [i3]Yasushi Kawase, Yusuke Kobayashi, Yutaro Yamaguchi:
Tight Approximation for Unconstrained XOS Maximization. CoRR abs/1811.09045 (2018) - 2017
- [j36]Yusuke Kobayashi, Sho Toyooka:
Finding a Shortest Non-zero Path in Group-Labeled Graphs via Permanent Computation. Algorithmica 77(4): 1128-1142 (2017) - [j35]Kristóf Bérczi, Yusuke Kobayashi:
An algorithm for identifying cycle-plus-triangles graphs. Discret. Appl. Math. 226: 10-16 (2017) - [j34]Naonori Kakimura, Ken-ichi Kawarabayashi, Yusuke Kobayashi:
Packing Edge-Disjoint Odd Eulerian Subgraphs Through Prescribed Vertices in 4-Edge-Connected Graphs. SIAM J. Discret. Math. 31(2): 766-782 (2017) - [j33]Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto:
Efficient stabilization of cooperative matching games. Theor. Comput. Sci. 677: 69-82 (2017) - [j32]Yusuke Kobayashi, Kenjiro Takazawa:
Randomized strategies for cardinality robustness in the knapsack problem. Theor. Comput. Sci. 699: 53-62 (2017) - [c27]Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto, Taichi Shiitada:
Tight Approximability of the Server Allocation Problem for Real-Time Applications. ALGOCLOUD 2017: 41-55 - [c26]Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto:
Reconfiguration of Maximum-Weight b-Matchings in a Graph. COCOON 2017: 287-296 - [c25]Kristóf Bérczi, Yusuke Kobayashi:
The Directed Disjoint Shortest Paths Problem. ESA 2017: 13:1-13:13 - [c24]Takehiro Ito, Naonori Kakimura, Yusuke Kobayashi:
Complexity of the Multi-Service Center Problem. ISAAC 2017: 48:1-48:12 - [c23]Satoru Iwata, Yusuke Kobayashi:
A weighted linear matroid parity algorithm. STOC 2017: 264-276 - 2016
- [j31]Kensuke Otsuki, Yusuke Kobayashi, Kazuo Murota:
Improved max-flow min-cut algorithms in a Circular Disk Failure Model with application to a road network. Eur. J. Oper. Res. 248(2): 396-403 (2016) - [j30]Ken-ichi Kawarabayashi, Yusuke Kobayashi:
Edge-disjoint odd cycles in 4-edge-connected graphs. J. Comb. Theory B 119: 12-27 (2016) - [j29]Kristóf Bérczi, Tamás Király, Yusuke Kobayashi:
Covering Intersecting Bi-set Families under Matroid Constraints. SIAM J. Discret. Math. 30(3): 1758-1774 (2016) - [j28]Ken-ichi Kawarabayashi, Yusuke Kobayashi:
An Improved Approximation Algorithm for the Edge-Disjoint Paths Problem with Congestion Two. ACM Trans. Algorithms 13(1): 5:1-5:17 (2016) - [c22]Yusuke Kobayashi, Kenjiro Takazawa:
Randomized Strategies for Cardinality Robustness in the Knapsack Problem. ANALCO 2016: 25-33 - [c21]Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto:
Efficient Stabilization of Cooperative Matching Games. AAMAS 2016: 41-49 - 2015
- [j27]Ken-ichi Kawarabayashi, Yusuke Kobayashi:
The edge-disjoint paths problem in Eulerian graphs and 4-edge-connected graphs. Comb. 35(4): 477-495 (2015) - [j26]Akitoshi Kawamura, Yusuke Kobayashi:
Fence patrolling by mobile agents with distinct speeds. Distributed Comput. 28(2): 147-154 (2015) - [j25]Holger Flier, Matús Mihalák, Peter Widmayer, Anna Zych, Yusuke Kobayashi, Anita Schöbel:
Selecting vertex disjoint paths in plane graphs. Networks 66(2): 136-144 (2015) - [j24]Yusuke Kobayashi:
The complexity of minimizing the difference of two M♮-convex set functions. Oper. Res. Lett. 43(6): 573-574 (2015) - [j23]Attila Bernáth, Yusuke Kobayashi, Tatsuya Matsuoka:
The Generalized Terminal Backup Problem. SIAM J. Discret. Math. 29(3): 1764-1782 (2015) - [c20]Yasushi Kawase, Yusuke Kobayashi, Yutaro Yamaguchi:
Finding a Path in Group-Labeled Graphs with Two Labels Forbidden. ICALP (1) 2015: 797-809 - [i2]Hiroshi Nishiyama, Yusuke Kobayashi, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita:
The Parity Hamiltonian Cycle Problem. CoRR abs/1501.06323 (2015) - 2014
- [j22]Yusuke Kobayashi:
Triangle-free 2-matchings and M-concave functions on jump systems. Discret. Appl. Math. 175: 35-42 (2014) - [c19]Yusuke Kobayashi, Kensuke Otsuki:
Max-flow min-cut theorem and faster algorithms in a circular disk failure model. INFOCOM 2014: 1635-1643 - [c18]Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto:
Minimum-Cost b -Edge Dominating Sets on Trees. ISAAC 2014: 195-207 - [c17]Attila Bernáth, Yusuke Kobayashi:
The Generalized Terminal Backup Problem. SODA 2014: 1678-1686 - [c16]Ken-ichi Kawarabayashi, Yusuke Kobayashi, Stephan Kreutzer:
An excluded half-integral grid theorem for digraphs and the directed disjoint paths problem. STOC 2014: 70-78 - [i1]Akitoshi Kawamura, Yusuke Kobayashi:
Fence patrolling by mobile agents with distinct speeds. CoRR abs/1407.8194 (2014) - 2013
- [j21]Ryo Fujita, Yusuke Kobayashi, Kazuhisa Makino:
Robust Matchings and Matroid Intersections. SIAM J. Discret. Math. 27(3): 1234-1256 (2013) - [j20]Ken-ichi Kawarabayashi, Yusuke Kobayashi:
An O(log n)-Approximation Algorithm for the Edge-Disjoint Paths Problem in Eulerian Planar Graphs. ACM Trans. Algorithms 9(2): 16:1-16:13 (2013) - [c15]Ken-ichi Kawarabayashi, Yusuke Kobayashi:
All-or-Nothing Multicommodity Flow Problem with Bounded Fractionality in Planar Graphs. FOCS 2013: 187-196 - 2012
- [j19]Yusuke Kobayashi, Xin Yin:
An algorithm for finding a maximum t-matching excluding complete partite subgraphs. Discret. Optim. 9(2): 98-108 (2012) - [j18]Ken-ichi Kawarabayashi, Yusuke Kobayashi:
A linear time algorithm for the induced disjoint paths problem in planar graphs. J. Comput. Syst. Sci. 78(2): 670-680 (2012) - [j17]Ken-ichi Kawarabayashi, Yusuke Kobayashi, Bruce A. Reed:
The disjoint paths problem in quadratic time. J. Comb. Theory B 102(2): 424-435 (2012) - [j16]Kristóf Bérczi, Yusuke Kobayashi:
An algorithm for (n-3)-connectivity augmentation problem: Jump system approach. J. Comb. Theory B 102(3): 565-587 (2012) - [j15]Yusuke Kobayashi, Jácint Szabó, Kenjiro Takazawa:
A proof of Cunningham's conjecture on restricted subgraphs and jump systems. J. Comb. Theory B 102(4): 948-966 (2012) - [j14]Ken-ichi Kawarabayashi, Yusuke Kobayashi:
Fixed-parameter tractability for the subset feedback set problem and the S-cycle packing problem. J. Comb. Theory B 102(4): 1020-1034 (2012) - [j13]Yusuke Kobayashi, Kazuo Murota, Robert Weismantel:
Cone superadditivity of discrete convex functions. Math. Program. 135(1-2): 25-44 (2012) - [j12]Shinji Imahori, Yuichiro Miyamoto, Hideki Hashimoto, Yusuke Kobayashi, Mihiro Sasaki, Mutsunori Yagiura:
The complexity of the node capacitated in-tree packing problem. Networks 59(1): 13-21 (2012) - [j11]Yusuke Kobayashi, Yuichi Yoshida:
Algorithms for Finding a Maximum Non-k-Linked Graph. SIAM J. Discret. Math. 26(2): 591-604 (2012) - [j10]Yuichi Yoshida, Yusuke Kobayashi:
Testing the (s, t)-disconnectivity of graphs and digraphs. Theor. Comput. Sci. 434: 98-113 (2012) - [c14]Akitoshi Kawamura, Yusuke Kobayashi:
Fence Patrolling by Mobile Agents with Distinct Speeds. ISAAC 2012: 598-608 - [c13]Ken-ichi Kawarabayashi, Yusuke Kobayashi:
List-coloring graphs without subdivisions and without immersions. SODA 2012: 1425-1435 - [c12]Naonori Kakimura, Ken-ichi Kawarabayashi, Yusuke Kobayashi:
Erdös-Pósa property and its algorithmic applications: parity constraints, subset feedback set, and subset packing. SODA 2012: 1726-1736 - [c11]Ken-ichi Kawarabayashi, Yusuke Kobayashi:
Edge-disjoint Odd Cycles in 4-edge-connected Graphs. STACS 2012: 206-217 - [c10]Ken-ichi Kawarabayashi, Yusuke Kobayashi:
Linear min-max relation between the treewidth of H-minor-free graphs and its largest grid. STACS 2012: 278-289 - 2011
- [j9]Ken-ichi Kawarabayashi, Yusuke Kobayashi:
An Improved Algorithm for the Half-Disjoint Paths Problem. SIAM J. Discret. Math. 25(3): 1322-1330 (2011) - [c9]Yusuke Kobayashi, Yuichi Yoshida:
Algorithms for Finding a Maximum Non-k-linked Graph. ESA 2011: 131-142 - [c8]Ken-ichi Kawarabayashi, Yusuke Kobayashi:
Breaking o(n1/2)-approximation algorithms for the edge-disjoint paths problem with congestion two. STOC 2011: 81-88 - 2010
- [j8]Satoru Iwata, Yusuke Kobayashi:
An Algorithm for Minimum Cost Arc-Connectivity Orientations. Algorithmica 56(4): 437-447 (2010) - [j7]Ken-ichi Kawarabayashi, Yusuke Kobayashi:
Algorithms for finding an induced cycle in planar graphs. Comb. 30(6): 715-734 (2010) - [j6]Yusuke Kobayashi:
A simple algorithm for finding a maximum triangle-free 2-matching in subcubic graphs. Discret. Optim. 7(4): 197-202 (2010) - [j5]Yusuke Kobayashi, Christian Sommer:
On shortest disjoint paths in planar graphs. Discret. Optim. 7(4): 234-245 (2010) - [c7]Ken-ichi Kawarabayashi, Yusuke Kobayashi:
An O(logn)-Approximation Algorithm for the Disjoint Paths Problem in Eulerian Planar Graphs and 4-Edge-Connected Planar Graphs. APPROX-RANDOM 2010: 274-286 - [c6]Ken-ichi Kawarabayashi, Yusuke Kobayashi:
Improved Algorithm for the Half-Disjoint Paths Problem. APPROX-RANDOM 2010: 287-297 - [c5]Ryo Fujita, Yusuke Kobayashi, Kazuhisa Makino:
Robust Matchings and Matroid Intersections. ESA (2) 2010: 123-134 - [c4]Ken-ichi Kawarabayashi, Yusuke Kobayashi:
The Edge Disjoint Paths Problem in Eulerian Graphs and 4-edge-connected Graphs. SODA 2010: 345-353
2000 – 2009
- 2009
- [j4]Yusuke Kobayashi:
Induced disjoint paths problem in a planar digraph. Discret. Appl. Math. 157(15): 3231-3238 (2009) - [j3]Yusuke Kobayashi, Kenjiro Takazawa:
Even factors, jump systems, and discrete convexity. J. Comb. Theory B 99(1): 139-161 (2009) - [c3]Yusuke Kobayashi, Christian Sommer:
On Shortest Disjoint Paths in Planar Graphs. ISAAC 2009: 293-302 - [c2]Yusuke Kobayashi, Ken-ichi Kawarabayashi:
Algorithms for finding an induced cycle in planar graphs and bounded genus graphs. SODA 2009: 1146-1155 - 2008
- [c1]Ken-ichi Kawarabayashi, Yusuke Kobayashi:
The Induced Disjoint Paths Problem. IPCO 2008: 47-61 - 2007
- [j2]Yusuke Kobayashi, Kazuo Murota:
Induction of M-convex functions by linking systems. Discret. Appl. Math. 155(11): 1471-1480 (2007) - [j1]Yusuke Kobayashi, Kazuo Murota, Ken'ichiro Tanaka:
Operations on M-Convex Functions on Jump Systems. SIAM J. Discret. Math. 21(1): 107-129 (2007)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:10 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
