1. Some APX-completeness results for cubic graphs;Alimonti;Theor. Comput. Sci.,2000
2. Digraphs: Theory, Algorithms and Applications;Bang-Jensen,2009
3. Making a tournament k-arc-strong by reversing or deorienting arcs;Bang-Jensen;Discrete Appl. Math.,2004
4. On some tighter inapproximability results (extended abstract);Berman,1999
5. Bridging the gap between tree and connectivity augmentation: unified and stronger approaches;Cecchetto,2021