CiteSeer.IST Home   Check: The following citations are predicted to all refer to the same paper.   Details

C.H. Papadimitriou and M. Yannakakis. The clique problem for planar graphs. Information Processing Letters, 13:131--133, 1981.

C.H. Papadimitriou and M. Yannakakis. The clique problem for planar graphs. Information Processing Letters, 13:131--133, 1981.

C. H. Papadimitriou. Efficient search for rationals. Information Processing Letters, 8(1):1--4, 1978.

C. H. Papadimitriou and M. Yannakakis. The clique problem for planar graphs. Information Processing Letters, 13:131--133, 1981.

C. H. Papadimitriou. Efficient search for rationals. Information Processing Letters, 8(1):1--4, 1978.

C.H. Papadimitriou and M. Yannakakis. The clique problem for planar graphs. Information Processing Letters, 13:131--133, 1981.

C. H. Papadimitriou and M. Yannakakis. The clique problem for planar graphs. Information Processing Letters 13:131-133, 1981.

C.H. Papadimitriou and M. Yannakakis. The clique problem for planar graphs. Information Processing Letters, 13:131-133, 1981.

C. Papadimitriou. Ecient search for rationals. Information Processing Letters, 8:1-4, 1979.

CiteSeer.IST - Copyright Penn State and NEC