Published papers
Number of published data : 121
No. Classification Refereed paper Title Authorship Author Journal Volume/issue/page Publication date ISSN DOI URL
1 Paper
Yes
A parameterized view to the robust recoverable base problem of matroids under structural uncertainty
Joint
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
Operations Research Letters
50, 370-375
2022



2 Paper
Yes
Submodular Reassignment Problem for Reallocating Agents to Tasks with Synergy Effects
Joint
Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
Discrete Optimization
44
2022



3 Paper
Yes
Shortest Reconfiguration of Perfect Matchings via Alternating Cycles
Joint
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
SIAM Journal on Discrete Mathematics
36, 1102-1123
2022



4 Paper
Yes
Weight balancing on boundaries
Joint
Luis Barba, Otfried Cheong, Michael Gene Dobbins, Rudolf Fleischer, Akitoshi Kawamura, Matias Korman, Yoshio Okamoto, János Pach, Yuan Tang, Takeshi Tokuyama, Sander Verdonschot
Journal of Computational Geometry
13/ 1, 1-12
2022



5 Paper
Yes
Linear-Time Recognition of Double-Threshold Graphs
Joint
Yusuke Kobayashi, Yoshio Okamoto, Yota Otachi, Yushi Uno
Algorithmica
84, 1163-1181
2022



6 Paper
Yes
Rectilinear Link Diameter and Radius in a Rectilinear Polygonal Domain
Joint
Elena Arseneva, Man-Kwun Chiu, Matias Korman, Aleksandar Markovic, Yoshio Okamoto, Aurélien Ooms, André van Renssen, Marcel Roeloffzen
Computational Geometry: Theory and Applications
92
2021



7 Paper
Yes
Algorithmic Enumeration of Surrounding Polygons

Katsuhisa Yamanaka, David Avis, Takashi Horiyama, Yoshio Okamoto, Ryuhei Uehara, Tanami Yamauchi
Discrete Applied Mathematics
303, 305-313
2021



8 Paper
Yes
Algorithms for Gerrymandering Over Graphs
Joint
Takehiro Ito, Naoyuki Kamiyama, Yusuke Kobayashi, and Yoshio Okamoto
Theoretical Computer Science
868, 30-45
2021



9 Paper
Yes
Subgraph Isomorphism on Graph Classes that Exclude a Substructure
Joint
Hans L. Bodlaender, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi, Yoshio Okamoto, Yota Otachi, and Tom C. van der Zanden
Algorithmica
82, 3566-3587
2020



10 Paper
Yes
Balanced line separators of unit disk graphs
Joint
Paz Carmi, Man Kwun Chiu, Matthew J. Katz, Matias Korman, Yoshio Okamoto, André van Renssen, Marcel Roeloffzen, Taichi Shiitada, and Shakhar Smorodinsky
Computational Geometry: Theory and Applications
86
2020/01



11 Paper
Yes
Area bounds of rectilinear polygons realized by angle sequences
Joint
Sang Won Bae, Yoshio Okamoto, Chan-Su Shin
Computational Geometry: Theory and Applications
83, 9-29
2019



12 Paper
Yes
Minimum-Cost b-Edge Dominating Sets on Trees
Joint
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
Algorithmica
81, 343-366
2019



13 Paper
Yes
Sankaku-Tori: An Old Western-Japanese Game Played on a Point Set
Joint
Takashi Horiyama, Takashi Iizuka, Masashi Kiyomi, Yoshio Okamoto, Ryuhei Uehara, Takeaki Uno, Yushi Uno, and Yukiko Yamauchi
Journal of Information Processing
25, 708-715
2017



14 Paper
Yes
General Constructions of Rational Secret Sharing with Expected Constant-Round Reconstruction
Joint
Akinori Kawachi, Yoshio Okamoto, Keisuke Tanaka, and Kenji Yasunaga
The Computer Journal
60, 711-728
2017



15 Paper
Yes
Efficient Stabilization of Cooperative Matching Games
Joint
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, and Yoshio Okamoto
Theoretical Computer Science
677, 69-82
2017



