The following pages link to Jianping Li (Q198775):
Displaying 50 items.
- Approximation algorithms for solving the constrained arc routing problem in mixed graphs (Q297063) (← links)
- Approximations for constructing tree-form structures using specific material with fixed length (Q315511) (← links)
- The capacity expansion path problem in networks (Q364264) (← links)
- Long cycles in 1-tough graphs with large degree sums (Q687919) (← links)
- Maximizing profits of routing in WDM networks (Q813327) (← links)
- On the minimum number of Steiner points of constrained 1-line-fixed Steiner tree in the Euclidean plane \(\mathbb{R}^2\) (Q828689) (← links)
- Penalty cost constrained identical parallel machine scheduling problem (Q897945) (← links)
- On partitioning simple bipartite graphs in vertex-disjoint paths (Q925494) (← links)
- Long paths with endpoints in given vertex-subsets of graphs (Q941396) (← links)
- An improved approximation algorithm for the maximum TSP (Q974748) (← links)
- Some approximation algorithms for the clique partition problem in weighted interval graphs (Q995565) (← links)
- The subdivision-constrained minimum spanning tree problem (Q1006063) (← links)
- \((s,m)\)-radius of \(k\)-connected graphs (Q1011788) (← links)
- A proof of a conjecture about \(D_ \lambda\)-paths in graphs with large neighborhood unions (Q1356422) (← links)
- Cycles through subsets with large degree sums (Q1363686) (← links)
- Approximation algorithms for constructing specific subgraphs with minimum number of length-bounded stock pieces (Q1641150) (← links)
- Approximation algorithms for constructing spanning \(K\)-trees using stock pieces of bounded length (Q1686555) (← links)
- Approximation algorithms for the generalized stacker crane problem (Q1699767) (← links)
- On \(k\)-coloring of weighted circular-arc graphs (Q1768168) (← links)
- On the complexity of finding emerging patterns (Q1781987) (← links)
- Exact matching of RNA secondary structure patterns (Q1781989) (← links)
- Shortest path problems with left-side time windows (Q1926637) (← links)
- A polynomial time approximation scheme for embedding a directed hypergraph on a weighted ring (Q1928513) (← links)
- On approximations for constructing 1-line minimum rectilinear Steiner trees in the Euclidean plane \(\mathbb{R}^2\) (Q2039643) (← links)
- Approximation algorithms for constructing required subgraphs using stock pieces of fixed length (Q2082192) (← links)
- \(1\)-line minimum rectilinear Steiner trees and related problems (Q2084647) (← links)
- Approximation algorithms for solving the line-capacitated minimum Steiner tree problem (Q2089871) (← links)
- Approximation algorithms for solving the heterogeneous Chinese postman problem (Q2106868) (← links)
- Bin packing with divisible item sizes and rejection penalties (Q2136894) (← links)
- An approximation algorithm for solving the heterogeneous Chinese postman problem (Q2151360) (← links)
- Approximation algorithms for constructing some required structures in digraphs (Q2255946) (← links)
- Approximation algorithms for solving the 1-line Euclidean minimum Steiner tree problem (Q2292156) (← links)
- Improved approximation algorithms for the combination problem of parallel machine scheduling and path (Q2331579) (← links)
- Approximation algorithms for the ring loading problem with penalty cost (Q2350601) (← links)
- Coordination mechanism for selfish scheduling under a grade of service provision (Q2377231) (← links)
- On packing and coloring hyperedges in a cycle (Q2384398) (← links)
- Recursive formula of enumeration on forbidden words (Q2423993) (← links)
- The subdivision-constrained routing requests problem (Q2436672) (← links)
- Approximation algorithms for \(k\)-partitioning problems with partition matroid constraint (Q2448182) (← links)
- Cycles containing many vertices of subsets in 1-tough graphs with large degree sums (Q2715952) (← links)
- Cycles containing given subsets in 1-tough graphs. (Q2716016) (← links)
- Cycles containing many vertices of subsets in graphs with large degree sums and neighborhood unions (Q2721961) (← links)
- On the Thomassen's conjecture (Q2746209) (← links)
- (Q2779606) (← links)
- The prize-collecting call control problem on weighted lines and rings (Q2798111) (← links)
- ON THE VISUALIZATION OF STRINGS AND FRACTALS OF SOME FORBIDDEN WORDS (Q3011229) (← links)
- (Q3014094) (← links)
- (Q3110842) (← links)
- Parallel-Machine Scheduling Problem under the Job Rejection Constraint (Q3188845) (← links)
- (Q3374620) (← links)
