Global Routing with Inherent Static Timing Constraints. - Stephan Held; Dirk Müller 003; Daniel Rotter; Vera Traub; Jens Vygen (ICCAD, 2015)

Approaching $ frac{3}{2}$ for the $s$-$t$-path TSP. - Vera Traub; Jens Vygen (CoRR, 2017)

Approaching for the s-t-path TSP. - Vera Traub; Jens Vygen (SODA, 2018)

Layers and matroids for the traveling salesman's paths. - Frans Schalekamp; András Sebö; Vera Traub; Anke van Zuylen (Oper. Res. Lett., 2018)

Global Routing With Timing Constraints. - Stephan Held; Dirk Müller 003; Daniel Rotter; Rudolf Scheifele; Vera Traub; Jens Vygen (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2018)

Approaching 3/2 for the s-t-path TSP. - Vera Traub; Jens Vygen (J. ACM, 2019)

An improved upper bound on the integrality ratio for the s-t-path TSP. - Vera Traub; Jens Vygen (Oper. Res. Lett., 2019)

A Fast (2 + 2/7)-Approximation Algorithm for Capacitated Cycle Covering. - Vera Traub; Thorben Tröbst (IPCO, 2020)

An improved approximation algorithm for ATSP. - Vera Traub; Jens Vygen (STOC, 2020)

The asymmetric traveling salesman path LP has constant integrality ratio. - Anna Köhne; Vera Traub; Jens Vygen (Math. Program., 2020)

Improving on Best-of-Many-Christofides for T-tours. - Vera Traub (Oper. Res. Lett., 2020)

Approximation Algorithms for Traveling Salesman Problems - Vera Traub (2020)

A Better-Than-2 Approximation for Weighted Tree Augmentation. - Vera Traub; Rico Zenklusen (FOCS, 2021)

Bridging the gap between tree and connectivity augmentation: unified and stronger approaches. - Federica Cecchetto; Vera Traub; Rico Zenklusen (STOC, 2021)

Local Search for Weighted Tree Augmentation and Steiner Tree. - Vera Traub; Rico Zenklusen (SODA, 2022)

Breaching the 2-approximation barrier for the forest augmentation problem. - Fabrizio Grandoni 001; Afrouz Jabal Ameli; Vera Traub (STOC, 2022)

Better-Than-4/3-Approximations for Leaf-to-Leaf Tree and Connectivity Augmentation. - Federica Cecchetto; Vera Traub; Rico Zenklusen (CoRR, 2022)

A fast $(2 + frac{2}{7})$-approximation algorithm for capacitated cycle covering. - Vera Traub; Thorben Tröbst (Math. Program., 2022)

An Improved Approximation Algorithm for The Asymmetric Traveling Salesman Problem. - Vera Traub; Jens Vygen (SIAM J. Comput., 2022)

Reducing Path TSP to TSP. - Vera Traub; Jens Vygen; Rico Zenklusen (SIAM J. Comput., 2022)

A (1.5+ε)-Approximation Algorithm for Weighted Connectivity Augmentation. - Vera Traub; Rico Zenklusen (STOC, 2023)

Improving the approximation ratio for capacitated vehicle routing. - Jannis Blauth; Vera Traub; Jens Vygen (Math. Program., 2023)

Beating the Integrality Ratio for $s$-$t$-Tours in Graphs. - Vera Traub; Jens Vygen (SIAM J. Comput., 2023)

The Bidirected Cut Relaxation for Steiner Tree has Integrality Gap Smaller Than 2. - Jaroslaw Byrka; Fabrizio Grandoni 001; Vera Traub (FOCS, 2024)

Single-Source Unsplittable Flows in Planar Graphs. - Vera Traub; Laura Vargas Koch; Rico Zenklusen (SODA, 2024)

Vehicle routing with time-dependent travel times: Theory, practice, and benchmarks. - Jannis Blauth; Stephan Held; Dirk Müller 003; Niklas Schlomberg; Vera Traub; Thorben Tröbst; Jens Vygen (Discret. Optim., 2024)

Cost allocation for set covering: The happy nucleolus. - Jannis Blauth; Antonia Ellerbrock; Vera Traub; Jens Vygen (Oper. Res. Lett., 2024)

Better-than-$ frac{4}{3}$-approximations for leaf-to-leaf tree and connectivity augmentation. - Federica Cecchetto; Vera Traub; Rico Zenklusen (Math. Program., 2024)

On the Bidirected Cut Relaxation for Steiner Forest. - Jaroslaw Byrka; Fabrizio Grandoni 001; Vera Traub (IPCO, 2025)

Better-Than-2 Approximations for Weighted Tree Augmentation and Applications to Steiner Tree. - Vera Traub; Rico Zenklusen (J. ACM, 2025)