Research by Yoshio Okamoto

[Japanese|English]

Everything is listed in the reverse chronological order, namely the newer first.
Please respect the copyrights, and notice that the manuscripts here are different from the copies from the publishers.

Listed in Database: DBLP | MathSciNet

Contents

Interest

Software

  1. Katsuki Fujisawa, Sunyoung Kim, Masakazu Kojima, Yoshio Okamoto, and Makoto Yamashita,
    SparseCoLo: Conversion Methods for SPARSE COnic-form Linear Optimization,
    Available from M. Kojima's page.

    Associated Techinical Report:
    User's Manual forSparseCoLO: Conversion Methods for SPARSE COnic-form Linear Optimization Problems
    Department of Mathematical and Computer Sciences Research Report, B-453, 2009.
    Available here

Preprints

  1. Michael Hoffmann, Jiri Matousek, Yoshio Okamoto, Philipp Zumstein,
    The t-pebbling number is eventually linear in t.
    Preprint, 2010.

  2. Shuji Kijima, Yoshio Okamoto, and Takeaki Uno,
    Counting the number of dominating sets in graph classes.
    Preprint, 2010.

  3. Yusuke Kuroki, Yoshio Okamoto, Kazuya Shirahata,
    Analysis of quicksort in terms of inversions.
    Preprint, 2010.

  4. Sang Won Bae, Matias Korman, Yoshio Okamoto,
    The geodesic diameter of polygonal domains.
    (Preprint available at arXiv.org)

  5. Sang Won Bae and Yoshio Okamoto,
    Querying two boundary points for shortest paths in a polygonal domain (full-paper version).
    (Preprint available at arXiv.org)

  6. Kevin Buchin, Radoslav Fulek, Masashi Kiyomi, Yoshio Okamoto, Shin-ichi Tanigawa, and Csaba D. Tóth,
    A tight lower bound for convexly independent subsets of the Minkowski sums of planar point sets.
    ( Manuscript: PDF; 128137 bytes)

  7. Masayuki Kobayashi and Yoshio Okamoto,
    Submodularity of minimum-cost spanning tree games.
    ( Manuscript: PDF; 135138 bytes)

  8. Yusuke Abe and Yoshio Okamoto,
    Algorithmic enumeration of higher-order Delaunay triangulations.
    ( Manuscript: PDF; 139375 bytes)

  9. Yoshio Okamoto and Takeaki Uno,
    A polynomial-time-delay polynomial-space algorithm for enumeration problems in multi-criteria optimization (full-paper version).
    ( Manuscript: PDF; 150563 bytes)