16 Paper
Yes
Computing the L1 Geodesic Diameter and Center of a Polygonal Domain

Sang Won Bae, Matias Korman, Joseph Mitchell, Yoshio Okamoto, Valentin Polishchuk, Haitao Wang
Discrete & Computational Geometry
57, 674-701
2017



17 Paper
Yes
Extended formulations for sparsity matroids

Satoru Iwata, Naoyuki Kamiyama, Naoki Katoh, Shuji Kijima, and Yoshio Okamoto
Mathematical Programming
158, 565-574
2016



18 Paper
Yes
On problems as hard as CNF-SAT
Joint
Marek Cygan, Holger Dell, Daniel Lokshtanov, Dániel Marx, Jesper Nederlof, Yoshio Okamoto, Ramamohan Paturi, Saket Saurabh, and Magnus Wahlström
ACM Transactions on Algorithms
12/ 3
2016



19 Paper
Yes
On the treewidth of toroidal grids
Joint
Masashi Kiyomi, Yoshio Okamoto, Yota Otachi
Discrete Applied Mathematics
198, 303-306
2016



20 Paper
Yes
A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares
Joint
Takehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno
Computational Geometry: Theory and Applications
51, 25-39
2016



21 Paper
Yes
Free edge lengths in plane graphs

Zachary Abel, Robert Connelly, Sarah Eisenstat, Radoslav Fulek, Filip Morić, Yoshio Okamoto, Tibor Szabó, and Csaba Tóth,
Discrete & Computational Geometry
54/ 1, 259-289
2015



22 Paper
Yes
Swapping labeled tokens on graphs

Katsuhisa Yamanaka, Erik D. Demaine, Takehiro Ito, Jun Kawahara, Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Kei Uchizawa, and Takeaki Uno
Theoretical Computer Science
586, 81-94
2015



23 Paper
Yes
Computing the L1 geodesic diameter and center of a simple polygon in linear time

Sang Won Bae, Matias Korman, Yoshio Okamoto, Haitao Wang
Computational Geometry: Theory and Applications
48, 495-505
2015



24 Paper
Yes
Computational complexity and an integer programming model of Shakashaka
Joint
Erik D. Demaine, Yoshio Okamoto, Ryuhei Uehara, and Yushi Uno
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
E97-A, 1213-1219
2014



25 Paper
Yes
Approximating the path-distance-width for AT-free graphs and graphs in related classes
Joint
Yota Otachi, Toshiki Saitoh, Katsuhisa Yamanaka, Shuji Kijima, Yoshio Okamoto, Hirotaka Ono, Yushi Uno, Koichi Yamazaki
Discrete Applied Mathematics
168, 69-77
2014



26 Paper
Yes
Submodularity of minimum-cost spanning tree games
Joint
Masayuki Kobayashi, Yoshio Okamoto
Networks
63, 231-238
2014



27 Paper
Yes
The geodesic diameter of polygonal domains

Sang Won Bae, Matias Korman, Yoshio Okamoto
Discrete & Computational Geometry
50/ 2, 306-329
2013/09



28 Paper
Yes
The complexity of the stamp folding problem

Takuya Umesato, Toshiki Saitoh, Ryuhei Uehara, Hiro Ito, Yoshio Okamoto
Theoretical Computer Science
497, 13-19
2013/07



29 Paper
Yes
On bipartite powers of bigraphs

Yoshio Okamoto, Yota Otachi, Ryuhei Uehara
Discrete Mathematics & Theoretical Computer Science
14/ 2, 11-20
2012



30 Paper
Yes
Reverse preferential spread in complex networks

Hiroshi Toyoizumi, Seiichi Tani, Naoto Miyoshi, Yoshio Okamoto
Physical Review E
021103
2012



31 Paper
Yes
Minimum and maximum against k lies

Michael Hoffmann, Jiri Matousek, Yoshio Okamoto, Philipp Zumstein
Chicago Journal of Theoretical Computer Science
2012/ 2, 1-10
2012



