The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Stefan Hougardy: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  25. Computation of best possible low degree expanders. [Citation Graph (, )][DBLP]


Search in 0.008secs, Finished in 0.009secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002