Refereed Papers in Journals

  1. Kevin Buchin, Maike Buchin, Jaroslaw Byrka, Martin Nöllenburg, Yoshio Okamoto, Rodrigo I. Silveira, and Alexander Wolff,
    Drawing (complete) binary tanglegrams: Hardness, approximation, fixed-parameter tractability.
    Algorithmica, accepted.
    (Preprint available at arXiv.org)

  2. Yoshinobu Kawahara, Kiyohito Nagano, and Yoshio Okamoto,
    Submodular fractional programming for balanced clustering.
    Pattern Recognition Letters, accepted.

  3. Hee-Kap Ahn and Yoshio Okamoto,
    Adaptive algorithms for planar convex hull problems.
    IEICE Transactions on Information and Systems. Accepted.
    ( Manuscript: PDF; 195432 bytes)

  4. Shuji Kijima, Masashi Kiyomi, Yoshio Okamoto, and Takeaki Uno,
    On listing, sampling, and counting the chordal graphs with edge constraints.
    Theoretical Computer Science 411 (2010) 2591-2601.
    DOI:10.1016/j.tcs.2010.03.024.
    A preliminary version available as RIMS Preprint, RIMS-1610, Kyoto University, 2007.
    ( Preprint: Gzipped Postscript)
    ( Preprint: PDF)

  5. Tobias Christ, Michael Hoffmann, Yoshio Okamoto, and Takeaki Uno,
    Improved bounds for wireless localization.
    Algorithmica 57 (2010) 499--516.
    DOI:10.1007/s00453-009-9287-2.

  6. Xavier Goaoc, Jan Kratochvil, Yoshio Okamoto, Chan-Su Shin, Andreas Spillner, and Alexander Wolff,
    Untangling a planar graph.
    Discrete & Computational Geometry 42 (2009) 542--569.
    DOI:10.1007/s00454-008-9130-6.
    (Preprint available at arXiv.org)

  7. Komei Fukuda, Sonoko Moriyama and Yoshio Okamoto,
    The Holt-Klee condition for oriented matroids.
    European Journal of Combinatorics 30 (2009) 1854--1867.
    DOI:10.1016/j.ejc.2008.12.012.
    (Preprint available at arXiv.org)

  8. Heidi Gebauer and Yoshio Okamoto,
    Fast exponential-time algorithms for the forest counting and the Tutte polynomial computation in graph classes.
    International Journal of Foundations of Computer Science 20 (2009) 25--44.
    DOI:10.1142/S0129054109006437.
    ( Manuscript: Gzipped Postscript; 107932 bytes)
    ( Manuscript: PDF; 110880 bytes)

  9. Yoshio Okamoto,
    Local topology of the free complex of a two-dimensional generalized convex shelling.
    Discrete Mathematics 308 (2008) 3836-3846.
    DOI:10.1016/j.disc.2007.07.078.
    ( Manuscript: Gzipped Postscript; 160621 bytes)
    ( Manuscript: PDF; 126724 bytes)
    © Elsevier B.V. 2008.

  10. Yoshio Okamoto, Takeaki Uno and Ryuhei Uehara,
    Counting the number of independent sets in chordal graphs.
    Journal of Discrete Algorithms 6 (2008) 229-242.
    DOI:10.1016/j.jda.2006.07.006.
    ( Manuscript: Gzipped Postscript; 106368 bytes)
    ( Manuscript: PDF; 108012 bytes)
    © Elsevier B.V. 2008.

  11. Yoshio Okamoto,
    Fair cost allocations under conflicts --- a game-theoretic point of view ---.
    Discrete Optimization 5 (2008) 1-18.
    DOI:10.1016/j.disopt.2007.10.002.
    ( Manuscript: Gzipped Postscript; 199008 bytes)
    ( Manuscript: PDF; 173175 bytes)
    © Elsevier B.V. 2008.

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

  13. Kenji Kashiwabara, Yoshio Okamoto and Takeaki Uno,
    Matroid representation of clique complexes,
    Discrete Applied Mathematics 155 (2007) 1910-1929.
    DOI:10.1016/j.dam.2007.05.004.
    ( Manuscript: Gzipped Postscript; 145565 bytes)
    ( Manuscript: PDF; 172557 bytes)
    © Elsevier B.V. 2007.

  14. Sonoko Moriyama and Yoshio Okamoto,
    The even outdegree conjecture for acyclic PLCP-cubes in dimension five.
    IEICE Transactions on Information and Systems E89-D (2006) 2402-2404.
    DOI:10.1093/ietisy/e89-d.8.2402.

  15. Thomas Bietenhader and Yoshio Okamoto,
    Core stability of minimum coloring games.
    Mathematics of Operations Research 31 (2006) 418-431.
    DOI:10.1287/moor.1060.0187.
    ( Manuscript: Gzipped Postscript; 155523 bytes)
    ( Manuscript: PDF; 320239 bytes)
    © INFORMS 2006.

  16. Michael Hoffmann and Yoshio Okamoto,
    The minimum weight triangulation problem with few inner points.
    Computational Geometry: Theory and Applications 34 (2006) 149-158.
    DOI:10.1016/j.comgeo.2005.11.006.
    ( Manuscript: Gzipped Postscript; 165328 bytes)
    ( Manuscript: PDF; 178477 bytes)
    © Elsevier B.V. 2006.

  17. Vladimir G. Deineko, Michael Hoffmann, Yoshio Okamoto and Gerhard J. Woeginger,
    The traveling salesman problem with few inner points,
    Operations Research Letters 34 (2006) 106--110.
    DOI:10.1016/j.orl.2005.01.002.
    ( Manuscript: Gzzipped Postscript; 120491 bytes)
    ( Manuscript: PDF; 119234 bytes)
    © Elsevier B.V. 2006.

  18. Kenji Kashiwabara, Masataka Nakamura and Yoshio Okamoto,
    The affine representation theorem for abstract convex geometries,
    Computational Geometry: Theory and Applications 30 (2005) 129--144.
    DOI: 10.1016/j.comgeo.2004.05.001.
    ( Manuscript: Gzipped Postscript; 119441 bytes)
    ( Manuscript: PDF; 248564 bytes)
    © Elsevier B.V. 2005.

  19. Yoshio Okamoto,
    Traveling salesman games with the Monge property,
    Discrete Applied Mathematics 138 (2004) 349--369.
    DOI: 10.1016/j.dam.2003.08.005.
    ( Manuscript: Gzipped Postscript; 191811 bytes)
    ( Manuscript: PDF; 208296 bytes)
    © Elsevier B.V. 2004.

  20. Yoshio Okamoto and Masataka Nakamura,
    The forbidden minor characterization of line-search antimatroids of rooted digraphs,
    Discrete Applied Mathematics 131 (2003) 523--533.
    DOI: 10.1016/S0166-218X(02)00471-7.
    ( Manuscript: Gzipped Postscript; 80204 bytes)
    ( Manuscript: PDF; 169961 bytes)
    © Elsevier B.V. 2003.

  21. Kenji Kashiwabara and Yoshio Okamoto,
    A greedy algorithm for convex geometries.
    Discrete Applied Mathematics 131 (2003) 449--465.
    DOI: 10.1016/S0166-218X(02)00467-5.
    ( Manuscript: Gzipped Postscript; 88390 bytes)
    ( Manuscript: PDF; 218744 bytes)
    © Elsevier B.V. 2003.

  22. Yoshio Okamoto,
    Submodularity of some classes of the combinatorial optimization games.
    Mathematical Methods of Operations Research 58 (2003) 131--139.
    DOI: 10.1007/s001860300284.
    ( Manuscript: Gzipped Postscript; 61764 bytes)
    ( Manuscript: PDF; 146436 bytes)
    © Springer-Verlag 2003.

  23. Yoshio Okamoto,
    Some properties of the core on convex geometries.
    Mathematical Methods of Operations Research 56 (2002) 377--386.
    DOI: 10.1007/s001860200218.
    ( Manuscript: Gzipped Postscript; 40672 bytes)
    ( Manuscript: PDF; 125167 bytes)
    © Springer-Verlag 2002.