32 Paper
Yes
Vertex angle and crossing angle resolution of leveled tree drawings

Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Yoshio Okamoto, Andreas Spillner
Information Processing Letters
112/ 16, 630-635
2012



33 Paper
Yes
Drawing (complete) binary tanglegrams: Hardness, approximation, fixed-parameter tractability

Kevin Buchin, Maike Buchin, Jaroslaw Byrka, Martin Noellenburg, Yoshio Okamoto, Rodrigo I. Silveira, Alexander Wolff
Algorithmica
62, 309-332
2012



34 Paper
Yes
Querying two boundary points for shortest paths in a polygonal domain

Sang Won Bae, Yoshio Okamoto
Computational Geometry: Theory and Applications
45/ 7, 284-293
2012/08



35 Paper
Yes
Submodular fractional programming for balanced clustering

Yoshinobu Kawahara, Kiyohito Nagano, Yoshio Okamoto
Pattern Recognition Letters
32, 235-243
2011



36 Paper
Yes
A polynomial-time-delay polynomial-space algorithm for enumeration problems in multi-criteria optimization

Yoshio Okamoto, Takeaki Uno
European Journal of Operational Research
210, 48-56
2011



37 Paper
Yes
Adaptive algorithms for planar convex hull problems

Hee-Kap Ahn, Yoshio Okamoto
IEICE Transactions on Information and Systems
E94-D, 182-189
2011



38 Paper
Yes
The t-pebbling number is eventually linear in t

Michael Hoffmann, Jiří Matoušek, Yoshio Okamoto, Philipp Zumstein
The Electronic Journal of Combinatorics
18/ 1
2011



39 Paper
Yes
Hardness results and an exact exponential algorithm for the spanning tree congestion problem

Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno
Journal of Graph Algorithms and Applications
15, 727-751
2011



40 Paper
Yes
On listing, sampling, and counting the chordal graphs with edge constraints

Shuji Kijima, Masashi Kiyomi, Yoshio Okamoto, Takeaki Uno
Theoretical Computer Science
411, 2591-2601
2010



41 Paper
Yes
A tight lower bound for convexly independent subsets of the Minkowski sums of planar point sets

Ondrej Bilka, Kevin Buchin, Radoslav Fulek, Masashi Kiyomi, Yoshio Okamoto, Shin-ichi Tanigawa, Csaba D. Toth
The Electronic Journal of Combinatorics
17
2010



42 Paper
Yes
The Holt-Klee condition for oriented matroids

Komei Fukuda, Sonoko Moriyama, Yoshio Okamoto
European Journal of Combinatorics
30, 1854-1867
2009



43 Paper
Yes
Untangling a planar graph

Xavier Goaoc, Jan Kratochvil, Yoshio Okamoto, Chan-Su Shin, Andreas Spillner, Alexander Wolff
Discrete & Computational Geometry
42, 542-569
2009



44 Paper
Yes
Fair cost allocations under conflicts --- a game-theoretic point of view ---

Yoshio Okamoto
Discrete Optimization
5, 1-18
2008



45 Paper
Yes
Counting the number of independent sets in chordal graphs

Yoshio Okamoto, Takeaki Uno, Ryuhei Uehara
Journal of Discrete Algorithms
6, 229-242
2008



46 Paper
Yes
Local topology of the free complex of a two-dimensional generalized convex shelling

Yoshio Okamoto
Discrete Mathematics
308, 3836-3846
2008



47 Paper
Yes
Matroid representation of clique complexes

Kenji Kashiwabara, Yoshio Okamoto, Takeaki Uno
Discrete Applied Mathematics
155, 1910-1929
2007



48 Paper
Yes
Relationships between the class of unit grid intersection graphs and other classes of bipartite graphs

Yota Otachi, Yoshio Okamoto, Koichi Yamazaki
Discrete Applied Mathematics
155, 2383-2390
2007



49 Paper
Yes
The traveling salesman problem with few inner points

