Ernst W. Mayr An Algorithm for the General Petri Net Reachability Problem. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1984, v:13, n:3, pp:441-460 [Journal]
Bernard Chazelle Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1984, v:13, n:3, pp:488-507 [Journal]
Robert Endre Tarjan, Mihalis Yannakakis Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs. [Citation Graph (14, 0)][DBLP] SIAM J. Comput., 1984, v:13, n:3, pp:566-579 [Journal]