Sold Out
Book Categories |
Biography | ||
List of Publications | ||
Autobiographical Notes | ||
On the Foundations of Inversion Geometry | 4 | |
Cyclic Affine Planes | 29 | |
On the Number of Absolute Points of a Correlation | 36 | |
On Unions and Intersections of Cones | 50 | |
Binding Constraints and Helly Numbers | 57 | |
A Characterization of Comparability Graphs and of Interval Graphs | 65 | |
Some Properties of Graphs with Multiple Edges | 75 | |
Self-orthogonal Latin Squares | 87 | |
On Partitions of a Partially Ordered Set | 96 | |
Variations on a Theorem of Ryser | 107 | |
The Variation of the Spectrum of a Normal Matrix | 118 | |
Some Metric Inequalities in the Space of Matrices | 121 | |
On the Nonsingularity of Complex Matrices | 127 | |
Combinatorial Aspects of Gerschgorin's Theorem | 131 | |
Linear G-functions | 138 | |
On the Relationship Between the Hausdorff Distance and Matrix Distances of Ellipsoids | 146 | |
Bounds for the Spectrum of Normal Matrices | 159 | |
On Approximate Solutions of Systems of Linear Inequalities | 174 | |
Cycling in the Simplex Algorithm | 177 | |
Computational Experience in Solving Linear Programs | 182 | |
On Abstract Dual Linear Programs | 199 | |
A Proof of the Convexity of the Range of a Nonatomic Vector Measure Using Linear Inequalities | 204 | |
A Nonlinear Allocation Problem | 211 | |
Integral Boundary Points of Convex Polyhedra | 220 | |
Some Recent Applications of the Theory of Linear Inequalities to Extremal Combinatorial Analysis | 244 | |
Finding all Shortest Distances in a Directed Network | 259 | |
On Balanced Matrices | 262 | |
A Generalization of Max Flow-Min Cut | 275 | |
On Lattice Polyhedra III: Blockers and Anti-Blockers of Lattice Clutters | 283 | |
Local Unimodularity in the Matching Polytope | 294 | |
A Fast Algorithm that Makes Matrices Optimally Sparse | 303 | |
On Simple Linear Programming Problems | 317 | |
Totally Balanced and Greedy Matrices | 328 | |
Greedy Packing and Series-Parallel Graphs | 338 | |
On Simple Combinatorial Optimization Problems | 348 | |
Series Parallel Composition of Greedy Linear Programming Problems | 353 | |
On the Uniqueness of the Triangular Association Scheme | 371 | |
On Moore Graphs with Diameters 2 and 3 | 377 | |
On the Polynomial of a Graph | 385 | |
On the Line Graph of a Symmetric Balanced Incomplete Block Design | 392 | |
On Eigenvalues and Colorings of Graphs | 407 | |
Eigenvalues and Partitionings of the Edges of a Graph | 420 | |
On Spectrally Bounded Graphs | 430 | |
Lower Bounds for the Partitioning of Graphs | 437 | |
Nearest S-Matrices of Given Rank and the Ramsey Problem for Eigenvalues of Bipartite S-Graphs | 443 |
Login|Complaints|Blog|Games|Digital Media|Souls|Obituary|Contact Us|FAQ
CAN'T FIND WHAT YOU'RE LOOKING FOR? CLICK HERE!!! X
You must be logged in to add to WishlistX
This item is in your Wish ListX
This item is in your CollectionSelected Papers of Alan J Hoffman (with Commentary)
X
This Item is in Your InventorySelected Papers of Alan J Hoffman (with Commentary)
X
You must be logged in to review the productsX
X
X
Add Selected Papers of Alan J Hoffman (with Commentary), , Selected Papers of Alan J Hoffman (with Commentary) to the inventory that you are selling on WonderClubX
X
Add Selected Papers of Alan J Hoffman (with Commentary), , Selected Papers of Alan J Hoffman (with Commentary) to your collection on WonderClub |