Yusuke KOBAYASHI

Yusuke KOBAYASHI

Kyoto University

H-index: 21

Asia-Japan

About Yusuke KOBAYASHI

Yusuke KOBAYASHI, With an exceptional h-index of 21 and a recent h-index of 14 (since 2020), a distinguished researcher at Kyoto University,

His recent articles reflect a diverse array of research interests and contributions to the field:

Envy-free relaxations for goods, chores, and mixed items

Finding a Maximum Restricted -Matching via Boolean Edge-CSP

Feedback vertex set reconfiguration in planar graphs

Trade-offs among degree, diameter, and number of paths

A framework to design approximation algorithms for finding diverse solutions in combinatorial problems

Monotone edge flips to an orientation of maximum edge-connectivity à la Nash-Williams

Fixed-parameter algorithms for graph constraint logic

EFX allocations for indivisible chores: matching-based approach

Yusuke KOBAYASHI Information

University

Position

___

Citations(all)

1479

Citations(since 2020)

811

Cited By

984

hIndex(all)

21

hIndex(since 2020)

14

i10Index(all)

43

i10Index(since 2020)

28

Email

University Profile Page

Kyoto University

Google Scholar

View Google Scholar Profile

Top articles of Yusuke KOBAYASHI

Title

Journal

Author(s)

Publication Date

Envy-free relaxations for goods, chores, and mixed items

arXiv preprint arXiv:2006.04428

Kristóf Bérczi

Erika R Bérczi-Kovács

Endre Boros

Fekadu Tolessa Gedefa

Naoyuki Kamiyama

...

2020/6/8

Finding a Maximum Restricted -Matching via Boolean Edge-CSP

arXiv preprint arXiv:2310.20245

Yuni Iwamasa

Yusuke Kobayashi

Kenjiro Takazawa

2023/10/31

Feedback vertex set reconfiguration in planar graphs

Theoretical Computer Science

Nicolas Bousquet

Felix Hommelsheim

Yusuke Kobayashi

Moritz Mühlenthaler

Akira Suzuki

2023/11/10

Trade-offs among degree, diameter, and number of paths

Discrete Applied Mathematics

Toshimasa Ishii

Akitoshi Kawamura

Yusuke Kobayashi

Kazuhisa Makino

2023/3/15

A framework to design approximation algorithms for finding diverse solutions in combinatorial problems

Proceedings of the AAAI Conference on Artificial Intelligence

Tesshu Hanaka

Masashi Kiyomi

Yasuaki Kobayashi

Yusuke Kobayashi

Kazuhiro Kurita

...

2023/6/26

Monotone edge flips to an orientation of maximum edge-connectivity à la Nash-Williams

ACM Transactions on Algorithms

Takehiro Ito

Yuni Iwamasa

Naonori Kakimura

Naoyuki Kamiyama

Yusuke Kobayashi

...

2023/2/20

Fixed-parameter algorithms for graph constraint logic

Theoretical Computer Science

Tatsuhiko Hatanaka

Felix Hommelsheim

Takehiro Ito

Yusuke Kobayashi

Moritz Mühlenthaler

...

2023/5/30

EFX allocations for indivisible chores: matching-based approach

Yusuke Kobayashi

Ryoga Mahara

Souta Sakamoto

2023/9/4

Reconfiguration of time-respecting arborescences

Takehiro Ito

Yuni Iwamasa

Naoyuki Kamiyama

Yasuaki Kobayashi

Yusuke Kobayashi

...

2023/7/28

APPROXIMATION ALGORITHM FOR STEINER TREE PROBLEM WITH NEIGHBOR-INDUCED COST

Journal of the Operations Research Society of Japan

Yusuke Kobayashi

Ryoga Mahara

2023/1/31

On reachable assignments under dichotomous preferences

Theoretical Computer Science

Takehiro Ito

Naonori Kakimura

Naoyuki Kamiyama

Yusuke Kobayashi

Yuta Nozaki

...

2023/11/10

Reconfiguration of the Union of Arborescences

arXiv preprint arXiv:2304.13217

Yusuke Kobayashi

Ryoga Mahara

Tamás Schwarcz

2023/4/26

Algorithmic theory of qubit routing

Takehiro Ito

Naonori Kakimura

Naoyuki Kamiyama

Yusuke Kobayashi

Yoshio Okamoto

2023/7/28

Optimal general factor problem and jump system intersection

Yusuke Kobayashi

2023/5/22

Reconfiguration of spanning trees with degree constraints or diameter constraints

Algorithmica

Nicolas Bousquet

Takehiro Ito

Yusuke Kobayashi

Haruka Mizuta

Paul Ouvrard

...

2023/9

An approximation algorithm for two-edge-connected subgraph problem via triangle-free two-edge-cover

arXiv preprint arXiv:2304.13228

Yusuke Kobayashi

Takashi Noguchi

2023/4/26

Hardness of finding combinatorial shortest paths on graph associahedra

arXiv preprint arXiv:2304.14782

Takehiro Ito

Naonori Kakimura

Naoyuki Kamiyama

Yusuke Kobayashi

Shun-ichi Maezawa

...

2023/4/28

Shortest reconfiguration of perfect matchings via alternating cycles

SIAM Journal on Discrete Mathematics

Takehiro Ito

Naonori Kakimura

Naoyuki Kamiyama

Yusuke Kobayashi

Yoshio Okamoto

2022

An improved deterministic parameterized algorithm for cactus vertex deletion

Theory of Computing Systems

Yuuki Aoike

Tatsuya Gima

Tesshu Hanaka

Masashi Kiyomi

Yasuaki Kobayashi

...

2022/4

Reforming an Envy-Free Matching

Proceedings of the AAAI Conference on Artificial Intelligence

Takehiro Ito

Yuni Iwamasa

Naonori Kakimura

Naoyuki Kamiyama

Yusuke Kobayashi

...

2022/6/28

See List of Professors in Yusuke KOBAYASHI University(Kyoto University)