Papers by Kenjiro Takazawa

Papers by Kenjiro Takazawa

Journal Papers

  1. K. Takazawa:
    A weighted even factor algorithm,
    Mathematical Programming, Series A, 115 (2008), pp. 223-237.
  2. S. Iwata and K. Takazawa:
    The independent even factor problem,
    SIAM Journal on Discrete Mathematics, 22 (2008), pp. 1411-1427.
  3. Y. Kobayashi and K. Takazawa:
    Even factors, jump systems, and discrete convexity,
    Journal of Combinatorial Theory, Series B, 99 (2009), pp. 139-161.
  4. K. Takazawa:
    A weighted $K_{t,t}$-free $t$-factor algorithm for bipartite graphs,
    Mathematics of Operations Research, 34 (2009), pp. 351-362.
  5. K. Takazawa:
    A weighted independent even factor algorithm,
    Mathematical Programming, Series A, 132 (2012), pp. 261-276.
  6. 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.
  7. K. Takazawa:
    Shortest bibranchings and valuated matroid intersection,
    Japan Journal of Industrial and Applied Mathematics, 29 (2012), pp. 561-573.
  8. 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.
  9. K. Takazawa:
    Optimal matching forests and valuated delta-matroids,
    SIAM Journal on Discrete Mathematics, 28 (2014), pp. 445-467.

Papers in Refereed Conferences and Symposia

  1. S. Iwata and K. Takazawa:
    The independent even factor problem,
    Proceedings of the 18th ACM-SIAM Symposium on Discrete Algorithms (SODA 2007), 2007, pp. 1171-1180.
  2. K. Takazawa:
    A weighted even factor algorithm,
    Proceedings of the 5th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications (HJ 2007), 2007, pp. 43-52.
  3. K. Takazawa:
    A weighted $K_{t,t}$-free $t$-factor algorithm for bipartite graphs,
    Proceedings of the 13th Conference on Integer Programming and Combinatorial Optimization (IPCO 2008),
    Lecture Notes in Computer Science 5035, 2008, pp. 62-76.
  4. Y. Kobayashi and K. Takazawa:
    Square-free 2-matchings in bipartite graphs and jump systems,
    Proceedings of the 6th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications (JH 2009), 2009, pp. 187-197.
  5. K. Takazawa:
    A weighted independent even factor algorithm,
    Proceedings of the 6th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications (JH 2009), 2009, pp. 361-371.
  6. K. Takazawa:
    Optimal matching forests and valuated delta-matroids,
    Proceedings of the 15th Conference on Integer Programming and Combinatorial Optimization (IPCO 2011),
    Lecture Notes in Computer Science 6655, 2011, pp. 404-416.
  7. K. Takazawa:
    Decomposition theorems for square-free 2-matchings in bipartite graphs,
    Proceedings of the 41st International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2015),
    Lecture Notes in Computer Science, to appear.
    [See also: K. Takazawa: Structure theorems for square-free 2-matchings in bipartite graphs,
    Proceedings of the 9th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications (HJ 2015), 2015, to appear.]

Technical Reports

  1. K. Takazawa:
    A weighted even factor algorithm,
    Mathematical Engineering Technical Reports, METR 2005-17, University of Tokyo, 2005.
  2. S. Iwata and K. Takazawa:
    The independent even factor problem,
    Mathematical Engineering Technical Reports, METR 2006-24, University of Tokyo, 2006.
  3. Y. Kobayashi and K. Takazawa:
    Even factors, jump systems, and discrete convexity,
    Mathematical Engineering Technical Reports, METR 2007-36, University of Tokyo, 2007.
    (See also RIMS Preprint, RIMS-1595, Kyoto University, 2007.)
  4. K. Takazawa:
    A weighted $K_{t,t}$-free $t$-factor algorithm for bipartite graphs,
    Mathematical Engineering Technical Reports, METR 2008-07, University of Tokyo, 2008.
    (See also RIMS Preprint, RIMS-1621, Kyoto University, 2008.)
  5. 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.)
  6. K. Takazawa:
    A weighted independent even factor algorithm,
    Mathematical Engineering Technical Reports, METR 2009-15, University of Tokyo, 2009.
  7. 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.
  8. K. Takazawa:
    Optimal matching forests and valuated delta-matroids,
    RIMS Preprint, RIMS-1718, Kyoto University, 2011.
  9. S. Boyd, S. Iwata and K. Takazawa:
    Covering cuts in bridgeless cubic graphs,
    RIMS Preprint, RIMS-1731, Kyoto University, 2011.
  10. 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.)
  11. K. Takazawa:
    Decomposition theorems for square-free 2-matchings in bipartite graphs,
    RIMS Preprint, RIMS-1813, Kyoto University, 2015.

Others

  1. 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.

Theses


Return to Takazawa's Home