Martin Nägele

23 papers A* 4A 1B 3Journal 14
YearRankTypeTitle / Venue / Authors
2026 J jnl
On the Complexity of the Odd-Red Bipartite Perfect Matching Polytope.
CoRR
Martin Nägele, Christian Nöbel, Rico Zenklusen
2025 J jnl
Advances on strictly Δ-modular IPs.
Math. Program.
Martin Nägele, Christian Nöbel, Richard Santiago, Rico Zenklusen
2024 A conf
A (3/2 + 1/e)-Approximation Algorithm for Ordered TSP.
APPROX/RANDOM
Susanne Armbruster, Matthias Mnich, Martin Nägele
2024 J jnl
A (3/2+1/e)-Approximation Algorithm for Ordered TSP.
CoRR
Susanne Armbruster, Matthias Mnich, Martin Nägele
2024 B conf
A Better-Than-1.6-Approximation for Prize-Collecting TSP.
IPCO
Jannis Blauth, Nathan Klein, Martin Nägele
2024 J jnl
A New Dynamic Programming Approach for Spanning Trees with Chain Constraints and Beyond.
Math. Oper. Res.
Martin Nägele, Rico Zenklusen
2024 J jnl
Congruency-Constrained TU Problems Beyond the Bimodular Case.
Math. Oper. Res.
Martin Nägele, Richard Santiago, Rico Zenklusen
2023 J jnl
A Better-Than-1.6-Approximation for Prize-Collecting TSP.
CoRR
Jannis Blauth, Nathan Klein, Martin Nägele
2023 J jnl
A New Dynamic Programming Approach for Spanning Trees with Chain Constraints and Beyond.
CoRR
Martin Nägele, Rico Zenklusen
2023 B conf
Advances on Strictly $\varDelta $-Modular IPs.
IPCO
Martin Nägele, Christian Nöbel, Richard Santiago, Rico Zenklusen
2023 J jnl
Advances on Strictly Δ-Modular IPs.
CoRR
Martin Nägele, Christian Nöbel, Richard Santiago, Rico Zenklusen
2023 A* conf
An Improved Approximation Guarantee for Prize-Collecting TSP.
STOC
Jannis Blauth, Martin Nägele
2022 J jnl
An improved approximation guarantee for Prize-Collecting TSP.
CoRR
Jannis Blauth, Martin Nägele
2022 A* conf
Congruency-Constrained TU Problems Beyond the Bimodular Case.
SODA
Martin Nägele, Richard Santiago, Rico Zenklusen
2021 J jnl
Congruency-Constrained TU Problems Beyond the Bimodular Case.
CoRR
Martin Nägele, Richard Santiago, Rico Zenklusen
2021 — —
Efficient Methods for Congruency-Constrained Optimization.
Martin Nägele
2020 J jnl
A new contraction technique with applications to congruency-constrained cuts.
Math. Program.
Martin Nägele, Rico Zenklusen
2019 B conf
A New Contraction Technique with Applications to Congruency-Constrained Cuts.
IPCO
Martin Nägele, Rico Zenklusen
2019 A* conf
A New Dynamic Programming Approach for Spanning Trees with Chain Constraints and Beyond.
SODA
Martin Nägele, Rico Zenklusen
2019 J jnl
Submodular Minimization Under Congruency Constraints.
Comb.
Martin Nägele, Benny Sudakov, Rico Zenklusen
2018 A* conf
Submodular Minimization Under Congruency Constraints.
SODA
Martin Nägele, Benny Sudakov, Rico Zenklusen
2017 J jnl
Submodular Minimization Under Congruency Constraints.
CoRR
Martin Nägele, Benny Sudakov, Rico Zenklusen
2016 J jnl
Refuting a conjecture of Goemans on bounded degree spanning trees.
Oper. Res. Lett.
Stephen R. Chestnut, Martin Nägele, Rico Zenklusen