The Floyd-Warshall algorithm on graphs with negative cyclesHOUGARDY, Stefan.Information processing letters. 2010, Vol 110, Num 8-9, pp 279-281, issn 0020-0190, 3 p.Article

On a conjecture of Hoàng and Tu concerning perfectly orderable graphsHOUGARDY, Stefan.Discrete mathematics. 2006, Vol 306, Num 22, pp 2962-2963, issn 0012-365X, 2 p.Article

Approximating weighted matchings in parallelHOUGARDY, Stefan; VINKEMEIER, Doratha E.Information processing letters. 2006, Vol 99, Num 3, pp 119-123, issn 0020-0190, 5 p.Article

A simple approximation algorithm for the weighted matching problemDRAKE, Doratha E; HOUGARDY, Stefan.Information processing letters. 2003, Vol 85, Num 4, pp 211-213, issn 0020-0190, 3 p.Article

Computation of best possible low degree expandersHOUGARDY, Stefan; KÖTHNIG, Ivo.Discrete applied mathematics. 2007, Vol 155, Num 18, pp 2539-2545, issn 0166-218X, 7 p.Article

Lower bounds for the relative greedy algorithm for approximating steiner treesHOUGARDY, Stefan; KIRCHNER, Stefan.Networks (New York, NY). 2006, Vol 47, Num 2, pp 111-115, issn 0028-3045, 5 p.Article

Perfectness is an elusive graph propertyHOUGARDY, Stefan; WAGLER, Annegret.SIAM journal on computing (Print). 2005, Vol 34, Num 1, pp 109-117, issn 0097-5397, 9 p.Article

On approximation algorithms for the terminal Steiner tree problemDRAKE, Doratha E; HOUGARDY, Stefan.Information processing letters. 2004, Vol 89, Num 1, pp 15-18, issn 0020-0190, 4 p.Article

Classes of perfect graphsHOUGARDY, Stefan.Discrete mathematics. 2006, Vol 306, Num 19-20, pp 2529-2571, issn 0012-365X, 43 p.Article

Steiner trees in uniformly quasi-bipartite graphsGRÖPL, Clemens; HOUGARDY, Stefan; NIERHOFF, Till et al.Information processing letters. 2002, Vol 83, Num 4, pp 195-200, issn 0020-0190Article

On simplicial and co-simplicial vertices in graphsHOANG, Chinh T; HOUGARDY, Stefan; MAFFRAY, Frédéric et al.Discrete applied mathematics. 2004, Vol 138, Num 1-2, pp 117-132, issn 0166-218X, 16 p.Conference Paper

Improved linear time approximation algorithms for weighted matchingsDRAKE, Doratha E; HOUGARDY, Stefan.Lecture notes in computer science. 2003, pp 14-23, issn 0302-9743, isbn 3-540-40770-7, 10 p.Conference Paper

Lower bounds for approximation algorithms for the Steiner tree problemGRÖPL, Clemens; HOUGARDY, Stefan; NIERHOFF, Till et al.Lecture notes in computer science. 2001, pp 217-228, issn 0302-9743, isbn 3-540-42707-4Conference Paper

Linear time local improvements for weighted matchings in graphsDRAKE, Doratha E; HOUGARDY, Stefan.Lecture notes in computer science. 2003, pp 107-119, issn 0302-9743, isbn 3-540-40205-5, 13 p.Conference Paper

Accelerating screening of 3D protein data with a graph theoretical approachFRÖMMEL, Cornelius; GILLE, Christoph; GOEDE, Andrean et al.Bioinformatics (Oxford. Print). 2003, Vol 19, Num 18, pp 2442-2447, issn 1367-4803, 6 p.Article