Talks by Kenjiro Takazawa

Talks by Kenjiro Takazawa

  1. K. Takazawa: A weighted even factor algorithm,
    The 37th Southeastern International Conference on Combinatorics, Graph Theory, and Computing, Florida, USA, 2006.

  2. S. Iwata and K. Takazawa: The independent even factor problem,
    The 19th International Symposium on Mathematical Programming, Rio de Janeiro, Brazil, 2006.

  3. S. Iwata and K. Takazawa: The independent even factor problem,
    The 18th ACM-SIAM Symposium on Discrete Algorithms, New Orleans, USA, 2007.

  4. K. Takazawa: A weighted even factor algorithm,
    The 5th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications, Sendai, Japan, 2007.

  5. K. Takazawa: A weighted $K_{t,t}$-free $t$-factor algorithm for bipartite graphs,
    The 1st AAAC Annual Meeting, Pokfulam, Hong Kong, 2008.

  6. K. Takazawa: A weighted $K_{t,t}$-free $t$-factor algorithm for bipartite graphs,
    The 13th Conference on Integer Programming and Combinatorial Optimization, Bertinoro, Italy, 2008.

  7. K. Takazawa: Even factors: Algorithms and structure,
    Kyoto RIMS Workshop on Combinatorial Optimization and Discrete Algorithms, Kyoto, Japan, 2008.

  8. K. Takazawa: A weighted independent even factor algorithm,
    The 6th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications, Budapest, Hungary, 2009.

  9. K. Takazawa: Optimal matching forests and valuated delta-matroids,
    The 15th Conference on Integer Programming and Combinatorial Optimization, New York, USA, 2011.

  10. K. Takazawa: Shortest bibranchings and valuated matroid intersection,
    The First ETH-Japan Workshop on Science and Computing, Engelberg, Switzerland, 2012.

  11. S. Boyd, S. Iwata and K. Takazawa: Covering cuts in bridgeless cubic graphs,
    The 21st International Symposium on Mathematical Programming, Berlin, Germany, 2012.

  12. S. Boyd, S. Iwata and K. Takazawa: Finding 2-factors closer to TSP tours in cubic graphs,
    The 3rd Cargèse Workshop on Combinatorial Optimization, Corsica, France, 2012.

  13. K. Takazawa: Discrete convexity in network optimization: Matching forests and bibranchings,
    Kyoto RIMS Workshop "Discrete Convexity and Optimization", Kyoto, Japan, 2012.

  14. K. Takazawa: Shortest bibranchings and valuated matroid intersection,
    Combinatorial Geometries: Matroids, Oriented Matroids and Applications, Marseille, France, 2013.

  15. S. Boyd, S. Iwata and K. Takazawa: Finding 2-factors closer to TSP tours in cubic graphs,
    The 18th Aussois Combinatorial Optimization Workshop, Aussois, France, 2014.
    (slides: [.ppt], [.pdf])
  16. K. Takazawa: Structure theorems for square-free 2-matchings for bipartite graphs,
    The 9th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications, Fukuoka, Japan, 2015.


Return to Takazawa's Home
Return to Takazawa's Home (in Japanese)

Last modified: March, 2015