Stefan Hougardy

Publication Activity (10 Years)

Years Active: 1993-2024
Publications (10 Years): 23

Top Topics

Traveling Salesman

Valid Inequalities

Greedy Algorithm

Top Venues

Oper. Res. Lett.

Math. Program. Comput.

Publications

Stefan Hougardy, Bart Zondervan
The Bottom-Left Algorithm for the Strip Packing Problem. CoRR (2024)
Sophia Heimann, Hung P. Hoang, Stefan Hougardy
The k-Opt algorithm for the Traveling Salesman Problem has exponential running time for k≥5. CoRR (2024)
Sophia Heimann, Hung P. Hoang, Stefan Hougardy
The k-Opt Algorithm for the Traveling Salesman Problem Has Exponential Running Time for k ≥ 5. ICALP (2024)
Stefan Hougardy, Karolina Tammemaa
Fast Approximation Algorithms for Euclidean Minimum Weight Perfect Matching. CoRR (2024)
Stefan Hougardy, Bart Zondervan
The Bottom-Left Algorithm for the Strip Packing Problem. IWOCA (2024)
William J. Cook, Keld Helsgaun, Stefan Hougardy, Rasmus T. Schroeder
Local elimination in the traveling salesman problem. CoRR (2023)
Stefan Hougardy, Meike Neuwohner, Ulrike Schorr
A Fast Optimal Double-row Legalization Algorithm. ACM Trans. Design Autom. Electr. Syst. 28 (5) (2023)
Ulrich A. Brodowsky, Stefan Hougardy, Xianghui Zhong
-Opt Heuristic for the Euclidean Traveling Salesman Problem. SIAM J. Comput. 52 (4) (2023)
Stefan Hougardy, Xianghui Zhong
Hard to solve instances of the Euclidean Traveling Salesman Problem. Math. Program. Comput. 13 (1) (2021)
Stefan Hougardy, Meike Neuwohner, Ulrike Schorr
A Fast Optimal Double Row Legalization Algorithm. CoRR (2021)
Ulrich A. Brodowsky, Stefan Hougardy, Xianghui Zhong
The Approximation Ratio of the k-Opt Heuristic for the Euclidean Traveling Salesman Problem. CoRR (2021)
Stefan Hougardy, Meike Neuwohner, Ulrike Schorr
A Fast Optimal Double Row Legalization Algorithm. ISPD (2021)
Ulrich A. Brodowsky, Stefan Hougardy
The Approximation Ratio of the 2-Opt Heuristic for the Euclidean Traveling Salesman Problem. STACS (2021)
Pascal Van Cleeff, Stefan Hougardy, Jannik Silvanus, Tobias Werner
BonnCell: Automatic Cell Layout in the 7-nm Era. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 39 (10) (2020)
Stefan Hougardy, Fabian Zaiser, Xianghui Zhong
The approximation ratio of the 2-Opt Heuristic for the metric Traveling Salesman Problem. Oper. Res. Lett. 48 (4) (2020)
Ulrich A. Brodowsky, Stefan Hougardy
The Approximation Ratio of the 2-Opt Heuristic for the Euclidean Traveling Salesman Problem. CoRR (2020)
Stefan Hougardy, Fabian Zaiser, Xianghui Zhong
The Approximation Ratio of the 2-Opt Heuristic for the Metric Traveling Salesman Problem. CoRR (2019)
Stefan Hougardy, Xianghui Zhong
Hard to Solve Instances of the Euclidean Traveling Salesman Problem. CoRR (2018)
Stefan Hougardy, Jannik Silvanus, Jens Vygen
Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm. Math. Program. Comput. 9 (2) (2017)
Pascal Cremer, Stefan Hougardy, Jan Schneider, Jannik Silvanus
Automatic Cell Layout in the 7nm Era. ISPD (2017)
Julia Funke, Stefan Hougardy, Jan Schneider
An exact algorithm for wirelength optimal placements in VLSI design. Integr. 52 (2016)
Stefan Hougardy, Mirko Wilde
On the nearest neighbor rule for the metric traveling salesman problem. Discret. Appl. Math. 195 (2015)
Judith Brecklinghaus, Stefan Hougardy
The approximation ratio of the greedy algorithm for the metric traveling salesman problem. Oper. Res. Lett. 43 (3) (2015)
Stefan Hougardy, Jannik Silvanus, Jens Vygen
Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm. CoRR (2014)
Stefan Hougardy, Mirko Wilde
On the Nearest Neighbor Rule for the Metric Traveling Salesman Problem. CoRR (2014)
Stefan Hougardy
On the integrality ratio of the subtour LP for Euclidean TSP. Oper. Res. Lett. 42 (8) (2014)
Stefan Hougardy, Rasmus T. Schroeder
Edge Elimination in TSP Instances. WG (2014)
Stefan Hougardy, Rasmus T. Schroeder
Edge Elimination in TSP Instances. CoRR (2014)
Stefan Hougardy
On the Integrality Ratio of the Subtour LP for Euclidean TSP. CoRR (2014)
Judith Brecklinghaus, Stefan Hougardy
The Approximation Ratio of the Greedy Algorithm for the Metric Traveling Salesman Problem. CoRR (2014)
Stefan Hougardy, Tim Nieberg, Jan Schneider
BonnCell: Automatic layout of leaf cells. ASP-DAC (2013)
Stefan Hougardy
On packing squares into a rectangle. Comput. Geom. 44 (8) (2011)
Stefan Hougardy
The Floyd-Warshall algorithm on graphs with negative cycles. Inf. Process. Lett. 110 (8-9) (2010)
Stefan Hougardy, Frank H. Lutz, Mariano Zelke
Surface Realization with the Intersection Segment Functional. Exp. Math. 19 (1) (2010)
Stefan Hougardy
Linear Time Approximation Algorithms for Degree Constrained Subgraph Problems. Bonn Workshop of Combinatorial Optimization (2008)
Stefan Hougardy, Ivo Köthnig
Computation of best possible low degree expanders. Discret. Appl. Math. 155 (18) (2007)
Stefan Hougardy
Classes of perfect graphs. Discret. Math. 306 (19-20) (2006)
Stefan Hougardy, Doratha E. Drake Vinkemeier
Approximating weighted matchings in parallel. Inf. Process. Lett. 99 (3) (2006)
Stefan Hougardy, Stefan Kirchner
Lower bounds for the relative greedy algorithm for approximating Steiner trees. Networks 47 (2) (2006)
Stefan Hougardy
On a conjecture of Hoàng and Tu concerning perfectly orderable graphs. Discret. Math. 306 (22) (2006)
Doratha E. Drake Vinkemeier, Stefan Hougardy
A linear-time approximation algorithm for weighted matchings in graphs. ACM Trans. Algorithms 1 (1) (2005)
Chính T. Hoàng, Stefan Hougardy, Frédéric Maffray, Nadimpalli V. R. Mahadev
On simplicial and co-simplicial vertices in graphs. Discret. Appl. Math. 138 (1-2) (2004)
Doratha E. Drake, Stefan Hougardy
On approximation algorithms for the terminal Steiner tree problem. Inf. Process. Lett. 89 (1) (2004)
Martin Thimm, Andrean Goede, Stefan Hougardy, Robert Preissner
Superposition. Application to Searching a Conformational Drug Database. J. Chem. Inf. Model. 44 (5) (2004)
Stefan Hougardy, Annegret Wagler
Perfectness is an Elusive Graph Property. SIAM J. Comput. 34 (1) (2004)
Doratha E. Drake, Stefan Hougardy
A simple approximation algorithm for the weighted matching problem. Inf. Process. Lett. 85 (4) (2003)
Cornelius Frömmel, Christoph Gille, Andrean Goede, Clemens Gröpl, Stefan Hougardy, Till Nierhoff, Robert Preissner, Martin Thimm
Accelerating screening of 3D protein data with a graph theoretical approach. Bioinform. 19 (18) (2003)
Doratha E. Drake, Stefan Hougardy
Improved Linear Time Approximation Algorithms for Weighted Matchings. RANDOM-APPROX (2003)
Doratha E. Drake, Stefan Hougardy
Linear Time Local Improvements for Weighted Matchings in Graphs. WEA (2003)
Ryan B. Hayward, Stefan Hougardy, Bruce A. Reed
Polynomial time recognition of P4-structure. SODA (2002)
Clemens Gröpl, Stefan Hougardy, Till Nierhoff, Hans Jürgen Prömel
Steiner trees in uniformly quasi-bipartite graphs. Inf. Process. Lett. 83 (4) (2002)
Endre Boros, Vladimir Gurvich, Stefan Hougardy
Recursive generation of partitionable graphs. J. Graph Theory 41 (4) (2002)
Clemens Gröpl, Stefan Hougardy, Till Nierhoff, Hans Jürgen Prömel
Lower Bounds for Approximation Algorithms for the Steiner Tree Problem. WG (2001)
Stefan Hougardy, Hans Jürgen Prömel
A 1.598 Approximation Algorithm for the Steiner Problem in Graphs. SODA (1999)
Stefan Hougardy
On wing-perfect graphs. J. Graph Theory 31 (1) (1999)
Thomas Emden-Weinert, Stefan Hougardy, Bernd Kreuter
Uniquely Colourable Graphs and the Hardness of Colouring Graphs of Large Girth. Comb. Probab. Comput. 7 (4) (1998)
Stefan Hougardy
-structure. Discret. Math. (1997)
Oliver T. Dasbach, Stefan Hougardy
Does the Jones Polynomial Detect Unknottedness? Exp. Math. 6 (1) (1997)
Stefan Hougardy, Van Bang Le, Annegret Wagler
Wing-triangulated graphs are perfect. J. Graph Theory 24 (1) (1997)
Stefan Hougardy
Proof Checking and Non-approximability. Lectures on Proof Verification and Approximation Algorithms (1997)
Stefan Hougardy
Even pairs and the strong perfect graph conjecture. Discret. Math. 154 (1-3) (1996)
Chính T. Hoàng, Stefan Hougardy, Frédéric Maffray
-Structure of Perfect Graphs V. Overlap Graphs. J. Comb. Theory, Ser. B 67 (2) (1996)
Stefan Hougardy
Even and odd pairs in linegraphs of bipartite graphs. Eur. J. Comb. 16 (1) (1995)
Stefan Hougardy, Hans Jürgen Prömel, Angelika Steger
Probabilistically checkable proofs and their consequences for approximation algorithms. Discret. Math. 136 (1-3) (1994)
Stefan Hougardy
Counterexamples to three conjectures concerning perfect graphs. Discret. Math. 117 (1-3) (1993)