Vladimir G. Deineko, Michael Hoffmann, Yoshio Okamoto, Gerhard J. Woeginger
Operations Research Letters
34, 106-110
2006



50 Paper
Yes
The minimum weight triangulation problem with few inner points

Michael Hoffmann, Yoshio Okamoto
Computational Geometry: Theory and Applications
34, 149-158
2006



51 Paper
Yes
Core stability of minimum coloring games

Thomas Bietenhader, Yoshio Okamoto
Mathematics of Operations Research
31, 418-431
2006



52 Paper
Yes
Traveling salesman games with the Monge property

Yoshio Okamoto
Discrete Applied Mathematics
138, 349-369
2004



53 Paper
Yes
Submodularity of some classes of the combinatorial optimization games

Yoshio Okamoto
Mathematical Methods of Operations Research
58, 131-139
2003



54 Paper
Yes
A greedy algorithm for convex geometries

Kenji Kashiwabara, Yoshio Okamoto
Discrete Applied Mathematics
131, 449-465
2003



55 Paper
Yes
The forbidden minor characterization of line-search antimatroids of rooted digraphs

Yoshio Okamoto, Masataka Nakamura
Discrete Applied Mathematics
131, 523-533
2003



56 Paper
Yes
Some properties of the core on convex geometries

Yoshio Okamoto
Mathematical Methods of Operations Research
56, 377-386
2002



57 Invited paper
Yes
Reconfiguration of Maximum-Weight b-Matchings in a Graph
Joint
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
Journal of Combinatorial Optimization
37, 454-464
2019



58 Invited paper
Yes
Sequentially Swapping Colored Tokens on Graphs
Joint
Katsuhisa Yamanaka, Erik D. Demaine, Takashi Horiyama, Akitoshi Kawamura, Shin-Ichi Nakano, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno
Journal of Graph Algorithms and Applications
23, 3-27
2019



59 Invited paper
Yes
Computing the Geodesic Centers of a Polygonal Domain
Joint
Sang Won Bae, Matias Korman, Yoshio Okamoto
Computational Geometry: Theory and Applications
77, 3-9
2019



60 Invited paper
Yes
A 4.31-approximation for the geometric unique coverage problem on unit disks
Joint
Takehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, and Yushi Uno
Theoretical Computer Science
544, 14-31
2014

10.1016/j.tcs.2014.04.014

61 Invited paper
Yes
Improved bounds for wireless localization

Tobias Christ, Michael Hoffmann, Yoshio Okamoto, Takeaki Uno
Algorithmica
57, 499-516
2010



62 Invited paper
Yes
Fast exponential-time algorithms for the forest counting and the Tutte polynomial computation in graph classes

Heidi Gebauer, Yoshio Okamoto
International Journal of Foundations of Computer Science
20, 25-44
2009



63 Invited paper
Yes
The even outdegree conjecture for acyclic PLCP-cubes in dimension five

Sonoko Moriyama, Yoshio Okamoto
IEICE Transactions on Information and Systems
E89-D, 2402-2404
2006



64 Invited paper
Yes
The affine representation theorem for abstract convex geometries

Kenji Kashiwabara, Masataka Nakamura, Yoshio Okamoto
Computational Geometry: Theory and Applications
30, 129-144
2005



65 International conference proceedings, etc.
Yes
Unlabeled Multi-Robot Motion Planning with Tighter Separation Bounds
Joint
Bahareh Banyassady, Mark de Berg, Karl Bringmann, Kevin Buchin, Henning Fernau, Dan Halperin, Irina Kostitsyna, Yoshio Okamoto, Stijn Slot
Proceedings of 38th International Symposium on Computational Geometry (SoCG 2022)
12:1-12:16
2022



66 International conference proceedings, etc.
Yes
Reforming an Envy-Free Matching
Joint
Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
Proceedings of the 36th AAAI Conference on Artificial Intelligence (AAAI 2022)
5084-5091
2022



