Greedy Edge-Disjoint Paths in Complete Graphs. - Paz Carmi; Thomas Erlebach; Yoshio Okamoto (WG, 2003)

A greedy algorithm for convex geometries. - Kenji Kashiwabara; Yoshio Okamoto (Discret. Appl. Math., 2003)

The forbidden minor characterization of line-search antimatroids of rooted digraphs. - Yoshio Okamoto; Masataka Nakamura (Discret. Appl. Math., 2003)

Some properties of the core on convex geometries. - Yoshio Okamoto (Math. Methods Oper. Res., 2003)

Submodularity of some classes of the combinatorial optimization games. - Yoshio Okamoto (Math. Methods Oper. Res., 2003)

Traveling salesman games with the Monge property. - Yoshio Okamoto (Discret. Appl. Math., 2004)

Linear-Time Counting Algorithms for Independent Sets in Chordal Graphs. - Yoshio Okamoto; Takeaki Uno; Ryuhei Uehara (WG, 2005)

The affine representation theorem for abstract convex geometries. - Kenji Kashiwabara; Masataka Nakamura; Yoshio Okamoto (Comput. Geom., 2005)

The minimum weight triangulation problem with few inner points. - Michael Hoffmann 001; Yoshio Okamoto (Comput. Geom., 2006)

The Even Outdegree Conjecture for Acyclic PLCP-Cubes in Dimension Five. - Sonoko Moriyama; Yoshio Okamoto (IEICE Trans. Inf. Syst., 2006)

Core Stability of Minimum Coloring Games. - Thomas Bietenhader; Yoshio Okamoto (Math. Oper. Res., 2006)

The traveling salesman problem with few inner points. - Vladimir G. Deineko; Michael Hoffmann 001; Yoshio Okamoto; Gerhard J. Woeginger (Oper. Res. Lett., 2006)

Fast Exponential-Time Algorithms for the Forest Counting in Graph Classes. - Heidi Gebauer; Yoshio Okamoto (CATS, 2007)

Moving Vertices to Make Drawings Plane. - Xavier Goaoc; Jan Kratochvíl; Yoshio Okamoto; Chan-Su Shin; Alexander Wolff 001 (GD, 2007)

Matroid representation of clique complexes. - Kenji Kashiwabara; Yoshio Okamoto; Takeaki Uno (Discret. Appl. Math., 2007)

Relationships between the class of unit grid intersection graphs and other classes of bipartite graphs. - Yota Otachi; Yoshio Okamoto; Koichi Yamazaki (Discret. Appl. Math., 2007)

08431 Open Problems - Moderately Exponential Time Algorithms. - Fedor V. Fomin; Kazuo Iwama; Dieter Kratsch; Petteri Kaski; Mikko Koivisto; Lukasz Kowalik; Yoshio Okamoto; Johan M. M. van Rooij; Ryan Williams 001 (Moderately Exponential Time Algorithms, 2008)

Drawing (Complete) Binary Tanglegrams. - Kevin Buchin; Maike Buchin; Jaroslaw Byrka; Martin Nöllenburg; Yoshio Okamoto; Rodrigo I. Silveira; Alexander Wolff 001 (GD, 2008)

Fair cost allocations under conflicts - a game-theoretic point of view - . - Yoshio Okamoto (Discret. Optim., 2008)

Local topology of the free complex of a two-dimensional generalized convex shelling. - Yoshio Okamoto (Discret. Math., 2008)

Counting the number of independent sets in chordal graphs. - Yoshio Okamoto; Takeaki Uno; Ryuhei Uehara (J. Discrete Algorithms, 2008)

Traveling Sales Person with Few Inner Points. - Yoshio Okamoto (Encyclopedia of Algorithms, 2008)

How to make a picturesque maze. - Yoshio Okamoto; Ryuhei Uehara (CCCG, 2009)

Counting the Number of Matchings in Chordal and Chordal Bipartite Graph Classes. - Yoshio Okamoto; Ryuhei Uehara; Takeaki Uno (WG, 2009)

