51

A contribution to particle size distribution functions

Year:
1974
Language:
english
File:
PDF, 430 KB
english, 1974
53

A new approach to the maximum-flow problem

Year:
1988
Language:
english
File:
PDF, 1.55 MB
english, 1988
54

Amortized efficiency of list update and paging rules

Year:
1985
Language:
english
File:
PDF, 791 KB
english, 1985
56

A randomized linear-time algorithm to find minimum spanning trees

Year:
1995
Language:
english
File:
PDF, 619 KB
english, 1995
57

A Separator Theorem for Planar Graphs

Year:
1979
Language:
english
File:
PDF, 1.11 MB
english, 1979
58

Algorithmic Aspects of Vertex Elimination on Directed Graphs

Year:
1978
Language:
english
File:
PDF, 1.95 MB
english, 1978
59

Efficient maximum flow algorithms

Year:
2014
Language:
english
File:
PDF, 6.62 MB
english, 2014
60

Faster algorithms for the shortest path problem

Year:
1990
Language:
english
File:
PDF, 932 KB
english, 1990
62

Worst-case Analysis of Set Union Algorithms

Year:
1984
Language:
english
File:
PDF, 1.55 MB
english, 1984
63

A Fast Merging Algorithm

Year:
1979
Language:
english
File:
PDF, 854 KB
english, 1979
65

Sorting Using Networks of Queues and Stacks

Year:
1972
Language:
english
File:
PDF, 316 KB
english, 1972
66

Self-adjusting binary trees

Year:
1983
Language:
english
File:
PDF, 902 KB
english, 1983
67

Sparse Matrix Computations || GRAPH THEORY AND GAUSSIAN ELIMINATION

Year:
1976
Language:
english
File:
PDF, 1.03 MB
english, 1976
68

Dominating Sets in Planar Graphs

Year:
1996
Language:
english
File:
PDF, 174 KB
english, 1996
69

A Faster Deterministic Maximum Flow Algorithm

Year:
1994
File:
PDF, 1011 KB
1994
70

A data structure for dynamic trees

Year:
1983
Language:
english
File:
PDF, 1.62 MB
english, 1983
72

Efficient algorithms for a family of matroid intersection problems

Year:
1984
Language:
english
File:
PDF, 3.01 MB
english, 1984
73

Transitive compaction in parallel via branchings

Year:
1991
Language:
english
File:
PDF, 1000 KB
english, 1991
75

A V log V algorithm for isomorphism of triconnected planar graphs

Year:
1973
Language:
english
File:
PDF, 476 KB
english, 1973
76

Combinatorial algorithms for process synthesis

Year:
1992
Language:
english
File:
PDF, 509 KB
english, 1992
77

The analysis of a nested dissection algorithm

Year:
1986-1987
Language:
english
File:
PDF, 1.39 MB
english, 1986-1987
79

Space bounds for a game on graphs

Year:
1976-1977
Language:
english
File:
PDF, 824 KB
english, 1976-1977
80

Maintaining bridge-connected and biconnected components on-line

Year:
1992
Language:
english
File:
PDF, 1.80 MB
english, 1992
82

Rectilinear planar layouts and bipolar orientations of planar graphs

Year:
1986
Language:
english
File:
PDF, 644 KB
english, 1986
84

Dynamic trees as search trees via euler tours, applied to the network simplex algorithm

Year:
1997
Language:
english
File:
PDF, 515 KB
english, 1997
85

A simple version of Karzanov's blocking flow algorithm

Year:
1984
Language:
english
File:
PDF, 431 KB
english, 1984
87

A linear-time algorithm for finding all feedback vertices

Year:
1978
Language:
english
File:
PDF, 468 KB
english, 1978
88

Updating a balanced search tree in O(1) rotations

Year:
1983
Language:
english
File:
PDF, 366 KB
english, 1983
89

Deques with heap order

Year:
1986
Language:
english
File:
PDF, 340 KB
english, 1986
91

Ginger: a natural carcinogen-modulating factor

Year:
1989
Language:
english
File:
PDF, 86 KB
english, 1989
92

Finding Dominators in Directed Graphs

Year:
1974
Language:
english
File:
PDF, 2.86 MB
english, 1974
93

The Planar Hamiltonian Circuit Problem is NP-Complete

Year:
1976
Language:
english
File:
PDF, 768 KB
english, 1976
94

Symbolic Program Analysis in Almost-Linear Time

Year:
1982
Language:
english
File:
PDF, 1.49 MB
english, 1982
95

A Fast Parametric Maximum Flow Algorithm and Applications

Year:
1989
Language:
english
File:
PDF, 3.68 MB
english, 1989
96

On a Greedy Heuristic for Complete Matching

Year:
1981
Language:
english
File:
PDF, 533 KB
english, 1981
97

Fast Algorithms for Finding Nearest Common Ancestors

Year:
1984
Language:
english
File:
PDF, 2.15 MB
english, 1984
98

Improved Time Bounds for the Maximum Flow Problem

Year:
1989
Language:
english
File:
PDF, 2.21 MB
english, 1989
99

An $O(m\log n)$-Time Algorithm for the Maximal Planar Subgraph Problem

Year:
1993
Language:
english
File:
PDF, 2.34 MB
english, 1993