Stefan Hougardy
Orcid: 0000-0001-8656-3418Affiliations:
- University of Bonn, Germany
According to our database1,
Stefan Hougardy
authored at least 53 papers
between 1993 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
1995
2000
2005
2010
2015
2020
0
1
2
3
4
5
2
2
2
2
1
1
2
1
1
2
1
4
1
4
2
2
1
1
3
2
1
1
1
2
1
1
1
1
1
2
1
1
1
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
-
on dl.acm.org
On csauthors.net:
Bibliography
2024
Math. Program. Comput., December, 2024
CoRR, 2024
Proceedings of the Combinatorial Algorithms - 35th International Workshop, 2024
The k-Opt Algorithm for the Traveling Salesman Problem Has Exponential Running Time for k ≥ 5.
Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024
2023
ACM Trans. Design Autom. Electr. Syst., September, 2023
The Approximation Ratio of the <i>k</i>-Opt Heuristic for the Euclidean Traveling Salesman Problem.
SIAM J. Comput., August, 2023
2021
Math. Program. Comput., 2021
The Approximation Ratio of the k-Opt Heuristic for the Euclidean Traveling Salesman Problem.
CoRR, 2021
The Approximation Ratio of the 2-Opt Heuristic for the Euclidean Traveling Salesman Problem.
Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science, 2021
2020
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2020
The approximation ratio of the 2-Opt Heuristic for the metric Traveling Salesman Problem.
Oper. Res. Lett., 2020
2017
Math. Program. Comput., 2017
Proceedings of the 2017 ACM on International Symposium on Physical Design, 2017
2016
2015
The approximation ratio of the greedy algorithm for the metric traveling salesman problem.
Oper. Res. Lett., 2015
Discret. Appl. Math., 2015
2014
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2014
2013
Proceedings of the 18th Asia and South Pacific Design Automation Conference, 2013
2011
2010
Inf. Process. Lett., 2010
2008
Proceedings of the Research Trends in Combinatorial Optimization, 2008
2007
2006
Networks, 2006
Discret. Math., 2006
2005
ACM Trans. Algorithms, 2005
2004
Comparison of 2<i>D</i> Similarity and 3<i>D</i> Superposition. Application to Searching a Conformational Drug Database.
J. Chem. Inf. Model., 2004
Inf. Process. Lett., 2004
2003
Inf. Process. Lett., 2003
Bioinform., 2003
Proceedings of the Experimental and Efficient Algorithms, Second International Workshop, 2003
Proceedings of the Approximation, 2003
2002
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002
2001
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2001
1999
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999
1998
Comb. Probab. Comput., 1998
1997
Proceedings of the Lectures on Proof Verification and Approximation Algorithms. (the book grow out of a Dagstuhl Seminar, 1997
1996
J. Comb. Theory B, 1996
1995
1994
Probabilistically checkable proofs and their consequences for approximation algorithms.
Discret. Math., 1994
1993