Seguir
Stefan Hougardy
Stefan Hougardy
Professor of Mathematics, University of Bonn
E-mail confirmado em or.uni-bonn.de - Página inicial
Título
Citado por
Citado por
Ano
The Floyd–Warshall algorithm on graphs with negative cycles
S Hougardy
Information Processing Letters 110 (8-9), 279-281, 2010
2892010
A 1.598 approximation algorithm for the Steiner problem in graphs
S Hougardy, HJ Prömel
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms …, 1999
1951999
A simple approximation algorithm for the weighted matching problem
DE Drake, S Hougardy
Information Processing Letters 85 (4), 211-213, 2003
1892003
A linear-time approximation algorithm for weighted matchings in graphs
DED Vinkemeier, S Hougardy
ACM Transactions on Algorithms (TALG) 1 (1), 107-122, 2005
1012005
Uniquely colourable graphs and the hardness of colouring graphs of large girth
T Emden-Weinert, S Hougardy, B Kreuter
Combinatorics, Probability and Computing 7 (4), 375-386, 1998
1001998
Approximation algorithms for the Steiner tree problem in graphs
C Gropl, S Hougardy, T Nierhoff, HJ Promel
COMBINATORIAL OPTIMIZATION-DORDRECHT- 11, 235-280, 2001
982001
On approximation algorithms for the terminal Steiner tree problem
DE Drake, S Hougardy
Information Processing Letters 89 (1), 15-18, 2004
892004
Comparison of 2D Similarity and 3D Superposition. Application to Searching a Conformational Drug Database
M Thimm, A Goede, S Hougardy, R Preissner
Journal of chemical information and computer sciences 44 (5), 1816-1822, 2004
742004
Classes of perfect graphs
S Hougardy
Discrete Mathematics 306 (19), 2529-2571, 2006
67*2006
Linear time local improvements for weighted matchings in graphs
DE Drake, S Hougardy
Experimental and Efficient Algorithms: Second International Workshop, WEA …, 2003
462003
Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm
S Hougardy, J Silvanus, J Vygen
Mathematical Programming Computation 9, 135-202, 2017
452017
Improved linear time approximation algorithms for weighted matchings
DE Drake, S Hougardy
International Workshop on Randomization and Approximation Techniques in …, 2003
442003
The approximation ratio of the 2-Opt Heuristic for the metric Traveling Salesman Problem
S Hougardy, F Zaiser, X Zhong
Operations Research Letters 48 (4), 401-404, 2020
432020
Does the Jones polynomial detect unknottedness?
OT Dasbach, S Hougardy
Experimental Mathematics 6 (1), 51-56, 1997
401997
Approximating weighted matchings in parallel
S Hougardy, DE Vinkemeier
Information Processing Letters 99 (3), 119-123, 2006
392006
Probabilistically checkable proofs and their consequences for approximation algorithms
S Hougardy, HJ Prömel, A Steger
Discrete Mathematics 136 (1-3), 175-223, 1994
381994
An exact algorithm for wirelength optimal placements in VLSI design
J Funke, S Hougardy, J Schneider
Integration 52, 355-366, 2016
372016
On wing perfect graphs
S Hougardy
Journal of Graph Theory 31, 51-66, 1999
34*1999
Approximating minimum spanning sets in hypergraphs and polymatroids
G Baudis, C Gröpl, S Hougardy, T Nierhoff, HJ Prömel
Proc. ICALP, 2000
312000
Automatic cell layout in the 7nm era
P Cremer, S Hougardy, J Schneider, J Silvanus
Proceedings of the 2017 ACM on International Symposium on Physical Design …, 2017
292017
O sistema não pode executar a operação agora. Tente novamente mais tarde.
Artigos 1–20