Slides from Talks by Yoshio Okamoto

[Back]


Contents


Talks, Slides from Conferences, Workshops, ...

(restricted to talks in English)
  1. Sang Won Bae, Matias Korman, and Yoshio Okamoto,
    The geodesic diameter of polygonal domains.
    7th Dutch Computational Geometry Day,
    TU Eindhoven, the Netherlands,
    November 11, 2010.
    ( Slides: PDF; 847536 bytes)

  2. 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.
    Japan Conference on Computational Geometry and Graphs (JCCGG 2009),
    Kanazawa, Japan,
    November 11, 2009.
    ( Slides: PDF; 440460 bytes)

  3. Yoshio Okamoto, Takeaki Uno and Ryuhei Uehara,
    Linear-time counting algorithms for independent sets in chordal graphs,
    31st International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2005),
    University of Metz, Metz, France,
    June 25, 2005.
    ( Slides: Gzipped Postscript; 1635383 bytes)
    ( Slides: PDF; 674788 bytes)

  4. Yoshio Okamoto, Takeaki Uno and Ryuhei Uehara,
    Counting the independent sets of a chordal graph in linear time,
    4th Japanese-Hungarian Symposium on Discrete Mathematics and its Applications,
    Renyi Institute, Budapest, Hungary,
    June 6, 2005.
    ( Slides: Gzipped Postscript; 1508242 bytes)
    ( Slides: PDF; 1739671 bytes)

  5. Michael Hoffmann and Yoshio Okamoto,
    The minimum weight triangulation problem with few inner points,
    1st International Workshop on Parameterized and Exact Computation (IWPEC 2004),
    Radisson SAS Royal Hotel, Bergen, Norway,
    September 16, 2004.
    ( Slides: Gzipped Postscript; 1360534 bytes)
    ( Slides: PDF; 929391 bytes)

  6. Vladimir G. Deineko, Michael Hoffmann, Yoshio Okamoto and Gerhard J. Woeginger,
    The traveling salesman problem with few inner points,
    10th International Computing and Combinatorics Conference (COCOON 2004),
    Ramada Plaza Jeju Hotel, Jeju Island, Korea,
    August 18, 2004.
    ( Slides: Gzipped Postscript; 1597622 bytes)
    ( Slides: PDF; 1106162 bytes)

  7. Thomas Bietenhader and Yoshio Okamoto,
    Core stability of minimum coloring games,
    30th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2004),
    Physikzentrum Bad Honnef, Bad Honnef, Germany,
    June 23, 2004.
    ( Slides: Gzipped Postscript; 2667620 bytes)
    ( Slides: PDF; 1172336 bytes)

  8. Michael Hoffmann and Yoshio Okamoto,
    The traveling salesman problem with few inner points,
    Upper Rhein Algorithms Workshop 2004,
    Technical University of Karlsruhe, Karlsruhe, Germany,
    March 19--20, 2004.
    ( Slides: Gzipped Postscript; 87144 bytes)
    ( Slides: PDF; 188802 bytes)

  9. Yoshio Okamoto,
    The affine representation theorem for abstract convex geometries,
    2004 Barbados Undercurrent Workshop on Polyhedra, Convex Geometry, and Optimization,
    Bellairs Research Institute, McGill University, Barbados,
    March 7--14, 2004.
    ( Slides: Gzipped Postscript; 83121 bytes)
    ( Slides: PDF; 109937 bytes)

  10. Yoshio Okamoto,
    Recent development of abstract convex geometries,
    Workshop: Submodular Functions and Combinatorial Optimization,
    Kyoto University, Kyoto, Japan,
    December 18--19, 2003.
    ( Slides: Gzipped Postscript; 145210 bytes)
    ( Slides: PDF; 404364 bytes)

  11. Yoshio Okamoto,
    Fair cost allocations under conflicts -- a game-theoretic point of view --,
    14th Annual International Symposium on Algorithms and Computation,
    Rihga Royal Hotel Kyoto, Kyoto, Japan,
    December 15--17, 2003.
    ( Slides: Gzipped Postscript; 358680 bytes)
    ( Slides: PDF; 258752 bytes)

  12. Yoshio Okamoto,
    Fair cost allocations under conflicts,
    3rd Annual Workshop on Combinatorics, Geometry and Computation,
    Park Hotel Fasanerie, Neustrelitz, Germany,
    September 29--October 1, 2003.
    ( Slides: Gzipped Postscript; 111011 bytes)
    ( Slides: PDF; 184530 bytes)

  13. Yoshio Okamoto,
    Free complex of a two-dimensional generalized convex shelling,
    2nd European Conference on Combinatorics, Graph Theory and Applications (Eurocomb'03)
    Czech University of Agriculture, Prague, Czech Republic,
    September 8--12, 2003.
    ( Slides: Gzipped Postscript; 148038 bytes)
    ( Slides: PDF; 208735 bytes)

  14. Kenji Kashiwabara, Yoshio Okamoto and Takeaki Uno,
    Matroid representation of clique complexes,
    18th International Symposium on Mathematical Programming (ISMP 2003),
    Technical University of Denmark, Copenhagen, Denmark,
    August 18--22, 2003.
    ( Slides: Gzipped Postscript; 468974 bytes)
    ( Slides: PDF; 212509 bytes)

  15. Kenji Kashiwabara, Yoshio Okamoto and Takeaki Uno,
    Matroid representation of clique complexes,
    9th International Computing and Combinatorics Conference (COCOON 2003),
    Big Sky, Montana, USA,
    July 25--28, 2003.
    ( Slides: Gzipped Postscript; 464202 bytes)
    ( Slides: PDF; 206936 bytes)

  16. Paz Carmi, Thomas Erlebach and Yoshio Okamoto,
    Greedy edge-disjoint paths in complete graphs,
    29th Workshop on Graph Theoretic Concepts in Computer Science (WG 2003),
    Elspeet, the Netherlands,
    June 19--21, 2003.
    ( Slides: Gzipped postscript; 3292315 bytes)

  17. Kenji Kashiwabara, Masataka Nakamura and Yoshio Okamoto,
    Affine representations of abstract convex geometries,
    19th European Workshop on Computational Geometry (EWCG 2003),
    University of Bonn, Bonn, Germany,
    March 24--26, 2003.
    ( Slides: Gzipped postscript; 80010 bytes)
    ( Slides: PDF; 186778 bytes)

  18. Kenji Kashiwabara, Yoshio Okamoto and Takeaki Uno,
    Matroid representation of clique complexes,
    2nd Annual Workshop on Combinatorics, Geometry and Computation,
    Insel Hiddensee, Germany,
    October 9--12, 2002.
    ( Slides: Gzipped Postscript; 90810 bytes)

  19. Yoshio Okamoto,
    Submodularity of some classes of combinatorial optimization games,
    International Congress of Mathematicians 2002 (ICM 2002),
    Beijing, People Republic of China,
    August 20--28, 2002.
    ( Slides : 63175 bytes)

  20. Yoshio Okamoto,
    Traveling salesman games with the Monge property,
    Game Theory and Applications: Satellite Conference of International Congress of Mathematicians 2002,
    Grand Regency Hotel, Qingdao, People Republic of China,
    August 14--17, 2002.
    ( Slides : Gzipped Postscript; 221206 bytes)
    ( Slides : PDF; 320383 bytes)

  21. Yoshio Okamoto,
    Core stability of games on convex geometries,
    Second International Conference on Nonlinear Analysis and Convex Analysis (NACA 2001),
    Hirosaki University, Hirosaki, Japan,
    July 30--August 2, 2001.
    ( Slides : Gzipped Postscript; 127497 bytes)

  22. Yoshio Okamoto,
    Traveling salesman games with the Monge property,
    6th Korea-Japan Joint Workshop on Algorithms and Computation (WAAC 2001),
    Pusan National University, Pusan, Korea,
    June 28--29, 2001.
    ( Slides: Gzipped Postscript; 274518 bytes)

  23. Yoshio Okamoto and Masataka Nakamura,
    Forbidden minors for point-search antimatroids and line-search antimatroids of rooted graphs,
    Japan Conference on Discrete and Computational Geometry 2000 (JCDCG 2000),
    Tokai University, Tokyo, Japan,
    November 22--25, 2000.
    ( Slides: Gzipped Postscript; 127640 bytes)

  24. Kenji Kashiwabara and Yoshio Okamoto,
    A greedy algorithm for convex geometries,
    17th International Symposium on Mathematical Programming (ISMP 2000),
    Georgia Institute of Technology, Atlanta, Georgia, USA,
    August 7--11, 2000.
    ( Slides: Gzipped Postscript; 163041 bytes)

  25. Yoshio Okamoto and Kenji Kashiwabara,
    A greedy algorithm for convex geometries,
    5th Japan-Korea Joint Workshop on Algorithms and Computation (WAAC 2000),
    The University of Tokyo, Tokyo, Japan,
    July 21--22, 2000.
    ( Slides: Gzipped Postscript; 163041 bytes)

Slides from the seminar talks

  1. Yoshio Okamoto,
    Vertex angle and crossing angle resolution of leveled trees,
    Mittagsseminar,
    ETH Zurich, Zurich, Switzerland
    September 13, 2011.
    ( Slides: PDF; 230840 bytes)

  2. Yoshio Okamoto,
    The traveling salesman problem with few inner points,
    Mittagsseminar,
    ETH Zurich, Zurich, Switzerland
    April 6, 2004.
    ( Slides: Gzipped Postscript; 88619 bytes)
    ( Slides: PDF; 196013 bytes)

  3. Yoshio Okamoto,
    A solution to the Füredi-Hajnal conjecture by Marcus & Tardos,
    Mittagsseminar,
    ETH Zurich, Zurich, Switzerland
    February 12, 2004.
    ( Slides: Gzipped Postscript; 98636 bytes)
    ( Slides: PDF; 167523 bytes)

  4. Yoshio Okamoto,
    Local topology of the free complex of a two-dimensional generalized convex shelling,
    Mittagsseminar,
    ETH Zurich, Zurich, Switzerland
    October 23, 2003.
    ( Slides: Gzipped Postscript; 126848 bytes)
    ( Slides: PDF; 243541 bytes)

  5. Yoshio Okamoto,
    Fair cost allocations under conflicts,
    Algorithms seminar,
    School of Computer Science, McGill University, Montreal, Canada
    August 4, 2003.
    ( Slides: Gzipped Postscript; 128560 bytes)
    ( Slides: PDF; 217185 bytes)

  6. Yoshio Okamoto,
    The affine representation theorem for abstract convex geometries,
    Mittagsseminar,
    ETH Zurich, Zurich, Switzerland
    January 9, 2003.
    ( Slides: Gzipped Postscript; 82682 bytes)

  7. Yoshio Okamoto,
    Submodular-type optimization on abstract convex geometries,
    Mittagsseminar,
    ETH Zurich, Zurich, Switzerland,
    November 5, 2002.
    ( Slides: Gzipped Postscript; 94427 bytes)

  8. Yoshio Okamoto,
    Matroid representation of clique complexes,
    Mittagsseminar,
    ETH Zurich, Zurich, Switzerland,
    October 29, 2002.
    ( Slides: Gzipped Postscript; 97521 bytes)

  9. Yoshio Okamoto,
    Traveling salesman games with the Monge property,
    Mittagsseminar,
    ETH Zurich, Zurich, Switzerland,
    June 4, 2002.
    ( Slides: Gzipped Postscript; 248048 bytes)

  10. Yoshio Okamoto,
    Unique sink orientation and related topics,
    Presentation for the final project of CGC Pre-Doc Program,
    ETH Zurich, Zurich, Switzerland,
    March 25, 2002.
    ( Slides: Gzipped Postscript; 115671 bytes)

  11. Yoshio Okamoto,
    Greedy edge-disjoint paths in complete graphs,
    Presentation for the mid-term project of CGC Pre-Doc Program,
    ETH Zurich, Zurich, Switzerland,
    December 20, 2001.
    ( Slides: Gzipped Postscript; 100175 bytes)


[Top]
okamotoy@uec.ac.jp