default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStefan Hougardy
Person information
- affiliation: University of Bonn, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c14]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: 84:1-84:18- [c13]Stefan Hougardy
, Bart Zondervan:
The Bottom-Left Algorithm for the Strip Packing Problem. IWOCA 2024: 433-445 - [i14]Sophia Heimann, Hung P. Hoang, Stefan Hougardy:
The k-Opt algorithm for the Traveling Salesman Problem has exponential running time for k≥5. CoRR abs/2402.07061 (2024) - [i13]Stefan Hougardy, Bart Zondervan:
The Bottom-Left Algorithm for the Strip Packing Problem. CoRR abs/2402.16572 (2024) - [i12]Stefan Hougardy, Karolina Tammemaa:
Fast Approximation Algorithms for Euclidean Minimum Weight Perfect Matching. CoRR abs/2407.07749 (2024) - 2023
- [j37]Ulrich A. Brodowsky, Stefan Hougardy, Xianghui Zhong:
The Approximation Ratio of the k-Opt Heuristic for the Euclidean Traveling Salesman Problem. SIAM J. Comput. 52(4): 841-864 (2023) - [j36]Stefan Hougardy, Meike Neuwohner, Ulrike Schorr:
A Fast Optimal Double-row Legalization Algorithm. ACM Trans. Design Autom. Electr. Syst. 28(5): 71:1-71:26 (2023) - [i11]William J. Cook, Keld Helsgaun, Stefan Hougardy, Rasmus T. Schroeder:
Local elimination in the traveling salesman problem. CoRR abs/2307.07054 (2023) - 2021
- [j35]Stefan Hougardy, Xianghui Zhong:
Hard to solve instances of the Euclidean Traveling Salesman Problem. Math. Program. Comput. 13(1): 51-74 (2021) - [c12]Stefan Hougardy, Meike Neuwohner, Ulrike Schorr:
A Fast Optimal Double Row Legalization Algorithm. ISPD 2021: 23-30 - [c11]Ulrich A. Brodowsky, Stefan Hougardy:
The Approximation Ratio of the 2-Opt Heuristic for the Euclidean Traveling Salesman Problem. STACS 2021: 18:1-18:15 - [i10]Stefan Hougardy, Meike Neuwohner, Ulrike Schorr:
A Fast Optimal Double Row Legalization Algorithm. CoRR abs/2101.08561 (2021) - [i9]Ulrich A. Brodowsky, Stefan Hougardy, Xianghui Zhong:
The Approximation Ratio of the k-Opt Heuristic for the Euclidean Traveling Salesman Problem. CoRR abs/2109.00069 (2021) - 2020
- [j34]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): 401-404 (2020) - [j33]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): 2872-2885 (2020) - [i8]Ulrich A. Brodowsky, Stefan Hougardy:
The Approximation Ratio of the 2-Opt Heuristic for the Euclidean Traveling Salesman Problem. CoRR abs/2010.02583 (2020)
2010 – 2019
- 2019
- [i7]Stefan Hougardy, Fabian Zaiser, Xianghui Zhong:
The Approximation Ratio of the 2-Opt Heuristic for the Metric Traveling Salesman Problem. CoRR abs/1909.12025 (2019) - 2018
- [i6]Stefan Hougardy, Xianghui Zhong:
Hard to Solve Instances of the Euclidean Traveling Salesman Problem. CoRR abs/1808.02859 (2018) - 2017
- [j32]Stefan Hougardy, Jannik Silvanus, Jens Vygen:
Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm. Math. Program. Comput. 9(2): 135-202 (2017) - [c10]Pascal Cremer, Stefan Hougardy, Jan Schneider, Jannik Silvanus:
Automatic Cell Layout in the 7nm Era. ISPD 2017: 99-106 - 2016
- [j31]Julia Funke, Stefan Hougardy, Jan Schneider:
An exact algorithm for wirelength optimal placements in VLSI design. Integr. 52: 355-366 (2016) - 2015
- [j30]Stefan Hougardy, Mirko Wilde:
On the nearest neighbor rule for the metric traveling salesman problem. Discret. Appl. Math. 195: 101-103 (2015) - [j29]Judith Brecklinghaus, Stefan Hougardy:
The approximation ratio of the greedy algorithm for the metric traveling salesman problem. Oper. Res. Lett. 43(3): 259-261 (2015) - 2014
- [j28]Stefan Hougardy:
On the integrality ratio of the subtour LP for Euclidean TSP. Oper. Res. Lett. 42(8): 495-499 (2014) - [c9]Stefan Hougardy, Rasmus T. Schroeder:
Edge Elimination in TSP Instances. WG 2014: 275-286 - [i5]Stefan Hougardy, Mirko Wilde:
On the Nearest Neighbor Rule for the Metric Traveling Salesman Problem. CoRR abs/1401.2071 (2014) - [i4]Stefan Hougardy:
On the Integrality Ratio of the Subtour LP for Euclidean TSP. CoRR abs/1402.5904 (2014) - [i3]Stefan Hougardy, Rasmus T. Schroeder:
Edge Elimination in TSP Instances. CoRR abs/1402.7301 (2014) - [i2]Stefan Hougardy, Jannik Silvanus, Jens Vygen:
Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm. CoRR abs/1406.0492 (2014) - [i1]Judith Brecklinghaus, Stefan Hougardy:
The Approximation Ratio of the Greedy Algorithm for the Metric Traveling Salesman Problem. CoRR abs/1412.7366 (2014) - 2013
- [c8]Stefan Hougardy, Tim Nieberg, Jan Schneider:
BonnCell: Automatic layout of leaf cells. ASP-DAC 2013: 453-460 - 2011
- [j27]Stefan Hougardy:
On packing squares into a rectangle. Comput. Geom. 44(8): 456-463 (2011) - 2010
- [j26]Stefan Hougardy, Frank H. Lutz, Mariano Zelke:
Surface Realization with the Intersection Segment Functional. Exp. Math. 19(1): 79-92 (2010) - [j25]Stefan Hougardy:
The Floyd-Warshall algorithm on graphs with negative cycles. Inf. Process. Lett. 110(8-9): 279-281 (2010)
2000 – 2009
- 2008
- [c7]Stefan Hougardy:
Linear Time Approximation Algorithms for Degree Constrained Subgraph Problems. Bonn Workshop of Combinatorial Optimization 2008: 185-200 - 2007
- [j24]Stefan Hougardy, Ivo Köthnig:
Computation of best possible low degree expanders. Discret. Appl. Math. 155(18): 2539-2545 (2007) - 2006
- [j23]Stefan Hougardy:
Classes of perfect graphs. Discret. Math. 306(19-20): 2529-2571 (2006) - [j22]Stefan Hougardy:
On a conjecture of Hoàng and Tu concerning perfectly orderable graphs. Discret. Math. 306(22): 2962-2963 (2006) - [j21]Stefan Hougardy, Doratha E. Drake Vinkemeier:
Approximating weighted matchings in parallel. Inf. Process. Lett. 99(3): 119-123 (2006) - [j20]Stefan Hougardy, Stefan Kirchner:
Lower bounds for the relative greedy algorithm for approximating Steiner trees. Networks 47(2): 111-115 (2006) - 2005
- [j19]Doratha E. Drake Vinkemeier, Stefan Hougardy:
A linear-time approximation algorithm for weighted matchings in graphs. ACM Trans. Algorithms 1(1): 107-122 (2005) - 2004
- [j18]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): 117-132 (2004) - [j17]Doratha E. Drake, Stefan Hougardy:
On approximation algorithms for the terminal Steiner tree problem. Inf. Process. Lett. 89(1): 15-18 (2004) - [j16]Martin Thimm, Andrean Goede, Stefan Hougardy, Robert Preissner:
Comparison of 2D Similarity and 3D Superposition. Application to Searching a Conformational Drug Database. J. Chem. Inf. Model. 44(5): 1816-1822 (2004) - [j15]Stefan Hougardy, Annegret Wagler:
Perfectness is an Elusive Graph Property. SIAM J. Comput. 34(1): 109-117 (2004) - 2003
- [j14]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): 2442-2447 (2003) - [j13]Doratha E. Drake, Stefan Hougardy:
A simple approximation algorithm for the weighted matching problem. Inf. Process. Lett. 85(4): 211-213 (2003) - [c6]Doratha E. Drake, Stefan Hougardy:
Improved Linear Time Approximation Algorithms for Weighted Matchings. RANDOM-APPROX 2003: 14-23 - [c5]Doratha E. Drake, Stefan Hougardy:
Linear Time Local Improvements for Weighted Matchings in Graphs. WEA 2003: 107-119 - 2002
- [j12]Clemens Gröpl, Stefan Hougardy, Till Nierhoff, Hans Jürgen Prömel:
Steiner trees in uniformly quasi-bipartite graphs. Inf. Process. Lett. 83(4): 195-200 (2002) - [j11]Endre Boros, Vladimir Gurvich, Stefan Hougardy:
Recursive generation of partitionable graphs. J. Graph Theory 41(4): 259-285 (2002) - [c4]Ryan B. Hayward, Stefan Hougardy, Bruce A. Reed:
Polynomial time recognition of P4-structure. SODA 2002: 382-389 - 2001
- [c3]Clemens Gröpl, Stefan Hougardy, Till Nierhoff, Hans Jürgen Prömel:
Lower Bounds for Approximation Algorithms for the Steiner Tree Problem. WG 2001: 217-228
1990 – 1999
- 1999
- [j10]Stefan Hougardy:
On wing-perfect graphs. J. Graph Theory 31(1): 51-66 (1999) - [c2]Stefan Hougardy, Hans Jürgen Prömel:
A 1.598 Approximation Algorithm for the Steiner Problem in Graphs. SODA 1999: 448-453 - 1998
- [j9]Thomas Emden-Weinert, Stefan Hougardy, Bernd Kreuter:
Uniquely Colourable Graphs and the Hardness of Colouring Graphs of Large Girth. Comb. Probab. Comput. 7(4): 375-386 (1998) - 1997
- [j8]Stefan Hougardy:
Perfect graphs with unique P4-structure. Discret. Math. 165-166: 421-430 (1997) - [j7]Oliver T. Dasbach, Stefan Hougardy:
Does the Jones Polynomial Detect Unknottedness? Exp. Math. 6(1): 51-56 (1997) - [j6]Stefan Hougardy, Van Bang Le, Annegret Wagler:
Wing-triangulated graphs are perfect. J. Graph Theory 24(1): 25-31 (1997) - [c1]Stefan Hougardy:
Proof Checking and Non-approximability. Lectures on Proof Verification and Approximation Algorithms 1997: 63-82 - 1996
- [j5]Stefan Hougardy:
Even pairs and the strong perfect graph conjecture. Discret. Math. 154(1-3): 277-278 (1996) - [j4]Chính T. Hoàng, Stefan Hougardy, Frédéric Maffray:
On the P4-Structure of Perfect Graphs V. Overlap Graphs. J. Comb. Theory B 67(2): 212-237 (1996) - 1995
- [j3]Stefan Hougardy:
Even and odd pairs in linegraphs of bipartite graphs. Eur. J. Comb. 16(1): 17-21 (1995) - 1994
- [j2]Stefan Hougardy, Hans Jürgen Prömel, Angelika Steger:
Probabilistically checkable proofs and their consequences for approximation algorithms. Discret. Math. 136(1-3): 175-223 (1994) - 1993
- [j1]Stefan Hougardy:
Counterexamples to three conjectures concerning perfect graphs. Discret. Math. 117(1-3): 245-251 (1993)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-18 00:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
