Yoshio Okamoto

191 papers A* 9A 11B 26C 3Misc 9Journal 119Unranked 11

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra. SIAM J. Discret. Math. Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto
2026	J	`jnl`	The Smallest String Attractors of Fibonacci and Period-Doubling Words. CoRR Mutsunori Banbara, Hideo Bannai, Peaker Guo, Dominik Köppl, Takuya Mieno, Yoshio Okamoto
2025	J	`jnl`	Algorithmic Theory of Qubit Routing in the Linear Nearest Neighbor Architectures. ACM Trans. Quantum Comput. Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
2025	J	`jnl`	Chasing puppies on orthogonal straight-line plane graphs. CoRR Johanna Ockenfels, Yoshio Okamoto, Patrick Schnider
2025	B	`conf`	Minimum Sum Coloring with Bundles in Trees and Bipartite Graphs. ISAAC Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
2025	J	`jnl`	Minimum Sum Coloring with Bundles in Trees and Bipartite Graphs. CoRR Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
2025	J	`jnl`	Reconfiguration of colorings in triangulations of the sphere. J. Comput. Geom. Takehiro Ito, Yuni Iwamasa, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2025	J	`jnl`	Reforming an Envy-Free Matching. Algorithmica Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2025	J	`jnl`	Rerouting Planar Curves and Disjoint Paths. ACM Trans. Algorithms Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2025	J	`jnl`	The Solitaire Clobber game and the correducibility of k-connected graphs. Discret. Appl. Math. Tatsuya Fujimori, Shun-ichi Maezawa, Yoshio Okamoto
2024	B	`conf`	CoRe Challenge 2022/2023: Empirical Evaluations for Independent Set Reconfiguration Problems (Extended Abstract). SOCS Takehide Soh, Tomoya Tanjo, Yoshio Okamoto, Takehiro Ito
2024	J	`jnl`	Loss Minimization for Electrical Flows over Spanning Trees on Grids. CoRR Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
2024	J	`jnl`	Minimum separator reconfiguration. J. Comput. Syst. Sci. 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
2023	B	`conf`	Algorithmic Theory of Qubit Routing. WADS Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
2023	J	`jnl`	Algorithmic Theory of Qubit Routing. CoRR Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
2023	J	`jnl`	Core Challenge 2023: Solver and Graph Descriptions. CoRR Takehide Soh, Tomoya Tanjo, Yoshio Okamoto, Takehiro Ito
2023	J	`jnl`	Graphs with large total angular resolution. Theor. Comput. Sci. Oswin Aichholzer, Matias Korman, Yoshio Okamoto, Irene Parada, Daniel Perz, André van Renssen, Birgit Vogtenhuber
2023	A*	`conf`	Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra. ICALP Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto
2023	J	`jnl`	Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra. CoRR Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto
2023	B	`conf`	Minimum Separator Reconfiguration. IPEC 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
2023	J	`jnl`	Minimum Separator Reconfiguration. CoRR 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
2023	J	`jnl`	Monotone Edge Flips to an Orientation of Maximum Edge-Connectivity à la Nash-Williams. ACM Trans. Algorithms Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2023	J	`jnl`	On reachable assignments under dichotomous preferences. Theor. Comput. Sci. Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2023	A*	`conf`	Reconfiguration of Colorings in Triangulations of the Sphere. SoCG Takehiro Ito, Yuni Iwamasa, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2023	A*	`conf`	Rerouting Planar Curves and Disjoint Paths. ICALP Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2022	J	`jnl`	A parameterized view to the robust recoverable base problem of matroids under structural uncertainty. Oper. Res. Lett. Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
2022	J	`jnl`	Core Challenge 2022: Solver and Graph Descriptions. CoRR Takehide Soh, Yoshio Okamoto, Takehiro Ito
2022	J	`jnl`	Linear-Time Recognition of Double-Threshold Graphs. Algorithmica Yusuke Kobayashi, Yoshio Okamoto, Yota Otachi, Yushi Uno
2022	A*	`conf`	Monotone edge flips to an orientation of maximum edge-connectivity à la Nash-Williams. SODA Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2022	B	`conf`	On Reachable Assignments Under Dichotomous Preferences. PRIMA Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2022	J	`jnl`	On Reachable Assignments under Dichotomous Preferences. CoRR Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2022	J	`jnl`	Reconfiguration of colorings in triangulations of the sphere. CoRR Takehiro Ito, Yuni Iwamasa, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2022	A*	`conf`	Reforming an Envy-Free Matching. AAAI Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2022	J	`jnl`	Reforming an Envy-Free Matching. CoRR Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2022	J	`jnl`	Rerouting Planar Curves and Disjoint Paths. CoRR Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2022	J	`jnl`	Shortest Reconfiguration of Perfect Matchings via Alternating Cycles. SIAM J. Discret. Math. Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
2022	J	`jnl`	Submodular reassignment problem for reallocating agents to tasks with synergy effects. Discret. Optim. Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
2022	A*	`conf`	Unlabeled Multi-Robot Motion Planning with Tighter Separation Bounds. SoCG Bahareh Banyassady, Mark de Berg, Karl Bringmann, Kevin Buchin, Henning Fernau, Dan Halperin, Irina Kostitsyna, Yoshio Okamoto, Stijn Slot
2022	J	`jnl`	Unlabeled Multi-Robot Motion Planning with Tighter Separation Bounds. CoRR Bahareh Banyassady, Mark de Berg, Karl Bringmann, Kevin Buchin, Henning Fernau, Dan Halperin, Irina Kostitsyna, Yoshio Okamoto, Stijn Slot
2022	J	`jnl`	Weight balancing on boundaries. J. Comput. Geom. Luis Barba, Otfried Cheong, Michael Gene Dobbins, Rudolf Fleischer, Akitoshi Kawamura, Matias Korman, Yoshio Okamoto, János Pach, Yuan Tang, Takeshi Tokuyama, Sander Verdonschot
2021	J	`jnl`	Algorithmic enumeration of surrounding polygons. Discret. Appl. Math. Katsuhisa Yamanaka, David Avis, Takashi Horiyama, Yoshio Okamoto, Ryuhei Uehara, Tanami Yamauchi
2021	J	`jnl`	Algorithms for gerrymandering over graphs. Theor. Comput. Sci. Takehiro Ito, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
2021	J	`jnl`	ClusterSets: Optimizing Planar Clusters in Categorical Point Data. Comput. Graph. Forum Jakob Geiger, Sabine Cornelsen, Jan-Henrik Haunert, Philipp Kindermann, Tamara Mchedlidze, Martin Nöllenburg, Yoshio Okamoto, Alexander Wolff
2021	J	`jnl`	Monotone edge flips to an orientation of maximum edge-connectivity à la Nash-Williams. CoRR Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2021	J	`jnl`	Rectilinear link diameter and radius in a rectilinear polygonal domain. Comput. Geom. Elena Arseneva, Man-Kwun Chiu, Matias Korman, Aleksandar Markovic, Yoshio Okamoto, Aurélien Ooms, André van Renssen, Marcel Roeloffzen
2020	—	`ch.`	Angular Resolutions: Around Vertices and Crossings. Beyond Planar Graphs Yoshio Okamoto
2020	J	`jnl`	Balanced line separators of unit disk graphs. Comput. Geom. Paz Carmi, Man-Kwun Chiu, Matthew J. Katz, Matias Korman, Yoshio Okamoto, André van Renssen, Marcel Roeloffzen, Taichi Shiitada, Shakhar Smorodinsky
2020	J	`jnl`	Guest Editorial: Selected Papers from ISAAC 2017. Algorithmica Yoshio Okamoto
2020	B	`conf`	Linear-Time Recognition of Double-Threshold Graphs. WG Yusuke Kobayashi, Yoshio Okamoto, Yota Otachi, Yushi Uno
2020	J	`jnl`	Subgraph Isomorphism on Graph Classes that Exclude a Substructure. Algorithmica Hans L. Bodlaender, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi, Yoshio Okamoto, Yota Otachi, Tom C. van der Zanden
2019	A	`conf`	Algorithms for Gerrymandering over Graphs. AAMAS Takehiro Ito, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
2019	J	`jnl`	Area bounds of rectilinear polygons realized by angle sequences. Comput. Geom. Sang Won Bae, Yoshio Okamoto, Chan-Su Shin
2019	J	`jnl`	Computing the geodesic centers of a polygonal domain. Comput. Geom. Sang Won Bae, Matias Korman, Yoshio Okamoto
2019	A	`conf`	Graphs with Large Total Angular Resolution. GD Oswin Aichholzer, Matias Korman, Yoshio Okamoto, Irene Parada, Daniel Perz, André van Renssen, Birgit Vogtenhuber
2019	J	`jnl`	Graphs with large total angular resolution. CoRR Oswin Aichholzer, Matias Korman, Yoshio Okamoto, Irene Parada, Daniel Perz, André van Renssen, Birgit Vogtenhuber
2019	J	`jnl`	Linear-Time Recognition of Double-Threshold Graphs. CoRR Yusuke Kobayashi, Yoshio Okamoto, Yota Otachi, Yushi Uno
2019	J	`jnl`	Minimum-Cost b-Edge Dominating Sets on Trees. Algorithmica Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
2019	J	`jnl`	Reconfiguration of maximum-weight b-matchings in a graph. J. Comb. Optim. Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
2019	J	`jnl`	Sequentially Swapping Colored Tokens on Graphs. J. Graph Algorithms Appl. Katsuhisa Yamanaka, Erik D. Demaine, Takashi Horiyama, Akitoshi Kawamura, Shin-Ichi Nakano, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno
2019	A	`conf`	Shortest Reconfiguration of Perfect Matchings via Alternating Cycles. ESA Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
2019	J	`jnl`	Shortest Reconfiguration of Perfect Matchings via Alternating Cycles. CoRR Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
2019	C	`conf`	Subgraph Isomorphism on Graph Classes that Exclude a Substructure. CIAC Hans L. Bodlaender, Tesshu Hanaka, Yoshio Okamoto, Yota Otachi, Tom C. van der Zanden
2019	J	`jnl`	Subgraph Isomorphism on Graph Classes that Exclude a Substructure. CoRR Hans L. Bodlaender, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi, Yoshio Okamoto, Yota Otachi, Tom C. van der Zanden
2019	A	`conf`	Variants of the Segment Number of a Graph. GD Yoshio Okamoto, Alexander Ravsky, Alexander Wolff
2019	J	`jnl`	Variants of the Segment Number of a Graph. CoRR Yoshio Okamoto, Alexander Ravsky, Alexander Wolff
2018	C	`conf`	Computational Complexity of Robot Arm Simulation Problems. IWOCA Tianfeng Feng, Takashi Horiyama, Yoshio Okamoto, Yota Otachi, Toshiki Saitoh, Takeaki Uno, Ryuhei Uehara
2018	Misc	`conf`	Exact Algorithms for the Max-Min Dispersion Problem. FAW Toshihiro Akagi, Tetsuya Araki, Takashi Horiyama, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara, Takeaki Uno, Kunihiro Wasa
2018	A	`conf`	Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity. GD Evmorfia N. Argyriou, Sabine Cornelsen, Henry Förster, Michael Kaufmann, Martin Nöllenburg, Yoshio Okamoto, Chrysanthi N. Raftopoulou, Alexander Wolff
2018	J	`jnl`	Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity. CoRR Evmorfia N. Argyriou, Sabine Cornelsen, Henry Förster, Michael Kaufmann, Martin Nöllenburg, Yoshio Okamoto, Chrysanthi N. Raftopoulou, Alexander Wolff
2018	B	`conf`	Rectilinear Link Diameter and Radius in a Rectilinear Polygonal Domain. ISAAC Elena Arseneva, Man-Kwun Chiu, Matias Korman, Aleksandar Markovic, Yoshio Okamoto, Aurélien Ooms, André van Renssen, Marcel Roeloffzen
2017	B	`ed.`	28th International Symposium on Algorithms and Computation, ISAAC 2017, Phuket, Thailand, December 9-12, 2017 ISAAC Yoshio Okamoto, Takeshi Tokuyama
2017	B	`conf`	Balanced Line Separators of Unit Disk Graphs. WADS Paz Carmi, Man-Kwun Chiu, Matthew J. Katz, Matias Korman, Yoshio Okamoto, André van Renssen, Marcel Roeloffzen, Taichi Shiitada, Shakhar Smorodinsky
2017	J	`jnl`	Balanced Line Separators of Unit Disk Graphs. CoRR Paz Carmi, Man-Kwun Chiu, Matthew J. Katz, Matias Korman, Yoshio Okamoto, André van Renssen, Marcel Roeloffzen, Taichi Shiitada, Shakhar Smorodinsky
2017	J	`jnl`	Computing the L Discret. Comput. Geom. Sang Won Bae, Matias Korman, Joseph S. B. Mitchell, Yoshio Okamoto, Valentin Polishchuk, Haitao Wang
2017	J	`jnl`	Efficient stabilization of cooperative matching games. Theor. Comput. Sci. Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
2017	A*	`conf`	Folding Free-Space Diagrams: Computing the Fréchet Distance between 1-Dimensional Curves (Multimedia Contribution). SoCG Kevin Buchin, Jinhee Chun, Maarten Löffler, Aleksandar Markovic, Wouter Meulemans, Yoshio Okamoto, Taichi Shiitada
2017	J	`jnl`	General Constructions of Rational Secret Sharing with Expected Constant-Round Reconstruction. Comput. J. Akinori Kawachi, Yoshio Okamoto, Keisuke Tanaka, Kenji Yasunaga
2017	Misc	`conf`	Reconfiguration of Maximum-Weight b-Matchings in a Graph. COCOON Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
2017	J	`jnl`	Rectilinear Link Diameter and Radius in a Rectilinear Polygonal Domain. CoRR Man-Kwun Chiu, Elena Khramtcova, Matias Korman, Aleksandar Markovic, Yoshio Okamoto, Aurélien Ooms, André van Renssen, Marcel Roeloffzen
2017	J	`jnl`	Sankaku-tori: An Old Western-Japanese Game Played on a Point Set. J. Inf. Process. Takashi Horiyama, Takashi Iizuka, Masashi Kiyomi, Yoshio Okamoto, Ryuhei Uehara, Takeaki Uno, Yushi Uno, Yukiko Yamauchi
2017	B	`conf`	Sequentially Swapping Colored Tokens on Graphs. WALCOM Katsuhisa Yamanaka, Erik D. Demaine, Takashi Horiyama, Akitoshi Kawamura, Shin-Ichi Nakano, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno
2017	—	`conf`	Tight Approximability of the Server Allocation Problem for Real-Time Applications. ALGOCLOUD Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto, Taichi Shiitada
2016	J	`jnl`	A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares. Comput. Geom. Takehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno
2016	A	`conf`	Approximation and Hardness of Token Swapping. ESA Tillmann Miltzow, Lothar Narins, Yoshio Okamoto, Günter Rote, Antonis Thomas, Takeaki Uno
2016	A	`conf`	Computing the L1 Geodesic Diameter and Center of a Polygonal Domain. STACS Sang Won Bae, Matias Korman, Joseph S. B. Mitchell, Yoshio Okamoto, Valentin Polishchuk, Haitao Wang
2016	A	`conf`	Efficient Stabilization of Cooperative Matching Games. AAMAS Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
2016	J	`jnl`	Extended formulations for sparsity matroids. Math. Program. Satoru Iwata, Naoyuki Kamiyama, Naoki Katoh, Shuji Kijima, Yoshio Okamoto
2016	J	`jnl`	On Problems as Hard as CNF-SAT. ACM Trans. Algorithms Marek Cygan, Holger Dell, Daniel Lokshtanov, Dániel Marx, Jesper Nederlof, Yoshio Okamoto, Ramamohan Paturi, Saket Saurabh, Magnus Wahlström
2016	J	`jnl`	On the treewidth of toroidal grids. Discret. Appl. Math. Masashi Kiyomi, Yoshio Okamoto, Yota Otachi
2016	J	`jnl`	Theory and Applications of Geometric Optimization (NII Shonan Meeting 2016-9). NII Shonan Meet. Rep. Siu-Wing Cheng, Yoshio Okamoto, Otfried Cheong
2016	J	`jnl`	Tight Exact and Approximate Algorithmic Results on Token Swapping. CoRR Tillmann Miltzow, Lothar Narins, Yoshio Okamoto, Günter Rote, Antonis Thomas, Takeaki Uno
2016	—	`ch.`	Traveling Sales Person with Few Inner Points. Encyclopedia of Algorithms Yoshio Okamoto
2015	J	`jnl`	Computing the Geodesic Centers of a Polygonal Domain. CoRR Sang Won Bae, Matias Korman, Yoshio Okamoto
2015	J	`jnl`	Computing the L CoRR Sang Won Bae, Matias Korman, Joseph S. B. Mitchell, Yoshio Okamoto, Valentin Polishchuk, Haitao Wang
2015	J	`jnl`	Computing the L1 geodesic diameter and center of a simple polygon in linear time. Comput. Geom. Sang Won Bae, Matias Korman, Yoshio Okamoto, Haitao Wang
2015	J	`jnl`	Free Edge Lengths in Plane Graphs. Discret. Comput. Geom. Zachary Abel, Robert Connelly, Sarah Eisenstat, Radoslav Fulek, Filip Moric, Yoshio Okamoto, Tibor Szabó, Csaba D. Tóth
2015	J	`jnl`	Polynomial-time approximability of the k-Sink Location problem. CoRR Rémy Belmonte, Yuya Higashikawa, Naoki Katoh, Yoshio Okamoto
2015	J	`jnl`	Swapping labeled tokens on graphs. Theor. Comput. Sci. Katsuhisa Yamanaka, Erik D. Demaine, Takehiro Ito, Jun Kawahara, Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Kei Uchizawa, Takeaki Uno
2015	J	`jnl`	Weight Balancing on Boundaries and Skeletons. CoRR 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, Tianhao Wang
2014	J	`jnl`	A 4.31-approximation for the geometric unique coverage problem on unit disks. Theor. Comput. Sci. Takehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno
2014	J	`jnl`	Approximating the path-distance-width for AT-free graphs and graphs in related classes. Discret. Appl. Math. Yota Otachi, Toshiki Saitoh, Katsuhisa Yamanaka, Shuji Kijima, Yoshio Okamoto, Hirotaka Ono, Yushi Uno, Koichi Yamazaki
2014	J	`jnl`	Computational Complexity and an Integer Programming Model of Shakashaka. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Erik D. Demaine, Yoshio Okamoto, Ryuhei Uehara, Yushi Uno
2014	—	`conf`	Computing the Geodesic Centers of a Polygonal Domain. CCCG Sang Won Bae, Matias Korman, Yoshio Okamoto
2014	B	`conf`	Computing the L 1 Geodesic Diameter and Center of a Simple Polygon in Linear Time. LATIN Sang Won Bae, Matias Korman, Yoshio Okamoto, Haitao Wang
2014	J	`jnl`	Extended Formulations for Sparsity Matroids. CoRR Satoru Iwata, Naoyuki Kamiyama, Naoki Katoh, Shuji Kijima, Yoshio Okamoto
2014	A*	`conf`	Free Edge Lengths in Plane Graphs. SoCG Zachary Abel, Robert Connelly, Sarah Eisenstat, Radoslav Fulek, Filip Moric, Yoshio Okamoto, Tibor Szabó, Csaba D. Tóth
2014	B	`conf`	Minimum-Cost b -Edge Dominating Sets on Trees. ISAAC Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
2014	Misc	`conf`	Sankaku-Tori: An Old Western-Japanese Game Played on a Point Set. FUN Takashi Horiyama, Masashi Kiyomi, Yoshio Okamoto, Ryuhei Uehara, Takeaki Uno, Yushi Uno, Yukiko Yamauchi
2014	B	`conf`	Semantic Word Cloud Representations: Hardness and Approximation Algorithms. LATIN Lukas Barth, Sara Irina Fabrikant, Stephen G. Kobourov, Anna Lubiw, Martin Nöllenburg, Yoshio Okamoto, Sergey Pupyrev, Claudio Squarcella, Torsten Ueckerdt, Alexander Wolff
2014	J	`jnl`	Submodularity of minimum-cost spanning tree games. Networks Masayuki Kobayashi, Yoshio Okamoto
2014	Misc	`conf`	Swapping Labeled Tokens on Graphs. FUN Katsuhisa Yamanaka, Erik D. Demaine, Takehiro Ito, Jun Kawahara, Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Kei Uchizawa, Takeaki Uno
2014	A*	`conf`	Weight Balancing on Boundaries and Skeletons. SoCG 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, Tianhao Wang
2013	—	`conf`	Computational complexity and an integer programming model of Shakashaka. CCCG Erik D. Demaine, Yoshio Okamoto, Ryuhei Uehara, Yushi Uno
2013	J	`jnl`	Computing the L CoRR Sang Won Bae, Matias Korman, Yoshio Okamoto, Haitao Wang
2013	J	`jnl`	Exact and fixed-parameter algorithms for metro-line crossing minimization problems. CoRR Yoshio Okamoto, Yuichi Tatsu, Yushi Uno
2013	J	`jnl`	General Constructions of Rational Secret Sharing with Expected Constant-Round Reconstruction. IACR Cryptol. ePrint Arch. Akinori Kawachi, Yoshio Okamoto, Keisuke Tanaka, Kenji Yasunaga
2013	J	`jnl`	Guest Editorial: Selected Papers from ISAAC 2011. Algorithmica Takao Asano, Shin-Ichi Nakano, Yoshio Okamoto
2013	J	`jnl`	Guest Editors' Foreword. Int. J. Comput. Geom. Appl. Takao Asano, Shin-Ichi Nakano, Yoshio Okamoto
2013	J	`jnl`	Semantic Word Cloud Representations: Hardness and Approximation Algorithms. CoRR Lukas Barth, Sara Irina Fabrikant, Stephen G. Kobourov, Anna Lubiw, Martin Nöllenburg, Yoshio Okamoto, Sergey Pupyrev, Claudio Squarcella, Torsten Ueckerdt, Alexander Wolff
2013	J	`jnl`	The Geodesic Diameter of Polygonal Domains. Discret. Comput. Geom. Sang Won Bae, Matias Korman, Yoshio Okamoto
2013	J	`jnl`	The complexity of the stamp folding problem. Theor. Comput. Sci. Takuya Umesato, Toshiki Saitoh, Ryuhei Uehara, Hiro Ito, Yoshio Okamoto
2012	B	`conf`	A 4.31-Approximation for the Geometric Unique Coverage Problem on Unit Disks. ISAAC Takehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno
2012	—	`conf`	A Polynomial-Time Approximation Scheme for the Geometric Unique Coverage Problem on Unit Squares. SWAT Takehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno
2012	B	`conf`	Area Bounds of Rectilinear Polygons Realized by Angle Sequences. ISAAC Sang Won Bae, Yoshio Okamoto, Chan-Su Shin
2012	J	`jnl`	Drawing (Complete) Binary Tanglegrams - Hardness, Approximation, Fixed-Parameter Tractability. Algorithmica Kevin Buchin, Maike Buchin, Jaroslaw Byrka, Martin Nöllenburg, Yoshio Okamoto, Rodrigo I. Silveira, Alexander Wolff
2012	J	`jnl`	Efficient Enumeration of the Directed Binary Perfect Phylogenies from Incomplete Data CoRR Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh
2012	B	`conf`	Efficient Enumeration of the Directed Binary Perfect Phylogenies from Incomplete Data. SEA Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh
2012	J	`jnl`	Guest Editors' Foreword. Int. J. Comput. Geom. Appl. Otfried Cheong, Yoshio Okamoto
2012	J	`jnl`	Minimum and maximum against k lies. Chic. J. Theor. Comput. Sci. Michael Hoffmann, Jirí Matousek, Yoshio Okamoto, Philipp Zumstein
2012	A	`conf`	On Problems as Hard as CNF-SAT. CCC Marek Cygan, Holger Dell, Daniel Lokshtanov, Dániel Marx, Jesper Nederlof, Yoshio Okamoto, Ramamohan Paturi, Saket Saurabh, Magnus Wahlström
2012	J	`jnl`	On bipartite powers of bigraphs. Discret. Math. Theor. Comput. Sci. Yoshio Okamoto, Yota Otachi, Ryuhei Uehara
2012	J	`jnl`	Querying two boundary points for shortest paths in a polygonal domain. Comput. Geom. Sang Won Bae, Yoshio Okamoto
2012	B	`conf`	Universal Point Subsets for Planar Graphs. ISAAC Patrizio Angelini, Carla Binucci, William S. Evans, Ferran Hurtado, Giuseppe Liotta, Tamara Mchedlidze, Henk Meijer, Yoshio Okamoto
2012	J	`jnl`	Vertex angle and crossing angle resolution of leveled tree drawings. Inf. Process. Lett. Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Yoshio Okamoto, Andreas Spillner
2011	J	`jnl`	A polynomial-time-delay and polynomial-space algorithm for enumeration problems in multi-criteria optimization. Eur. J. Oper. Res. Yoshio Okamoto, Takeaki Uno
2011	J	`jnl`	Adaptive Algorithms for Planar Convex Hull Problems. IEICE Trans. Inf. Syst. Hee-Kap Ahn, Yoshio Okamoto
2011	B	`ed.`	Algorithms and Computation - 22nd International Symposium, ISAAC 2011, Yokohama, Japan, December 5-8, 2011. Proceedings ISAAC Takao Asano, Shin-Ichi Nakano, Yoshio Okamoto, Osamu Watanabe
2011	B	`conf`	Approximability of the Path-Distance-Width for AT-free Graphs. WG Yota Otachi, Toshiki Saitoh, Katsuhisa Yamanaka, Shuji Kijima, Yoshio Okamoto, Hirotaka Ono, Yushi Uno, Koichi Yamazaki
2011	Misc	`conf`	Dominating Set Counting in Graph Classes. COCOON Shuji Kijima, Yoshio Okamoto, Takeaki Uno
2011	C	`conf`	Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem. TAMC Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno
2011	J	`jnl`	Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem. J. Graph Algorithms Appl. Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno
2011	J	`jnl`	Not All Saturated 3-Forests Are Tight CoRR Heidi Gebauer, Anna Gundert, Robin A. Moser, Yoshio Okamoto
2011	J	`jnl`	On Problems as Hard as CNFSAT CoRR Marek Cygan, Holger Dell, Daniel Lokshtanov, Dániel Marx, Jesper Nederlof, Yoshio Okamoto, Ramamohan Paturi, Saket Saurabh, Magnus Wahlström
2011	J	`jnl`	Submodular fractional programming for balanced clustering. Pattern Recognit. Lett. Yoshinobu Kawahara, Kiyohito Nagano, Yoshio Okamoto
2011	J	`jnl`	The Electron. J. Comb. Michael Hoffmann, Jirí Matousek, Yoshio Okamoto, Philipp Zumstein
2010	J	`jnl`	A Tight Lower Bound for Convexly Independent Subsets of the Minkowski Sums of Planar Point Sets. Electron. J. Comb. Ondrej Bílka, Kevin Buchin, Radoslav Fulek, Masashi Kiyomi, Yoshio Okamoto, Shin-ichi Tanigawa, Csaba D. Tóth
2010	Misc	`conf`	Adaptive Algorithms for Planar Convex Hull Problems. FAW Hee-Kap Ahn, Yoshio Okamoto
2010	J	`jnl`	Improved Bounds for Wireless Localization. Algorithmica Tobias Christ, Michael Hoffmann, Yoshio Okamoto, Takeaki Uno
2010	—	`conf`	Minimum and Maximum against SWAT Michael Hoffmann, Jirí Matousek, Yoshio Okamoto, Philipp Zumstein
2010	J	`jnl`	Minimum and maximum against k lies CoRR Michael Hoffmann, Jirí Matousek, Yoshio Okamoto, Philipp Zumstein
2010	J	`jnl`	On listing, sampling, and counting the chordal graphs with edge constraints. Theor. Comput. Sci. Shuji Kijima, Masashi Kiyomi, Yoshio Okamoto, Takeaki Uno
2010	J	`jnl`	The Geodesic Diameter of Polygonal Domains CoRR Sang Won Bae, Matias Korman, Yoshio Okamoto
2010	—	`conf`	The Geodesic Diameter of Polygonal Domains. ESA (1) Sang Won Bae, Matias Korman, Yoshio Okamoto
2009	B	`conf`	Counting the Number of Matchings in Chordal and Chordal Bipartite Graph Classes. WG Yoshio Okamoto, Ryuhei Uehara, Takeaki Uno
2009	J	`jnl`	Fast Exponential-Time Algorithms for the Forest Counting and the Tutte Polynomial Computation in Graph Classes. Int. J. Found. Comput. Sci. Heidi Gebauer, Yoshio Okamoto
2009	—	`conf`	How to make a picturesque maze. CCCG Yoshio Okamoto, Ryuhei Uehara
2009	J	`jnl`	Querying Two Boundary Points for Shortest Paths in a Polygonal Domain CoRR Sang Won Bae, Yoshio Okamoto
2009	B	`conf`	Querying Two Boundary Points for Shortest Paths in a Polygonal Domain. ISAAC Sang Won Bae, Yoshio Okamoto
2009	J	`jnl`	The Holt-Klee condition for oriented matroids. Eur. J. Comb. Komei Fukuda, Sonoko Moriyama, Yoshio Okamoto
2009	J	`jnl`	Untangling a Planar Graph. Discret. Comput. Geom. Xavier Goaoc, Jan Kratochvíl, Yoshio Okamoto, Chan-Su Shin, Andreas Spillner, Alexander Wolff
2008	—	`conf`	08431 Open Problems - Moderately Exponential Time Algorithms. 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
2008	J	`jnl`	Counting the number of independent sets in chordal graphs. J. Discrete Algorithms Yoshio Okamoto, Takeaki Uno, Ryuhei Uehara
2008	A	`conf`	Drawing (Complete) Binary Tanglegrams. GD Kevin Buchin, Maike Buchin, Jaroslaw Byrka, Martin Nöllenburg, Yoshio Okamoto, Rodrigo I. Silveira, Alexander Wolff
2008	J	`jnl`	Drawing (Complete) Binary Tanglegrams: Hardness, Approximation, Fixed-Parameter Tractability CoRR Kevin Buchin, Maike Buchin, Jaroslaw Byrka, Martin Nöllenburg, Yoshio Okamoto, Rodrigo I. Silveira, Alexander Wolff
2008	J	`jnl`	Fair cost allocations under conflicts - a game-theoretic point of view - . Discret. Optim. Yoshio Okamoto
2008	—	`conf`	Improved Bounds for Wireless Localization. SWAT Tobias Christ, Michael Hoffmann, Yoshio Okamoto, Takeaki Uno
2008	J	`jnl`	Local topology of the free complex of a two-dimensional generalized convex shelling. Discret. Math. Yoshio Okamoto
2008	Misc	`conf`	On Listing, Sampling, and Counting the Chordal Graphs with Edge Constraints. COCOON Shuji Kijima, Masashi Kiyomi, Yoshio Okamoto, Takeaki Uno
2008	—	`ch.`	Traveling Sales Person with Few Inner Points. Encyclopedia of Algorithms Yoshio Okamoto
2007	B	`conf`	A Polynomial-Time-Delay and Polynomial-Space Algorithm for Enumeration Problems in Multi-criteria Optimization. ISAAC Yoshio Okamoto, Takeaki Uno
2007	—	`conf`	Fast Exponential-Time Algorithms for the Forest Counting in Graph Classes. CATS Heidi Gebauer, Yoshio Okamoto
2007	J	`jnl`	Matroid representation of clique complexes. Discret. Appl. Math. Kenji Kashiwabara, Yoshio Okamoto, Takeaki Uno
2007	A	`conf`	Moving Vertices to Make Drawings Plane. GD Xavier Goaoc, Jan Kratochvíl, Yoshio Okamoto, Chan-Su Shin, Alexander Wolff
2007	J	`jnl`	Relationships between the class of unit grid intersection graphs and other classes of bipartite graphs. Discret. Appl. Math. Yota Otachi, Yoshio Okamoto, Koichi Yamazaki
2006	J	`jnl`	Core Stability of Minimum Coloring Games. Math. Oper. Res. Thomas Bietenhader, Yoshio Okamoto
2006	J	`jnl`	The Even Outdegree Conjecture for Acyclic IEICE Trans. Inf. Syst. Sonoko Moriyama, Yoshio Okamoto
2006	J	`jnl`	The minimum weight triangulation problem with few inner points. Comput. Geom. Michael Hoffmann, Yoshio Okamoto
2006	J	`jnl`	The traveling salesman problem with few inner points. Oper. Res. Lett. Vladimir G. Deineko, Michael Hoffmann, Yoshio Okamoto, Gerhard J. Woeginger
2005	B	`conf`	Linear-Time Counting Algorithms for Independent Sets in Chordal Graphs. WG Yoshio Okamoto, Takeaki Uno, Ryuhei Uehara
2005	J	`jnl`	The affine representation theorem for abstract convex geometries. Comput. Geom. Kenji Kashiwabara, Masataka Nakamura, Yoshio Okamoto
2004	B	`conf`	Core Stability of Minimum Coloring Games. WG Thomas Bietenhader, Yoshio Okamoto
2004	—	`conf`	The Minimum Weight Triangulation Problem with Few Inner Points. IWPEC Michael Hoffmann, Yoshio Okamoto
2004	Misc	`conf`	The Traveling Salesman Problem with Few Inner Points. COCOON Vladimir G. Deineko, Michael Hoffmann, Yoshio Okamoto, Gerhard J. Woeginger
2004	J	`jnl`	Traveling salesman games with the Monge property. Discret. Appl. Math. Yoshio Okamoto
2003	J	`jnl`	A greedy algorithm for convex geometries. Discret. Appl. Math. Kenji Kashiwabara, Yoshio Okamoto
2003	B	`conf`	Fair Cost Allocations under Conflicts - A Game-Theoretic Point of View. ISAAC Yoshio Okamoto
2003	B	`conf`	Greedy Edge-Disjoint Paths in Complete Graphs. WG Paz Carmi, Thomas Erlebach, Yoshio Okamoto
2003	Misc	`conf`	Matroid Representation of Clique Complexes. COCOON Kenji Kashiwabara, Yoshio Okamoto, Takeaki Uno
2003	J	`jnl`	Some properties of the core on convex geometries. Math. Methods Oper. Res. Yoshio Okamoto
2003	J	`jnl`	Submodularity of some classes of the combinatorial optimization games. Math. Methods Oper. Res. Yoshio Okamoto
2003	J	`jnl`	The forbidden minor characterization of line-search antimatroids of rooted digraphs. Discret. Appl. Math. Yoshio Okamoto, Masataka Nakamura