Stefan Hougardy
Stefan Hougardy
Professor of Mathematics, University of Bonn
Verified email at or.uni-bonn.de - Homepage
Title
Cited by
Cited by
Year
Digital libraries
EA Fox, RM Akscyn, RK Furuta, JJ Leggett
Communications of the ACM 38 (4), 22-28, 1995
542*1995
The Floyd–Warshall algorithm on graphs with negative cycles
S Hougardy
Information Processing Letters 110 (8-9), 279-281, 2010
1762010
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
1721999
A simple approximation algorithm for the weighted matching problem
DE Drake, S Hougardy
Information Processing Letters 85 (4), 211-213, 2003
1542003
A linear-time approximation algorithm for weighted matchings in graphs
DED Vinkemeier, S Hougardy
ACM Transactions on Algorithms (TALG) 1 (1), 107-122, 2005
922005
Approximation algorithms for the Steiner tree problem in graphs
C Gropl, S Hougardy, T Nierhoff, HJ Promel
COMBINATORIAL OPTIMIZATION-DORDRECHT- 11, 235-280, 2001
882001
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
771998
On approximation algorithms for the terminal Steiner tree problem
DE Drake, S Hougardy
Information Processing Letters 89 (1), 15-18, 2004
762004
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
662004
Classes of perfect graphs
S Hougardy
Discrete Mathematics 306 (19), 2529-2571, 2006
49*2006
Linear time local improvements for weighted matchings in graphs
DE Drake, S Hougardy
International Workshop on Experimental and Efficient Algorithms, 107-119, 2003
392003
Does the Jones polynomial detect unknottedness?
OT Dasbach, S Hougardy
Experimental Mathematics 6 (1), 51-56, 1997
391997
Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm
S Hougardy, J Silvanus, J Vygen
Mathematical Programming Computation 9 (2), 135-202, 2017
372017
Improved linear time approximation algorithms for weighted matchings
DE Drake, S Hougardy
Approximation, Randomization, and Combinatorial Optimization.. Algorithms …, 2003
372003
Probabilistically checkable proofs and their consequences for approximation algorithms
S Hougardy, HJ Prömel, A Steger
Discrete Mathematics 136 (1-3), 175-223, 1994
371994
Approximating weighted matchings in parallel
S Hougardy, DE Vinkemeier
Information Processing Letters 99 (3), 119-123, 2006
342006
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
An exact algorithm for wirelength optimal placements in VLSI design
J Funke, S Hougardy, J Schneider
Integration 52, 355-366, 2016
272016
Einführung in Graphen und Algorithmen
T Emden-Weinert, S Hougardy, B Kreuter, HJ Prömel, A Steger
HU Berlin, 1996
22*1996
The system can't perform the operation now. Try again later.
Articles 1–20