67 International conference proceedings, etc.
Yes
Monotone edge flips to an orientation of maximum edge-connectivity à la Nash-Williams
Joint
Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
Proceedings of 33rd ACM-SIAM Symposium on Discrete Algorithms, (SODA 2022)
1342-1355
2022



68 International conference proceedings, etc.
Yes
ClusterSets: Optimizing planar clusters in categorical point data
Joint
Jakob Geiger, Sabine Cornelsen, Jan-Henrik Haunert, Philipp Kindermann, Tamara Mchedlidze, Martin Nöllenburg, Yoshio Okamoto, and Alexander Wolff
Proceedings of 23rd EG Conference on Visualization (EuroVis 2021), Computer Graphics Forum
40, 471-481
2021



69 International conference proceedings, etc.
Yes
Linear-Time Recognition of Double-Threshold Graphs
Joint
Yusuke Kobayashi, Yoshio Okamoto, Yota Otachi and Yushi Uno
Proceedings of 46th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2020)
286-297
2020



70 International conference proceedings, etc.
Yes
Variants of the Segment Number of a Graph
Joint
Yoshio Okamoto, Alexander Ravsky, Alexander Wolff
Proceedings of 27th International Symposium on Graph Drawing and Network Visualization (GD 2019)
430-443
2019



71 International conference proceedings, etc.
Yes
Graphs with Large Total Angular Resolution
Joint
Oswin Aichholzer, Matias Korman, Yoshio Okamoto, Irene Parada, Daniel Perz, André van Renssen, Birgit Vogtenhuber
Proceedings of 27th International Symposium on Graph Drawing and Network Visualization (GD 2019)
193-199
2019



72 International conference proceedings, etc.
Yes
Shortest Reconfiguration of Perfect Matchings via Alternating Cycles
Joint
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
Proceedings of the 27th Annual European Symposium on Algorithms (ESA 2019)
61:1-61:15
2019



73 International conference proceedings, etc.
Yes
Algorithms for Gerrymandering Over Graphs
Joint
Takehiro Ito, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
Proceedings of the 18th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2019)
1413-1421
2019



74 International conference proceedings, etc.
Yes
Subgraph Isomorphism on Graph Classes that Exclude a Substructure
Joint
Hans L. Bodlaender, Tesshu Hanaka, Yoshio Okamoto, Yota Otachi, Tom C. van der Zanden
Proceedings of 11th International Conference on Algorithms and Complexity (CIAC 2019)
87-98
2019



75 International conference proceedings, etc.
Yes
Rectilinear Link Diameter and Radius in a Rectilinear Polygonal Domain
Joint
Elena Arseneva, Man-Kwun Chiu, Matias Korman, Aleksandar Markovic, Yoshio Okamoto, Aurélien Ooms, André van Renssen, Marcel Roeloffzen
Proceedings of 29th International Symposium on Algorithms and Computation (ISAAC 2018)
58:1-58:13
2018



76 International conference proceedings, etc.
Yes
Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity
Joint
Evmorfia Argyriou, Sabine Cornelsen, Henry Förster, Michael Kaufmann, Martin Nöllenburg, Yoshio Okamoto, Chrysanthi Raftopoulou, Alexander Wolff
Proceedings of 26th International Symposium on Graph Drawing and Network Visualization (GD 2018)
509-523
2018



77 International conference proceedings, etc.
Yes
Computational Complexity of Robot Arm Simulation Problems

Tianfeng Feng, Takashi Horiyama, Yoshio Okamoto, Yota Otachi, Toshiki Saitoh, Takeaki Uno, Ryuhei Uehara
Proceedings of 29th International Workshop on Combinational Algorithms (IWOCA 2018)
177-188
2018



78 International conference proceedings, etc.
Yes
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
Proceedings of 12th International Frontiers of Algorithmics Workshop (FAW 2018)
263-272
2018



79 International conference proceedings, etc.
Yes
Tight approximability of the server allocation problem for real-time applications
Joint
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto, and Taichi Shiitada
Proceedings of 3rd International Workshop on Algorithmic Aspects of Cloud Computing (ALGOCLOUD 2017)
41-55
2018