Untangling a Planar Graph. - Xavier Goaoc; Jan Kratochvíl; Yoshio Okamoto; Chan-Su Shin; Andreas Spillner 001; Alexander Wolff 001 (Discret. Comput. Geom., 2009)

The Holt-Klee condition for oriented matroids. - Komei Fukuda; Sonoko Moriyama; Yoshio Okamoto (Eur. J. Comb., 2009)

Fast Exponential-Time Algorithms for the Forest Counting and the Tutte Polynomial Computation in Graph Classes. - Heidi Gebauer; Yoshio Okamoto (Int. J. Found. Comput. Sci., 2009)

Minimum and Maximum against k Lies. - Michael Hoffmann 001; Jirí Matousek 001; Yoshio Okamoto; Philipp Zumstein (SWAT, 2010)

Improved Bounds for Wireless Localization. - Tobias Christ; Michael Hoffmann 001; Yoshio Okamoto; Takeaki Uno (Algorithmica, 2010)

A Tight Lower Bound for Convexly Independent Subsets of the Minkowski Sums of Planar Point Sets. - Ondrej Bílka; Kevin Buchin; Radoslav Fulek; Masashi Kiyomi; Yoshio Okamoto; Shin-ichi Tanigawa; Csaba D. Tóth (Electron. J. Comb., 2010)

On listing, sampling, and counting the chordal graphs with edge constraints. - Shuji Kijima; Masashi Kiyomi; Yoshio Okamoto; Takeaki Uno (Theor. Comput. Sci., 2010)

Dominating Set Counting in Graph Classes. - Shuji Kijima; Yoshio Okamoto; Takeaki Uno (COCOON, 2011)

Approximability of the Path-Distance-Width for AT-free Graphs. - Yota Otachi; Toshiki Saitoh; Katsuhisa Yamanaka; Shuji Kijima; Yoshio Okamoto; Hirotaka Ono 001; Yushi Uno; Koichi Yamazaki (WG, 2011)

The t-Pebbling Number is Eventually Linear in t. - Michael Hoffmann 001; Jirí Matousek 001; Yoshio Okamoto; Philipp Zumstein (Electron. J. Comb., 2011)

Not All Saturated 3-Forests Are Tight - Heidi Gebauer; Anna Gundert; Robin A. Moser; Yoshio Okamoto (CoRR, 2011)

On Problems as Hard as CNFSAT - Marek Cygan; Holger Dell; Daniel Lokshtanov; Dániel Marx; Jesper Nederlof; Yoshio Okamoto; Ramamohan Paturi; Saket Saurabh 001; Magnus Wahlström (CoRR, 2011)

A polynomial-time-delay and polynomial-space algorithm for enumeration problems in multi-criteria optimization. - Yoshio Okamoto; Takeaki Uno (Eur. J. Oper. Res., 2011)

Adaptive Algorithms for Planar Convex Hull Problems. - Hee-Kap Ahn; Yoshio Okamoto (IEICE Trans. Inf. Syst., 2011)

Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem. - Yoshio Okamoto; Yota Otachi; Ryuhei Uehara; Takeaki Uno (J. Graph Algorithms Appl., 2011)

Submodular fractional programming for balanced clustering. - Yoshinobu Kawahara; Kiyohito Nagano; Yoshio Okamoto (Pattern Recognit. Lett., 2011)

Universal Point Subsets for Planar Graphs. - Patrizio Angelini; Carla Binucci; William S. Evans; Ferran Hurtado; Giuseppe Liotta; Tamara Mchedlidze; Henk Meijer; Yoshio Okamoto (ISAAC, 2012)

Efficient Enumeration of the Directed Binary Perfect Phylogenies from Incomplete Data. - Masashi Kiyomi; Yoshio Okamoto; Toshiki Saitoh (SEA, 2012)

Drawing (Complete) Binary Tanglegrams - Hardness, Approximation, Fixed-Parameter Tractability. - Kevin Buchin; Maike Buchin; Jaroslaw Byrka; Martin Nöllenburg; Yoshio Okamoto; Rodrigo I. Silveira; Alexander Wolff 001 (Algorithmica, 2012)

