Concepedia

James F. Geelen

JF

16

Publications

572

Citations

15

H-Index

1993

Active since

Affiliations

University of Waterloo(Current)

Victoria University of Wellington

Centrum Wiskunde & Informatica

Louisiana State University

The University of Tokyo

James F. Geelen is an author at University of Waterloo specializing in discrete mathematics, graph theory, and combinatorial optimization.

Top concepts

Discrete MathematicsEngineeringGraph TheoryCombinatorial OptimizationMathematical ProgrammingComputer ScienceComputational ComplexityFunctional AnalysisData ScienceNetwork Science

Publications per year

1993–2005

16

Publications

16

Branch-Width and Well-Quasi-Ordering in Matroids and Graphs

James F. Geelen, A.M.H. Gerards, Geoff Whittle · Journal of Combinatorial Theory Series B · 2002 · 102 citations · Full text

Mathematical Programming, Matroid Theory, Engineering +6

Computational methods for the diameter restricted minimum weight spanning tree problem.

N. R. Achuthan, Lou Caccetta, P. Caccetta et al. · 1994 · 49 citations

The optimal path-matching problem

William H. Cunningham, James F. Geelen · COMBINATORICA · 1997 · 46 citations

Mathematical Programming, Engineering, Graph Theory +8

Maximum rank matrix completion

James F. Geelen · Linear Algebra and its Applications · 1999 · 42 citations

Low-rank Approximation, Matrix Factorization, Data Science +1

Matroid Matching Via Mixed Skew-Symmetric Matrices

James F. Geelen, Satoru Iwata · COMBINATORICA · 2005 · 38 citations

Mathematical Programming, Matroid Theory, Engineering +4

Rows per page

1–5 of 16