|
Journals in DBLP
J. Algorithms 1995, volume: 18, number: 2
- Martin Fürer, Balaji Raghavachari
An Efficient Parallel Algorithm for Finding Hamiltonian Cycles in Dense Directed Graphs. [Citation Graph (0, 0)][DBLP] J. Algorithms, 1995, v:18, n:2, pp:203-220 [Journal]
- Yossi Azar, Joseph Naor, Raphael Rom
The Competitiveness of On-Line Assignments. [Citation Graph (0, 0)][DBLP] J. Algorithms, 1995, v:18, n:2, pp:221-237 [Journal]
- Hans L. Bodlaender, John R. Gilbert, Hjálmtyr Hafsteinsson, Ton Kloks
Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree. [Citation Graph (0, 0)][DBLP] J. Algorithms, 1995, v:18, n:2, pp:238-255 [Journal]
- Mark de Berg, Marc J. van Kreveld, Jack Snoeyink
Two- and Three-Dimensional Point Location in Rectangular Subdivisions. [Citation Graph (0, 0)][DBLP] J. Algorithms, 1995, v:18, n:2, pp:256-277 [Journal]
- Dany Breslauer
Dictionary-Matching on Unbounded Alphabets: Uniform Length Dictionaries. [Citation Graph (0, 0)][DBLP] J. Algorithms, 1995, v:18, n:2, pp:278-296 [Journal]
- Yuval Caspi, Eliezer Dekel
Edge Coloring Series Parallel Graphs. [Citation Graph (0, 0)][DBLP] J. Algorithms, 1995, v:18, n:2, pp:296-321 [Journal]
- Yosi Ben-Asher, Assaf Schuster
The Complexity of Data Reduction on a Reconfigurable Linear Array. [Citation Graph (0, 0)][DBLP] J. Algorithms, 1995, v:18, n:2, pp:322-357 [Journal]
- Ten-Hwang Lai, Shu-Shang Wei
Algorithms for Page Retrieval and Hamiltonian Paths on Forward-Convex Line Graphs. [Citation Graph (0, 0)][DBLP] J. Algorithms, 1995, v:18, n:2, pp:358-375 [Journal]
|