Yoshio Okamoto
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
49
Venues
20
Active years
2003–2026
Best venue rank
A*
Where they publish
Papers
49 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | CPM | The Smallest String Attractors of Fibonacci and Period-Doubling Words. | Mutsunori Banbara, Hideo Bannai, Peaker Guo, Dominik Kppl, Takuya Mieno, Yoshio Okamoto |
| 2026 | ESA | Rerouting Curves on Surfaces. | Timo Brand, Stefan Felsner, Henry Frster, Stephen G. Kobourov, Anna Lubiw, Yoshio Okamoto, Jnos Pach, Csaba D. Tth, Gza Tth, Torsten Ueckerdt, Pavel Valtr |
| 2025 | ISAAC | Minimum Sum Coloring with Bundles in Trees and Bipartite Graphs. | Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto |
| 2024 | SoCS | CoRe Challenge 2022/2023: Empirical Evaluations for Independent Set Reconfiguration Problems (Extended Abstract). | Takehide Soh, Tomoya Tanjo, Yoshio Okamoto, Takehiro Ito |
| 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 | 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 | PRIMA | On Reachable Assignments Under Dichotomous Preferences. | Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki |
| 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 |
| 2020 | WG | Linear-Time Recognition of Double-Threshold Graphs. | Yusuke Kobayashi, Yoshio Okamoto, Yota Otachi, Yushi Uno |
| 2019 | CIAC | Subgraph Isomorphism on Graph Classes that Exclude a Substructure. | Hans L. Bodlaender, Tesshu Hanaka, Yoshio Okamoto, Yota Otachi, Tom C. van der Zanden |
| 2019 | ESA | Shortest Reconfiguration of Perfect Matchings via Alternating Cycles. | Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto |
| 2019 | GD | Graphs with Large Total Angular Resolution. | Oswin Aichholzer, Matias Korman, Yoshio Okamoto, Irene Parada, Daniel Perz, Andr van Renssen, Birgit Vogtenhuber |
| 2019 | GD | Variants of the Segment Number of a Graph. | Yoshio Okamoto, Alexander Ravsky, Alexander Wolff |
| 2018 | FAW | Exact Algorithms for the Max-Min Dispersion Problem. | Toshihiro Akagi, Tetsuya Araki, Takashi Horiyama, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara, Takeaki Uno, Kunihiro Wasa |
| 2018 | GD | Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity. | Evmorfia N. Argyriou, Sabine Cornelsen, Henry Frster, Michael Kaufmann, Martin Nllenburg, Yoshio Okamoto, Chrysanthi N. Raftopoulou, Alexander Wolff |
| 2018 | ISAAC | Rectilinear Link Diameter and Radius in a Rectilinear Polygonal Domain. | Elena Arseneva, Man-Kwun Chiu, Matias Korman, Aleksandar Markovic, Yoshio Okamoto, Aurlien Ooms, Andr van Renssen, Marcel Roeloffzen |
| 2018 | IWOCA | Computational Complexity of Robot Arm Simulation Problems. | Tianfeng Feng, Takashi Horiyama, Yoshio Okamoto, Yota Otachi, Toshiki Saitoh, Takeaki Uno, Ryuhei Uehara |
| 2017 | COCOON | Reconfiguration of Maximum-Weight b-Matchings in a Graph. | Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto |
| 2017 | WADS | Balanced Line Separators of Unit Disk Graphs. | Paz Carmi, Man-Kwun Chiu, Matthew J. Katz, Matias Korman, Yoshio Okamoto, Andr van Renssen, Marcel Roeloffzen, Taichi Shiitada, Shakhar Smorodinsky |
| 2017 | WALCOM | Sequentially Swapping Colored Tokens on Graphs. | Katsuhisa Yamanaka, Erik D. Demaine, Takashi Horiyama, Akitoshi Kawamura, Shin-Ichi Nakano, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno |
| 2016 | ESA | Approximation and Hardness of Token Swapping. | Tillmann Miltzow, Lothar Narins, Yoshio Okamoto, Gnter Rote, Antonis Thomas, Takeaki Uno |
| 2016 | STACS | Computing the L1 Geodesic Diameter and Center of a Polygonal Domain. | Sang Won Bae, Matias Korman, Joseph S. B. Mitchell, Yoshio Okamoto, Valentin Polishchuk, Haitao Wang |
| 2014 | FUN | Sankaku-Tori: An Old Western-Japanese Game Played on a Point Set. | Takashi Horiyama, Masashi Kiyomi, Yoshio Okamoto, Ryuhei Uehara, Takeaki Uno, Yushi Uno, Yukiko Yamauchi |
| 2014 | FUN | Swapping Labeled Tokens on Graphs. | Katsuhisa Yamanaka, Erik D. Demaine, Takehiro Ito, Jun Kawahara, Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Kei Uchizawa, Takeaki Uno |
| 2014 | ISAAC | Minimum-Cost b -Edge Dominating Sets on Trees. | Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto |
| 2014 | LATIN | Computing the L 1 Geodesic Diameter and Center of a Simple Polygon in Linear Time. | Sang Won Bae, Matias Korman, Yoshio Okamoto, Haitao Wang |
| 2014 | LATIN | Semantic Word Cloud Representations: Hardness and Approximation Algorithms. | Lukas Barth, Sara Irina Fabrikant, Stephen G. Kobourov, Anna Lubiw, Martin Nllenburg, Yoshio Okamoto, Sergey Pupyrev, Claudio Squarcella, Torsten Ueckerdt, Alexander Wolff |
| 2012 | ISAAC | Universal Point Subsets for Planar Graphs. | Patrizio Angelini, Carla Binucci, William S. Evans, Ferran Hurtado, Giuseppe Liotta, Tamara Mchedlidze, Henk Meijer, Yoshio Okamoto |
| 2012 | ISAAC | Area Bounds of Rectilinear Polygons Realized by Angle Sequences. | Sang Won Bae, Yoshio Okamoto, Chan-Su Shin |
| 2012 | ISAAC | A 4.31-Approximation for the Geometric Unique Coverage Problem on Unit Disks. | Takehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno |
| 2011 | COCOON | Dominating Set Counting in Graph Classes. | Shuji Kijima, Yoshio Okamoto, Takeaki Uno |
| 2011 | TAMC | Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem. | Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno |
| 2011 | WG | Approximability of the Path-Distance-Width for AT-free Graphs. | Yota Otachi, Toshiki Saitoh, Katsuhisa Yamanaka, Shuji Kijima, Yoshio Okamoto, Hirotaka Ono, Yushi Uno, Koichi Yamazaki |
| 2010 | ESA | The Geodesic Diameter of Polygonal Domains. | Sang Won Bae, Matias Korman, Yoshio Okamoto |
| 2010 | FAW | Adaptive Algorithms for Planar Convex Hull Problems. | Hee-Kap Ahn, Yoshio Okamoto |
| 2009 | ISAAC | Querying Two Boundary Points for Shortest Paths in a Polygonal Domain. | Sang Won Bae, Yoshio Okamoto |
| 2009 | WG | Counting the Number of Matchings in Chordal and Chordal Bipartite Graph Classes. | Yoshio Okamoto, Ryuhei Uehara, Takeaki Uno |
| 2008 | COCOON | On Listing, Sampling, and Counting the Chordal Graphs with Edge Constraints. | Shuji Kijima, Masashi Kiyomi, Yoshio Okamoto, Takeaki Uno |
| 2008 | GD | Drawing (Complete) Binary Tanglegrams. | Kevin Buchin, Maike Buchin, Jaroslaw Byrka, Martin Nllenburg, Yoshio Okamoto, Rodrigo I. Silveira, Alexander Wolff |
| 2007 | GD | Moving Vertices to Make Drawings Plane. | Xavier Goaoc, Jan Kratochvl, Yoshio Okamoto, Chan-Su Shin, Alexander Wolff |
| 2007 | ISAAC | A Polynomial-Time-Delay and Polynomial-Space Algorithm for Enumeration Problems in Multi-criteria Optimization. | Yoshio Okamoto, Takeaki Uno |
| 2005 | WG | Linear-Time Counting Algorithms for Independent Sets in Chordal Graphs. | Yoshio Okamoto, Takeaki Uno, Ryuhei Uehara |
| 2004 | COCOON | The Traveling Salesman Problem with Few Inner Points. | Vladimir G. Deineko, Michael Hoffmann, Yoshio Okamoto, Gerhard J. Woeginger |
| 2004 | WG | Core Stability of Minimum Coloring Games. | Thomas Bietenhader, Yoshio Okamoto |
| 2003 | COCOON | Matroid Representation of Clique Complexes. | Kenji Kashiwabara, Yoshio Okamoto, Takeaki Uno |
| 2003 | ISAAC | Fair Cost Allocations under Conflicts - A Game-Theoretic Point of View. | Yoshio Okamoto |
| 2003 | WG | Greedy Edge-Disjoint Paths in Complete Graphs. | Paz Carmi, Thomas Erlebach, Yoshio Okamoto |