Refereed Papers in Conferences

  1. Sang Won Bae, Matias Korman, and Yoshio Okamoto,
    The geodesic diameter of polygonal domains.
    Proceedings of 18th Annual European Symposium on Algorithms (ESA 2010),
    Lecture Notes in Computer Science, to appear.
    (Preprint available at arXiv.org)

  2. Hee-Kap Ahn and Yoshio Okamoto,
    Adaptive algorithms for planar convex hull problems.
    Proceedings of 4th International Frontiers of Algorithmics Workshop (FAW 2010),
    Lecture Notes in Computer Science 6213 (2010) 316--326.
    DOI: 10.1007/978-3-642-14553-7_30.
    ( Manuscript: PDF; 195432 bytes)

  3. Michael Hoffmann, Jiri Matousek, Yoshio Okamoto, Philipp Zumstein,
    Minimum and maximum against k lies.
    Proceedings of 12th Scandinavian Symposium and Workshop on Algorithm Theory (SWAT 2010),
    Lecture Notes in Computer Science 6139 (2010) 139--149.
    DOI: 10.1007/978-3-642-13731-0_14.
    (Preprint available at arXiv.org)

  4. Yoshio Okamoto, Ryuhei Uehara, and Takeaki Uno,
    Counting the number of matchings in chordal and chordal bipartite graph classes.
    Proceedings of 35th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2009),
    Lecture Notes in Computer Science 5911 (2010) 296-307.
    DOI: 10.1007/978-3-642-11409-0_26.
    ( Manuscript: PDF; 184054 bytes)

  5. Sang Won Bae and Yoshio Okamoto,
    Querying two boundary points for shortest paths in a polygonal domain.
    Proceedings of 20th International Symposium on Algorithms and Computation (ISAAC 2009),
    Lecture Notes in Computer Science 5878 (2009) 1054-1063.
    DOI: 10.1007/978-3-642-10631-6_106.
    (Preprint available at arXiv.org)

  6. Kevin Buchin, Maike Buchin, Jaroslaw Byrka, Martin Nöllenburg, Yoshio Okamoto, Rodrigo I. Silveira, and Alexander Wolff,
    Drawing (complete) binary tanglegrams: Hardness, approximation, fixed-parameter tractability.
    I.G. Tollis and M. Patrignani (eds.),
    Proceedings of 16th International Symposium on Graph Drawing (GD 2008),
    Lecture Notes in Computer Science 5417 (2009) 324-335.
    DOI: 10.1007/978-3-642-00219-9_32.
    (Preprint available at arXiv.org)

  7. Tobias Christ, Michael Hoffmann, Yoshio Okamoto, and Takeaki Uno,
    Improved bounds for wireless localization.
    J. Gudmundsson (ed.),
    Proceedings of 11th Scandinavian Workshop on Algorithm Theory (SWAT 2008),
    Lecture Notes in Computer Science 5124 (2008) 77-89 .
    DOI: 10.1007/978-3-540-69903-3_9.
    ( Manuscript: PDF; 296450 bytes)

  8. Shuji Kijima, Masashi Kiyomi, Yoshio Okamoto, and Takeaki Uno,
    On listing, sampling, and counting the chordal graphs with edge constraints.
    X. Hu and J. Wang (eds.),
    Proceedings of 14th Annual International Computing and Combinatorics Conference (COCOON 2008),
    Lecture Notes in Computer Science 5092 (2008) 458-467.
    DOI: 10.1007/978-3-540-69733-6_45.
    Available as RIMS Preprint, RIMS-1610, Kyoto University, 2007.
    ( Preprint: Gzipped Postscript)
    ( Preprint: PDF)

  9. Xavier Goaoc, Jan Kratochvil, Yoshio Okamoto, Chan-Su Shin, and Alexander Wolff,
    Moving vertices to make drawings plane.
    S.-H. Hong, T. Nishizeki, and W. Quan (eds.),
    Proceedings of 15th International Symposium on Graph Drawing (GD 2007),
    Lecture Notes in Computer Science 4875 (2008) 101-112.
    DOI: 10.1007/978-3-540-77537-9_13.
    (Preprint available at arXiv.org)

  10. Yoshio Okamoto and Takeaki Uno,
    A polynomial-time-delay polynomial-space algorithm for enumeration problems in multi-criteria optimization.
    T. Tokuyama (ed.),
    Proceedings of 18th International Symposium on Algorithms and Computation (ISAAC 2007),
    Lecture Notes in Computer Science 4835 (2007) 609-620.
    DOI: 10.1007/978-3-540-77120-3_53.
    ( Manuscript: Gzipped Postscript; 146217 bytes)
    ( Manuscript: PDF; 112161 bytes)

  11. Heidi Gebauer and Yoshio Okamoto,
    Fast exponential-time algorithms for the forest counting in graph classes.
    J. Gudmundsson and B. Jay (eds.),
    Proceedings of 13th Computing: The Australasian Theory Symposium (CATS 2007),
    Conferences in Research and Practice in Information Technology 65 (2007) 63-69.
    ( Manuscript: Gzipped Postscript; 140395 bytes)
    ( Manuscript: PDF; 165165 bytes)
    © Australian Computer Soceity, Inc. 2007.

  12. Yoshio Okamoto, Takeaki Uno and Ryuhei Uehara,
    Linear-time counting algorithms for independent sets in chordal graphs.
    D. Kratsch (ed.),
    Proceedings of 31st International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2005),
    Lecture Notes in Computer Science 3787 (2005) 433-444.
    DOI: 10.1007/11604686_38.

  13. Thomas Bietenhader and Yoshio Okamoto,
    Core stability of minimum coloring games (extended abstract version),
    J. Hromkovic, M. Nagl, B. Westfechtel (eds.),
    Proceedings of 30th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2004),
    Lecture Notes in Computer Science 3353 (2004) 389-401.
    MetaPress Object Identifier: nxrqt5nwmmvgndec
    ( Manuscript: Gzipped Postscript; 78730 bytes)
    ( Manuscript: PDF; 161961 bytes)
    © Springer-Verlag 2004.

  14. Michael Hoffmann and Yoshio Okamoto,
    The minimum weight triangulation problem with few inner points (extended abstract version).
    R. Downey, M. Fellows, F. Dehne (eds.),
    Proceedings of 1st International Workshop on Parameterized and Exact Computation (IWPEC 2004),
    Lecture Notes in Computer Science 3162 (2004) 200-212.
    MetaPress Object Identifier: ce3bby624mpvaw8a
    ( Manuscript: Gzipped Postscript; 74253 bytes)
    ( Manuscript: PDF; 205657 bytes)
    © Springer-Verlag 2004.

  15. Vladimir G. Deineko, Michael Hoffmann, Yoshio Okamoto and Gerhard J. Woeginger,
    The traveling salesman problem with few inner points (extended abstract version),
    K.-Y. Chwa and J. I. Munro (eds.),
    Proceedings of 10th International Computing and Combinatorics Conference (COCOON 2004),
    Lecture Notes in Computer Science 3106 (2004) 268--277.
    MetaPress Object Identifier: k2v23krveq2d7g59
    ( Manuscript: Gzipped Postscript; 76090 bytes)
    ( Manuscript: PDF; 154502 bytes)
    © Springer-Verlag 2004.

  16. Yoshio Okamoto,
    Fair cost allocations under conflicts --- a game-theoretic point of view --- (extended abstract version).
    T. Ibaraki, N. Katoh and H. Ono (eds.),
    Proceedings of 14th Annual International Symposium on Algorithms and Computation (ISAAC 2003),
    Lecture Notes in Computer Science 2906 (2003) 686--695.
    MetaPress Object Identifier: anxafxh8ext523th
    ( Manuscript: Gzipped Postscript; 128235 bytes)
    ( Manuscript: PDF; 163851 bytes)
    © Springer-Verlag 2003.

  17. Paz Carmi, Thomas Erlebach and Yoshio Okamoto,
    Greedy edge-disjoint paths in complete graphs (extended abstract version).
    H.L. Bodlaender (ed.),
    Proceedings of 29th Workshop on Graph Theoretic Concepts in Computer Science (WG 2003),
    Lecture Notes in Computer Science 2880 (2003) 143--155.
    MetaPress Object Identifier: vlhxajtfv2jvdu7d
    ( Manuscript: Gzipped Postscript; 162501 bytes)
    ( Manuscript: PDF; 157159 bytes)
    © Springer-Verlag 2003.

  18. Yoshio Okamoto,
    The free complex of a two-dimensional generalized convex shelling (abstract version for Eurocomb'03).
    J. Fiala (ed.),
    EUROCOMB'03 -- Abstracts, ITI Series 2003-145, Institute for Theoretical Computer Science (ITI), Charles University, 2003, pp. 289--293.
    ( Manuscript: Gzipped Postscript; 41435 bytes)
    ( Manuscript: PDF; 113371 bytes)

  19. Kenji Kashiwabara, Yoshio Okamoto and Takeaki Uno,
    Matroid representation of clique complexes (extended abstract version).
    T. Warnow and B. Zhu (eds.),
    Proceedings of 9th International Computing and Combinatorics Conference (COCOON 2003),
    Lecture Notes in Computer Science 2697 (2003) 192--201.
    MetaPress Object Identifier: nup5u08fca327xlg
    ( Manuscript: Gzipped Postscript; 45654 bytes)
    ( Manuscript: PDF; 131631 bytes)
    © Springer-Verlag 2003.

Contributions in Books

  1. Yoshio Okamoto,
    Traveling sales person with few inner points.
    Ming-Yang Kao (ed.),
    Encyclopedia of Algorithms, Springer, 2008, pp. 961-964.

Translation of books

  1. Matthias Beck and Sinai Robins,
    Computing the Continuous Discretely: Integer-Point Enumeration in Polyhedra.
    Springer Japan, 2010.
    (Information provided by Springer Japan)

  2. Jiri Matousek,
    Lectures on Discrete Geometry.
    Japanese Translation by Yoshio Okamoto,
    Springer-Verlag Tokyo, 2005.
    ( Information provided by myself in Japanese)

  3. Günter M. Ziegler,
    Lectures on Polytopes.
    Japanese Translation by Masahiro Hachimori and Yoshio Okamoto,
    Springer-Verlag Tokyo, 2003.
    ( Information provided by Masahiro Hachimori in Japanese)
    ( Information provided by Springer-Verlag Tokyo in Japanese)

Thesis

  1. Yoshio Okamoto,
    Structural Parameters in Combinatorial Objects.
    PhD Thesis, Department of Computer Science, ETH Zurich,
    Dissertation Number 15901.
    ( Manuscript: Gzipped Postscript; 366278 bytes)
    ( Manuscript: PDF; 854178 bytes)

  2. Yoshio Okamoto,
    Several Aspects of Antimatroids and Convex Geometries.
    Master's Thesis, Department of Systems Science, Graduate School of Arts and Sciences, The University of Tokyo, 2001.
    ( Manuscript: Gzipped Postscript; 233302 bytes)

Other Reports, Abstracts

(restricted to articles in English)
  1. Hee-Kap Ahn, Yoshio Okamoto, Iris Reinbacher,
    Tracing a virus.
    3rd AAAC meeting, 1 page.

  2. Sang Won Bae, Matias Korman, Yoshio Okamoto,
    On the geodesic diameter in polygonal domains.
    Abstracts of Japan Conference on Computational Geometry and Graphs (JCCGG 2009), 2 pages.

  3. Kevin Buchin, Radoslav Fulek, Masashi Kiyomi, Yoshio Okamoto, Shin-ichi Tanigawa, and Csaba D. Tóth,
    A tight lower bound for convexly independent subsets of the Minkowski sums of planar point sets.
    Abstracts of Japan Conference on Computational Geometry and Graphs (JCCGG 2009), 2 pages.

  4. Yoshio Okamoto, and Ryuhei Uehara,
    How to make a picturesque maze.
    Proceedings of 21st Canadian Conference on Computational Geometry (CCCG 2009), 137-140.
    ( Manuscript: PDF; 854178 bytes)
    Update is available here.

  5. Tobias Christ, Michael Hoffmann, and Yoshio Okamoto,
    Natural wireless localization is NP-hard.
    Abstracts of 25th European Workshop on Computational Geometry, 2009, 175--178.

  6. Hee-Kap Ahn and Yoshio Okamoto,
    Adaptive computational geometry.
    Proceedings of RIMS Workshop on Computational Geometry and Discrete Mathematics, 2008, pp. 51--54.

  7. Yusuke Abe and Yoshio Okamoto,
    Algorithmic enumeration of higher-order Delaunay triangulations.
    Proceedings of 11th Japan-Korea Joint Workshop on Algorithms and Computation, 2008.

  8. Masayuki Kobayashi and Yoshio Okamoto,
    Submodularity of minimum-cost spanning tree games.
    Proceedings of 1st ACCC Annual Meeting, 2008, p. 38.

  9. Yoshio Okamoto and Takeaki Uno,
    A provably efficient algorithm for the multi-criteria linear programming.
    Proceedings of 5th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications, 2007, pp. 87--96.

  10. Takehiro Ito, Yoshio Okamoto, and Takeshi Tokuyama,
    Algorithms for the full Steiner tree problem.
    Proceedings of ICALP'06 Affiliated Workshop "Improving Exponential Time Algorithms," 2006, pp. 39--45.

  11. Heidi Gebauer and Yoshio Okamoto,
    Fast exponential-time algorithms for the forest counting in graph classes.
    Proceedings of ICALP'06 Affiliated Workshop "Improving Exponential Time Algorithms," 2006, pp. 25--30.

  12. Hiroki Nakayama, Sonoko Moriyama, Komei Fukuda and Yoshio Okamoto,
    Comparing the strengths of the non-realizability certificates for oriented matroids.
    Proceedings of 4th Japanese-Hungarian Symposium on Discrete Mathematics and its Applications, 2005, pp. 243--249.

  13. Yoshio Okamoto, Takeaki Uno and Ryuhei Uehara,
    Counting the independent sets of a chordal graph in linear time.
    Proceedings of 4th Japanese-Hungarian Symposium on Discrete Mathematics and its Applications, 2005, pp. 257--263.

  14. Kenji Kashiwabara, Masataka Nakamura and Yoshio Okamoto,
    Affine representations of abstract convex geometries (extended abstract version).
    Abstracts of 19th European Workshop on Computational Geometry, 2003, 77--80.
    ( Manuscript: Gzipped Postscript; 33420 bytes)

  15. Paz Carmi, Thomas Erlebach and Yoshio Okamoto,
    Greedy edge-disjoint paths in complete graphs (technical report version).
    TIK-Report 155, Computer Engineering and Networks Laboratory (TIK), ETH Zürich, 2002.
    ( Manuscript: PDF; 149507 bytes)
    ( Manuscript: Gzipped Postscript; 121200 bytes)

  16. Kenji Kashiwabara, Yoshio Okamoto and Takeaki Uno,
    Matroid representation of clique complexes (preliminary version).
    Proceedings of the 3rd Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications, 2003, pp.40--48.
    ( Manuscript: Gzipped Postscript; 48927 bytes)

  17. Yoshio Okamoto,
    Traveling salesman games with the Monge property (extended abstract version).
    ICM2002GTA Proceeding Volume, 2002, pp.625--629.

  18. Yoshio Okamoto,
    Core stability of games on convex geometries (preliminary version).
    Summaries of the 2nd International Conference on Nonlinear Analysis and Convex Analysis, 2001, (CD-ROM).
    ( Manuscript: Gzipped Postscript; 62779 bytes)

  19. Yoshio Okamoto,
    Core stability of games on convex geometries (abstract).
    Abstracts of the 2nd International Conference on Nonlinear Analysis and Convex Analysis, 2001, pp.128.
    ( Manuscript: Gzipped Postscript; 37286 bytes)

  20. Yoshio Okamoto,
    Traveling salesman games with the Monge property (preliminary version).
    Proceedings of the 6th Korea-Japan Workshop on Algorithms and Computation, 2001, pp. 75--82.
    ( Manuscript: Gzipped Postscript; 81874 bytes)

  21. Yoshio Okamoto,
    Circuits of antimatroids and Dilworth's decomposition theorem.
    Information and Communication Studies, Vol. 25, Faculty of Information and Communications, Bunkyo University, 2000, pp.43--54.

  22. Yoshio Okamoto and Masataka Nakamura,
    Forbidden minors for point-search antimatroids and line-search antimatroids of rooted graphs (abstract version).
    Abstracts of Japan Conference on Discrete and Computational Geometry 2000, pp.91--92.
    ( Manuscript: Gzipped Postscript; 48206 bytes)

  23. Yoshio Okamoto and Kenji Kashiwabara,
    A greedy algorithm for convex geometries (extended abstract version).
    Proceedings of the 5th Japan-Korea Joint Workshop on Algorithms and Computation, 2000, pp.118--121.
    ( Manuscript: Gzipped Postscript; 58478 bytes)

[Top]
my_lastname@is.titech.ac.jp