Slides

The bbibranching problem: TDI system, packing, and discrete convexity
[PDF],
The 23rd International Symposium on Mathematical Programming (ISMP 2018),
Bordeaux, France, July 3, 2018.

Excluded tfactors in Bipartite Graphs:
A Unified Framework for Nonbipartite Matchings and Restricted 2matchings
[PDF],
The 19th Conference on Integer Programming and Combinatorial Optimization (IPCO 2017),
Waterloo, Canada, June 27, 2017.

Finding a maximum 2matching excluding prescribed cycles in bipartite graphs
[PDF],
The 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016),
Kraków, Poland, Aug. 25, 2016.

Randomized strategies for cardinality robustness in the knapsack problem
[PDF],
Analytic Algorithmics and Combinatorics (ANALCO16),
Arlington, USA, Jan. 11, 2016.

Decomposition theorems for squarefree 2matchings in bipartite graphs
[PDF],
The 22nd International Symposium on Mathematical Programming (ISMP 2015),
Pittsburgh, USA, July 13, 2015.
 Finding 2factors closer to TSP tours in cubic graphs
[PDF],
The 18th Aussois Combinatorial Optimization Workshop,
Aussois, France, Jan. 7, 2014.
