Jens Vygen - RankMe

103 papers A* 9A 5B 9Journal 70Unranked 6

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Better approximation guarantee for Asymmetric TSP. CoRR Jens Vygen
2026	—	`conf`	Invited: BonnRoute: Classic Routing Algorithms with Recent Advances. ISPD Jens Vygen
2025	J	`jnl`	An Efficient Algorithm for Minimizing Ordered Norms in Fractional Load Balancing. CoRR Daniel Blankenburg, Antonia Ellerbrock, Thomas Kesselheim, Jens Vygen
2025	J	`jnl`	Improved Guarantees for the A Priori TSP. Math. Oper. Res. Jannis Blauth, Meike Neuwohner, Luise Puhlmann, Jens Vygen
2025	J	`jnl`	Packing Cycles in Planar and Bounded-Genus Graphs. SIAM J. Comput. Niklas Schlomberg, Hanjo Thiele, Jens Vygen
2024	J	`jnl`	Cost Allocation for Set Covering: the Happy Nucleolus. CoRR Jannis Blauth, Antonia Ellerbrock, Vera Traub, Jens Vygen
2024	J	`jnl`	Cost allocation for set covering: The happy nucleolus. Oper. Res. Lett. Jannis Blauth, Antonia Ellerbrock, Vera Traub, Jens Vygen
2024	J	`jnl`	Faster goal-oriented shortest path search for bulk and incremental detailed routing. Math. Program. Markus Ahrens, Dorothee Henke, Stefan Rabenstein, Jens Vygen
2024	B	`ed.`	Integer Programming and Combinatorial Optimization - 25th International Conference, IPCO 2024, Wrocław, Poland, July 3-5, 2024, Proceedings IPCO Jens Vygen, Jaroslaw Byrka
2024	J	`jnl`	Vehicle routing with time-dependent travel times: Theory, practice, and benchmarks. Discret. Optim. Jannis Blauth, Stephan Held, Dirk Müller, Niklas Schlomberg, Vera Traub, Thorben Tröbst, Jens Vygen
2023	J	`jnl`	Approximating Maximum Integral Multiflows on Bounded Genus Graphs. Discret. Comput. Geom. Chien-Chung Huang, Mathieu Mari, Claire Mathieu, Jens Vygen
2023	J	`jnl`	Approximating the discrete time-cost tradeoff problem with bounded depth. Math. Program. Siad Daboul, Stephan Held, Jens Vygen
2023	J	`jnl`	Beating the Integrality Ratio for $s$-$t$-Tours in Graphs. SIAM J. Comput. Vera Traub, Jens Vygen
2023	B	`conf`	Improved Guarantees for the a Priori TSP. ISAAC Jannis Blauth, Meike Neuwohner, Luise Puhlmann, Jens Vygen
2023	J	`jnl`	Improved guarantees for the a priori TSP. CoRR Jannis Blauth, Meike Neuwohner, Luise Puhlmann, Jens Vygen
2023	J	`jnl`	Improving the approximation ratio for capacitated vehicle routing. Math. Program. Jannis Blauth, Vera Traub, Jens Vygen
2023	A*	`conf`	Packing cycles in planar and bounded-genus graphs. SODA Niklas Schlomberg, Hanjo Thiele, Jens Vygen
2022	J	`jnl`	An Improved Approximation Algorithm for The Asymmetric Traveling Salesman Problem. SIAM J. Comput. Vera Traub, Jens Vygen
2022	B	`conf`	Faster Goal-Oriented Shortest Path Search for Bulk and Incremental Detailed Routing. IPCO Markus Ahrens, Dorothee Henke, Stefan Rabenstein, Jens Vygen
2022	J	`jnl`	Packing cycles in planar and bounded-genus graphs. CoRR Niklas Schlomberg, Hanjo Thiele, Jens Vygen
2022	J	`jnl`	Reducing Path TSP to TSP. SIAM J. Comput. Vera Traub, Jens Vygen, Rico Zenklusen
2022	J	`jnl`	Vehicle Routing with Time-Dependent Travel Times: Theory, Practice, and Benchmarks. CoRR Jannis Blauth, Stephan Held, Dirk Müller, Niklas Schlomberg, Vera Traub, Thorben Tröbst, Jens Vygen
2021	J	`jnl`	An Approximation Algorithm for Fully Planar Edge-Disjoint Paths. SIAM J. Discret. Math. Chien-Chung Huang, Mathieu Mari, Claire Mathieu, Kevin Schewior, Jens Vygen
2021	A*	`conf`	Approximating Maximum Integral Multiflows on Bounded Genus Graphs. ICALP Chien-Chung Huang, Mathieu Mari, Claire Mathieu, Jens Vygen
2021	B	`conf`	Approximating the Discrete Time-Cost Tradeoff Problem with Bounded Depth. IPCO Siad Daboul, Stephan Held, Jens Vygen
2021	J	`jnl`	Faster Goal-Oriented Shortest Path Search for Bulk and Incremental Detailed Routing. CoRR Markus Ahrens, Dorothee Henke, Stefan Rabenstein, Jens Vygen
2021	B	`conf`	Improving the Approximation Ratio for Capacitated Vehicle Routing. IPCO Jannis Blauth, Vera Traub, Jens Vygen
2020	J	`jnl`	An Approximation Algorithm for Fully Planar Edge-Disjoint Paths. CoRR Chien-Chung Huang, Mathieu Mari, Claire Mathieu, Kevin Schewior, Jens Vygen
2020	A*	`conf`	An improved approximation algorithm for ATSP. STOC Vera Traub, Jens Vygen
2020	J	`jnl`	Approximating maximum integral multiflows on bounded genus graphs. CoRR Chien-Chung Huang, Mathieu Mari, Claire Mathieu, Jens Vygen
2020	J	`jnl`	Approximating the discrete time-cost tradeoff problem with bounded depth. CoRR Siad Daboul, Stephan Held, Jens Vygen
2020	J	`jnl`	Few Sequence Pairs Suffice: Representing All Rectangle Placements. SIAM J. Discret. Math. Jannik Silvanus, Jens Vygen
2020	J	`jnl`	Improving the Approximation Ratio for Capacitated Vehicle Routing. CoRR Jannis Blauth, Vera Traub, Jens Vygen
2020	A*	`conf`	Reducing path TSP to TSP. STOC Vera Traub, Jens Vygen, Rico Zenklusen
2020	J	`jnl`	The asymmetric traveling salesman path LP has constant integrality ratio. Math. Program. Anna Köhne, Vera Traub, Jens Vygen
2019	J	`jnl`	An improved approximation algorithm for ATSP. CoRR Vera Traub, Jens Vygen
2019	J	`jnl`	An improved upper bound on the integrality ratio for the s-t-path TSP. Oper. Res. Lett. Vera Traub, Jens Vygen
2019	J	`jnl`	Approaching 3/2 for the J. ACM Vera Traub, Jens Vygen
2019	J	`jnl`	Reducing Path TSP to TSP. CoRR Vera Traub, Jens Vygen, Rico Zenklusen
2019	B	`conf`	The Asymmetric Traveling Salesman Path LP Has Constant Integrality Ratio. IPCO Anna Köhne, Vera Traub, Jens Vygen
2019	J	`jnl`	Vehicle routing with subtours. Discret. Optim. Stephan Held, Jochen Könemann, Jens Vygen
2018	J	`jnl`	An Approximation Algorithm for Threshold Voltage Optimization. ACM Trans. Design Autom. Electr. Syst. Siad Daboul, Stephan Held, Jens Vygen, Sonja Wittke
2018	J	`jnl`	An improved upper bound on the integrality ratio for the s-t-path TSP. CoRR Vera Traub, Jens Vygen
2018	A*	`conf`	Approaching for the SODA Vera Traub, Jens Vygen
2018	A*	`conf`	Beating the Integrality Ratio for s-t-Tours in Graphs. FOCS Vera Traub, Jens Vygen
2018	J	`jnl`	Beating the integrality ratio for s-t-tours in graphs. CoRR Vera Traub, Jens Vygen
2018	J	`jnl`	Better s-t-tours by Gao trees. Math. Program. Corinna Gottschalk, Jens Vygen
2018	J	`jnl`	Global Routing With Timing Constraints. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. Stephan Held, Dirk Müller, Daniel Rotter, Rudolf Scheifele, Vera Traub, Jens Vygen
2018	J	`jnl`	The asymmetric traveling salesman path LP has constant integrality ratio. CoRR Anna Köhne, Vera Traub, Jens Vygen
2018	J	`jnl`	Vehicle Routing with Subtours. CoRR Stephan Held, Jochen Könemann, Jens Vygen
2017	J	`jnl`	Approaching $\frac{3}{2}$ for the $s$-$t$-path TSP. CoRR Vera Traub, Jens Vygen
2017	J	`jnl`	Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm. Math. Program. Comput. Stefan Hougardy, Jannik Silvanus, Jens Vygen
2017	—	`conf`	On the Integrality Gap of the Prize-Collecting Steiner Forest LP. APPROX-RANDOM Jochen Könemann, Neil Olver, Kanstantsin Pashkovich, R. Ravi, Chaitanya Swamy, Jens Vygen
2017	J	`jnl`	On the Integrality Gap of the Prize-Collecting Steiner Forest LP. CoRR Jochen Könemann, Neil Olver, Kanstantsin Pashkovich, R. Ravi, Chaitanya Swamy, Jens Vygen
2017	J	`jnl`	Two-Connected Spanning Subgraphs with at Most $\frac{10}{7}{OPT}$ Edges. SIAM J. Discret. Math. Klaus Heeger, Jens Vygen
2016	B	`conf`	Better s-t-Tours by Gao Trees. IPCO Corinna Gottschalk, Jens Vygen
2016	J	`jnl`	Reassembling Trees for the Traveling Salesman. SIAM J. Discret. Math. Jens Vygen
2016	J	`jnl`	Two-connected spanning subgraphs with at most 10/7 OPT edges. CoRR Klaus Heeger, Jens Vygen
2015	J	`jnl`	Better $s$-$t$-Tours by Gao Trees. CoRR Corinna Gottschalk, Jens Vygen
2015	A	`conf`	Global Routing with Inherent Static Timing Constraints. ICCAD Stephan Held, Dirk Müller, Daniel Rotter, Vera Traub, Jens Vygen
2015	J	`jnl`	Preface. Math. Program. Jon Lee, Jens Vygen
2015	J	`jnl`	Reassembling trees for the traveling salesman. CoRR Jens Vygen
2014	J	`jnl`	Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm. CoRR Stefan Hougardy, Jannik Silvanus, Jens Vygen
2014	B	`ed.`	Integer Programming and Combinatorial Optimization - 17th International Conference, IPCO 2014, Bonn, Germany, June 23-25, 2014. Proceedings IPCO Jon Lee, Jens Vygen
2014	J	`jnl`	Shorter tours by nicer ears: 7/5-Approximation for the graph-TSP, 3/2 for the path version, and 4/3 for two-edge-connected subgraphs. Comb. András Sebö, Jens Vygen
2013	J	`jnl`	BonnRoute: Algorithms and data structures for fast and good VLSI routing. ACM Trans. Design Autom. Electr. Syst. Michael Gester, Dirk Müller, Tim Nieberg, Christian Panten, Christian Schulte, Jens Vygen
2013	J	`jnl`	d-dimensional arrangement revisited. Inf. Process. Lett. Daniel Rotter, Jens Vygen
2012	A*	`conf`	Algorithms and data structures for fast and good VLSI routing. DAC Michael Gester, Dirk Müller, Tim Nieberg, Christian Panten, Christian Schulte, Jens Vygen
2012	J	`jnl`	Shorter Tours by Nicer Ears: 7/5-approximation for graphic TSP, 3/2 for the path version, and 4/3 for two-edge-connected subgraphs. CoRR András Sebö, Jens Vygen
2011	—	`ch.`	Combinatorial Optimization in VLSI Design. Combinatorial Optimization - Methods and Applications Stephan Held, Bernhard Korte, Dieter Rautenbach, Jens Vygen
2011	J	`jnl`	Faster algorithm for optimum Steiner trees. Inf. Process. Lett. Jens Vygen
2011	J	`jnl`	Faster min-max resource sharing in theory and practice. Math. Program. Comput. Dirk Müller, Klaus Radke, Jens Vygen
2011	J	`jnl`	Splitting trees at vertices. Discret. Math. Jens Vygen
2010	J	`jnl`	The repeater tree construction problem. Inf. Process. Lett. Christoph Bartoschek, Stephan Held, Jens Maßberg, Dieter Rautenbach, Jens Vygen
2009	J	`jnl`	A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing. J. Discrete Algorithms Sven Peyer, Dieter Rautenbach, Jens Vygen
2009	—	`conf`	Fast buffering for optimizing worst slack and resource consumption in repeater trees. ISPD Christoph Bartoschek, Stephan Held, Dieter Rautenbach, Jens Vygen
2009	—	`ed.`	Research Trends in Combinatorial Optimization, Bonn Workshop on Combinatorial Optimization, November 3-7, 2008, Bonn, Germany Bonn Workshop on Combinatorial Optimization William J. Cook, László Lovász, Jens Vygen
2008	—	`ch.`	Analytical Methods in Placement. Handbook of Algorithms for Physical Design Automation Ulrich Brenner, Jens Vygen
2008	J	`jnl`	Approximation algorithms for a facility location problem with service capacities. ACM Trans. Algorithms Jens Maßberg, Jens Vygen
2008	J	`jnl`	BonnPlace: Placement of Leading-Edge Chips by Advanced Combinatorial Algorithms. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. Ulrich Brenner, Markus Struzyna, Jens Vygen
2007	J	`jnl`	BonnTools: Mathematical Innovation for Layout and Timing Closure of Systems on a Chip. Proc. IEEE Bernhard Korte, Dieter Rautenbach, Jens Vygen
2007	J	`jnl`	From stars to comets: Improved local search for universal facility location. Oper. Res. Lett. Jens Vygen
2007	J	`jnl`	New theoretical results on quadratic placement. Integr. Jens Vygen
2006	—	`conf`	Efficient generation of short and fast repeater tree topologies. ISPD Christoph Bartoschek, Stephan Held, Dieter Rautenbach, Jens Vygen
2006	J	`jnl`	Slack in static timing analysis. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. Jens Vygen
2005	—	`conf`	Approximation Algorithms for Network Design and Facility Location with Service Capacities. APPROX-RANDOM Jens Maßberg, Jens Vygen
2005	J	`jnl`	Geometric quadrisection in linear time, with application to VLSI placement. Discret. Optim. Jens Vygen
2004	—	`conf`	Almost optimum placement legalization by minimum cost flow and dynamic programming. ISPD Ulrich Brenner, Anna Pauli, Jens Vygen
2004	J	`jnl`	Legalizing a placement with minimum total movement. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. Ulrich Brenner, Jens Vygen
2004	B	`conf`	Near-Optimum Global Routing with Coupling, Delay Bounds, and Power Consumption. IPCO Jens Vygen
2003	J	`jnl`	A note on Schrijver's submodular function minimization algorithm. J. Comb. Theory B Jens Vygen
2003	A	`conf`	Clock Scheduling and Clocktree Construction for High Performance ASICS. ICCAD Stephan Held, Bernhard Korte, Jens Maßberg, Matthias Ringe, Jens Vygen
2002	J	`jnl`	Maximum mean weight cycle in a digraph and minimizing cycle time of a logic chip. Discret. Appl. Math. Christoph Albrecht, Bernhard Korte, Jürgen Schietke, Jens Vygen
2002	J	`jnl`	On dual minimum cost flow algorithms. Math. Methods Oper. Res. Jens Vygen
2001	J	`jnl`	The edge-disjoint paths problem is NP-complete for series-parallel graphs. Discret. Appl. Math. Takao Nishizeki, Jens Vygen, Xiao Zhou
2001	J	`jnl`	Worst-case ratios of networks in the rectilinear plane. Networks Ulrich Brenner, Jens Vygen
2000	A	`conf`	Faster Optimal Single-Row Placement with Fixed Ordering. DATE Ulrich Brenner, Jens Vygen
2000	A*	`conf`	On dual minimum cost flow algorithms (extended abstract). STOC Jens Vygen
1999	A	`conf`	Cycle time and slack optimization for VLSI-chips. ICCAD Christoph Albrecht, Bernhard Korte, Jürgen Schietke, Jens Vygen
1998	A	`conf`	Algorithms for Detailed Placement of Standard Cells. DATE Jens Vygen
1997	A*	`conf`	Algorithms for Large-Scale Flat Placement. DAC Jens Vygen
1996	—	`—`	Plazierung im VLSI-Design und ein zweidimensionales Zerlegungsproblem. Jens Vygen
1995	J	`jnl`	NP-completeness of Some Edge-disjoint Paths Problems. Discret. Appl. Math. Jens Vygen