Stefan Hougardy

74 papers A* 4A 2B 3C 1Journal 56Unranked 8
YearRankTypeTitle / Venue / Authors
2026 A conf
A 13/6-Approximation for Strip Packing via the Bottom-Left Algorithm.
STACS
Stefan Hougardy, Bart Zondervan
2026 A* conf
A Near-Complete Resolution of the Exponential-Time Complexity of k-opt for the Traveling Salesman Problem.
SODA
Sophia Heimann, Hung P. Hoang, Stefan Hougardy
2026 J jnl
Extending Exact Integrality Gap Computations for the Metric TSP.
CoRR
William Cook, Stefan Hougardy, Moritz Petrich
2026 J jnl
On the PLS-Completeness of k-Opt Local Search for the Traveling Salesman Problem.
CoRR
Sophia Heimann, Hung P. Hoang, Stefan Hougardy
2025 — conf
37.1 IBM Telum II Processor Design-Technology Co-Optimizations for Power, Performance, Area, and Reliability.
ISSCC
David Wolpert, Gerry Strevig, Christopher J. Berry, Leon J. Sigal, Bill Huott, Mark Cichanowski, Matthias Pflanz, Tobias Werner, Philipp Salz, Nick Jinq, Michael Romain, Iris Leefken, Richard E. Serton, Rajesh Veerabhadraiah, Dureseti Chidambarrao, Robert Arelt, Matt Angyal, Ben Trombley, Arvind Haran, Stefan Hougardy, Ben Klotz, Rahul M. Rao
2025 J jnl
A 13/6-Approximation for Strip Packing via the Bottom-Left Algorithm.
CoRR
Stefan Hougardy, Bart Zondervan
2025 J jnl
A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem.
CoRR
Sophia Heimann, Hung P. Hoang, Stefan Hougardy
2024 B conf
Fast Approximation Algorithms for Euclidean Minimum Weight Perfect Matching.
WAOA
Stefan Hougardy, Karolina Tammemaa
2024 J jnl
Fast Approximation Algorithms for Euclidean Minimum Weight Perfect Matching.
CoRR
Stefan Hougardy, Karolina Tammemaa
2024 J jnl
Local elimination in the traveling salesman problem.
Math. Program. Comput.
William J. Cook, Keld Helsgaun, Stefan Hougardy, Rasmus T. Schroeder
2024 C conf
The Bottom-Left Algorithm for the Strip Packing Problem.
IWOCA
Stefan Hougardy, Bart Zondervan
2024 J jnl
The Bottom-Left Algorithm for the Strip Packing Problem.
CoRR
Stefan Hougardy, Bart Zondervan
2024 A* conf
The k-Opt Algorithm for the Traveling Salesman Problem Has Exponential Running Time for k ≥ 5.
ICALP
Sophia Heimann, Hung P. Hoang, Stefan Hougardy
2024 J jnl
The k-Opt algorithm for the Traveling Salesman Problem has exponential running time for k≥5.
CoRR
Sophia Heimann, Hung P. Hoang, Stefan Hougardy
2023 J jnl
A Fast Optimal Double-row Legalization Algorithm.
ACM Trans. Design Autom. Electr. Syst.
Stefan Hougardy, Meike Neuwohner, Ulrike Schorr
2023 J jnl
Local elimination in the traveling salesman problem.
CoRR
William J. Cook, Keld Helsgaun, Stefan Hougardy, Rasmus T. Schroeder
2023 J jnl
The Approximation Ratio of the
SIAM J. Comput.
Ulrich A. Brodowsky, Stefan Hougardy, Xianghui Zhong
2021 — conf
A Fast Optimal Double Row Legalization Algorithm.
ISPD
Stefan Hougardy, Meike Neuwohner, Ulrike Schorr
2021 J jnl
A Fast Optimal Double Row Legalization Algorithm.
CoRR
Stefan Hougardy, Meike Neuwohner, Ulrike Schorr
2021 J jnl
Hard to solve instances of the Euclidean Traveling Salesman Problem.
Math. Program. Comput.
Stefan Hougardy, Xianghui Zhong
2021 A conf
The Approximation Ratio of the 2-Opt Heuristic for the Euclidean Traveling Salesman Problem.
STACS
Ulrich A. Brodowsky, Stefan Hougardy
2021 J jnl
The Approximation Ratio of the k-Opt Heuristic for the Euclidean Traveling Salesman Problem.
CoRR
Ulrich A. Brodowsky, Stefan Hougardy, Xianghui Zhong
2020 J jnl
BonnCell: Automatic Cell Layout in the 7-nm Era.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.
Pascal Van Cleeff, Stefan Hougardy, Jannik Silvanus, Tobias Werner
2020 J jnl
The Approximation Ratio of the 2-Opt Heuristic for the Euclidean Traveling Salesman Problem.
CoRR
Ulrich A. Brodowsky, Stefan Hougardy
2020 J jnl
The approximation ratio of the 2-Opt Heuristic for the metric Traveling Salesman Problem.
Oper. Res. Lett.
Stefan Hougardy, Fabian Zaiser, Xianghui Zhong
2019 J jnl
The Approximation Ratio of the 2-Opt Heuristic for the Metric Traveling Salesman Problem.
CoRR
Stefan Hougardy, Fabian Zaiser, Xianghui Zhong
2018 J jnl
Hard to Solve Instances of the Euclidean Traveling Salesman Problem.
CoRR
Stefan Hougardy, Xianghui Zhong
2017 — conf
Automatic Cell Layout in the 7nm Era.
ISPD
Pascal Cremer, Stefan Hougardy, Jan Schneider, Jannik Silvanus
2017 J jnl
Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm.
Math. Program. Comput.
Stefan Hougardy, Jannik Silvanus, Jens Vygen
2016 J jnl
An exact algorithm for wirelength optimal placements in VLSI design.
Integr.
Julia Funke, Stefan Hougardy, Jan Schneider
2015 J jnl
On the nearest neighbor rule for the metric traveling salesman problem.
Discret. Appl. Math.
Stefan Hougardy, Mirko Wilde
2015 J jnl
The approximation ratio of the greedy algorithm for the metric traveling salesman problem.
Oper. Res. Lett.
Judith Brecklinghaus, Stefan Hougardy
2014 J jnl
Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm.
CoRR
Stefan Hougardy, Jannik Silvanus, Jens Vygen
2014 B conf
Edge Elimination in TSP Instances.
WG
Stefan Hougardy, Rasmus T. Schroeder
2014 J jnl
Edge Elimination in TSP Instances.
CoRR
Stefan Hougardy, Rasmus T. Schroeder
2014 J jnl
On the Integrality Ratio of the Subtour LP for Euclidean TSP.
CoRR
Stefan Hougardy
2014 J jnl
On the Nearest Neighbor Rule for the Metric Traveling Salesman Problem.
CoRR
Stefan Hougardy, Mirko Wilde
2014 J jnl
On the integrality ratio of the subtour LP for Euclidean TSP.
Oper. Res. Lett.
Stefan Hougardy
2014 J jnl
The Approximation Ratio of the Greedy Algorithm for the Metric Traveling Salesman Problem.
CoRR
Judith Brecklinghaus, Stefan Hougardy
2013 — conf
BonnCell: Automatic layout of leaf cells.
ASP-DAC
Stefan Hougardy, Tim Nieberg, Jan Schneider
2011 J jnl
On packing squares into a rectangle.
Comput. Geom.
Stefan Hougardy
2010 J jnl
Surface Realization with the Intersection Segment Functional.
Exp. Math.
Stefan Hougardy, Frank H. Lutz, Mariano Zelke
2010 J jnl
The Floyd-Warshall algorithm on graphs with negative cycles.
Inf. Process. Lett.
Stefan Hougardy
2008 — conf
Linear Time Approximation Algorithms for Degree Constrained Subgraph Problems.
Bonn Workshop of Combinatorial Optimization
Stefan Hougardy
2007 J jnl
Computation of best possible low degree expanders.
Discret. Appl. Math.
Stefan Hougardy, Ivo Köthnig
2006 J jnl
Approximating weighted matchings in parallel.
Inf. Process. Lett.
Stefan Hougardy, Doratha E. Drake Vinkemeier
2006 J jnl
Classes of perfect graphs.
Discret. Math.
Stefan Hougardy
2006 J jnl
Lower bounds for the relative greedy algorithm for approximating Steiner trees.
Networks
Stefan Hougardy, Stefan Kirchner
2006 J jnl
On a conjecture of Hoàng and Tu concerning perfectly orderable graphs.
Discret. Math.
Stefan Hougardy
2005 J jnl
A linear-time approximation algorithm for weighted matchings in graphs.
ACM Trans. Algorithms
Doratha E. Drake Vinkemeier, Stefan Hougardy
2004 J jnl
Comparison of 2
J. Chem. Inf. Model.
Martin Thimm, Andrean Goede, Stefan Hougardy, Robert Preissner
2004 J jnl
On approximation algorithms for the terminal Steiner tree problem.
Inf. Process. Lett.
Doratha E. Drake, Stefan Hougardy
2004 J jnl
On simplicial and co-simplicial vertices in graphs.
Discret. Appl. Math.
Chính T. Hoàng, Stefan Hougardy, Frédéric Maffray, Nadimpalli V. R. Mahadev
2004 J jnl
Perfectness is an Elusive Graph Property.
SIAM J. Comput.
Stefan Hougardy, Annegret K. Wagler
2003 J jnl
A simple approximation algorithm for the weighted matching problem.
Inf. Process. Lett.
Doratha E. Drake, Stefan Hougardy
2003 J jnl
Accelerating screening of 3D protein data with a graph theoretical approach.
Bioinform.
Cornelius Frömmel, Christoph Gille, Andrean Goede, Clemens Gröpl, Stefan Hougardy, Till Nierhoff, Robert Preissner, Martin Thimm
2003 — conf
Improved Linear Time Approximation Algorithms for Weighted Matchings.
RANDOM-APPROX
Doratha E. Drake, Stefan Hougardy
2003 — conf
Linear Time Local Improvements for Weighted Matchings in Graphs.
WEA
Doratha E. Drake, Stefan Hougardy
2002 A* conf
Polynomial time recognition of P4-structure.
SODA
Ryan B. Hayward, Stefan Hougardy, Bruce A. Reed
2002 J jnl
Recursive generation of partitionable graphs.
J. Graph Theory
Endre Boros, Vladimir Gurvich, Stefan Hougardy
2002 J jnl
Steiner trees in uniformly quasi-bipartite graphs.
Inf. Process. Lett.
Clemens Gröpl, Stefan Hougardy, Till Nierhoff, Hans Jürgen Prömel
2001 B conf
Lower Bounds for Approximation Algorithms for the Steiner Tree Problem.
WG
Clemens Gröpl, Stefan Hougardy, Till Nierhoff, Hans Jürgen Prömel
1999 A* conf
A 1.598 Approximation Algorithm for the Steiner Problem in Graphs.
SODA
Stefan Hougardy, Hans Jürgen Prömel
1999 J jnl
On wing-perfect graphs.
J. Graph Theory
Stefan Hougardy
1998 J jnl
Uniquely Colourable Graphs and the Hardness of Colouring Graphs of Large Girth.
Comb. Probab. Comput.
Thomas Emden-Weinert, Stefan Hougardy, Bernd Kreuter
1997 J jnl
Does the Jones Polynomial Detect Unknottedness?
Exp. Math.
Oliver T. Dasbach, Stefan Hougardy
1997 J jnl
Perfect graphs with unique P
Discret. Math.
Stefan Hougardy
1997 — conf
Proof Checking and Non-approximability.
Lectures on Proof Verification and Approximation Algorithms
Stefan Hougardy
1997 J jnl
Wing-triangulated graphs are perfect.
J. Graph Theory
Stefan Hougardy, Van Bang Le, Annegret K. Wagler
1996 J jnl
Even pairs and the strong perfect graph conjecture.
Discret. Math.
Stefan Hougardy
1996 J jnl
On the
J. Comb. Theory B
Chính T. Hoàng, Stefan Hougardy, Frédéric Maffray
1995 J jnl
Even and odd pairs in linegraphs of bipartite graphs.
Eur. J. Comb.
Stefan Hougardy
1994 J jnl
Probabilistically checkable proofs and their consequences for approximation algorithms.
Discret. Math.
Stefan Hougardy, Hans Jürgen Prömel, Angelika Steger
1993 J jnl
Counterexamples to three conjectures concerning perfect graphs.
Discret. Math.
Stefan Hougardy