Talks by Kenjiro Takazawa

Talks by Kenjiro Takazawa

  1. K. Takazawa:
    Excluded $t$-factors in Bipartite Graphs: A Unified Framework for Nonbipartite Matchings and Restricted 2-matchings,
    The 19th Conference on Integer Programming and Combinatorial Optimization (IPCO 2017),
    Waterloo, Canada, 2017.
    • Refereed
    • Acceptance ratio = 29% (36/125)
    • Slides: [PDF]
    • Photo tweet by Bill Cook
  2. K. Takazawa:
    Excluded $t$-factors in Bipartite Graphs: A Unified Framework for Nonbipartite Matchings and Restricted 2-matchings,
    The 10th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications (JH 2017),
    Budapest, Hungary, 2017.
    • Refereed
  3. K. Takazawa: Finding a maximum 2-matching excluding prescribed cycles in bipartite graphs,
    The 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016),
    Kraków, Poland, 2016.
    • Refereed
    • Acceptance ratio ≤ 38% (84/220)
    • Slides: [PDF]
  4. K. Takazawa: Decomposition theorems for square-free 2-matchings in bipartite graphs,
    The 22nd International Symposium on Mathematical Programming (ISMP 2015),
    Pittsburgh, USA, 2015.
    • Slides: [PDF]
  5. K. Takazawa: Decomposition theorems for square-free 2-matchings in bipartite graphs,
    The 41st International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2015),
    Munich, Germany, 2015.
    • Refereed
    • Acceptance ratio = 41% (32/79)
  6. K. Takazawa: Structure theorems for square-free 2-matchings in bipartite graphs,
    The 9th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications (HJ 2015),
    Fukuoka, Japan, 2015.
    • Refereed
    • Slides: [PDF]

  7. 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: [PDF]
  8. K. Takazawa: Shortest bibranchings and valuated matroid intersection,
    Combinatorial Geometries: Matroids, Oriented Matroids and Applications,
    Marseille, France, 2013.
  9. K. Takazawa: Discrete convexity in network optimization: Matching forests and bibranchings,
    Kyoto RIMS Workshop "Discrete Convexity and Optimization",
    Kyoto, Japan, 2012.
    • Invited

  10. 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.
  11. S. Boyd, S. Iwata and K. Takazawa: Covering cuts in bridgeless cubic graphs,
    The 21st International Symposium on Mathematical Programming (ISMP 2012),
    Berlin, Germany, 2012.
  12. K. Takazawa: Shortest bibranchings and valuated matroid intersection,
    The First ETH-Japan Workshop on Science and Computing,
    Engelberg, Switzerland, 2012.
  13. K. Takazawa: Optimal matching forests and valuated delta-matroids,
    The 15th Conference on Integer Programming and Combinatorial Optimization (IPCO 2011),
    New York, USA, 2011.
    • Refereed
    • Acceptance ratio = 30% (33/110)
  14. K. Takazawa: Optimal matching forests and valuated delta-matroids,
    Shonan Meeting: Graph Algorithm and Combinatorial Optimization,
    Shonan, Japan, 2011.
  15. K. Takazawa: A weighted independent even factor algorithm,
    The 6th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications (JH 2009),
    Budapest, Hungary, 2009.
    • Refereed
  16. K. Takazawa: Even factors: Algorithms and structure,
    Kyoto RIMS Workshop on Combinatorial Optimization and Discrete Algorithms,
    Kyoto, Japan, 2008.
    • Invited
  17. K. Takazawa: A weighted $K_{t,t}$-free $t$-factor algorithm for bipartite graphs,
    The 13th Conference on Integer Programming and Combinatorial Optimization (IPCO 2008),
    Bertinoro, Italy, 2008.
    • Refereed
    • Acceptance ratio = 34% (32/95)
  18. K. Takazawa: A weighted $K_{t,t}$-free $t$-factor algorithm for bipartite graphs,
    The 1st AAAC Annual Meeting,
    Pokfulam, Hong Kong, 2008.
  19. K. Takazawa: A weighted even factor algorithm,
    The 5th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications (HJ 2007),
    Sendai, Japan, 2007.
    • Refereed
  20. S. Iwata and K. Takazawa: The independent even factor problem,
    The 18th ACM-SIAM Symposium on Discrete Algorithms (SODA 2007),
    New Orleans, USA, 2007.
    • Refereed
    • Acceptance ratio = 36% (139/382)
  21. S. Iwata and K. Takazawa: The independent even factor problem,
    The 19th International Symposium on Mathematical Programming (ISMP 2006),
    Rio de Janeiro, Brazil, 2006.
  22. K. Takazawa: A weighted even factor algorithm,
    The 37th Southeastern International Conference on Combinatorics, Graph Theory, and Computing,
    Florida, USA, 2006.

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