TRANSPARENTS

  1. Reachability-based matroid-restricted packing of arborescences (2017) (pdf),
  2. On minimally $2$-$T$-connected digraph (2017) (pdf),
  3. Matroid-based packing of spanning arborescences (2017) (pdf),
  4. Packing arborescences : a survey (2017) (pdf),
  5. Packing of arborescences versus matroid intersection (2016) (pdf),
  6. Summer school in Bonn : Connectivity Problems (2015); Talk 1 (pdf) (video), Talk 2 (pdf) (video), Talk 3 (pdf) (video),
  7. On (2k,k)-connected graphs (2015) (pdf),
  8. Old and new results on packing arborescences (2015) (pdf),
  9. Characterization of non-Seymour graphs - from matching theory's point of view (2014) (pdf),
  10. Opening of the meeting in honor of András Sebő (2014) (pdf),
  11. On packing of arborescences with matroid constraints (2013) (pdf),
  12. On packing of arborescences (2012) (pdf),
  13. On 2-vertex-connected orientations of graphs (2012) (pdf),
  14. Sandwich problems on orientations (2011) (pdf),
  15. Orientations of graphs (2011) (pdf),
  16. An excluded minor characterization of Seymour graphs (2011) (pdf),
  17. Edge-connectivity of permutation hypergraphs (2010) (pdf),
  18. Edge-connectivity augmentation of graphs over symmetric parity families (2010) (pdf),
  19. Partition Constrained Edge-Connectivity Augmentation of a Hypergraph (2009) (pdf),
  20. Hypergraph Edge-Connectivity Augmentation (2009) (pdf),
  21. Edge-connectivity augmentations of graphs and hypergraphs (2008) (pdf),
  22. Covering symmetric skew-supermodular functions (2008) (pdf),
  23. Augmentation de la connexité entre noeuds et zones (2007) (pdf),
  24. Fiabilisation des réseaux par augmentation de la connexité : Applications au transport et télécommunication (2007) (pdf),
  25. Reliable Network Design (2006) (pdf),
  26. Reliable Orientations of Eulerian Graphs (2006) (pdf),
  27. Augmentation de l'arête-connexité des graphes bipartis (2005) (pdf),
  28. On the local splitting off theorem (2005) (pdf),
  29. Edge-connectivity augmentation of graphs (2004) (pdf),
  30. On 2-edge-connected spanning subgraph problem (2001) (pdf),
  31. On min-max theorems in matching theory (2000) (pdf),
  32. Matchings and ear-decompositions (1998) (pdf),
  33. The two ear theorem on matching-covered graphs (1996) (pdf),
  34. A note on packing paths in planar graphs (1994) (pdf),
  35. A characterization of Seymour graphs (1994) (pdf),