Robust algorithms for restricted domains

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2001, Pages 460-467

  Raghavan, Vijay ^a   Spinrad, Jeremy ^a  

^a VANDERBILT UNIVERSITY   (United States)

Author keywords

Algorithms; Theory; Verification

Indexed keywords

EID: 0242274240     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. J. ABELLO, H. LIN, S. PISUPATI, On Visibility Graphs of Simple Polygons, Congressus Numerantium 90, 119- 128, 1992.
2. Avrim Blum , David Karger, An Õ(n3/14)-coloring algorithm for 3-colorable graphs, Information Processing Letters, v.61 n.1, p.49-53, Jan. 14, 1997 [doi〉10.1016/S0020-0190(96)00190-1]
3. Heinz Breu , David G. Kirkpatrick, Unit disk graph recognition is NP-hard, Computational Geometry: Theory and Applications, v.9 n.1-2, p.3-24, Jan. 1998 [doi〉10.1016/S0925-7721(97)00014-X]
4. Heinz Breu , David G. Kirkpatrick, Algorithmic aspects of constrained unit disk graphs, 1996
5. Yair Caro , András Sebö, Michael Tarsi, Recognizing greedy structures, Journal of Algorithms, v.20 n.1, p.137-156, Jan. 1996 [doi〉10.1006/jagm.1996.0006]
6. B. M. Chazelle , D. T. Lee, On a circle placement problem, Computing, v.36 n.1-2, p.1-16, 1986 [doi〉10.1007/BF02238188]
7. V. CHVATAL, P.J. SLATER A Note on Well-Covered Graphs, Quo vadis, graph theory?, Ann. Discrete Math., 55, 179-181, 1993.
8. Brent N. Clark , Charles J. Colbourn , David S. Johnson, Unit disk graphs, Discrete Mathematics, v.86 n.1-3, p.165-177, Dec. 14, 1990 [doi〉10.1016/0012-365X(90)90358-O]
9. D. DOBKIN, H. EDELSBRUNNER Searching for Empty Convex Polygons, Algorithmica, vol. 5, pp. 561-571, 1990.
10. Shimon Even , Alan L. Selman , Yacov Yacobi, The complexity of promise problems with applications to public-key cryptography, Information and Control, v.61 n.2, p.159-173, May 1984 [doi〉10.1016/S0019-9958(84)80056-X]
11. A. GRAF, Coloring and Recognizing Special Graph Classes, PhD Thesis, Musikwissenschaftliches Institut, Abteilung Musikinformatik, Johannes Gutenberg-Universitat Mainz, 1995. (Also available as technical report Bericht Nr. 20.)
12. M.D. PLUMMER, Some Covering Concepts in Graphs, Journal of Combinatorial Theory 8,91-98, 1970.
13. M.D. PLUMMER, Well-covered Graphs: A Survey, Quaestiones Math. 16, 253-287, 1993.
14. E. PRISNER, Journey through intersection graph country, http://www, math. uni-hamburg, de /spag/gd/mitarbeiter/prisner/Pris/Rahmen. html 3/24/99
15. R. L. Rivest , A. Shamir , L. Adleman, A method for obtaining digital signatures and publickey cryptosystems, Communications of the ACM, v.21 n.2, p.120-126, Feb. 1978 [doi〉10.1145/359340.359342]
16. Alan L. Selman, A taxonomy of complexity classes of functions, Journal of Computer and System Sciences, v.48 n.2, p.357-381, April 1994 [doi〉10.1016/S0022-0000(05)80009-1]
17. R. SANKARANARAYANA, L. STEWART Complexity Results for well Covered Graphs, Networks 22, 247-262, 1992
18. L. G. Valiant , V. V. Vazirani, NP is as easy as detecting unique solutions, Theoretical Computer Science, v.47 n.1, p.85-93, Nov. 1986
19. Avi Wigderson, Improving the performance guarantee for approximate graph coloring, Journal of the ACM (JACM), v.30 n.4, p.729-735, Oct. 1983 [doi〉10.1145/2157.2158]