I am a member of the Egerváry Research Group (EGRES) at the Department of Operations Research. I am mainly interested in combinatorial optimization, particularly in graph theory. I wrote my master thesis on packings and coverings in directed graphs. In the last few years I have been working on restricted b-matchings, especially on the case of triangle-free 2-matchings.
List of publications.
Here are the slides of some recent talks:
Splitting property via shadow systems , The 8th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications, Veszprém, June 2013
Restricted b-matchings , Discrete Convexity and Optimization, Kyoto, October 2012 (invited talk)
The Triangle-free 2-matching Polytope of Subcubic Graphs , The 21st International Symposium on Mathematical Programming, Berlin, August 2012 (invited talk)
A Note on Strongly Edge-Disjoint Arborescences , The 7th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications, Kyoto, June 2011
Restricted b-matchings in Degree-Bounded Graphs , The 14th Conference on Integer Programming and Combinatorial Optimization, Lausanne, June 2010
Packing Arborescences , Kyoto, January 2009
Informations for students can be found here.