| 2007 |
|---|
| 25 | EE | Stefan Hougardy,
Ivo Köthnig:
Computation of best possible low degree expanders.
Discrete Applied Mathematics 155(18): 2539-2545 (2007) |
| 2006 |
|---|
| 24 | EE | Stefan Hougardy:
Classes of perfect graphs.
Discrete Mathematics 306(19-20): 2529-2571 (2006) |
| 23 | EE | Stefan Hougardy:
On a conjecture of Hoàng and Tu concerning perfectly orderable graphs.
Discrete Mathematics 306(22): 2962-2963 (2006) |
| 22 | EE | Stefan Hougardy,
Doratha E. Drake Vinkemeier:
Approximating weighted matchings in parallel.
Inf. Process. Lett. 99(3): 119-123 (2006) |
| 21 | EE | Stefan Hougardy,
Stefan Kirchner:
Lower bounds for the relative greedy algorithm for approximating Steiner trees.
Networks 47(2): 111-115 (2006) |
| 2005 |
|---|
| 20 | EE | Doratha E. Drake Vinkemeier,
Stefan Hougardy:
A linear-time approximation algorithm for weighted matchings in graphs.
ACM Transactions on Algorithms 1(1): 107-122 (2005) |
| 2004 |
|---|
| 19 | EE | Chính T. Hoàng,
Stefan Hougardy,
Frédéric Maffray,
Nadimpalli V. R. Mahadev:
On simplicial and co-simplicial vertices in graphs.
Discrete Applied Mathematics 138(1-2): 117-132 (2004) |
| 18 | EE | Doratha E. Drake,
Stefan Hougardy:
On approximation algorithms for the terminal Steiner tree problem.
Inf. Process. Lett. 89(1): 15-18 (2004) |
| 17 | EE | Martin Thimm,
Andrean Goede,
Stefan Hougardy,
Robert Preissner:
Comparison of 2D Similarity and 3D Superposition. Application to Searching a Conformational Drug Database.
Journal of Chemical Information and Modeling 44(5): 1816-1822 (2004) |
| 16 | EE | Stefan Hougardy,
Annegret Wagler:
Perfectness is an Elusive Graph Property.
SIAM J. Comput. 34(1): 109-117 (2004) |
| 2003 |
|---|
| 15 | EE | Doratha E. Drake,
Stefan Hougardy:
Improved Linear Time Approximation Algorithms for Weighted Matchings.
RANDOM-APPROX 2003: 14-23 |
| 14 | EE | Doratha E. Drake,
Stefan Hougardy:
Linear Time Local Improvements for Weighted Matchings in Graphs.
WEA 2003: 107-119 |
| 13 | | 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.
Bioinformatics 19(18): 2442-2447 (2003) |
| 12 | EE | Doratha E. Drake,
Stefan Hougardy:
A simple approximation algorithm for the weighted matching problem.
Inf. Process. Lett. 85(4): 211-213 (2003) |
| 2002 |
|---|
| 11 | EE | Ryan B. Hayward,
Stefan Hougardy,
Bruce A. Reed:
Polynomial time recognition of P4-structure.
SODA 2002: 382-389 |
| 10 | EE | 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) |
| 2001 |
|---|
| 9 | EE | 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 |
| 1999 |
|---|
| 8 | EE | Stefan Hougardy,
Hans Jürgen Prömel:
A 1.598 Approximation Algorithm for the Steiner Problem in Graphs.
SODA 1999: 448-453 |
| 1998 |
|---|
| 7 | | Thomas Emden-Weinert,
Stefan Hougardy,
Bernd Kreuter:
Uniquely Colourable Graphs and the Hardness of Colouring Graphs of Large Girth.
Combinatorics, Probability & Computing 7(4): 375-386 (1998) |
| 1997 |
|---|
| 6 | EE | Stefan Hougardy:
Proof Checking and Non-approximability.
Lectures on Proof Verification and Approximation Algorithms 1997: 63-82 |
| 5 | EE | Stefan Hougardy:
Perfect graphs with unique P4-structure.
Discrete Mathematics 165-166: 421-430 (1997) |
| 1996 |
|---|
| 4 | EE | Stefan Hougardy:
Even pairs and the strong perfect graph conjecture.
Discrete Mathematics 154(1-3): 277-278 (1996) |
| 3 | EE | Chính T. Hoàng,
Stefan Hougardy,
Frédéric Maffray:
On the P4-Structure of Perfect Graphs V. Overlap Graphs.
J. Comb. Theory, Ser. B 67(2): 212-237 (1996) |
| 1994 |
|---|
| 2 | EE | Stefan Hougardy,
Hans Jürgen Prömel,
Angelika Steger:
Probabilistically checkable proofs and their consequences for approximation algorithms.
Discrete Mathematics 136(1-3): 175-223 (1994) |
| 1993 |
|---|
| 1 | EE | Stefan Hougardy:
Counterexamples to three conjectures concerning perfect graphs.
Discrete Mathematics 117(1-3): 245-251 (1993) |