Minimum and maximum against k lies. - Michael Hoffmann 001; Jirí Matousek 001; Yoshio Okamoto; Philipp Zumstein (Chic. J. Theor. Comput. Sci., 2012)

Querying two boundary points for shortest paths in a polygonal domain. - Sang Won Bae 001; Yoshio Okamoto (Comput. Geom., 2012)

On bipartite powers of bigraphs. - Yoshio Okamoto; Yota Otachi; Ryuhei Uehara (Discret. Math. Theor. Comput. Sci., 2012)

Guest Editors' Foreword. - Otfried Cheong; Yoshio Okamoto (Int. J. Comput. Geom. Appl., 2012)

Vertex angle and crossing angle resolution of leveled tree drawings. - Walter Didimo; Michael Kaufmann 001; Giuseppe Liotta; Yoshio Okamoto; Andreas Spillner 001 (Inf. Process. Lett., 2012)

Guest Editorial: Selected Papers from ISAAC 2011. - Takao Asano; Shin-Ichi Nakano; Yoshio Okamoto (Algorithmica, 2013)

Computing the L1 Geodesic Diameter and Center of a Simple Polygon in Linear Time. - Sang Won Bae 001; Matias Korman; Yoshio Okamoto; Haitao Wang 001 (CoRR, 2013)

Exact and fixed-parameter algorithms for metro-line crossing minimization problems. - Yoshio Okamoto; Yuichi Tatsu; Yushi Uno (CoRR, 2013)

The Geodesic Diameter of Polygonal Domains. - Sang Won Bae 001; Matias Korman; Yoshio Okamoto (Discret. Comput. Geom., 2013)

Guest Editors' Foreword. - Takao Asano; Shin-Ichi Nakano; Yoshio Okamoto (Int. J. Comput. Geom. Appl., 2013)

The complexity of the stamp folding problem. - Takuya Umesato; Toshiki Saitoh; Ryuhei Uehara; Hiro Ito; Yoshio Okamoto (Theor. Comput. Sci., 2013)

Weight Balancing on Boundaries and Skeletons. - Luis Barba; Otfried Cheong; Jean-Lou De Carufel; Michael Gene Dobbins; Rudolf Fleischer; Akitoshi Kawamura; Matias Korman; Yoshio Okamoto; János Pach; Yuan Tang; Takeshi Tokuyama; Sander Verdonschot; et al. (SoCG, 2014)

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 (FUN, 2014)

Computing the L 1 Geodesic Diameter and Center of a Simple Polygon in Linear Time. - Sang Won Bae 001; Matias Korman; Yoshio Okamoto; Haitao Wang 001 (LATIN, 2014)

Semantic Word Cloud Representations: Hardness and Approximation Algorithms. - Lukas Barth; Sara Irina Fabrikant; Stephen G. Kobourov; Anna Lubiw; Martin Nöllenburg; Yoshio Okamoto; Sergey Pupyrev; Claudio Squarcella; Torsten Ueckerdt; Alexander Wolff 001 (LATIN, 2014)

Approximating the path-distance-width for AT-free graphs and graphs in related classes. - Yota Otachi; Toshiki Saitoh; Katsuhisa Yamanaka; Shuji Kijima; Yoshio Okamoto; Hirotaka Ono 001; Yushi Uno; Koichi Yamazaki (Discret. Appl. Math., 2014)

Computational Complexity and an Integer Programming Model of Shakashaka. - Erik D. Demaine; Yoshio Okamoto; Ryuhei Uehara; Yushi Uno (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2014)

Submodularity of minimum-cost spanning tree games. - Masayuki Kobayashi; Yoshio Okamoto (Networks, 2014)

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 (Theor. Comput. Sci., 2014)

Computing the L1 geodesic diameter and center of a simple polygon in linear time. - Sang Won Bae 001; Matias Korman; Yoshio Okamoto; Haitao Wang 001 (Comput. Geom., 2015)

Polynomial-time approximability of the k-Sink Location problem. - Rémy Belmonte; Yuya Higashikawa; Naoki Katoh; Yoshio Okamoto (CoRR, 2015)

