Journals in DBLP
Sunil Arya , H. Ramesh A 2.5-Factor Approximation Algorithm for the k -MST Problem. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1998, v:65, n:3, pp:117-118 [Journal ] Q. S. Wu , Kun-Mao Chao , Richard C. T. Lee The NPO-Completeness of the Longest Hamiltonian Cycle Problem. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1998, v:65, n:3, pp:119-123 [Journal ] Pallab Dasgupta Agreement under Faulty Interfaces. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1998, v:65, n:3, pp:125-129 [Journal ] Shiva Chaudhuri , Naveen Garg , R. Ravi The p -Neighbor k -Center Problem. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1998, v:65, n:3, pp:131-134 [Journal ] Limin Xiang , Kazuo Ushijima ANSV Problem on BSRs. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1998, v:65, n:3, pp:135-138 [Journal ] Jung Je Son , Jong In Lim , Seongtaek Chee , Soo Hak Sung Global Avalanche Characteristics and Nonlinearity of Balanced Boolean Functions. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1998, v:65, n:3, pp:139-144 [Journal ] Viggo Kann , Jens Lagergren , Alessandro Panconesi Approximate Max k -Cut with Subgraph Guarantee. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1998, v:65, n:3, pp:145-150 [Journal ] Edith Hemaspaandra , Jörg Rothe Recognizing when Greed can Approximate Maximum Independent Sets is Complete for Parallel Access to NP. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1998, v:65, n:3, pp:151-156 [Journal ] Jeng-Jung Wang , Chun-Nan Hung , Lih-Hsing Hsu Optimal 1-Hamiltonian Graphs. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1998, v:65, n:3, pp:157-161 [Journal ] R. Balasubramanian , Michael R. Fellows , Venkatesh Raman An Improved Fixed-Parameter Algorithm for Vertex Cover. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1998, v:65, n:3, pp:163-168 [Journal ]