80 International conference proceedings, etc.
Yes
Reconfiguration of Maximum-Weight b-Matchings in a Graph
Joint
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, and Yoshio Okamoto
Proceedings of 23rd Annual International Computing and Combinatorics Conference (COCOON 2017)
287-296
2017



81 International conference proceedings, etc.
Yes
Balanced line separators of unit disk graphs
Joint
Paz Carmi, Man Kwun Chiu, Matthew J. Katz, Matias Korman, Yoshio Okamoto, André van Renssen, Marcel Roeloffzen, Taichi Shiitada, and Shakhar Smorodinsky
Proceedings of 15th Algorithms and Data Structures Symposium (WADS 2017)
241-252
2017



82 International conference proceedings, etc.
Yes
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
Proceedings of 11th International Conference and Workshop on Algorithms and Computation (WALCOM 2017)
435-447
2017



83 International conference proceedings, etc.
Yes
Approximation and Hardness of Token Swapping
Joint
Tillmann Miltzow, Lothar Narins, Yoshio Okamoto, Günter Rote, Antonis Thomas, Takeaki Uno
Proceedings of 24th European Symposium on Algorithms (ESA 2016)
66:1-66:15
2016



84 International conference proceedings, etc.
Yes
Efficient Stabilization of Cooperative Matching Games

Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
Proceedings of 15th International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS 2016)
41-49
2016



85 International conference proceedings, etc.
Yes
Computing the L1 Geodesic Diameter and Center of a Polygonal Domain
Joint
Sang Won Bae, Matias Korman, Joseph Mitchell, Yoshio Okamoto, Valentin Polishchuk, Haitao Wang
Proceedings of 33rd International Symposium on Theoretical Aspects of Computer Science (STACS 2016)
14:1-14:14
2016



86 International conference proceedings, etc.
Yes
Minimum-Cost b-Edge Dominating Sets on Trees
Joint
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, and Yoshio Okamoto
Proceedings of 25th International Symposium on Algorithms and Computation (ISAAC 2014)
195-207
2014



87 International conference proceedings, etc.
Yes
Swapping Labeled Tokens on Graphs
Joint
Katsuhisa Yamanaka, Erik D. Demaine, Takehiro Ito, Jun Kawahara, Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Kei Uchizawa, and Takeaki Uno
Proceedings of 7th International Conference on Fun with Algorithms (FUN 2014)
369-380
2014



88 International conference proceedings, etc.
Yes
Sankaku-Tori: An Old Western-Japanese Game Played on a Point Set
Joint
Takashi Horiyama, Masashi Kiyomi, Yoshio Okamoto, Ryuhei Uehara, Takeaki Uno, Yushi Uno, and Yukiko Yamauchi
Proceedings of 7th International Conference on Fun with Algorithms (FUN 2014)
235-244
2014



89 International conference proceedings, etc.
Yes
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, and Sander Verdonschot, Tianhao Wang
Proceedings of 30th Annual Symposium on Computational Geometry (SoCG 2014)
436-443
2014



90 International conference proceedings, etc.
Yes
Free edge lengths in plane graphs
Joint
Zachary Abel, Robert Connelly, Sarah Eisenstat, Radoslav Fulek, Filip Morić, Yoshio Okamoto, Tibor Szabó, and Csaba Tóth
Proceedings of 30th Annual Symposium on Computational Geometry (SoCG 2014)
426-435
2014



91 International conference proceedings, etc.
Yes
Semantic word cloud representations: hardness and approximation algorithms

Lukas Barth, Sara Irina Fabrikant, Stephen G. Kobourov, Anna Lubiw, Martin Noellenburg, Yoshio Okamoto, Sergey Pupyrev, Claudio Squarcella, Torsten Ueckerdt, Alexander Wolff
Proceedings of 11th Latin American Theoretical Informatics Symposium (LATIN 2014)
514-525
2014



