| 2026 | ESA | A Computer-Assisted Proof of the Optimal Density Bound for Pinwheel Covering. | Akitoshi Kawamura, Yusuke Kobayashi |
| 2026 | ESA | An Approximation Algorithm for 2-Vertex-Connectivity via Cycle-Restricted 2-Edge-Covers. | Yusuke Kobayashi, Takashi Noguchi |
| 2026 | IPCO | A PTAS for Weighted Triangle-Free 2-Matching. | Miguel Bosch-Calvo, Fabrizio Grandoni, Yusuke Kobayashi, Takashi Noguchi |
| 2026 | IPCO | Polynomial Kernels with Reachability for Weighted d-Matroid Intersection. | Chien-Chung Huang, Naonori Kakimura, Yusuke Kobayashi, Tatsuya Terao |
| 2025 | CIAC | Pinwheel Covering. | Akitoshi Kawamura, Yusuke Kobayashi, Yosuke Kusano |
| 2025 | ISAAC | Hardness and Fixed Parameter Tractability for Pinwheel Scheduling Problems. | Yusuke Kobayashi, Bingkai Lin |
| 2025 | ISAAC | Minimum Sum Coloring with Bundles in Trees and Bipartite Graphs. | Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto |
| 2024 | ESA | Finding a Maximum Restricted t-Matching via Boolean Edge-CSP. | Yuni Iwamasa, Yusuke Kobayashi, Kenjiro Takazawa |
| 2024 | ICALP | Subquadratic Submodular Maximization with a General Matroid Constraint. | Yusuke Kobayashi, Tatsuya Terao |
| 2024 | IGARSS | A Recurrent Deep Learning-Based Monthly Deforestation Prediction Model in Eight Areas for Brazilian Amazon: A Pilot Study. | Suguru Kanoga, Takeshi Nomaguchi, Yusuke Kobayashi, Takayuki Hoshino, Chiaki Tsutsumi, Ryu Sugimoto, Toru Kouyama, Ryosuke Nakamura |
| 2023 | AAAI | A Framework to Design Approximation Algorithms for Finding Diverse Solutions in Combinatorial Problems. | Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Kazuhiro Kurita, Yota Otachi |
| 2023 | ICALP | Rerouting Planar Curves and Disjoint Paths. | Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki |
| 2023 | ICALP | Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra. | Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto |
| 2023 | IPCO | Optimal General Factor Problem and Jump System Intersection. | Yusuke Kobayashi |
| 2023 | ISAAC | Reconfiguration of the Union of Arborescences. | Yusuke Kobayashi, Ryoga Mahara, Tams Schwarcz |
| 2023 | ISAAC | An Approximation Algorithm for Two-Edge-Connected Subgraph Problem via Triangle-Free Two-Edge-Cover. | Yusuke Kobayashi, Takashi Noguchi |
| 2023 | SAGT | EFX Allocations for Indivisible Chores: Matching-Based Approach. | Yusuke Kobayashi, Ryoga Mahara, Souta Sakamoto |
| 2023 | WADS | Reconfiguration of Time-Respecting Arborescences. | Takehiro Ito, Yuni Iwamasa, Naoyuki Kamiyama, Yasuaki Kobayashi, Yusuke Kobayashi, Shun-ichi Maezawa, Akira Suzuki |
| 2023 | WADS | Algorithmic Theory of Qubit Routing. | Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto |
| 2022 | AAAI | Reforming an Envy-Free Matching. | Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki |
| 2022 | ISAAC | Proportional Allocation of Indivisible Goods up to the Least Valued Good on Average. | Yusuke Kobayashi, Ryoga Mahara |
| 2022 | ISAAC | One-Face Shortest Disjoint Paths with a Deviation Terminal. | Yusuke Kobayashi, Tatsuya Terao |
| 2022 | IWOCA | An Additive Approximation Scheme for the Nash Social Welfare Maximization with Identical Additive Valuations. | Asei Inoue, Yusuke Kobayashi |
| 2022 | PRIMA | On Reachable Assignments Under Dichotomous Preferences. | Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki |
| 2022 | SMC | Detection of osteochondritis dissecans in ultrasound images for computer-aided diagnosis of baseball elbow. | Kenta Sasaki, Daisuke Fujita, Kenta Takatsuji, Yoshihiro Kotoura, Masataka Minami, Yusuke Kobayashi, Tsuyoshi Sukenari, Yoshikazu Kida, Kenji Takahashi, Syoji Kobashi |
| 2022 | SODA | Monotone edge flips to an orientation of maximum edge-connectivity la Nash-Williams. | Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki |
| 2022 | STACS | Reconfiguration of Spanning Trees with Degree Constraint or Diameter Constraint. | Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Paul Ouvrard, Akira Suzuki, Kunihiro Wasa |
| 2020 | ESA | Reconfiguration of Spanning Trees with Many or Few Leaves. | Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Paul Ouvrard, Akira Suzuki, Kunihiro Wasa |
| 2020 | HCI | Fundamental Study for Analysis of Walking Considering Base of Support for Prevention of Stumble Accident. | Masaya Hori, Yusuke Kobayashi, Tatsuo Hisaoka, Takuya Kiryu, Yu Kikuchi, Hiroaki Inoue, Shunji Shimizu |
| 2020 | HCI | Basic Study on Measuring Brain Activity for Evaluation Method of Visually Impaired Person's Orientation and Mobility Skills. | Hiroaki Inoue, Masaya Hori, Yu Kikuchi, Mayu Maeda, Yusuke Kobayashi, Takuya Kiryu, Toshiya Tsubota, Shunji Shimizu |
| 2020 | IPCO | Weighted Triangle-Free 2-Matching Problem with Edge-Disjoint Forbidden Triangles. | Yusuke Kobayashi |
| 2020 | ISAAC | Market Pricing for Matroid Rank Valuations. | Kristf Brczi, Naonori Kakimura, Yusuke Kobayashi |
| 2020 | IWOCA | Parameterized Complexity of (A, ℓ )-Path Packing. | Rmy Belmonte, Tesshu Hanaka, Masaaki Kanzaki, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Michael Lampis, Hirotaka Ono, Yota Otachi |
| 2020 | IWOCA | The Steiner Problem for Count Matroids. | Tibor Jordn, Yusuke Kobayashi, Ryoga Mahara, Kazuhisa Makino |
| 2020 | STACS | An FPT Algorithm for Minimum Additive Spanner Problem. | Yusuke Kobayashi |
| 2020 | STACS | Shortest Reconfiguration of Colorings Under Kempe Changes. | Marthe Bonamy, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Moritz Mhlenthaler, Akira Suzuki, Kunihiro Wasa |
| 2020 | WG | Linear-Time Recognition of Double-Threshold Graphs. | Yusuke Kobayashi, Yoshio Okamoto, Yota Otachi, Yushi Uno |
| 2019 | COCOON | Diameter of Colorings Under Kempe Changes. | Marthe Bonamy, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Moritz Mhlenthaler, Akira Suzuki, Kunihiro Wasa |
| 2019 | ESA | Shortest Reconfiguration of Perfect Matchings via Alternating Cycles. | Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto |
| 2019 | IWOCA | An Improved Fixed-Parameter Algorithm for Max-Cut Parameterized by Crossing Number. | Yasuaki Kobayashi, Yusuke Kobayashi, Shuichi Miyazaki, Suguru Tamaki |
| 2019 | MFCS | The Perfect Matching Reconfiguration Problem. | Marthe Bonamy, Nicolas Bousquet, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Arnaud Mary, Moritz Mhlenthaler, Kunihiro Wasa |
| 2018 | FAW | A Strongly Polynomial Time Algorithm for the Maximum Supply Rate Problem on Trees. | Koki Takayama, Yusuke Kobayashi |
| 2017 | COCOON | Reconfiguration of Maximum-Weight b-Matchings in a Graph. | Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto |
| 2017 | ESA | The Directed Disjoint Shortest Paths Problem. | Kristf Brczi, Yusuke Kobayashi |
| 2017 | ISAAC | Complexity of the Multi-Service Center Problem. | Takehiro Ito, Naonori Kakimura, Yusuke Kobayashi |
| 2017 | STOC | A weighted linear matroid parity algorithm. | Satoru Iwata, Yusuke Kobayashi |
| 2016 | SMC | A Pareto optimal solution visualization method using SOM-NG with learning parameter optimization. | Yusuke Kobayashi, Takashi Okamoto, Seiichi Koakutsu |
| 2015 | ICALP | Finding a Path in Group-Labeled Graphs with Two Labels Forbidden. | Yasushi Kawase, Yusuke Kobayashi, Yutaro Yamaguchi |
| 2014 | INFOCOM | Max-flow min-cut theorem and faster algorithms in a circular disk failure model. | Yusuke Kobayashi, Kensuke Otsuki |
| 2014 | ISAAC | Minimum-Cost b -Edge Dominating Sets on Trees. | Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto |
| 2014 | SODA | The Generalized Terminal Backup Problem. | Attila Bernth, Yusuke Kobayashi |
| 2014 | STOC | An excluded half-integral grid theorem for digraphs and the directed disjoint paths problem. | Ken-ichi Kawarabayashi, Yusuke Kobayashi, Stephan Kreutzer |
| 2013 | FOCS | All-or-Nothing Multicommodity Flow Problem with Bounded Fractionality in Planar Graphs. | Ken-ichi Kawarabayashi, Yusuke Kobayashi |
| 2012 | ISAAC | Fence Patrolling by Mobile Agents with Distinct Speeds. | Akitoshi Kawamura, Yusuke Kobayashi |
| 2012 | SODA | Erds-Psa property and its algorithmic applications: parity constraints, subset feedback set, and subset packing. | Naonori Kakimura, Ken-ichi Kawarabayashi, Yusuke Kobayashi |
| 2012 | SODA | List-coloring graphs without subdivisions and without immersions. | Ken-ichi Kawarabayashi, Yusuke Kobayashi |
| 2012 | STACS | Edge-disjoint Odd Cycles in 4-edge-connected Graphs. | Ken-ichi Kawarabayashi, Yusuke Kobayashi |
| 2012 | STACS | Linear min-max relation between the treewidth of H-minor-free graphs and its largest grid. | Ken-ichi Kawarabayashi, Yusuke Kobayashi |
| 2011 | ESA | Algorithms for Finding a Maximum Non-k-linked Graph. | Yusuke Kobayashi, Yuichi Yoshida |
| 2011 | STOC | Breaking o(n | Ken-ichi Kawarabayashi, Yusuke Kobayashi |
| 2010 | ESA | Robust Matchings and Matroid Intersections. | Ryo Fujita, Yusuke Kobayashi, Kazuhisa Makino |
| 2010 | ICCSA | An Effective Inference Method Using Sensor Data for Symbiotic Healthcare Support System. | Satoru Izumi, Yusuke Kobayashi, Hideyuki Takahashi, Takuo Suganuma, Tetsuo Kinoshita, Norio Shiratori |
| 2010 | SODA | The Edge Disjoint Paths Problem in Eulerian Graphs and 4-edge-connected Graphs. | Ken-ichi Kawarabayashi, Yusuke Kobayashi |
| 2009 | IROS | Development of Active 80-faced Polyhedron for haptic physical human-machine interface. | Tomoya Kubo, Yusuke Kobayashi, Ahmad Athif Mohd Faudzi, Koichi Suzumori |
| 2009 | ISAAC | On Shortest Disjoint Paths in Planar Graphs. | Yusuke Kobayashi, Christian Sommer |
| 2009 | SODA | Algorithms for finding an induced cycle in planar graphs and bounded genus graphs. | Yusuke Kobayashi, Ken-ichi Kawarabayashi |
| 2008 | IPCO | The Induced Disjoint Paths Problem. | Ken-ichi Kawarabayashi, Yusuke Kobayashi |