Yoshio Okamoto

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

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

Sang Won Bae, Yoshio Okamoto: Querying two boundary points for shortest paths in a polygonal domain. Comput. Geom. 45(7): 284-293 (2012)

Yoshio Okamoto, Yota Otachi, Ryuhei Uehara: On bipartite powers of bigraphs. Discrete Mathematics & Theoretical Computer Science 14(2): 11-20 (2012)

Otfried Cheong, Yoshio Okamoto: Guest Editors' Foreword. Int. J. Comput. Geometry Appl. 22(1): 1-2 (2012)

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

Marek Cygan, Holger Dell, Daniel Lokshtanov, Dániel Marx, Jesper Nederlof, Yoshio Okamoto, Ramamohan Paturi, Saket Saurabh, Magnus Wahlström: On Problems as Hard as CNF-SAT. IEEE Conference on Computational Complexity 2012: 74-84

Takehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno: A 4.31-Approximation for the Geometric Unique Coverage Problem on Unit Disks. ISAAC 2012: 372-381

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

Sang Won Bae, Yoshio Okamoto, Chan-Su Shin: Area Bounds of Rectilinear Polygons Realized by Angle Sequences. ISAAC 2012: 629-638

Takehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno: A Polynomial-Time Approximation Scheme for the Geometric Unique Coverage Problem on Unit Squares. SWAT 2012: 24-35

Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh: Efficient Enumeration of the Directed Binary Perfect Phylogenies from Incomplete Data. SEA 2012: 248-259

Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh: Efficient Enumeration of the Directed Binary Perfect Phylogenies from Incomplete Data. CoRR abs/1203.3284 (2012)

Michael Hoffmann, Jirí Matousek, Yoshio Okamoto, Philipp Zumstein: The t-Pebbling Number is Eventually Linear in t. Electr. J. Comb. 18(1) (2011)

Yoshio Okamoto, Takeaki Uno: A polynomial-time-delay and polynomial-space algorithm for enumeration problems in multi-criteria optimization. European Journal of Operational Research 210(1): 48-56 (2011)

Hee-Kap Ahn, Yoshio Okamoto: Adaptive Algorithms for Planar Convex Hull Problems. IEICE Transactions 94-D(2): 182-189 (2011)

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

Yoshinobu Kawahara, Kiyohito Nagano, Yoshio Okamoto: Submodular fractional programming for balanced clustering. Pattern Recognition Letters 32(2): 235-243 (2011)

Shuji Kijima, Yoshio Okamoto, Takeaki Uno: Dominating Set Counting in Graph Classes. COCOON 2011: 13-24

Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno: Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem. TAMC 2011: 452-462

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

Takao Asano, Shin-Ichi Nakano, Yoshio Okamoto, Osamu Watanabe (Eds.): Algorithms and Computation - 22nd International Symposium, ISAAC 2011, Yokohama, Japan, December 5-8, 2011. Proceedings. Lecture Notes in Computer Science 7074, Springer 2011, isbn 978-3-642-25590-8

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

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

Tobias Christ, Michael Hoffmann, Yoshio Okamoto, Takeaki Uno: Improved Bounds for Wireless Localization. Algorithmica 57(3): 499-516 (2010)

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

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

Sang Won Bae, Matias Korman, Yoshio Okamoto: The Geodesic Diameter of Polygonal Domains. ESA (1) 2010: 500-511

Hee-Kap Ahn, Yoshio Okamoto: Adaptive Algorithms for Planar Convex Hull Problems. FAW 2010: 316-326

Michael Hoffmann, Jirí Matousek, Yoshio Okamoto, Philipp Zumstein: Minimum and Maximum against k Lies. SWAT 2010: 139-149

Sang Won Bae, Matias Korman, Yoshio Okamoto: The Geodesic Diameter of Polygonal Domains. CoRR abs/1001.0695 (2010)

Michael Hoffmann, Jirí Matousek, Yoshio Okamoto, Philipp Zumstein: Minimum and maximum against k lies. CoRR abs/1002.0562 (2010)

Xavier Goaoc, Jan Kratochvíl, Yoshio Okamoto, Chan-Su Shin, Andreas Spillner, Alexander Wolff: Untangling a Planar Graph. Discrete & Computational Geometry 42(4): 542-569 (2009)

Komei Fukuda, Sonoko Moriyama, Yoshio Okamoto: The Holt-Klee condition for oriented matroids. Eur. J. Comb. 30(8): 1854-1867 (2009)

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

Yoshio Okamoto, Ryuhei Uehara: How to make a picturesque maze. CCCG 2009: 137-140

Sang Won Bae, Yoshio Okamoto: Querying Two Boundary Points for Shortest Paths in a Polygonal Domain. ISAAC 2009: 1054-1063

Yoshio Okamoto, Ryuhei Uehara, Takeaki Uno: Counting the Number of Matchings in Chordal and Chordal Bipartite Graph Classes. WG 2009: 296-307

Sang Won Bae, Yoshio Okamoto: Querying Two Boundary Points for Shortest Paths in a Polygonal Domain. CoRR abs/0911.5017 (2009)

Yoshio Okamoto: Fair cost allocations under conflicts - a game-theoretic point of view - . Discrete Optimization 5(1): 1-18 (2008)