Free Edge Lengths in Plane Graphs. - Zachary Abel; Robert Connelly; Sarah Eisenstat; Radoslav Fulek; Filip Moric; Yoshio Okamoto; Tibor Szabó; Csaba D. Tóth (Discret. Comput. Geom., 2015)

Swapping labeled tokens on graphs. - Katsuhisa Yamanaka; Erik D. Demaine; Takehiro Ito; Jun Kawahara; Masashi Kiyomi; Yoshio Okamoto; Toshiki Saitoh; Akira Suzuki 001; Kei Uchizawa; Takeaki Uno (Theor. Comput. Sci., 2015)

Approximation and Hardness of Token Swapping. - Tillmann Miltzow; Lothar Narins; Yoshio Okamoto; Günter Rote; Antonis Thomas; Takeaki Uno (ESA, 2016)

Computing the L1 Geodesic Diameter and Center of a Polygonal Domain. - Sang Won Bae 001; Matias Korman; Joseph S. B. Mitchell; Yoshio Okamoto; Valentin Polishchuk; Haitao Wang 001 (STACS, 2016)

A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares. - Takehiro Ito; Shin-Ichi Nakano; Yoshio Okamoto; Yota Otachi; Ryuhei Uehara; Takeaki Uno; Yushi Uno (Comput. Geom., 2016)

Tight Exact and Approximate Algorithmic Results on Token Swapping. - Tillmann Miltzow; Lothar Narins; Yoshio Okamoto; Günter Rote; Antonis Thomas; Takeaki Uno (CoRR, 2016)

On the treewidth of toroidal grids. - Masashi Kiyomi; Yoshio Okamoto; Yota Otachi (Discret. Appl. Math., 2016)

Extended formulations for sparsity matroids. - Satoru Iwata 001; Naoyuki Kamiyama; Naoki Katoh; Shuji Kijima; Yoshio Okamoto (Math. Program., 2016)

Theory and Applications of Geometric Optimization (NII Shonan Meeting 2016-9). - Siu-Wing Cheng; Yoshio Okamoto; Otfried Cheong (NII Shonan Meet. Rep., 2016)

On Problems as Hard as CNF-SAT. - Marek Cygan; Holger Dell; Daniel Lokshtanov; Dániel Marx; Jesper Nederlof; Yoshio Okamoto; Ramamohan Paturi; Saket Saurabh 001; Magnus Wahlström (ACM Trans. Algorithms, 2016)

Traveling Sales Person with Few Inner Points. - Yoshio Okamoto (Encyclopedia of Algorithms, 2016)

Tight Approximability of the Server Allocation Problem for Real-Time Applications. - Takehiro Ito; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi 001; Yoshio Okamoto; Taichi Shiitada (ALGOCLOUD, 2017)

Folding Free-Space Diagrams: Computing the Fréchet Distance between 1-Dimensional Curves (Multimedia Contribution). - Kevin Buchin; Jinhee Chun; Maarten Löffler; Aleksandar Markovic 001; Wouter Meulemans; Yoshio Okamoto; Taichi Shiitada (SoCG, 2017)

General Constructions of Rational Secret Sharing with Expected Constant-Round Reconstruction. - Akinori Kawachi; Yoshio Okamoto; Keisuke Tanaka; Kenji Yasunaga (Comput. J., 2017)

Computing the L1 Geodesic Diameter and Center of a Polygonal Domain. - Sang Won Bae 001; Matias Korman; Joseph S. B. Mitchell; Yoshio Okamoto; Valentin Polishchuk; Haitao Wang 001 (Discret. Comput. Geom., 2017)

Sankaku-tori: An Old Western-Japanese Game Played on a Point Set. - Takashi Horiyama; Takashi Iizuka; Masashi Kiyomi; Yoshio Okamoto; Ryuhei Uehara; Takeaki Uno; Yushi Uno; Yukiko Yamauchi (J. Inf. Process., 2017)

Efficient stabilization of cooperative matching games. - Takehiro Ito; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi 001; Yoshio Okamoto (Theor. Comput. Sci., 2017)

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 (FAW, 2018)

Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity. - Evmorfia N. Argyriou; Sabine Cornelsen; Henry Förster; Michael Kaufmann 001; Martin Nöllenburg; Yoshio Okamoto; Chrysanthi N. Raftopoulou; Alexander Wolff 001 (GD, 2018)