92 International conference proceedings, etc.
Yes
Computing the L1 geodesic diameter and center of a simple polygon in linear time

Sang Won Bae, Matias Korman, Yoshio Okamoto, Haitao Wang
Proceedings of 11th Latin American Theoretical Informatics Symposium (LATIN 2014)
120-131
2014



93 International conference proceedings, etc.
Yes
Exact and fixed-parameter algorithms for metro-line crossing minimization problems
Joint
Yoshio Okamoto, Yuichi Tatsu, Yushi Uno
Proceedings of 21st International Symposium on Graph Drawing (GD 2013)
520-521
2013



94 International conference proceedings, etc.
Yes
Area bounds of rectilinear polygons realized by angle sequences

Sang Won Bae, Yoshio Okamoto, Chan-Su Shin
Proceedings of 23rd International Symposium on Algorithms and Computation (ISAAC 2012)
629-638
2012



95 International conference proceedings, etc.
Yes
Universal point subsets for planar graphs

Patrizio Angelini, Carla Binucci, William Evans, Ferran Hurtado, Giuseppe Liotta Tamara Mchedlidze, Henk Meijer, Yoshio Okamoto,
Proceedings of 23rd International Symposium on Algorithms and Computation (ISAAC 2012)
423-432
2012



96 International conference proceedings, etc.
Yes
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
Proceedings of 23rd International Symposium on Algorithms and Computation (ISAAC 2012)
372-381
2012



97 International conference proceedings, etc.
Yes
On problems as hard as CNF-SAT

Marek Cygan, Holger Dell, Daniel Lokshtanov, Daniel Marx, Jesper Nederlof, Yoshio Okamoto, Ramamohan Paturi, Saket Saurabh, and Magnus Wahlstrom
Proceedings of 27th IEEE Conference on Computational Complexity (CCC 2012)
74-84
2012



98 International conference proceedings, etc.
Yes
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
Proceedings of 13th Scandinavian Symposium and Workshop on Algorithm Theory (SWAT 2012)
24-35
2012



99 International conference proceedings, etc.
Yes
Efficient enumeration of the directed binary perfect phylogenies from incomplete data

Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh
Proceedings of 11th International Symposium on Experimental Algorithms (SEA 2012)
248-259
2012



100 International conference proceedings, etc.
Yes
Hardness results and an exact exponential algorithm for the spanning tree congestion problem

Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno
Proceedings of 8th Annual Conference on Theory and Applications of Models of Computation (TAMC 2011)
452-462
2011



101 International conference proceedings, etc.
Yes
Dominating set counting in graph classes

Shuji Kijima, Yoshio Okamoto, Takeaki Uno
Proceedings of 17th Annual International Computing and Combinatorics Conference (COCOON 2011)
13-24
2011



102 International conference proceedings, etc.
Yes
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
Proceedings of 37th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2011)
271-282
2011



103 International conference proceedings, etc.
Yes
Counting the number of matchings in chordal and chordal bipartite graph classes

Yoshio Okamoto, Ryuhei Uehara, Takeaki Uno
Proceedings of 35th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2009)
296-307
2010



104 International conference proceedings, etc.
Yes
Minimum and maximum against k lies

Michael Hoffmann, Jiří Matoušek, Yoshio Okamoto, Philipp Zumstein
Proceedings of 12th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2010)
139-149
2010



105 International conference proceedings, etc.
Yes
Adaptive algorithms for planar convex hull problems

Hee-Kap Ahn, Yoshio Okamoto
Proceedings of 4th International Frontiers of Algorithmics Workshop (FAW 2010)
316-326
2010



106 International conference proceedings, etc.
Yes
The geodesic diameter of polygonal domains

Sang Won Bae, Matias Korman, Yoshio Okamoto
Proceedings of 18th Annual European Symposium on Algorithms (ESA 2010)
500-511
2010



107 International conference proceedings, etc.
Yes
Drawing (complete) binary tanglegrams: Hardness, approximation, fixed-parameter tractability

