The following pages link to Yanpei Liu (Q176697):
Displaying 50 items.
- Bicriteria scheduling on a series-batching machine to minimize maximum cost and makespan (Q300969) (← links)
- (Q390920) (redirect page) (← links)
- Three-matching intersection conjecture for perfect matching polytopes of small dimensions (Q390921) (← links)
- Cutwidth of triangular grids (Q397153) (← links)
- New classes of extremal graphs with given bandwidth (Q489353) (← links)
- Up-embeddability of graphs with new degree-sum (Q523775) (← links)
- Surface embeddability of graphs via homology (Q625921) (← links)
- Two models of two-dimensional bandwidth problems (Q656608) (← links)
- Counting orientable embeddings by genus for a type of 3-regular graph (Q659758) (← links)
- Preperfect graphs (Q684406) (← links)
- On kernels in perfect graphs (Q684411) (← links)
- The harmonious chromatic number of a complete binary and trinary tree (Q685580) (← links)
- Plane graphs and link invariants (Q685681) (← links)
- The efficient recognition on net-extensibility of graphs (Q687910) (← links)
- A comparison of two edge-coloring formulations (Q688209) (← links)
- A degree sequence method for the cutwidth problem of graphs (Q698370) (← links)
- On chromatic polynomials of some kinds of graphs (Q705078) (← links)
- Bisingular maps on some surfaces (Q705386) (← links)
- Chromatic sums of 2-edge-connected maps on the projective plane (Q711508) (← links)
- Correction to ``Chromatic sum equations for rooted cubic planar maps'' (Q749549) (← links)
- Chromatic enumeration for rooted outerplanar maps (Q757400) (← links)
- On the number of rooted c-nets (Q793049) (← links)
- General theoretical results on rectilinear embeddability of graphs (Q809088) (← links)
- The weighted link ring loading problem (Q839671) (← links)
- Up-embeddability of graphs with small order (Q847307) (← links)
- Necessary and sufficient conditions of optimality for some classical scheduling problems (Q852941) (← links)
- An extension of Sallee's theorem to infinite locally finite VAP-free plane graphs (Q854415) (← links)
- Edge covering coloring of nearly bipartite graphs (Q854458) (← links)
- Chromatic sums of general maps on the sphere and the projective plane (Q861795) (← links)
- Bisingular maps on the torus (Q874353) (← links)
- Strong embedding of HP-graphs on surface with higher genus (Q882534) (← links)
- Minimizing total completion time for preemptive scheduling with release dates and deadline constraints (Q902745) (← links)
- Enumeration of rooted nonseparable outerplanar maps (Q908932) (← links)
- On chromatic enumeration for rooted outerplanar maps (Q908939) (← links)
- The genus polynomials of cross-ladder digraphs in orientable surfaces (Q943439) (← links)
- Genus embeddings of a type of graph (Q949340) (← links)
- The genus of a type of graph (Q963700) (← links)
- A DP algorithm for minimizing makespan and total completion time on a series-batching machine (Q987835) (← links)
- A sufficient condition on upper embeddability of graphs (Q989758) (← links)
- Number of embeddings of circular and Möbius ladders on surfaces (Q989772) (← links)
- Bicriteria scheduling on a batching machine to minimize maximum lateness and makespan (Q995579) (← links)
- On the decomposition of graphs into complete bipartite graphs (Q995755) (← links)
- Bipartite matching extendable graphs (Q998414) (← links)
- Flexibility of embeddings of bouquets of circles on the projective plane and Klein bottle (Q1010643) (← links)
- On the embedding genus distribution of ladders and crosses (Q1021813) (← links)
- Online scheduling in a parallel batch processing system to minimize makespan using restarts (Q1022602) (← links)
- A note on the single machine scheduling to minimize the number of tardy jobs with deadlines (Q1038367) (← links)
- A new method for counting trees with vertex partition (Q1042787) (← links)
- The number of rooted Eulerian planar maps (Q1042797) (← links)
- Up-embeddability via girth and the degree-sum of adjacent vertices (Q1042914) (← links)