Computational Complexity of Robot Arm Simulation Problems. - Tianfeng Feng; Takashi Horiyama; Yoshio Okamoto; Yota Otachi; Toshiki Saitoh; Takeaki Uno; Ryuhei Uehara (IWOCA, 2018)

Subgraph Isomorphism on Graph Classes that Exclude a Substructure. - Hans L. Bodlaender; Tesshu Hanaka; Yoshio Okamoto; Yota Otachi; Tom C. van der Zanden (CIAC, 2019)

Variants of the Segment Number of a Graph. - Yoshio Okamoto; Alexander Ravsky; Alexander Wolff 001 (GD, 2019)

Minimum-Cost b-Edge Dominating Sets on Trees. - Takehiro Ito; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi 001; Yoshio Okamoto (Algorithmica, 2019)

Computing the geodesic centers of a polygonal domain. - Sang Won Bae 001; Matias Korman; Yoshio Okamoto (Comput. Geom., 2019)

Area bounds of rectilinear polygons realized by angle sequences. - Sang Won Bae 001; Yoshio Okamoto; Chan-Su Shin (Comput. Geom., 2019)

Reconfiguration of maximum-weight b-matchings in a graph. - Takehiro Ito; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi 001; Yoshio Okamoto (J. Comb. Optim., 2019)

Sequentially Swapping Colored Tokens on Graphs. - Katsuhisa Yamanaka; Erik D. Demaine; Takashi Horiyama; Akitoshi Kawamura; Shin-Ichi Nakano; Yoshio Okamoto; Toshiki Saitoh; Akira Suzuki 001; Ryuhei Uehara; Takeaki Uno (J. Graph Algorithms Appl., 2019)

Angular Resolutions: Around Vertices and Crossings. - Yoshio Okamoto (Beyond Planar Graphs, 2020)

Subgraph Isomorphism on Graph Classes that Exclude a Substructure. - Hans L. Bodlaender; Tesshu Hanaka; Yasuaki Kobayashi; Yusuke Kobayashi 001; Yoshio Okamoto; Yota Otachi; Tom C. van der Zanden (Algorithmica, 2020)

Guest Editorial: Selected Papers from ISAAC 2017. - Yoshio Okamoto (Algorithmica, 2020)

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 (Comput. Geom., 2020)

ClusterSets: Optimizing Planar Clusters in Categorical Point Data. - Jakob Geiger; Sabine Cornelsen; Jan-Henrik Haunert; Philipp Kindermann; Tamara Mchedlidze; Martin Nöllenburg; Yoshio Okamoto; Alexander Wolff 001 (Comput. Graph. Forum, 2021)

Rectilinear link diameter and radius in a rectilinear polygonal domain. - Elena Arseneva; Man-Kwun Chiu; Matias Korman; Aleksandar Markovic 001; Yoshio Okamoto; Aurélien Ooms; André van Renssen; Marcel Roeloffzen (Comput. Geom., 2021)

Algorithmic enumeration of surrounding polygons. - Katsuhisa Yamanaka; David Avis; Takashi Horiyama; Yoshio Okamoto; Ryuhei Uehara; Tanami Yamauchi (Discret. Appl. Math., 2021)

Algorithms for gerrymandering over graphs. - Takehiro Ito; Naoyuki Kamiyama; Yusuke Kobayashi 001; Yoshio Okamoto (Theor. Comput. Sci., 2021)

Unlabeled Multi-Robot Motion Planning with Tighter Separation Bounds. - Bahareh Banyassady; Mark de Berg; Karl Bringmann; Kevin Buchin; Henning Fernau; Dan Halperin; Irina Kostitsyna; Yoshio Okamoto; Stijn Slot (SoCG, 2022)

Linear-Time Recognition of Double-Threshold Graphs. - Yusuke Kobayashi 001; Yoshio Okamoto; Yota Otachi; Yushi Uno (Algorithmica, 2022)