Kevin Buchin, Maike Buchin, Jaroslaw Byrka, Martin Noellenburg, Yoshio Okamoto, Rodrigo I. Silveira, Alexander Wolff
Proceedings of 16th International Symposium on Graph Drawing (GD 2008)
324-335
2009



108 International conference proceedings, etc.
Yes
Querying two boundary points for shortest paths in a polygonal domain

Sang Won Bae, Yoshio Okamoto
Proceedings of 20th International Symposium on Algorithms and Computation (ISAAC 2009)
1054-1063
2009



109 International conference proceedings, etc.
Yes
Moving vertices to make drawings plane.

Xavier Goaoc, Jan Kratochvil, Yoshio Okamoto, Chan-Su Shin, Alexander Wolff
Proceedings of 15th International Symposium on Graph Drawing (GD 2007)
101-112
2008



110 International conference proceedings, etc.
Yes
On listing, sampling, and counting the chordal graphs with edge constraints

Shuji Kijima, Masashi Kiyomi, Yoshio Okamoto, Takeaki Uno
Proceedings of 14th Annual International Computing and Combinatorics Conference (COCOON 2008)
458-467
2008



111 International conference proceedings, etc.
Yes
Improved bounds for wireless localization

Tobias Christ, Michael Hoffmann, Yoshio Okamoto, Takeaki Uno
Proceedings of 11th Scandinavian Workshop on Algorithm Theory (SWAT 2008)
77-89
2008



112 International conference proceedings, etc.
Yes
Fast exponential-time algorithms for the forest counting in graph classes

Heidi Gebauer, Yoshio Okamoto
Proceedings of 13th Computing: The Australasian Theory Symposium (CATS 2007)
63-69
2007



113 International conference proceedings, etc.
Yes
A polynomial-time-delay polynomial-space algorithm for enumeration problems in multi-criteria optimization

Yoshio Okamoto, Takeaki Uno
Proceedings of 18th International Symposium on Algorithms and Computation (ISAAC 2007)
609-620
2007



114 International conference proceedings, etc.
Yes
Linear-time counting algorithms for independent sets in chordal graphs

Yoshio Okamoto, Takeaki Uno, Ryuhei Uehara
Proceedings of 31st International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2005)
433-444
2005



115 International conference proceedings, etc.
Yes
The traveling salesman problem with few inner points

Vladimir G. Deineko, Michael Hoffmann, Yoshio Okamoto, Gerhard J. Woeginger
Proceedings of 10th International Computing and Combinatorics Conference (COCOON 2004)
268-277
2004



116 International conference proceedings, etc.
Yes
The minimum weight triangulation problem with few inner points

Michael Hoffmann, Yoshio Okamoto
Proceedings of 1st International Workshop on Parameterized and Exact Computation (IWPEC 2004)
200-212
2004



117 International conference proceedings, etc.
Yes
Core stability of minimum coloring games

Thomas Bietenhader, Yoshio Okamoto
Proceedings of 30th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2004)
389-401
2004



118 International conference proceedings, etc.
Yes
Matroid representation of clique complexes

Kenji Kashiwabara, Yoshio Okamoto, Takeaki Uno
Proceedings of 9th International Computing and Combinatorics Conference (COCOON 2003)
192-201
2003



119 International conference proceedings, etc.
Yes
The free complex of a two-dimensional generalized convex shelling

Yoshio Okamoto
EUROCOMB'03 -- Abstracts
289-293
2003



120 International conference proceedings, etc.
Yes
Greedy edge-disjoint paths in complete graphs

Paz Carmi, Thomas Erlebach, Yoshio Okamoto
Proceedings of 29th Workshop on Graph Theoretic Concepts in Computer Science (WG 2003)
143-155
2003



121 International conference proceedings, etc.
Yes
Fair cost allocations under conflicts --- a game-theoretic point of view ---
Only
Yoshio Okamoto
Proceedings of 14th Annual International Symposium on Algorithms and Computation (ISAAC 2003)
686-695
2003