R. Gary Parker

According to our database1, R. Gary Parker authored at least 14 papers between 1985 and 2008.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2008
Solving problems on recursively constructed graphs.
ACM Comput. Surv., 2008

2003
The linear arrangement problem on recursively constructed graphs.
Networks, 2003


Connectivity and Traversability.
Proceedings of the Handbook of Graph Theory., 2003

Graph Representation.
Proceedings of the Handbook of Graph Theory., 2003

2001
On completing latin squares.
Discret. Appl. Math., 2001

2000
On minimum cuts and the linear arrangement problem.
Discret. Appl. Math., 2000

1995
on Halin Subgraphs and Supergraphs.
Discret. Appl. Math., 1995

1992
Automatic Generation of Linear-Time Algorithms from Predicate Calculus Descriptions of Problems on Recursively Constructed Graph Families.
Algorithmica, 1992

1991
Deterministic Decomposition of Recursive Graph Classes.
SIAM J. Discret. Math., 1991

Algorithms for recognition of regular properties and decomposition of recursive graph families.
Ann. Oper. Res., 1991

1988
Discrete optimization.
Computer science and scientific computing, Academic Press, ISBN: 978-0-12-545075-1, 1988

1986
On multiple steiner subgraph problems.
Networks, 1986

1985
An efficiently solvable case of the minimum weight equivalent subgraph problem.
Networks, 1985


  Loading...