Talks

T1   Packing Arborescences, Kyoto, January 2009

T2   Restricted b-matchings in Degree-Bounded Graphs, The 14th Conference on Integer Programming and Combinatorial Optimization (June 2010), Lausanne, Switzerland

T3   A Note on Strongly Edge-Disjoint Arborescences, The 7th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications (June 2011), Kyoto, Japan

T4   The Triangle-free 2-matching Polytope of Subcubic Graphs, The 21st International Symposium on Mathematical Programming (August 2012), Berlin, Germany (invited talk)

T5   Restricted b-matchings, Discrete Convexity and Optimization (October 2012), Kyoto, Japan (invited talk)

T6   Splitting property via shadow systems, The 8th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications (June 2013), Veszprém, Hungary

T7   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

T8   Arborescence packing and its applications, ELTE Summer School in Discrete Mathematics 2014, Budapest, Hungary

T9   Packing arborescences under matroid constraints, 7th Cracow Conference on Graph Theory (September 2014), Rytro, Poland

T10   Graph optimization problems of common root, The 9th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications (June 2015), Fukuoka, Japan

T11   Degree-sequences of highly-connected simple digraphs, NII Shonan Meeting on Current Trends in Combinatorial Optimization (April 2016), Japan

T12   Degree-bounded simple bipartite graphs with maximum matching number, European Chapter in Combinatorial Optimization (ECCO 2016), Budapest, Hungary