| Publication | Date of Publication | Type |
|---|
Extremal cut-width problem for graphs
Chinese Quarterly Journal of Mathematics | 2025-07-28 | Paper |
Problems on two-dimensional bandwidth under distance of L_-norm
Chinese Quarterly Journal of Mathematics | 2025-07-28 | Paper |
| The local diagnosability of \(k\)-ary \(n\)-cube. | 2018-06-15 | Paper |
Relationship between modified Zagreb indices and reformulated modified Zagreb indices with respect to trees.
Ars Combinatoria | 2016-10-26 | Paper |
Theorems about PI indices.
Ars Combinatoria | 2013-09-09 | Paper |
PI index of extremal simple pericondensed hexagonal systems.
Ars Combinatoria | 2013-09-09 | Paper |
| Theorems about Zagreb indices and modified Zagreb indices | 2013-01-21 | Paper |
| scientific article; zbMATH DE number 6010653 (Why is no real title available?) | 2012-03-01 | Paper |
| scientific article; zbMATH DE number 6010681 (Why is no real title available?) | 2012-03-01 | Paper |
| PI indices for some classes of bicyclic graphs. | 2012-03-01 | Paper |
| scientific article; zbMATH DE number 6007661 (Why is no real title available?) | 2012-02-20 | Paper |
An algorithm for reversal median problem
Journal of Mathematical Chemistry | 2011-07-21 | Paper |
| PI index of some simple pericondensed hexagonal systems. | 2011-06-29 | Paper |
| scientific article; zbMATH DE number 5914872 (Why is no real title available?) | 2011-06-29 | Paper |
| Some graphs with extremal PI index | 2011-01-25 | Paper |
| Some bounds for PI indices | 2009-11-09 | Paper |
Estimate the distance of genome rearrangements by reversals
Journal of Mathematical Chemistry | 2007-10-12 | Paper |
The adjoints of DNA graphs
Journal of Mathematical Chemistry | 2005-08-05 | Paper |
| scientific article; zbMATH DE number 2192172 (Why is no real title available?) | 2005-08-04 | Paper |
Maximum cutwidth problem for graphs.
Applied Mathematics. Series B (English Edition) | 2003-11-17 | Paper |
The extreme set condition of a graph
Discrete Mathematics | 2003-03-16 | Paper |
| scientific article; zbMATH DE number 1778090 (Why is no real title available?) | 2002-08-11 | Paper |
The enumeration of near-perfect matchings of factor-critical graphs
Discrete Mathematics | 2002-07-03 | Paper |
Cyclic bandwidth sum of graphs
Applied Mathematics. Series B (English Edition) | 2002-05-20 | Paper |
Diagnosing infeasibilities in network flow problems
Mathematical Programming. Series A. Series B | 1999-09-05 | Paper |
| scientific article; zbMATH DE number 742961 (Why is no real title available?) | 1995-04-11 | Paper |
A Faster Algorithm for Finding the Minimum Cut in a Directed Graph
Journal of Algorithms | 1994-12-14 | Paper |
On the maximum capacity augmentation algorithm for the maximum flow problem
Discrete Applied Mathematics | 1994-02-22 | Paper |
| scientific article; zbMATH DE number 515939 (Why is no real title available?) | 1993-01-01 | Paper |
Polynomial-time primal simplex algorithms for the minimum cost network flow problem
Algorithmica | 1992-09-27 | Paper |
On strongly polynomial variants of the networks simplex algorithm for the maximum flow problem
Operations Research Letters | 1992-06-27 | Paper |
Shortest path algorithms using dynamic breadth‐first search
Networks | 1991-01-01 | Paper |
A primal simplex algorithm that solves the maximum flow problem in at most nm pivots and O(n^ 2m) time
Mathematical Programming. Series A. Series B | 1990-01-01 | Paper |
Efficient Shortest Path Simplex Algorithms
Operations Research | 1990-01-01 | Paper |
Anti-stalling pivot rules for the network simplex algorithm
Networks | 1990-01-01 | Paper |
