Talks by Kenjiro Takazawa
 K. Takazawa:
Notes on equitable partitions into matching forests in mixed graphs and $b$branchings in digraphs,
The 6th International Symposium on Combinatorial Optimization (ISCO 2020),
Montreal, Canada Online, 2020.
 Refereed
 Acceptance ratio = 38%
 Slides: [PDF]
 N. Kakimura, N. Kamiyama and K. Takazawa:
The $b$branching problem: Branchings with high indegree,
The 10th Cargèse
Workshop on Combinatorial Optimization,
Corsica, France, 2019.
 K. Takazawa:
$b$branchings: Branchings with high indegree,
The 11th HungarianJapanese Symposium on Discrete Mathematics and Its Applications (HJ 2019),
Tokyo, Japan, 2019.
 K. Takazawa:
Generalizations of weighted matroid congestion games: Pure Nash equilibrium, sensitivity analysis, and discrete convex function,
The 15th Annual Conference on Theory and Applications of Models of Computation (TAMC 2019),
Kitakyushu, Japan, 2019.
 K. Takazawa:
Excluded $t$factors in bipartite graphs: A unified framework for nonbipartite matchings and restricted 2matchings,
The Traveling Salesman Problem: Algorithms & Optimization,
Banff, Canada, 2018.
 N. Kakimura, N. Kamiyama and K. Takazawa:
The $b$branching problem in digraphs,
The 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018),
Liverpool, UK, 2018.
 Refereed
 Acceptance ratio ≤ 40% (84/210)
 Slides: [PDF]
 K. Takazawa:
The $b$bibranching problem: TDI System, packing, and discrete convexity,
The 23rd International Symposium on Mathematical Programming (ISMP 2018),
Bordeaux, France, 2018.
 K. Takazawa:
Excluded $t$factors in bipartite graphs: A unified framework for nonbipartite matchings and restricted 2matchings,
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
 K. Takazawa:
Excluded $t$factors in bipartite graphs: A unified framework for nonbipartite matchings and restricted 2matchings,
The 10th JapaneseHungarian Symposium on Discrete Mathematics and Its Applications (JH 2017),
Budapest, Hungary, 2017.
 K. Takazawa:
Finding a maximum 2matching 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]
 K. Takazawa:
Decomposition theorems for squarefree 2matchings in bipartite graphs,
The 22nd International Symposium on Mathematical Programming (ISMP 2015),
Pittsburgh, USA, 2015.
 K. Takazawa:
Decomposition theorems for squarefree 2matchings in bipartite graphs,
The 41st International Workshop on GraphTheoretic Concepts in Computer Science (WG 2015),
Munich, Germany, 2015.
 Refereed
 Acceptance ratio = 41% (32/79)
 K. Takazawa:
Structure theorems for squarefree 2matchings in bipartite graphs,
The 9th HungarianJapanese Symposium on Discrete Mathematics and Its Applications (HJ 2015),
Fukuoka, Japan, 2015.
 S. Boyd, S. Iwata and K. Takazawa:
Finding 2factors closer to TSP tours in cubic graphs,
The 18th Aussois Combinatorial Optimization Workshop,
Aussois, France, 2014.
 K. Takazawa:
Shortest bibranchings and valuated matroid intersection,
Combinatorial Geometries: Matroids, Oriented Matroids and Applications,
Marseille, France, 2013.
 K. Takazawa:
Discrete convexity in network optimization:
Matching forests and bibranchings,
Kyoto RIMS Workshop "Discrete Convexity and Optimization",
Kyoto, Japan, 2012.
 S. Boyd, S. Iwata and K. Takazawa:
Finding 2factors closer to TSP tours in cubic graphs,
The 3rd Cargèse
Workshop on Combinatorial Optimization,
Corsica, France, 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.
 K. Takazawa:
Shortest bibranchings and valuated matroid intersection,
The First ETHJapan Workshop on Science and Computing,
Engelberg, Switzerland, 2012.
 K. Takazawa:
Optimal matching forests and valuated deltamatroids,
The 15th Conference on Integer Programming and Combinatorial Optimization (IPCO 2011),
New York, USA, 2011.
 Refereed
 Acceptance ratio = 30% (33/110)
 K. Takazawa:
Optimal matching forests and valuated deltamatroids,
Shonan Meeting: Graph Algorithm and Combinatorial Optimization,
Shonan, Japan, 2011.
 K. Takazawa:
A weighted independent even factor algorithm,
The 6th JapaneseHungarian Symposium on Discrete Mathematics and Its Applications (JH 2009),
Budapest, Hungary, 2009.
 K. Takazawa:
Even factors: Algorithms and structure,
Kyoto RIMS Workshop on Combinatorial Optimization and Discrete Algorithms,
Kyoto, Japan, 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.
 Refereed
 Acceptance ratio = 34% (32/95)
 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 even factor algorithm,
The 5th HungarianJapanese Symposium on Discrete Mathematics and Its Applications (HJ 2007),
Sendai, Japan, 2007.
 S. Iwata and K. Takazawa:
The independent even factor problem,
The 18th ACMSIAM Symposium on Discrete Algorithms (SODA 2007),
New Orleans, USA, 2007.
 Refereed
 Acceptance ratio = 36% (139/382)
 S. Iwata and K. Takazawa:
The independent even factor problem,
The 19th International Symposium on Mathematical Programming (ISMP 2006),
Rio de Janeiro, Brazil, 2006.
 K. Takazawa:
A weighted even factor algorithm,
The 37th Southeastern International Conference on Combinatorics,
Graph Theory, and Computing,
Florida, USA, 2006.
