Theoretical Computer Science
A Coordinatewise Domain Scaling Algorithm for M-convex Function Minimization
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
The linear delta-matroid parity problem
Journal of Combinatorial Theory Series B
The affine representation theorem for abstract convex geometries
Computational Geometry: Theory and Applications - Special issue on the 19th European workshop on computational geometry - EuroCG 03
The complexity of matrix completion
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Approximating clique-width and branch-width
Journal of Combinatorial Theory Series B
Holographic algorithms: from art to science
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Induction of M-convex functions by linking systems
Discrete Applied Mathematics
An algebraic algorithm for weighted linear matroid intersection
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Holographic algorithms with unsymmetric signatures
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Holographic algorithms: guest column
ACM SIGACT News
Basis Collapse in Holographic Algorithms
Computational Complexity
Structural Identifiability in Low-Rank Matrix Factorization
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
A Structure Theory for the Parametric Submodular Intersection Problem
Mathematics of Operations Research
The affine representation theorem for abstract convex geometries
Computational Geometry: Theory and Applications - Special issue on the 19th European workshop on computational geometry - EuroCG 03
On symmetric signatures in holographic algorithms
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Matching structure of symmetric bipartite graphs and a generalization of Pólya's problem
Journal of Combinatorial Theory Series B
Holographic algorithms: From art to science
Journal of Computer and System Sciences
Computing the maximum degree of minors in mixed polynomial matrices via combinatorial relaxation
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
Computers and Industrial Engineering
Deterministic Polynomial Time Algorithms for Matrix Completion Problems
SIAM Journal on Computing
On the Kronecker Canonical Form of Mixed Matrix Pencils
SIAM Journal on Matrix Analysis and Applications
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Combinatorial analysis of generic matrix pencils
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
Algebraic algorithms for linear matroid parity problems
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Some results on matchgates and holographic algorithms
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
On the NP-completeness of the perfect matching free subgraph problem
Theoretical Computer Science
Survey Generic properties and control of linear structured systems: a survey
Automatica (Journal of IFAC)
Polyhedral analysis and branch-and-cut for the structural analysis problem
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
On block-wise symmetric signatures for matchgates
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
Holographic algorithms: the power of dimensionality resolved
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Fast deterministic algorithms for matrix completion problems
IPCO'13 Proceedings of the 16th international conference on Integer Programming and Combinatorial Optimization
Matching problems with delta-matroid constraints
CATS '12 Proceedings of the Eighteenth Computing: The Australasian Theory Symposium - Volume 128
European Journal of Combinatorics
Coordinate-free geometry and decomposition in geometrical constraint solving
Computer-Aided Design
Hi-index | 0.00 |
A matroid is an abstract mathematical structure that captures combinatorial properties of matrices. This book offers a unique introduction to matroid theory, emphasizing motivations from matrix theory and applications to systems analysis.This book serves also as a comprehensive presentation of the theory and application of mixed matrices, developed primarily by the present author in the last decade. A mixed matrix is a convenient mathematical tool for systems analysis, compatible with the physical observation that "fixed constants" and "system parameters" are to be distinguished in the description of engineering systems.This book will be extremely useful to graduate students and researchers in engineering, mathematics and computer science. From the reviews: "The book has been prepared very carefully, contains a lot of interesting results and is highly recommended for graduate and postgraduate students." Andrs Recski, Mathematical Reviews Clippings 2000m:93006