# 小林 佑輔

ORCID ID
https://orcid.org/0000-0001-9478-7307
researchmap URL
https://researchmap.jp/yusuke_kobayashi

Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, and Yoshio Okamoto Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, and Yoshio Okamoto Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, and Yoshio Okamoto Shortest reconfiguration of perfect matchings via alternating cycles Shortest reconfiguration of perfect matchings via alternating cycles Shortest reconfiguration of perfect matchings via alternating cycles Proceedings of the 27th European Symposium on Algorithms (ESA 2019), 61:1-61:15 Proceedings of the 27th European Symposium on Algorithms (ESA 2019), 61:1-61:15 Proceedings of the 27th European Symposium on Algorithms (ESA 2019), 61:1-61:15 2019
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, and Yoshio Okamoto Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, and Yoshio Okamoto Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, and Yoshio Okamoto Minimum-cost b-edge dominating sets on trees Minimum-cost b-edge dominating sets on trees Minimum-cost b-edge dominating sets on trees Algorithmica, 81, 343-366 Algorithmica, 81, 343-366 Algorithmica, 81, 343-366 2019
Yusuke Kobayashi and Ryo Sako Yusuke Kobayashi and Ryo Sako Yusuke Kobayashi and Ryo Sako Two disjoint shortest paths problem with non-negative edge length Two disjoint shortest paths problem with non-negative edge length Two disjoint shortest paths problem with non-negative edge length Operations Research Letters, 47, 66-69 Operations Research Letters, 47, 66-69 Operations Research Letters, 47, 66-69 2019
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, and Yoshio Okamoto Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, and Yoshio Okamoto Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, and Yoshio Okamoto Reconfiguration of maximum-weight b-matchings in a graph Reconfiguration of maximum-weight b-matchings in a graph Reconfiguration of maximum-weight b-matchings in a graph Journal of Combinatorial Optimization, 37, 454-464 Journal of Combinatorial Optimization, 37, 454-464 Journal of Combinatorial Optimization, 37, 454-464 2019
Takehiro Ito, Naoyuki Kamiyama, Yusuke Kobayashi, and Yoshio Okamoto Takehiro Ito, Naoyuki Kamiyama, Yusuke Kobayashi, and Yoshio Okamoto Takehiro Ito, Naoyuki Kamiyama, Yusuke Kobayashi, and Yoshio Okamoto Algorithms for gerrymandering over graphs Algorithms for gerrymandering over graphs Algorithms for gerrymandering over graphs Proceedings of the 18th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2019), 1413-1421 Proceedings of the 18th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2019), 1413-1421 Proceedings of the 18th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2019), 1413-1421 2019
Marthe Bonamy, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Moritz Mühlenthaler, Akira Suzuki, and Kunihiro Wasa Marthe Bonamy, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Moritz Mühlenthaler, Akira Suzuki, and Kunihiro Wasa Marthe Bonamy, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Moritz Mühlenthaler, Akira Suzuki, and Kunihiro Wasa Diameter of colorings under Kempe changes Diameter of colorings under Kempe changes Diameter of colorings under Kempe changes Proceedings of the 25th Annual International Computing and Combinatorics Conference (COCOON 2019), 52-64 Proceedings of the 25th Annual International Computing and Combinatorics Conference (COCOON 2019), 52-64 Proceedings of the 25th Annual International Computing and Combinatorics Conference (COCOON 2019), 52-64 2019
Yasuaki Kobayashi, Yusuke Kobayashi, Shuichi Miyazaki, and Suguru Tamaki Yasuaki Kobayashi, Yusuke Kobayashi, Shuichi Miyazaki, and Suguru Tamaki Yasuaki Kobayashi, Yusuke Kobayashi, Shuichi Miyazaki, and Suguru Tamaki An improved fixed-parameter algorithm for max-cut parameterized by crossing number An improved fixed-parameter algorithm for max-cut parameterized by crossing number An improved fixed-parameter algorithm for max-cut parameterized by crossing number Proceedings of the 30th International Workshop on Combinatorial Algorithms (IWOCA 2019), 327-338 Proceedings of the 30th International Workshop on Combinatorial Algorithms (IWOCA 2019), 327-338 Proceedings of the 30th International Workshop on Combinatorial Algorithms (IWOCA 2019), 327-338 2019
Marthe Bonamy, Nicolas Bousquet, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Arnaud Mary, Moritz Mühlenthaler, and Kunihiro Wasa Marthe Bonamy, Nicolas Bousquet, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Arnaud Mary, Moritz Mühlenthaler, and Kunihiro Wasa Marthe Bonamy, Nicolas Bousquet, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Arnaud Mary, Moritz Mühlenthaler, and Kunihiro Wasa The perfect matching reconfiguration problem The perfect matching reconfiguration problem The perfect matching reconfiguration problem Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019), 80:1-80:14 Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019), 80:1-80:14 Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019), 80:1-80:14 2019
Than Nguyen Hau, Naonori Kakimura, Ken-ichi Kawarabayashi, Yusuke Kobayashi, Tatsuya Matsuoka, Yu Yokoi Than Nguyen Hau, Naonori Kakimura, Ken-ichi Kawarabayashi, Yusuke Kobayashi, Tatsuya Matsuoka, Yu Yokoi Than Nguyen Hau, Naonori Kakimura, Ken-ichi Kawarabayashi, Yusuke Kobayashi, Tatsuya Matsuoka, Yu Yokoi Optimal cache placement for an academic backbone network Optimal cache placement for an academic backbone network Optimal cache placement for an academic backbone network Journal of the Operations Research Society of Japan, 61, 197-216 Journal of the Operations Research Society of Japan, 61, 197-216 Journal of the Operations Research Society of Japan, 61, 197-216 2018
Hiroshi Nishiyama, Yusuke Kobayashi, Yukiko Yamauchi, Shuji Kijima, and Masafumi Yamashita Hiroshi Nishiyama, Yusuke Kobayashi, Yukiko Yamauchi, Shuji Kijima, and Masafumi Yamashita Hiroshi Nishiyama, Yusuke Kobayashi, Yukiko Yamauchi, Shuji Kijima, and Masafumi Yamashita The parity Hamiltonian cycle problem The parity Hamiltonian cycle problem The parity Hamiltonian cycle problem Discrete Mathematics, 341, 606-626 Discrete Mathematics, 341, 606-626 Discrete Mathematics, 341, 606-626 2018
Ken-ichi Kawarabayashi and Yusuke Kobayashi Ken-ichi Kawarabayashi and Yusuke Kobayashi Ken-ichi Kawarabayashi and Yusuke Kobayashi All-or-nothing multicommodity flow problem with bounded fractionality in planar graphs All-or-nothing multicommodity flow problem with bounded fractionality in planar graphs All-or-nothing multicommodity flow problem with bounded fractionality in planar graphs SIAM Journal on Computing, 47, 1483-1504 SIAM Journal on Computing, 47, 1483-1504 SIAM Journal on Computing, 47, 1483-1504 2018
Koki Takayama,Yusuke Kobayashi Koki Takayama,Yusuke Kobayashi Koki Takayama,Yusuke Kobayashi A Strongly Polynomial Time Algorithm for the Maximum Supply Rate Problem on Trees. A Strongly Polynomial Time Algorithm for the Maximum Supply Rate Problem on Trees. A Strongly Polynomial Time Algorithm for the Maximum Supply Rate Problem on Trees. Proceedings of the 12th International Frontiers of Algorithmics Workshop (FAW 2018), 54-67 Proceedings of the 12th International Frontiers of Algorithmics Workshop (FAW 2018), 54-67 Proceedings of the 12th International Frontiers of Algorithmics Workshop (FAW 2018), 54-67 2018
Yusuke Kobayashi Yusuke Kobayashi Yusuke Kobayashi NP-hardness and fixed-parameter tractability of the minimum spanner problem NP-hardness and fixed-parameter tractability of the minimum spanner problem NP-hardness and fixed-parameter tractability of the minimum spanner problem Theoretical Computer Science, 746, 88-97 Theoretical Computer Science, 746, 88-97 Theoretical Computer Science, 746, 88-97 2018
Yusuke Kobayashi and Kenjiro Takazawa Yusuke Kobayashi and Kenjiro Takazawa Yusuke Kobayashi and Kenjiro Takazawa Randomized strategies for cardinality robustness in the knapsack problem Randomized strategies for cardinality robustness in the knapsack problem Randomized strategies for cardinality robustness in the knapsack problem Theoretical Computer Science, 699, 53-62 Theoretical Computer Science, 699, 53-62 Theoretical Computer Science, 699, 53-62 2017
Kristóf Bérczi and Yusuke Kobayashi Kristóf Bérczi and Yusuke Kobayashi Kristóf Bérczi and Yusuke Kobayashi An algorithm for identifying cycle-plus-triangles graphs An algorithm for identifying cycle-plus-triangles graphs An algorithm for identifying cycle-plus-triangles graphs Discrete Applied Mathematics, 226, 10-16 Discrete Applied Mathematics, 226, 10-16 Discrete Applied Mathematics, 226, 10-16 2017
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, and Yoshio Okamoto Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, and Yoshio Okamoto Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, and Yoshio Okamoto Efficient stabilization of cooperative matching games Efficient stabilization of cooperative matching games Efficient stabilization of cooperative matching games Theoretical Computer Science, 677, 69-82 Theoretical Computer Science, 677, 69-82 Theoretical Computer Science, 677, 69-82 2017
Naonori Kakimura, Ken-ichi Kawarabayashi, and Yusuke Kobayashi Naonori Kakimura, Ken-ichi Kawarabayashi, and Yusuke Kobayashi Naonori Kakimura, Ken-ichi Kawarabayashi, and Yusuke Kobayashi Packing edge-disjoint odd Eulerian subgraphs through prescribed vertices in 4-edge-connected graphs Packing edge-disjoint odd Eulerian subgraphs through prescribed vertices in 4-edge-connected graphs Packing edge-disjoint odd Eulerian subgraphs through prescribed vertices in 4-edge-connected graphs SIAM Journal on Discrete Mathematics, 31, 766-782 SIAM Journal on Discrete Mathematics, 31, 766-782 SIAM Journal on Discrete Mathematics, 31, 766-782 2017
Yusuke Kobayashi and Sho Toyooka Yusuke Kobayashi and Sho Toyooka Yusuke Kobayashi and Sho Toyooka Finding a shortest non-zero path in group-labeled graphs via permanent computation Finding a shortest non-zero path in group-labeled graphs via permanent computation Finding a shortest non-zero path in group-labeled graphs via permanent computation Algorithmica, 77, 1128-1142 Algorithmica, 77, 1128-1142 Algorithmica, 77, 1128-1142 2017
Takehiro Ito, Naonori Kakimura, and Yusuke Kobayashi Takehiro Ito, Naonori Kakimura, and Yusuke Kobayashi Takehiro Ito, Naonori Kakimura, and Yusuke Kobayashi Complexity of the multi-service center problem Complexity of the multi-service center problem Complexity of the multi-service center problem Proceedings of the 28th International Symposium on Algorithms and Computation (ISAAC 2017), 48:1-48:12 Proceedings of the 28th International Symposium on Algorithms and Computation (ISAAC 2017), 48:1-48:12 Proceedings of the 28th International Symposium on Algorithms and Computation (ISAAC 2017), 48:1-48:12 2017
Kristóf Bérczi and Yusuke Kobayashi Kristóf Bérczi and Yusuke Kobayashi Kristóf Bérczi and Yusuke Kobayashi The directed disjoint shortest paths problem The directed disjoint shortest paths problem The directed disjoint shortest paths problem Proceedings of the 25th European Symposium on Algorithms (ESA 2017), 13:1-13:13 Proceedings of the 25th European Symposium on Algorithms (ESA 2017), 13:1-13:13 Proceedings of the 25th European Symposium on Algorithms (ESA 2017), 13:1-13:13 2017
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto, and Taichi Shiitada Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto, and Taichi Shiitada Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto, and Taichi Shiitada Tight approximability of the server allocation problem for real-time applications Tight approximability of the server allocation problem for real-time applications Tight approximability of the server allocation problem for real-time applications Proceedings of the 3rd International Workshop on Algorithmic Aspects of Cloud Computing (Algocloud 2017), 41-55 Proceedings of the 3rd International Workshop on Algorithmic Aspects of Cloud Computing (Algocloud 2017), 41-55 Proceedings of the 3rd International Workshop on Algorithmic Aspects of Cloud Computing (Algocloud 2017), 41-55 2017
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, and Yoshio Okamoto Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, and Yoshio Okamoto Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, and Yoshio Okamoto Reconfiguration of maximum-weight b-matchings in a graph Reconfiguration of maximum-weight b-matchings in a graph Reconfiguration of maximum-weight b-matchings in a graph Proceedings of the 23rd Annual International Computing and Combinatorics Conference (COCOON 2017), 287-296 Proceedings of the 23rd Annual International Computing and Combinatorics Conference (COCOON 2017), 287-296 Proceedings of the 23rd Annual International Computing and Combinatorics Conference (COCOON 2017), 287-296 2017
Satoru Iwata and Yusuke Kobayashi Satoru Iwata and Yusuke Kobayashi Satoru Iwata and Yusuke Kobayashi A weighted linear matroid parity algorithm A weighted linear matroid parity algorithm A weighted linear matroid parity algorithm Proceedings of the 49th ACM Symposium on Theory of Computing (STOC 2017), 264-276 Proceedings of the 49th ACM Symposium on Theory of Computing (STOC 2017), 264-276 Proceedings of the 49th ACM Symposium on Theory of Computing (STOC 2017), 264-276 2017
Ken-ichi Kawarabayashi and Yusuke Kobayashi Ken-ichi Kawarabayashi and Yusuke Kobayashi Ken-ichi Kawarabayashi and Yusuke Kobayashi Edge-disjoint odd cycles in 4-edge-connected graphs Edge-disjoint odd cycles in 4-edge-connected graphs Edge-disjoint odd cycles in 4-edge-connected graphs Journal of Combinatorial Theory, Series B, 119, 12-27 Journal of Combinatorial Theory, Series B, 119, 12-27 Journal of Combinatorial Theory, Series B, 119, 12-27 2016
Kensuke Otsuki, Yusuke Kobayashi, and Kazuo Murota Kensuke Otsuki, Yusuke Kobayashi, and Kazuo Murota Kensuke Otsuki, Yusuke Kobayashi, and Kazuo Murota Improved max-flow min-cut algorithms in a circular disk failure model with application to a road network Improved max-flow min-cut algorithms in a circular disk failure model with application to a road network Improved max-flow min-cut algorithms in a circular disk failure model with application to a road network European Journal of Operational Research, 248, 396-403 European Journal of Operational Research, 248, 396-403 European Journal of Operational Research, 248, 396-403 2016
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, and Yoshio Okamoto Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, and Yoshio Okamoto Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, and Yoshio Okamoto Efficient stabilization of cooperative matching games Efficient stabilization of cooperative matching games Efficient stabilization of cooperative matching games Proceedings of the 15th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2016), 41-49 Proceedings of the 15th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2016), 41-49 Proceedings of the 15th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2016), 41-49 2016
Yusuke Kobayashi and Kenjiro Takazawa Yusuke Kobayashi and Kenjiro Takazawa Yusuke Kobayashi and Kenjiro Takazawa Randomized strategies for cardinality robustness in the knapsack problem Randomized strategies for cardinality robustness in the knapsack problem Randomized strategies for cardinality robustness in the knapsack problem Proceedings of the 13th Meeting on Analytic Algorithmics and Combinatorics (ANALCO 2016), 25-33 Proceedings of the 13th Meeting on Analytic Algorithmics and Combinatorics (ANALCO 2016), 25-33 Proceedings of the 13th Meeting on Analytic Algorithmics and Combinatorics (ANALCO 2016), 25-33 2016
Ken-ichi Kawarabayashi and Yusuke Kobayashi Ken-ichi Kawarabayashi and Yusuke Kobayashi Ken-ichi Kawarabayashi and Yusuke Kobayashi An improved approximation algorithm for the edge-disjoint paths problem with congestion two An improved approximation algorithm for the edge-disjoint paths problem with congestion two An improved approximation algorithm for the edge-disjoint paths problem with congestion two ACM Transactions on Algorithms, 13, no. 5 ACM Transactions on Algorithms, 13, no. 5 ACM Transactions on Algorithms, 13, no. 5 2016
Kristóf Bérczi, Tamás Király, and Yusuke Kobayashi Kristóf Bérczi, Tamás Király, and Yusuke Kobayashi Kristóf Bérczi, Tamás Király, and Yusuke Kobayashi Covering intersecting bi-set families under matroid constraints Covering intersecting bi-set families under matroid constraints Covering intersecting bi-set families under matroid constraints SIAM Journal on Discrete Mathematics, 30, 1758-1774 SIAM Journal on Discrete Mathematics, 30, 1758-1774 SIAM Journal on Discrete Mathematics, 30, 1758-1774 2016
Attila Bernáth, Yusuke Kobayashi, and Tatsuya Matsuoka Attila Bernáth, Yusuke Kobayashi, and Tatsuya Matsuoka Attila Bernáth, Yusuke Kobayashi, and Tatsuya Matsuoka The generalized terminal backup problem The generalized terminal backup problem The generalized terminal backup problem SIAM Journal on Discrete Mathematics, 29, 1764-1782 SIAM Journal on Discrete Mathematics, 29, 1764-1782 SIAM Journal on Discrete Mathematics, 29, 1764-1782 2015
Kota Ishihara and Yusuke Kobayashi Kota Ishihara and Yusuke Kobayashi Kota Ishihara and Yusuke Kobayashi Routing algorithms under mutual interference constraints Routing algorithms under mutual interference constraints Routing algorithms under mutual interference constraints Journal of the Operations Research Society of Japan, 58, 209-222 Journal of the Operations Research Society of Japan, 58, 209-222 Journal of the Operations Research Society of Japan, 58, 209-222 2015
Yusuke Kobayashi Yusuke Kobayashi Yusuke Kobayashi The complexity of minimizing the difference of two M ${}^\natural$ -convex set functions The complexity of minimizing the difference of two M ${}^\natural$ -convex set functions The complexity of minimizing the difference of two M ${}^\natural$ -convex set functions Operations Research Letters, 43, 573-574 Operations Research Letters, 43, 573-574 Operations Research Letters, 43, 573-574 2015
Ken-ichi Kawarabayashi and Yusuke Kobayashi Ken-ichi Kawarabayashi and Yusuke Kobayashi Ken-ichi Kawarabayashi and Yusuke Kobayashi The edge-disjoint paths problem in Eulerian graphs and 4-edge-connected graphs The edge-disjoint paths problem in Eulerian graphs and 4-edge-connected graphs The edge-disjoint paths problem in Eulerian graphs and 4-edge-connected graphs Combinatorica, 35, 477-495 Combinatorica, 35, 477-495 Combinatorica, 35, 477-495 2015
Holger Flier, Yusuke Kobayashi, Matúš Mihalák, Anita Schöbel, Peter Widmayer, and Anna Zych Holger Flier, Yusuke Kobayashi, Matúš Mihalák, Anita Schöbel, Peter Widmayer, and Anna Zych Holger Flier, Yusuke Kobayashi, Matúš Mihalák, Anita Schöbel, Peter Widmayer, and Anna Zych Selecting vertex disjoint paths in plane graphs Selecting vertex disjoint paths in plane graphs Selecting vertex disjoint paths in plane graphs Networks, 66, 136-144 Networks, 66, 136-144 Networks, 66, 136-144 2015
Akitoshi Kawamura and Yusuke Kobayashi Akitoshi Kawamura and Yusuke Kobayashi Akitoshi Kawamura and Yusuke Kobayashi Fence patrolling by mobile agents with distinct speeds Fence patrolling by mobile agents with distinct speeds Fence patrolling by mobile agents with distinct speeds Distributed Computing, 28, 147-154 Distributed Computing, 28, 147-154 Distributed Computing, 28, 147-154 2015
Yasushi Kawase, Yusuke Kobayashi, and Yutaro Yamaguchi Yasushi Kawase, Yusuke Kobayashi, and Yutaro Yamaguchi Yasushi Kawase, Yusuke Kobayashi, and Yutaro Yamaguchi Finding a path in group-labeled graphs with two labels forbidden Finding a path in group-labeled graphs with two labels forbidden Finding a path in group-labeled graphs with two labels forbidden Proceedings of the 42nd International Colloquium on Automata, Languages, and Programming (ICALP 2015), 797-809 Proceedings of the 42nd International Colloquium on Automata, Languages, and Programming (ICALP 2015), 797-809 Proceedings of the 42nd International Colloquium on Automata, Languages, and Programming (ICALP 2015), 797-809 2015
Yusuke Kobayashi Yusuke Kobayashi Yusuke Kobayashi Triangle-free 2-matchings and M-concave functions on jump systems Triangle-free 2-matchings and M-concave functions on jump systems Triangle-free 2-matchings and M-concave functions on jump systems Discrete Applied Mathematics, 175, 35-42 Discrete Applied Mathematics, 175, 35-42 Discrete Applied Mathematics, 175, 35-42 2014
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, and Yoshio Okamoto Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, and Yoshio Okamoto Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, and Yoshio Okamoto Minimum-cost b-edge dominating sets on trees Minimum-cost b-edge dominating sets on trees Minimum-cost b-edge dominating sets on trees Proceedings of the 25th International Symposium on Algorithms and Computation (ISAAC 2014), 195-207 Proceedings of the 25th International Symposium on Algorithms and Computation (ISAAC 2014), 195-207 Proceedings of the 25th International Symposium on Algorithms and Computation (ISAAC 2014), 195-207 2014
Ken-ichi Kawarabayashi, Yusuke Kobayashi, and Stephan Kreutzer Ken-ichi Kawarabayashi, Yusuke Kobayashi, and Stephan Kreutzer Ken-ichi Kawarabayashi, Yusuke Kobayashi, and Stephan Kreutzer An excluded half-integral grid theorem for digraphs and the directed disjoint paths problem An excluded half-integral grid theorem for digraphs and the directed disjoint paths problem An excluded half-integral grid theorem for digraphs and the directed disjoint paths problem Proceedings of the 46th ACM Symposium on Theory of Computing (STOC 2014), 70-78 Proceedings of the 46th ACM Symposium on Theory of Computing (STOC 2014), 70-78 Proceedings of the 46th ACM Symposium on Theory of Computing (STOC 2014), 70-78 2014
Yusuke Kobayashi and Kensuke Otsuki Yusuke Kobayashi and Kensuke Otsuki Yusuke Kobayashi and Kensuke Otsuki Max-flow min-cut theorem and faster algorithms in a circular disk failure model Max-flow min-cut theorem and faster algorithms in a circular disk failure model Max-flow min-cut theorem and faster algorithms in a circular disk failure model Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM 2014), 1635-1643 Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM 2014), 1635-1643 Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM 2014), 1635-1643 2014
Attila Bernáth and Yusuke Kobayashi Attila Bernáth and Yusuke Kobayashi Attila Bernáth and Yusuke Kobayashi The generalized terminal backup problem The generalized terminal backup problem The generalized terminal backup problem Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2014), 1678-1686 Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2014), 1678-1686 Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2014), 1678-1686 2014
Ryo Fujita, Yusuke Kobayashi, and Kazuhisa Makino Ryo Fujita, Yusuke Kobayashi, and Kazuhisa Makino Ryo Fujita, Yusuke Kobayashi, and Kazuhisa Makino Robust matchings and matroid intersections Robust matchings and matroid intersections Robust matchings and matroid intersections SIAM Journal on Discrete Mathematics, 27, 1234-1256 SIAM Journal on Discrete Mathematics, 27, 1234-1256 SIAM Journal on Discrete Mathematics, 27, 1234-1256 2013
Ken-ichi Kawarabayashi and Yusuke Kobayashi Ken-ichi Kawarabayashi and Yusuke Kobayashi Ken-ichi Kawarabayashi and Yusuke Kobayashi An O(log n)-approximation algorithm for the edge-disjoint paths problem in Eulerian planar graphs An O(log n)-approximation algorithm for the edge-disjoint paths problem in Eulerian planar graphs An O(log n)-approximation algorithm for the edge-disjoint paths problem in Eulerian planar graphs ACM Transactions on Algorithms, 9, no. 16 ACM Transactions on Algorithms, 9, no. 16 ACM Transactions on Algorithms, 9, no. 16 2013
Ken-ichi Kawarabayashi and Yusuke Kobayashi Ken-ichi Kawarabayashi and Yusuke Kobayashi Ken-ichi Kawarabayashi and Yusuke Kobayashi All-or-nothing multicommodity flow problem with bounded fractionality in planar graphs All-or-nothing multicommodity flow problem with bounded fractionality in planar graphs All-or-nothing multicommodity flow problem with bounded fractionality in planar graphs Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2013), 187-196 Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2013), 187-196 Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2013), 187-196 2013
Ken-ichi Kawarabayashi and Yusuke Kobayashi Ken-ichi Kawarabayashi and Yusuke Kobayashi Ken-ichi Kawarabayashi and Yusuke Kobayashi An immersion of a square in $4$ -edge-connected graphs An immersion of a square in $4$ -edge-connected graphs An immersion of a square in $4$ -edge-connected graphs Progress in Informatics, 9, 35-36 Progress in Informatics, 9, 35-36 Progress in Informatics, 9, 35-36 2012
Ken-ichi Kawarabayashi and Yusuke Kobayashi Ken-ichi Kawarabayashi and Yusuke Kobayashi Ken-ichi Kawarabayashi and Yusuke Kobayashi A linear time algorithm for the induced disjoint paths problem in planar graphs A linear time algorithm for the induced disjoint paths problem in planar graphs A linear time algorithm for the induced disjoint paths problem in planar graphs Journal of Computer and System Sciences, 78, 670-680 Journal of Computer and System Sciences, 78, 670-680 Journal of Computer and System Sciences, 78, 670-680 2012
Kristóf Bérczi and Yusuke Kobayashi Kristóf Bérczi and Yusuke Kobayashi Kristóf Bérczi and Yusuke Kobayashi An algorithm for (n-3)-connectivity augmentation problem: jump system approach An algorithm for (n-3)-connectivity augmentation problem: jump system approach An algorithm for (n-3)-connectivity augmentation problem: jump system approach Journal of Combinatorial Theory, Series B, 102, 565-587 Journal of Combinatorial Theory, Series B, 102, 565-587 Journal of Combinatorial Theory, Series B, 102, 565-587 2012
Yusuke Kobayashi, Kazuo Murota, and Robert Weismantel Yusuke Kobayashi, Kazuo Murota, and Robert Weismantel Yusuke Kobayashi, Kazuo Murota, and Robert Weismantel Cone superadditivity of discrete convex functions Cone superadditivity of discrete convex functions Cone superadditivity of discrete convex functions Mathematical Programming, Series A, 135, 25-44 Mathematical Programming, Series A, 135, 25-44 Mathematical Programming, Series A, 135, 25-44 2012
Akitoshi Kawamura and Yusuke Kobayashi Akitoshi Kawamura and Yusuke Kobayashi Akitoshi Kawamura and Yusuke Kobayashi Fence patrolling by mobile agents with distinct speeds Fence patrolling by mobile agents with distinct speeds Fence patrolling by mobile agents with distinct speeds Proceedings of the 23rd International Symposium on Algorithms and Computation (ISAAC 2012), 598-608 Proceedings of the 23rd International Symposium on Algorithms and Computation (ISAAC 2012), 598-608 Proceedings of the 23rd International Symposium on Algorithms and Computation (ISAAC 2012), 598-608 2012
Ken-ichi Kawarabayashi, Yusuke Kobayashi, and Bruce Reed Ken-ichi Kawarabayashi, Yusuke Kobayashi, and Bruce Reed Ken-ichi Kawarabayashi, Yusuke Kobayashi, and Bruce Reed The disjoint paths problem in quadratic time The disjoint paths problem in quadratic time The disjoint paths problem in quadratic time Journal of Combinatorial Theory, Series B, 102, 424-435 Journal of Combinatorial Theory, Series B, 102, 424-435 Journal of Combinatorial Theory, Series B, 102, 424-435 2012
Ken-ichi Kawarabayashi and Yusuke Kobayashi Ken-ichi Kawarabayashi and Yusuke Kobayashi Ken-ichi Kawarabayashi and Yusuke Kobayashi Linear min-max relation between the treewidth of H-minor-free graphs and its largest grid minor Linear min-max relation between the treewidth of H-minor-free graphs and its largest grid minor Linear min-max relation between the treewidth of H-minor-free graphs and its largest grid minor Proceedings of the 29th Symposium on Theoretical Aspects of Computer Science (STACS 2012), 278-289 Proceedings of the 29th Symposium on Theoretical Aspects of Computer Science (STACS 2012), 278-289 Proceedings of the 29th Symposium on Theoretical Aspects of Computer Science (STACS 2012), 278-289 2012
Ken-ichi Kawarabayashi and Yusuke Kobayashi Ken-ichi Kawarabayashi and Yusuke Kobayashi Ken-ichi Kawarabayashi and Yusuke Kobayashi Fixed-parameter tractability for the subset feedback set problem and the S-cycle packing problem Fixed-parameter tractability for the subset feedback set problem and the S-cycle packing problem Fixed-parameter tractability for the subset feedback set problem and the S-cycle packing problem Journal of Combinatorial Theory, Series B, 102, 1020-1034 Journal of Combinatorial Theory, Series B, 102, 1020-1034 Journal of Combinatorial Theory, Series B, 102, 1020-1034 2012
Ken-ichi Kawarabayashi and Yusuke Kobayashi Ken-ichi Kawarabayashi and Yusuke Kobayashi Ken-ichi Kawarabayashi and Yusuke Kobayashi Edge-disjoint odd cycles in 4-edge-connected graphs Edge-disjoint odd cycles in 4-edge-connected graphs Edge-disjoint odd cycles in 4-edge-connected graphs Proceedings of the 29th Symposium on Theoretical Aspects of Computer Science (STACS 2012), 206-217 Proceedings of the 29th Symposium on Theoretical Aspects of Computer Science (STACS 2012), 206-217 Proceedings of the 29th Symposium on Theoretical Aspects of Computer Science (STACS 2012), 206-217 2012
Ken-ichi Kawarabayashi and Yusuke Kobayashi Ken-ichi Kawarabayashi and Yusuke Kobayashi Ken-ichi Kawarabayashi and Yusuke Kobayashi List-coloring graphs without subdivisions and without immersions List-coloring graphs without subdivisions and without immersions List-coloring graphs without subdivisions and without immersions Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2012), 1425-1435 Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2012), 1425-1435 Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2012), 1425-1435 2012
Yusuke Kobayashi, Jácint Szabó, and Kenjiro Takazawa Yusuke Kobayashi, Jácint Szabó, and Kenjiro Takazawa Yusuke Kobayashi, Jácint Szabó, and Kenjiro Takazawa A proof of Cunningham's conjecture on restricted subgraphs and jump systems A proof of Cunningham's conjecture on restricted subgraphs and jump systems A proof of Cunningham's conjecture on restricted subgraphs and jump systems Journal of Combinatorial Theory, Series B, 102, 948-966 Journal of Combinatorial Theory, Series B, 102, 948-966 Journal of Combinatorial Theory, Series B, 102, 948-966 2012
Shinji Imahori, Yuichiro Miyamoto, Hideki Hashimoto, Yusuke Kobayashi, Mihiro Sasaki, and Mutsunori Yagiura Shinji Imahori, Yuichiro Miyamoto, Hideki Hashimoto, Yusuke Kobayashi, Mihiro Sasaki, and Mutsunori Yagiura Shinji Imahori, Yuichiro Miyamoto, Hideki Hashimoto, Yusuke Kobayashi, Mihiro Sasaki, and Mutsunori Yagiura The complexity of the node capacitated in-tree packing problem The complexity of the node capacitated in-tree packing problem The complexity of the node capacitated in-tree packing problem Networks, 59, 13-21 Networks, 59, 13-21 Networks, 59, 13-21 2012
Yusuke Kobayashi and Yuichi Yoshida Yusuke Kobayashi and Yuichi Yoshida Yusuke Kobayashi and Yuichi Yoshida Algorithms for finding a maximum non-k-linked graph Algorithms for finding a maximum non-k-linked graph Algorithms for finding a maximum non-k-linked graph SIAM Journal on Discrete Mathematics, 26, 591-604 SIAM Journal on Discrete Mathematics, 26, 591-604 SIAM Journal on Discrete Mathematics, 26, 591-604 2012
Yusuke Kobayashi and Xin Yin Yusuke Kobayashi and Xin Yin Yusuke Kobayashi and Xin Yin An algorithm for finding a maximum t-matching excluding complete partite subgraphs An algorithm for finding a maximum t-matching excluding complete partite subgraphs An algorithm for finding a maximum t-matching excluding complete partite subgraphs Discrete Optimization, 9, 98-108 Discrete Optimization, 9, 98-108 Discrete Optimization, 9, 98-108 2012
Yuichi Yoshida and Yusuke Kobayashi Yuichi Yoshida and Yusuke Kobayashi Yuichi Yoshida and Yusuke Kobayashi Testing the (s,t)-disconnectivity of graphs and digraphs Testing the (s,t)-disconnectivity of graphs and digraphs Testing the (s,t)-disconnectivity of graphs and digraphs Theoretical Computer Science, 434, 98-113 Theoretical Computer Science, 434, 98-113 Theoretical Computer Science, 434, 98-113 2012
Naonori Kakimura, Ken-ichi Kawarabayashi, and Yusuke Kobayashi Naonori Kakimura, Ken-ichi Kawarabayashi, and Yusuke Kobayashi Naonori Kakimura, Ken-ichi Kawarabayashi, and Yusuke Kobayashi Erd\H{o}s-P\'osa property and its algorithmic applications --- parity constraints, subset feedback set, and subset packing Erd\H{o}s-P\'osa property and its algorithmic applications --- parity constraints, subset feedback set, and subset packing Erd\H{o}s-P\'osa property and its algorithmic applications --- parity constraints, subset feedback set, and subset packing Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2012), 1726-1736 Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2012), 1726-1736 Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2012), 1726-1736 2012
Ken-ichi Kawarabayashi and Yusuke Kobayashi Ken-ichi Kawarabayashi and Yusuke Kobayashi Ken-ichi Kawarabayashi and Yusuke Kobayashi An improved algorithm for the half-disjoint paths problem An improved algorithm for the half-disjoint paths problem An improved algorithm for the half-disjoint paths problem SIAM Journal on Discrete Mathematics, 25, 1322-1330 SIAM Journal on Discrete Mathematics, 25, 1322-1330 SIAM Journal on Discrete Mathematics, 25, 1322-1330 2011
Yusuke Kobayashi and Yuichi Yoshida Yusuke Kobayashi and Yuichi Yoshida Yusuke Kobayashi and Yuichi Yoshida Algorithms for finding a maximum non-k-linked graph Algorithms for finding a maximum non-k-linked graph Algorithms for finding a maximum non-k-linked graph Proceedings of the 19th European Symposium on Algorithms (ESA 2011), 131-142 Proceedings of the 19th European Symposium on Algorithms (ESA 2011), 131-142 Proceedings of the 19th European Symposium on Algorithms (ESA 2011), 131-142 2011
Ken-ichi Kawarabayashi and Yusuke Kobayashi Ken-ichi Kawarabayashi and Yusuke Kobayashi Ken-ichi Kawarabayashi and Yusuke Kobayashi Breaking O(n^{1/2})-approximation algorithms for the edge-disjoint paths problem with congestion two Breaking O(n^{1/2})-approximation algorithms for the edge-disjoint paths problem with congestion two Breaking O(n^{1/2})-approximation algorithms for the edge-disjoint paths problem with congestion two Proceedings of the 43rd ACM Symposium on Theory of Computing (STOC 2011), 81-88 Proceedings of the 43rd ACM Symposium on Theory of Computing (STOC 2011), 81-88 Proceedings of the 43rd ACM Symposium on Theory of Computing (STOC 2011), 81-88 2011
Satoru Iwata and Yusuke Kobayashi Satoru Iwata and Yusuke Kobayashi Satoru Iwata and Yusuke Kobayashi An algorithm for minimum cost arc-connectivity orientations An algorithm for minimum cost arc-connectivity orientations An algorithm for minimum cost arc-connectivity orientations Algorithmica, 56, 437-447 Algorithmica, 56, 437-447 Algorithmica, 56, 437-447 2010
Ryo Fujita, Yusuke Kobayashi, and Kazuhisa Makino Ryo Fujita, Yusuke Kobayashi, and Kazuhisa Makino Ryo Fujita, Yusuke Kobayashi, and Kazuhisa Makino Robust matchings and matroid intersections Robust matchings and matroid intersections Robust matchings and matroid intersections Proceedings of the 18th Annual European Symposium on Algorithms (ESA 2010), 123-134 Proceedings of the 18th Annual European Symposium on Algorithms (ESA 2010), 123-134 Proceedings of the 18th Annual European Symposium on Algorithms (ESA 2010), 123-134 2010
Ken-ichi Kawarabayashi and Yusuke Kobayashi Ken-ichi Kawarabayashi and Yusuke Kobayashi Ken-ichi Kawarabayashi and Yusuke Kobayashi Improved algorithm for the half-disjoint paths problem Improved algorithm for the half-disjoint paths problem Improved algorithm for the half-disjoint paths problem Proceedings of the 13th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2010), 287-297 Proceedings of the 13th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2010), 287-297 Proceedings of the 13th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2010), 287-297 2010
Ken-ichi Kawarabayashi and Yusuke Kobayashi Ken-ichi Kawarabayashi and Yusuke Kobayashi Ken-ichi Kawarabayashi and Yusuke Kobayashi An O(log n)-approximation algorithm for the disjoint paths problem in Eulerian planar graphs and 4-edge-connected planar graphs An O(log n)-approximation algorithm for the disjoint paths problem in Eulerian planar graphs and 4-edge-connected planar graphs An O(log n)-approximation algorithm for the disjoint paths problem in Eulerian planar graphs and 4-edge-connected planar graphs Proceedings of the 13th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2010), 274-286 Proceedings of the 13th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2010), 274-286 Proceedings of the 13th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2010), 274-286 2010
Ken-ichi Kawarabayashi and Yusuke Kobayashi Ken-ichi Kawarabayashi and Yusuke Kobayashi Ken-ichi Kawarabayashi and Yusuke Kobayashi The edge disjoint paths problem in Eulerian graphs and 4-edge-connected graphs The edge disjoint paths problem in Eulerian graphs and 4-edge-connected graphs The edge disjoint paths problem in Eulerian graphs and 4-edge-connected graphs Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 345-353 Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 345-353 Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 345-353 2010
Ken-ichi Kawarabayashi and Yusuke Kobayashi Ken-ichi Kawarabayashi and Yusuke Kobayashi Ken-ichi Kawarabayashi and Yusuke Kobayashi Algorithms for finding an induced cycle in planar graphs Algorithms for finding an induced cycle in planar graphs Algorithms for finding an induced cycle in planar graphs Combinatorica, 30, 715-734 Combinatorica, 30, 715-734 Combinatorica, 30, 715-734 2010
Yusuke Kobayashi and Christian Sommer Yusuke Kobayashi and Christian Sommer Yusuke Kobayashi and Christian Sommer On shortest disjoint paths in planar graphs On shortest disjoint paths in planar graphs On shortest disjoint paths in planar graphs Discrete Optimization, 7, 234-245 Discrete Optimization, 7, 234-245 Discrete Optimization, 7, 234-245 2010
Yusuke Kobayashi Yusuke Kobayashi Yusuke Kobayashi A simple algorithm for finding a maximum triangle-free 2-matching in subcubic graphs A simple algorithm for finding a maximum triangle-free 2-matching in subcubic graphs A simple algorithm for finding a maximum triangle-free 2-matching in subcubic graphs Discrete Optimization, 7, 197-202 Discrete Optimization, 7, 197-202 Discrete Optimization, 7, 197-202 2010
Yusuke Kobayashi Yusuke Kobayashi Yusuke Kobayashi Induced disjoint paths problem in a planar digraph Induced disjoint paths problem in a planar digraph Induced disjoint paths problem in a planar digraph Discrete Applied Mathematics, 157, 3231-3238 Discrete Applied Mathematics, 157, 3231-3238 Discrete Applied Mathematics, 157, 3231-3238 2009
Yusuke Kobayashi and Christian Sommer Yusuke Kobayashi and Christian Sommer Yusuke Kobayashi and Christian Sommer On shortest disjoint paths in planar graphs On shortest disjoint paths in planar graphs On shortest disjoint paths in planar graphs Proceedings of the 20th International Symposium on Algorithms and Computation (ISAAC 2009), 293-302 Proceedings of the 20th International Symposium on Algorithms and Computation (ISAAC 2009), 293-302 Proceedings of the 20th International Symposium on Algorithms and Computation (ISAAC 2009), 293-302 2009
Yusuke Kobayashi and Kenjiro Takazawa Yusuke Kobayashi and Kenjiro Takazawa Yusuke Kobayashi and Kenjiro Takazawa Even factors, jump systems, and discrete convexity Even factors, jump systems, and discrete convexity Even factors, jump systems, and discrete convexity Journal of Combinatorial Theory, Series B, 99, 139-161 Journal of Combinatorial Theory, Series B, 99, 139-161 Journal of Combinatorial Theory, Series B, 99, 139-161 2009
Shinji Imahori, Yuichiro Miyamoto, Hideki Hashimoto, Yusuke Kobayashi, Mihiro Sasaki, and Mutsunori Yagiura Shinji Imahori, Yuichiro Miyamoto, Hideki Hashimoto, Yusuke Kobayashi, Mihiro Sasaki, and Mutsunori Yagiura Shinji Imahori, Yuichiro Miyamoto, Hideki Hashimoto, Yusuke Kobayashi, Mihiro Sasaki, and Mutsunori Yagiura The complexity of the node capacitated in-tree packing problem The complexity of the node capacitated in-tree packing problem The complexity of the node capacitated in-tree packing problem Proceedings of the International Network Optimization Conference 2009 Proceedings of the International Network Optimization Conference 2009 Proceedings of the International Network Optimization Conference 2009 2009
Yusuke Kobayashi and Ken-ichi Kawarabayashi Yusuke Kobayashi and Ken-ichi Kawarabayashi Yusuke Kobayashi and Ken-ichi Kawarabayashi Algorithms for finding an induced cycle in planar graphs and bounded genus graphs Algorithms for finding an induced cycle in planar graphs and bounded genus graphs Algorithms for finding an induced cycle in planar graphs and bounded genus graphs Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 1146-1155 Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 1146-1155 Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 1146-1155 2009
Ken-ichi Kawarabayashi and Yusuke Kobayashi Ken-ichi Kawarabayashi and Yusuke Kobayashi Ken-ichi Kawarabayashi and Yusuke Kobayashi The induced disjoint paths problem The induced disjoint paths problem The induced disjoint paths problem Proceedings of the 13th Conference on Integer Programming and Combinatorial Optimization (IPCO 2008), 47-61 Proceedings of the 13th Conference on Integer Programming and Combinatorial Optimization (IPCO 2008), 47-61 Proceedings of the 13th Conference on Integer Programming and Combinatorial Optimization (IPCO 2008), 47-61 2008
Yusuke Kobayashi and Kazuo Murota Yusuke Kobayashi and Kazuo Murota Yusuke Kobayashi and Kazuo Murota Induction of M-convex functions by linking systems Induction of M-convex functions by linking systems Induction of M-convex functions by linking systems Discrete Applied Mathematics, 155, 1471-1480 Discrete Applied Mathematics, 155, 1471-1480 Discrete Applied Mathematics, 155, 1471-1480 2007
Yusuke Kobayashi, Kazuo Murota, and Ken'ichiro Tanaka Yusuke Kobayashi, Kazuo Murota, and Ken'ichiro Tanaka Yusuke Kobayashi, Kazuo Murota, and Ken'ichiro Tanaka Operations on M-convex functions on jump systems Operations on M-convex functions on jump systems Operations on M-convex functions on jump systems SIAM Journal on Discrete Mathematics, 21, 107-129 SIAM Journal on Discrete Mathematics, 21, 107-129 SIAM Journal on Discrete Mathematics, 21, 107-129 2007

• <<
• >>
• 表示
タイトル言語:

FFIT研究奨励賞 （公財）船井情報科学振興財団 2012/02/04

STOC 2017 Best Paper Award STOC 2017 Best Paper Award ACM SIGACT ACM SIGACT 2017/06/21
IWOCA 2019 Best Paper Award IWOCA 2019 Best Paper Award 2019/07/25

アルゴリズム論セミナー研究ａ Seminar on Algorithm Theory a 前期 理学研究科 2019/04〜2020/03
アルゴリズム論セミナー研究ｂ Seminar on Algorithm Theory b 後期 理学研究科 2019/04〜2020/03
アルゴリズム論セミナー研究ｃ Seminar on Algorithm Theory c 前期 理学研究科 2019/04〜2020/03
アルゴリズム論セミナー研究ｄ Seminar on Algorithm Theory d 後期 理学研究科 2019/04〜2020/03