Susan Landau Factoring Polynomials Over Algebraic Number Fields. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1985, v:14, n:1, pp:184-195 [Journal]
J. C. Lagarias The Computational Complexity of Simultaneous Diophantine Approximation Problems. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1985, v:14, n:1, pp:196-209 [Journal]
Wen-Lian Hsu Maximum Weight Clique Algorithms for Circular-Arc Graphs and Circle Graphs. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1985, v:14, n:1, pp:224-231 [Journal]
Robert Endre Tarjan, Mihalis Yannakakis Addendum: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs. [Citation Graph (2, 0)][DBLP] SIAM J. Comput., 1985, v:14, n:1, pp:254-255 [Journal]
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