Core Challenge 2022: Solver and Graph Descriptions. - Takehide Soh; Yoshio Okamoto; Takehiro Ito (CoRR, 2022)

Submodular reassignment problem for reallocating agents to tasks with synergy effects. - Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi 001; Yoshio Okamoto (Discret. Optim., 2022)

Weight balancing on boundaries. - Luis Barba; Otfried Cheong; Michael Gene Dobbins; Rudolf Fleischer; Akitoshi Kawamura; Matias Korman; Yoshio Okamoto; János Pach; Yuan Tang; Takeshi Tokuyama; Sander Verdonschot (J. Comput. Geom., 2022)

A parameterized view to the robust recoverable base problem of matroids under structural uncertainty. - Takehiro Ito; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi 001; Yoshio Okamoto (Oper. Res. Lett., 2022)

Shortest Reconfiguration of Perfect Matchings via Alternating Cycles. - Takehiro Ito; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi 001; Yoshio Okamoto (SIAM J. Discret. Math., 2022)

Reconfiguration of Colorings in Triangulations of the Sphere. - Takehiro Ito; Yuni Iwamasa; Yusuke Kobayashi 001; Shun-ichi Maezawa; Yuta Nozaki; Yoshio Okamoto; Kenta Ozeki (SoCG, 2023)

Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra. - Takehiro Ito; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi 001; Shun-ichi Maezawa; Yuta Nozaki; Yoshio Okamoto (ICALP, 2023)

Algorithmic Theory of Qubit Routing. - Takehiro Ito; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi 001; Yoshio Okamoto (WADS, 2023)

Core Challenge 2023: Solver and Graph Descriptions. - Takehide Soh; Tomoya Tanjo; Yoshio Okamoto; Takehiro Ito (CoRR, 2023)

Graphs with large total angular resolution. - Oswin Aichholzer; Matias Korman; Yoshio Okamoto; Irene Parada; Daniel Perz; André van Renssen; Birgit Vogtenhuber (Theor. Comput. Sci., 2023)

Monotone Edge Flips to an Orientation of Maximum Edge-Connectivity à la Nash-Williams. - Takehiro Ito; Yuni Iwamasa; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi 001; Shun-ichi Maezawa; Yuta Nozaki; Yoshio Okamoto; Kenta Ozeki (ACM Trans. Algorithms, 2023)

On reachable assignments under dichotomous preferences. - Takehiro Ito; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi 001; Yuta Nozaki; Yoshio Okamoto; Kenta Ozeki (Theor. Comput. Sci., 2023)

CoRe Challenge 2022/2023: Empirical Evaluations for Independent Set Reconfiguration Problems (Extended Abstract). - Takehide Soh; Tomoya Tanjo; Yoshio Okamoto; Takehiro Ito (SOCS, 2024)

Loss Minimization for Electrical Flows over Spanning Trees on Grids. - Takehiro Ito; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi 001; Yoshio Okamoto (CoRR, 2024)

Minimum separator reconfiguration. - Guilherme C. M. Gomes; Clément Legrand-Duchesne; Reem Mahmoud; Amer E. Mouawad; Yoshio Okamoto; Vinícius Fernandes dos Santos; Tom C. van der Zanden (J. Comput. Syst. Sci., 2024)

The Solitaire Clobber game and the correducibility of k-connected graphs. - Tatsuya Fujimori; Shun-ichi Maezawa; Yoshio Okamoto (Discret. Appl. Math., 2025)

Rerouting Planar Curves and Disjoint Paths. - Takehiro Ito; Yuni Iwamasa; Naonori Kakimura; Yusuke Kobayashi 001; Shun-ichi Maezawa; Yuta Nozaki; Yoshio Okamoto; Kenta Ozeki (ACM Trans. Algorithms, 2025)

Chasing puppies on orthogonal straight-line plane graphs. - Johanna Ockenfels; Yoshio Okamoto; Patrick Schnider (CoRR, 2025)

Reforming an Envy-Free Matching. - Takehiro Ito; Yuni Iwamasa; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi 001; Yuta Nozaki; Yoshio Okamoto; Kenta Ozeki (Algorithmica, 2025)