K. Takazawa: A weighted even factor algorithm,
Mathematical Programming, Series A, 115 (2008), pp. 223-237.
S. Iwata and K. Takazawa:
The independent even factor problem,
SIAM Journal on Discrete Mathematics, 22 (2008), pp. 1411-1427.
Y. Kobayashi and K. Takazawa:
Even factors, jump systems, and discrete convexity,
Journal of Combinatorial Theory, Series B, 99 (2009), pp. 139-161.
K. Takazawa:
A weighted Kt,t-free t-factor
algorithm for bipartite graphs,
Mathematics of Operations Research, 34 (2009), pp. 351-362.
K. Takazawa:
A weighted independent even factor algorithm,
Mathematical Programming, Series A, 132 (2012), pp. 261-276.
Y. Kobayashi, J. Szabó and K. Takazawa:
A proof of Cunningham's conjecture on restricted subgraphs and jump systems,
Journal of Combinatorial Theory, Series B, 102 (2012), pp. 948-966.
K. Takazawa:
Shortest bibranchings and valuated matroid intersection,
Japan Journal of Industrial and Applied Mathematics, 29 (2012), pp. 561-573.
S. Boyd, S. Iwata and K. Takazawa:
Finding 2-factors closer to TSP tours in cubic graphs,
SIAM Journal on Discrete Mathematics, 27 (2013), pp. 918-939.
K. Takazawa:
Optimal matching forests and valuated delta-matroids,
SIAM Journal on Discrete Mathematics, 28 (2014), pp. 445-467.
Y. Kobayashi and K. Takazawa:
Square-free 2-matchings in bipartite graphs and jump systems,
Mathematical Engineering Technical Reports, METR 2008-40, University of Tokyo, 2008.
(See also RIMS Preprint,
RIMS-1640, Kyoto University, 2008.)
Y. Kobayashi, J. Szabó and K. Takazawa:
A proof to Cunningham's conjecture on restricted subgraphs and jump systems,
EGRES Technical Reports, TR-2010-04, Egerváry Research Group, 2010.
K. Takazawa:
Optimal matching forests and valuated delta-matroids,
RIMS Preprint,
RIMS-1718, Kyoto University, 2011.
S. Boyd, S. Iwata and K. Takazawa:
Covering cuts in bridgeless cubic graphs,
RIMS Preprint,
RIMS-1731, Kyoto University, 2011.
S. Fujishige, T. Király, K. Makino, K. Takazawa and S. Tanigawa:
Minimizing submodular functions on diamonds via generalized fractional matroid matchings,
EGRES Technical Reports, TR-2014-14, Egerváry Research Group, 2014.
(See also RIMS Preprint,
RIMS-1812, Kyoto University, 2015.)
K. Takazawa:
Decomposition theorems for square-free 2-matchings in bipartite graphs,
RIMS Preprint,
RIMS-1813, Kyoto University, 2015.
Theses
[Master's Thesis]A Unified Approach to Combinatorial Algorithms for Matchings and Matroids,
University of Tokyo, 2007 (supervised by
Kazuo Murota and Satoru Iwata).
[Ph.D. Thesis]Combinatorial Algorithms for Generalized Matching Problems,
University of Tokyo, 2010 (supervised by
Kazuo Murota).
Others
K. Takazawa:
Even factors: Algorithms and structure,
in: S. Iwata (ed.), Combinatorial Optimization and Discrete Algorithms,
RIMS Kôkyûroku Bessatsu,
B23 (2010), pp. 233-252.