Yoshio Okamoto: Local topology of the free complex of a two-dimensional generalized convex shelling. Discrete Mathematics 308(17): 3836-3846 (2008)

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

Shuji Kijima, Masashi Kiyomi, Yoshio Okamoto, Takeaki Uno: On Listing, Sampling, and Counting the Chordal Graphs with Edge Constraints. COCOON 2008: 458-467

Kevin Buchin, Maike Buchin, Jaroslaw Byrka, Martin Nöllenburg, Yoshio Okamoto, Rodrigo I. Silveira, Alexander Wolff: Drawing (Complete) Binary Tanglegrams. Graph Drawing 2008: 324-335

Tobias Christ, Michael Hoffmann, Yoshio Okamoto, Takeaki Uno: Improved Bounds for Wireless Localization. SWAT 2008: 77-89

Yoshio Okamoto: Traveling Sales Person with Few Inner Points. Encyclopedia of Algorithms 2008

Kevin Buchin, Maike Buchin, Jaroslaw Byrka, Martin Nöllenburg, Yoshio Okamoto, Rodrigo I. Silveira, Alexander Wolff: Drawing (Complete) Binary Tanglegrams: Hardness, Approximation, Fixed-Parameter Tractability. CoRR abs/0806.0920 (2008)

Kenji Kashiwabara, Yoshio Okamoto, Takeaki Uno: Matroid representation of clique complexes. Discrete Applied Mathematics 155(15): 1910-1929 (2007)

Yota Otachi, Yoshio Okamoto, Koichi Yamazaki: Relationships between the class of unit grid intersection graphs and other classes of bipartite graphs. Discrete Applied Mathematics 155(17): 2383-2390 (2007)

Heidi Gebauer, Yoshio Okamoto: Fast Exponential-Time Algorithms for the Forest Counting in Graph Classes. CATS 2007: 63-69

Xavier Goaoc, Jan Kratochvíl, Yoshio Okamoto, Chan-Su Shin, Alexander Wolff: Moving Vertices to Make Drawings Plane. Graph Drawing 2007: 101-112

Yoshio Okamoto, Takeaki Uno: A Polynomial-Time-Delay and Polynomial-Space Algorithm for Enumeration Problems in Multi-criteria Optimization. ISAAC 2007: 609-620

Xavier Goaoc, Jan Kratochvíl, Yoshio Okamoto, Chan-Su Shin, Alexander Wolff: Moving Vertices to Make Drawings Plane. CoRR abs/0706.1002 (2007)

Michael Hoffmann, Yoshio Okamoto: The minimum weight triangulation problem with few inner points. Comput. Geom. 34(3): 149-158 (2006)

Sonoko Moriyama, Yoshio Okamoto: The Even Outdegree Conjecture for Acyclic PLCP-Cubes in Dimension Five. IEICE Transactions 89-D(8): 2402-2404 (2006)

Thomas Bietenhader, Yoshio Okamoto: Core Stability of Minimum Coloring Games. Math. Oper. Res. 31(2): 418-431 (2006)

Vladimir G. Deineko, Michael Hoffmann, Yoshio Okamoto, Gerhard J. Woeginger: The traveling salesman problem with few inner points. Oper. Res. Lett. 34(1): 106-110 (2006)

Kenji Kashiwabara, Masataka Nakamura, Yoshio Okamoto: The affine representation theorem for abstract convex geometries. Comput. Geom. 30(2): 129-144 (2005)

Yoshio Okamoto, Takeaki Uno, Ryuhei Uehara: Linear-Time Counting Algorithms for Independent Sets in Chordal Graphs. WG 2005: 433-444

Yoshio Okamoto: Traveling salesman games with the Monge property. Discrete Applied Mathematics 138(3): 349-369 (2004)

Vladimir G. Deineko, Michael Hoffmann, Yoshio Okamoto, Gerhard J. Woeginger: The Traveling Salesman Problem with Few Inner Points. COCOON 2004: 268-277

Michael Hoffmann, Yoshio Okamoto: The Minimum Weight Triangulation Problem with Few Inner Points. IWPEC 2004: 200-212

Thomas Bietenhader, Yoshio Okamoto: Core Stability of Minimum Coloring Games. WG 2004: 389-401

Kenji Kashiwabara, Yoshio Okamoto: A greedy algorithm for convex geometries. Discrete Applied Mathematics 131(2): 449-465 (2003)

Yoshio Okamoto, Masataka Nakamura: The forbidden minor characterization of line-search antimatroids of rooted digraphs. Discrete Applied Mathematics 131(2): 523-533 (2003)

Yoshio Okamoto: Some properties of the core on convex geometries. Math. Meth. of OR 56(3): 377-386 (2003)

Yoshio Okamoto: Submodularity of some classes of the combinatorial optimization games. Math. Meth. of OR 58(1): 131-139 (2003)

Kenji Kashiwabara, Yoshio Okamoto, Takeaki Uno: Matroid Representation of Clique Complexes. COCOON 2003: 192-201

Yoshio Okamoto: Fair Cost Allocations under Conflicts - A Game-Theoretic Point of View. ISAAC 2003: 686-695

Paz Carmi, Thomas Erlebach, Yoshio Okamoto: Greedy Edge-Disjoint Paths in Complete Graphs. WG 2003: 143-155