|
|
Journals in DBLP
J. Algorithms
1992, volume: 13, number: 1
- Amihood Amir, Gad M. Landau, Uzi Vishkin
Efficient Pattern Matching with Scaling. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 1992, v:13, n:1, pp:2-32 [Journal]
- David Eppstein, Giuseppe F. Italiano, Roberto Tamassia, Robert Endre Tarjan, Jeffery Westbrook, Moti Yung
Maintenance of a Minimum Spanning Forest in a Dynamic Plane Graph. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 1992, v:13, n:1, pp:33-54 [Journal]
- Maria M. Klawe
Superlinear Bounds for Matrix Searching Problems. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 1992, v:13, n:1, pp:55-78 [Journal]
- Carolyn Haibt Norton, Serge A. Plotkin, Éva Tardos
Using Separation Algorithms in Fixed Dimension. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 1992, v:13, n:1, pp:79-98 [Journal]
- Mike Paterson, F. Frances Yao
Optimal Binary Space Partitions for Orthogonal Objects. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 1992, v:13, n:1, pp:99-113 [Journal]
- Jørgen Bang-Jensen, Yannis Manoussakis, Carsten Thomassen
A Polynomial Algorithm for Hamiltonian-Connectedness in Semicomplete Digraphs. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 1992, v:13, n:1, pp:114-127 [Journal]
- Leslie Ann Goldberg
Efficient Algorithms for Listing Unlabeled Graphs. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 1992, v:13, n:1, pp:128-143 [Journal]
- Peter Avery
An Algorithmic Proof that Semiorders are Representable. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 1992, v:13, n:1, pp:144-147 [Journal]
- Daniel S. Hirschberg, Lawrence L. Larmore
The Traveler's Problem. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 1992, v:13, n:1, pp:148-160 [Journal]
- Toshinobu Kashiwabara, Sumio Masuda, Kazuo Nakajima, Toshio Fujisawa
Generation of Maximum Independent Sets of a Bipartite Graph and Maximum Cliques of a Circular-Arc Graph. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 1992, v:13, n:1, pp:161-174 [Journal]
|
