# Trevor I. Fenner

According to our database

Collaborative distances :

^{1}, Trevor I. Fenner authored at least 48 papers between 1968 and 2018.Collaborative distances :

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### Homepage:

#### On csauthors.net:

## Bibliography

2018

The size of a graph is reconstructible from any n-2 cards.

Discrete Mathematics, 2018

2016

Min-Sum 2-Paths Problems.

Theory Comput. Syst., 2016

2015

A stochastic evolutionary model generating a mixture of exponential distributions.

CoRR, 2015

2013

A bibliometric index based on the complete list of cited publications

CoRR, 2013

Min-Sum 2-Paths Problems.

Proceedings of the Approximation and Online Algorithms - 11th International Workshop, 2013

Analysis of Cluster Structure in Large-Scale English Wikipedia Category Networks.

Proceedings of the Advances in Intelligent Data Analysis XII, 2013

2012

A Discrete Evolutionary Model for Chess Players' Ratings.

IEEE Trans. Comput. Intellig. and AI in Games, 2012

Weighting Features for Partition around Medoids Using the Minkowski Metric.

Proceedings of the Advances in Intelligent Data Analysis XI - 11th International Symposium, 2012

2011

Recognizing connectedness from vertex-deleted subgraphs.

Journal of Graph Theory, 2011

A methodology for learning players' styles from game records.

IJAISC, 2011

A Discrete Evolutionary Model for Chess Players' Ratings

CoRR, 2011

How to Visualize a Crisp or Fuzzy Topic Set over a Taxonomy.

Proceedings of the Pattern Recognition and Machine Intelligence, 2011

2010

Families of pairs of graphs with a large number of common cards.

Journal of Graph Theory, 2010

Building Fuzzy Thematic Clusters and Mapping Them to Higher Ranks in a Taxonomy.

Int. J. Software and Informatics, 2010

Constructing and Mapping Fuzzy Thematic Clusters to Higher Ranks in a Taxonomy.

Proceedings of the Knowledge Science, 2010

A Hybrid Cluster-Lift Method for the Analysis of Research Activities.

Proceedings of the Hybrid Artificial Intelligence Systems, 5th International Conference, 2010

2009

A Methodology for Learning Players' Styles from Game Records

CoRR, 2009

2008

Modelling the navigation potential of a web page.

Theor. Comput. Sci., 2008

Move Generation with Perfect Hash Functions.

ICGA Journal, 2008

2007

A model for collaboration networks giving rise to a power-law distribution with an exponential cutoff.

Social Networks, 2007

A stochastic evolutionary growth model for social networks.

Computer Networks, 2007

2006

A stochastic model for the evolution of the Web allowing link deletion.

ACM Trans. Internet Techn., 2006

Aggregating Homologous Protein Families in Evolutionary Reconstructions of Herpesviruses.

Proceedings of the 2006 IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology, 2006

2005

High Degree Vertices and Eigenvalues in the Preferential Attachment Graph.

Internet Mathematics, 2005

2003

High Degree Vertices and Eigenvalues in the Preferential Attachment Graph.

Proceedings of the Approximation, 2003

2002

A stochastic model for the evolution of the Web.

Computer Networks, 2002

2001

The effect of mobility on minimaxing of game trees with random leaf values.

Artif. Intell., 2001

2000

Edge disjoint Hamilton cycles in sparse random graphs of minimum degree at least

*k*.
Journal of Graph Theory, 2000

On the expressive power of the relational algebra with partially ordered domains.

Int. J. Comput. Math., 2000

1996

On the Best Case of Heapsort.

J. Algorithms, 1996

1995

On Key Storage in Secure Networks.

J. Cryptology, 1995

A Partial Analysis of Minimaxing Game Trees with Random Leaf Values.

ICGA Journal, 1995

1987

An algorithm for finding Hamilton cycles in a random graph.

Combinatorica, 1987

1985

An Algorithm for Finding a Matroid Basis which Maximizes the Products of the Weights of the Elements.

BIT, 1985

An Algorithm for Finding Hamilton Cycles in a Random Graph

Proceedings of the 17th Annual ACM Symposium on Theory of Computing, 1985

1984

Hamiltonian cycles in random regular graphs.

J. Comb. Theory, Ser. B, 1984

Loop-Free Algorithms for Traversing Binary Trees.

BIT, 1984

1983

Tree Traversal Related Algorithms for Generating Integer Partitions.

SIAM J. Comput., 1983

On the existence of Hamiltonian cycles in a class of random graphs.

Discrete Mathematics, 1983

1982

On the connectivity of random m-orientable graphs and digraphs.

Combinatorica, 1982

1981

A Note on Traversal Algorithms for Triply Linked Binary Trees.

BIT, 1981

An Analysis of two Related Loop-free Algorithms for Generating Integer Partitions.

Acta Inf., 1981

1980

A Binary Tree Representation and Related Algorithms for Generating Partitions.

Comput. J., 1980

1978

Some Results on Condition Numbers and Matrix Scaling.

PhD thesis, 1978

1977

Combinatorial aspects of rectangular non-negative matrices.

Discrete Mathematics, 1977

1974

Some New Bounds on the Condition Numbers of Optimally Scaled Matrices.

J. ACM, 1974

1971

On Fully Indecomposable Matrices.

J. Comput. Syst. Sci., 1971

1968

A model of accidental drift voyaging in the Pacific Ocean with applications to the Polynesia colonization problem.

IFIP Congress (2), 1968