- K. Takazawa:
**A weighted even factor algorithm**,

The 37th Southeastern International Conference on Combinatorics, Graph Theory, and Computing,

Florida, USA, 2006. - S. Iwata and K. Takazawa:
**The independent even factor problem**,

The 19th International Symposium on Mathematical Programming (ISMP 2006),

Rio de Janeiro, Brazil, 2006. - S. Iwata and K. Takazawa:
**The independent even factor problem**,

The 18th ACM-SIAM Symposium on Discrete Algorithms (SODA 2007),

New Orleans, USA, 2007. - K. Takazawa:
**A weighted even factor algorithm**,

The 5th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications (HJ 2007),

Sendai, Japan, 2007. - K. Takazawa:
**A weighted $K_{t,t}$-free $t$-factor algorithm for bipartite graphs**,

The 1st AAAC Annual Meeting,

Pokfulam, Hong Kong, 2008. - 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. - K. Takazawa:
**Even factors: Algorithms and structure**,

Kyoto RIMS Workshop on Combinatorial Optimization and Discrete Algorithms,

Kyoto, Japan, 2008. - Y. Kobayashi and K. Takazawa:
**Square-free 2-matchings in bipartite graphs and jump systems**,

The 6th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications (JH 2009),

Budapest, Hungary, 2009.

(Speaker: Y. Kobayashi) - K. Takazawa:
**A weighted independent even factor algorithm**,

The 6th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications (JH 2009),

Budapest, Hungary, 2009. - K. Takazawa:
**Optimal matching forests and valuated delta-matroids**,

The 15th Conference on Integer Programming and Combinatorial Optimization (IPCO 2011),

New York, USA, 2011. - K. Takazawa:
**Shortest bibranchings and valuated matroid intersection**,

The First ETH-Japan Workshop on Science and Computing,

Engelberg, Switzerland, 2012. - 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. - 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. - K. Takazawa:
**Discrete convexity in network optimization: Matching forests and bibranchings**,

Kyoto RIMS Workshop "Discrete Convexity and Optimization",

Kyoto, Japan, 2012. - K. Takazawa:
**Shortest bibranchings and valuated matroid intersection**,

Combinatorial Geometries: Matroids, Oriented Matroids and Applications,

Marseille, France, 2013. - 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]) - 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. - 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. - K. Takazawa:
**Decomposition theorems for square-free 2-matchings in bipartite graphs**,

The 22nd International Symposium on Mathematical Programming (ISMP 2015),

Pittsburgh, USA, 2015.