Jianxiu Hao

Available identifiers

zbMath Open hao.jianxiuMaRDI QIDQ202777

List of research outcomes

Publication	Date of Publication	Type
https://portal.mardi4nfdi.de/entity/Q4568207	2018-06-15	Paper
https://portal.mardi4nfdi.de/entity/Q2828844	2016-10-26	Paper
https://portal.mardi4nfdi.de/entity/Q2846619	2013-09-09	Paper
https://portal.mardi4nfdi.de/entity/Q2846669	2013-09-09	Paper
https://portal.mardi4nfdi.de/entity/Q4903404	2013-01-21	Paper
https://portal.mardi4nfdi.de/entity/Q3118075	2012-03-01	Paper
https://portal.mardi4nfdi.de/entity/Q3118092	2012-03-01	Paper
https://portal.mardi4nfdi.de/entity/Q3118123	2012-03-01	Paper
https://portal.mardi4nfdi.de/entity/Q3114980	2012-02-20	Paper
An algorithm for reversal median problem	2011-07-21	Paper
https://portal.mardi4nfdi.de/entity/Q3011712	2011-06-29	Paper
https://portal.mardi4nfdi.de/entity/Q3011755	2011-06-29	Paper
https://portal.mardi4nfdi.de/entity/Q3069410	2011-01-25	Paper
https://portal.mardi4nfdi.de/entity/Q3643739	2009-11-09	Paper
Estimate the distance of genome rearrangements by reversals	2007-10-12	Paper
The adjoints of DNA graphs	2005-08-05	Paper
https://portal.mardi4nfdi.de/entity/Q5463548	2005-08-04	Paper
Maximum cutwidth problem for graphs.	2003-11-17	Paper
The extreme set condition of a graph	2003-03-16	Paper
https://portal.mardi4nfdi.de/entity/Q4543985	2002-08-11	Paper
The enumeration of near-perfect matchings of factor-critical graphs	2002-07-03	Paper
Cyclic bandwidth sum of graphs	2002-05-20	Paper
Diagnosing infeasibilities in network flow problems	1999-09-05	Paper
https://portal.mardi4nfdi.de/entity/Q4763403	1995-04-11	Paper
A Faster Algorithm for Finding the Minimum Cut in a Directed Graph	1994-12-14	Paper
On the maximum capacity augmentation algorithm for the maximum flow problem	1994-02-22	Paper
https://portal.mardi4nfdi.de/entity/Q4283456	1993-01-01	Paper
Polynomial-time primal simplex algorithms for the minimum cost network flow problem	1992-09-27	Paper
On strongly polynomial variants of the networks simplex algorithm for the maximum flow problem	1992-06-27	Paper
Shortest path algorithms using dynamic breadth‐first search	1991-01-01	Paper
A primal simplex algorithm that solves the maximum flow problem in at most nm pivots and \(O(n^ 2m)\) time	1990-01-01	Paper
Anti-stalling pivot rules for the network simplex algorithm	1990-01-01	Paper
Efficient Shortest Path Simplex Algorithms	1990-01-01	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Jianxiu Hao