Conferences and Workshops

T1   Restricted b-matchings in Degree-Bounded Graphs, The 14th Conference on Integer Programming and Combinatorial Optimization (June 2010), Lausanne, Switzerland
T2   A Note on Strongly Edge-Disjoint Arborescences, The 7th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications (June 2011), Kyoto, Japan
T3   The Triangle-free 2-matching Polytope of Subcubic Graphs, The 21st International Symposium on Mathematical Programming (August 2012), Berlin, Germany
T4   Restricted b-matchings, Discrete Convexity and Optimization (October 2012), Kyoto, Japan
T5   Splitting property via shadow systems, The 8th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications (June 2013), Veszprém, Hungary
T6   From digraphs to dypergraphs: paths and arborescences, Horn formulas, directed hypergraphs, lattices and closure systems: related formalisms and applications (May 2014), Dagstuhl Seminar 14201, Germany
T7   Packing arborescences under matroid constraints, 7th Cracow Conference on Graph Theory (September 2014), Rytro, Poland
T8   Graph optimization problems of common root, The 9th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications (June 2015), Fukuoka, Japan
T9   Degree-sequences of highly-connected simple digraphs, NII Shonan Meeting on Current Trends in Combinatorial Optimization (April 2016), Japan
T10   Degree-bounded simple bipartite graphs with maximum matching number, European Chapter in Combinatorial Optimization (ECCO 2016), Budapest, Hungary
T11   Directed hypergraphs and Horn minimization, The 10th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications (June 2017), Budapest, Hungary
T12   Matroidal term rank, CIRM Workshop on Combinatorial Geometries (September 2018), Marseille-Luminy, France
T13   Complexity of packing common bases, Bellairs Workshop on Discrete Optimization (April 2019), Barbados
T14   Complexity of packing common bases in the intersection of matroids, The 11th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications (May 2019), Tokyo, Japan
T15   Supermodularity in unweighted graph optimization: Algorithms, International Workshop on Combinatorial Optimization and Algorithmic Game Theory (January 2020), Kyoto, Japan

Seminars and Summer Schools

S1   Packing Arborescences, University of Tokyo, Japan (January 2009)
S2   Packing Arborescences, Research Institute of Mathematical Sciences, Kyoto University, Japan (February 2009)
S3   Arborescence packing and its applications, ELTE Summer School in Discrete Mathematics 2014, Budapest, Hungary
S4   Graphical degree sequences, ELTE Summer School in Discrete Mathematics 2015, Budapest, Hungary
S5   A tight √2-approximation for Linear 3-Cut, Research Institute of Mathematical Sciences (RIMS), Kyoto University, Japan (November 2017)
S6   Degree sequences of highly connected simple digraphs, Research Institute of Mathematical Sciences (RIMS), Kyoto University, Japan (June 2018)
S7   Improving the integrality gap for multiway cut, London School of Economics, London, UK (November 2018)
S8   Complexity of packing common bases, University of Bonn, Bonn, Germany (July 2019)
S9   Improving the integrality gap for multiway cut, Research Institute of Mathematical Sciences (RIMS), Kyoto University, Japan (December 2019)