Person:176697: Difference between revisions

From MaRDI portal
Person:176697
Created automatically from import231006081045
 
m AuthorDisambiguator moved page Yanpei Liu to Yanpei Liu: Duplicate
 
(No difference)

Latest revision as of 15:48, 8 December 2023

Available identifiers

zbMath Open liu.yanpeiMaRDI QIDQ176697

List of research outcomes

PublicationDate of PublicationType
Optimization of spanning tree stretch and congestion for graphs2022-03-21Paper
https://portal.mardi4nfdi.de/entity/Q50624692022-03-17Paper
https://portal.mardi4nfdi.de/entity/Q50624922022-03-17Paper
https://portal.mardi4nfdi.de/entity/Q50625822022-03-17Paper
https://portal.mardi4nfdi.de/entity/Q50629352022-03-17Paper
https://portal.mardi4nfdi.de/entity/Q50629902022-03-17Paper
https://portal.mardi4nfdi.de/entity/Q50630892022-03-17Paper
https://portal.mardi4nfdi.de/entity/Q50649492022-03-17Paper
The minimum stretch spanning tree problem for typical graphs2021-08-17Paper
Optimality computation of the minimum stretch spanning tree problem2021-03-16Paper
Birkhoff--von Neumann Graphs that are PM-Compact2020-10-28Paper
Combinatorial Functional Equations2019-12-10Paper
Combinatorial Functional Equations2019-10-25Paper
Bicriteria scheduling for due date assignment with total weighted tardiness2018-11-01Paper
https://portal.mardi4nfdi.de/entity/Q46428892018-05-25Paper
Bounded serial-batching scheduling for minimizing maximum lateness and makespan2018-05-24Paper
Core index of perfect matching polytope for a 2-connected cubic graph2018-01-10Paper
Algebraic Elements of Graphs2017-08-08Paper
Up-embeddability of graphs with new degree-sum2017-04-21Paper
Topological Theory of Graphs2017-02-03Paper
Bicriteria scheduling on a series-batching machine to minimize maximum cost and makespan2016-06-29Paper
https://portal.mardi4nfdi.de/entity/Q34624232016-01-14Paper
Minimizing total completion time for preemptive scheduling with release dates and deadline constraints2016-01-04Paper
2-边连通3-正则非上可嵌入图的扩充2015-10-28Paper
A characterization of PM-compact Hamiltonian bipartite graphs2015-07-22Paper
Vertex Splitting and Upper Embeddable Graphs2015-06-29Paper
New bounds on the edge-bandwidth of triangular grids2015-04-15Paper
Embedding of circulant graphs and generalized Petersen graphs on projective plane2015-03-02Paper
New classes of extremal graphs with given bandwidth2015-01-20Paper
https://portal.mardi4nfdi.de/entity/Q29314742014-11-25Paper
https://portal.mardi4nfdi.de/entity/Q31908472014-09-19Paper
A CHARACTERIZATION OF PM-COMPACT CLAW-FREE CUBIC GRAPHS2014-08-11Paper
Cutwidth of triangular grids2014-08-08Paper
https://portal.mardi4nfdi.de/entity/Q54123662014-04-25Paper
On the number of genus embeddings of complete bipartite graphs2014-02-14Paper
https://portal.mardi4nfdi.de/entity/Q57473942014-02-14Paper
Three-matching intersection conjecture for perfect matching polytopes of small dimensions2014-01-09Paper
https://portal.mardi4nfdi.de/entity/Q28603322013-11-19Paper
https://portal.mardi4nfdi.de/entity/Q28589462013-11-05Paper
An Improved Algorithm for a Bicriteria Batching Scheduling Problem2013-08-22Paper
Machine scheduling with contiguous processing constraints2013-06-28Paper
https://portal.mardi4nfdi.de/entity/Q49277502013-06-20Paper
Cutwidth of iterated caterpillars2013-06-18Paper
https://portal.mardi4nfdi.de/entity/Q49283592013-06-11Paper
https://portal.mardi4nfdi.de/entity/Q49248872013-06-10Paper
Chromatic sums of biloopless nonseparable near-triangulations on the projective plane2013-04-17Paper
Joint-tree model and the maximum genus of graphs2013-04-03Paper
https://portal.mardi4nfdi.de/entity/Q49096852013-03-21Paper
A characterization of PM-compact bipartite and near-bipartite graphs2013-03-19Paper
Queuing Theoretic Analysis of Power-performance Tradeoff in Power-efficient Computing2013-03-06Paper
https://portal.mardi4nfdi.de/entity/Q46499822012-11-15Paper
https://portal.mardi4nfdi.de/entity/Q29185352012-10-08Paper
https://portal.mardi4nfdi.de/entity/Q29185482012-10-08Paper
On the structure of graphs with path-width at most two2012-09-17Paper
https://portal.mardi4nfdi.de/entity/Q28812392012-04-03Paper
https://portal.mardi4nfdi.de/entity/Q28812842012-04-03Paper
https://portal.mardi4nfdi.de/entity/Q31180802012-03-01Paper
Square-root rule of two-dimensional bandwidth problem2012-02-28Paper
https://portal.mardi4nfdi.de/entity/Q31149512012-02-20Paper
https://portal.mardi4nfdi.de/entity/Q31149682012-02-20Paper
https://portal.mardi4nfdi.de/entity/Q31149782012-02-20Paper
https://portal.mardi4nfdi.de/entity/Q31150272012-02-20Paper
Counting orientable embeddings by genus for a type of 3-regular graph2012-01-24Paper
Two models of two-dimensional bandwidth problems2012-01-18Paper
https://portal.mardi4nfdi.de/entity/Q30945382011-10-25Paper
https://portal.mardi4nfdi.de/entity/Q31697042011-09-29Paper
https://portal.mardi4nfdi.de/entity/Q31709672011-09-29Paper
https://portal.mardi4nfdi.de/entity/Q30925842011-09-20Paper
https://portal.mardi4nfdi.de/entity/Q30900242011-08-25Paper
https://portal.mardi4nfdi.de/entity/Q30145472011-07-19Paper
https://portal.mardi4nfdi.de/entity/Q30135192011-07-18Paper
https://portal.mardi4nfdi.de/entity/Q30117772011-06-29Paper
https://portal.mardi4nfdi.de/entity/Q29960722011-05-05Paper
Surface embeddability of graphs via homology2011-02-25Paper
https://portal.mardi4nfdi.de/entity/Q30735712011-02-11Paper
PARALLEL MACHINE SCHEDULING WITH A SIMULTANEITY CONSTRAINT AND UNIT-LENGTH JOBS TO MINIMIZE THE MAKESPAN2011-02-10Paper
https://portal.mardi4nfdi.de/entity/Q30709162011-01-28Paper
https://portal.mardi4nfdi.de/entity/Q30709272011-01-28Paper
SOME IMPROVED ALGORITHMS ON THE SINGLE MACHINE HIERARCHICAL SCHEDULING WITH TOTAL TARDINESS AS THE PRIMARY CRITERION2011-01-19Paper
https://portal.mardi4nfdi.de/entity/Q30590222010-12-08Paper
https://portal.mardi4nfdi.de/entity/Q30525752010-11-05Paper
Chromatic sums of 2-edge-connected maps on the projective plane2010-10-26Paper
On a Conjecture of S. Stahl2010-10-13Paper
A sufficient condition on upper embeddability of graphs2010-08-23Paper
Number of embeddings of circular and Möbius ladders on surfaces2010-08-23Paper
A DP algorithm for minimizing makespan and total completion time on a series-batching machine2010-08-16Paper
https://portal.mardi4nfdi.de/entity/Q35746992010-07-09Paper
https://portal.mardi4nfdi.de/entity/Q35712222010-07-08Paper
https://portal.mardi4nfdi.de/entity/Q35729012010-07-08Paper
BIPARTITE MATCHING EXTENDABILITY AND TOUGHNESS2010-05-19Paper
The genus of a type of graph2010-04-13Paper
Classification of \((p,q,n)\)-dipoles on nonorientable surfaces2010-03-26Paper
https://portal.mardi4nfdi.de/entity/Q34053302010-02-12Paper
Up-embeddability of graphs with small order2010-02-12Paper
A new method for counting trees with vertex partition2009-12-07Paper
The number of rooted Eulerian planar maps2009-12-07Paper
Up-embeddability via girth and the degree-sum of adjacent vertices2009-12-07Paper
Genus distribution of ladder type and cross type graphs2009-12-07Paper
A note on the single machine scheduling to minimize the number of tardy jobs with deadlines2009-11-17Paper
https://portal.mardi4nfdi.de/entity/Q36422432009-11-11Paper
The weighted link ring loading problem2009-09-02Paper
https://portal.mardi4nfdi.de/entity/Q53184832009-07-22Paper
https://portal.mardi4nfdi.de/entity/Q53189652009-07-22Paper
https://portal.mardi4nfdi.de/entity/Q53189832009-07-22Paper
https://portal.mardi4nfdi.de/entity/Q53193932009-07-22Paper
https://portal.mardi4nfdi.de/entity/Q53205602009-07-22Paper
Online scheduling in a parallel batch processing system to minimize makespan using restarts2009-06-22Paper
On the embedding genus distribution of ladders and crosses2009-06-09Paper
https://portal.mardi4nfdi.de/entity/Q36261942009-05-22Paper
Flexibility of embeddings of bouquets of circles on the projective plane and Klein bottle2009-04-07Paper
https://portal.mardi4nfdi.de/entity/Q36140162009-03-16Paper
https://portal.mardi4nfdi.de/entity/Q36103232009-03-06Paper
https://portal.mardi4nfdi.de/entity/Q36103522009-03-06Paper
https://portal.mardi4nfdi.de/entity/Q36108452009-03-06Paper
Bipartite matching extendable graphs2009-01-28Paper
The number of rooted essential maps on surfaces2009-01-26Paper
Genus embeddings of a type of graph2008-10-21Paper
The genus polynomials of cross-ladder digraphs in orientable surfaces2008-09-09Paper
https://portal.mardi4nfdi.de/entity/Q35171692008-08-12Paper
https://portal.mardi4nfdi.de/entity/Q35134082008-08-06Paper
https://portal.mardi4nfdi.de/entity/Q35016802008-06-03Paper
A note on special optimal batching structures to minimize total weighted completion time2008-04-23Paper
https://portal.mardi4nfdi.de/entity/Q54558112008-04-04Paper
https://portal.mardi4nfdi.de/entity/Q54539312008-04-03Paper
Results of the maximum genus of graphs2008-03-11Paper
The genus distributions for a certain type of permutation graphs in orientable surfaces2008-03-11Paper
https://portal.mardi4nfdi.de/entity/Q54421572008-02-22Paper
The genus distributions of directed antiladders in orientable surfaces2008-02-07Paper
https://portal.mardi4nfdi.de/entity/Q54357582008-01-14Paper
https://portal.mardi4nfdi.de/entity/Q54330352007-12-18Paper
Up-embeddability of a graph by order and girth2007-12-10Paper
Orientable embedding genus distribution for certain types of graphs2007-12-10Paper
Enumeration of three kinds of rooted maps on the Klein bottle2007-10-22Paper
https://portal.mardi4nfdi.de/entity/Q53096402007-10-09Paper
On the decomposition of graphs into complete bipartite graphs2007-09-10Paper
Bicriteria scheduling on a batching machine to minimize maximum lateness and makespan2007-09-03Paper
https://portal.mardi4nfdi.de/entity/Q35951032007-08-10Paper
On the average crosscap number. II: Bounds for a graph2007-07-30Paper
https://portal.mardi4nfdi.de/entity/Q52949622007-07-26Paper
Strong embedding of HP-graphs on surface with higher genus2007-05-24Paper
Bisingular maps on the torus2007-04-05Paper
https://portal.mardi4nfdi.de/entity/Q34286372007-03-29Paper
https://portal.mardi4nfdi.de/entity/Q34286412007-03-29Paper
https://portal.mardi4nfdi.de/entity/Q34206772007-02-02Paper
Chromatic sums of general maps on the sphere and the projective plane2007-02-02Paper
https://portal.mardi4nfdi.de/entity/Q34146172007-01-10Paper
https://portal.mardi4nfdi.de/entity/Q34142822007-01-08Paper
Necessary and sufficient conditions of optimality for some classical scheduling problems2006-11-15Paper
The total embedding distributions of cacti and necklaces2006-10-04Paper
https://portal.mardi4nfdi.de/entity/Q54904872006-10-04Paper
https://portal.mardi4nfdi.de/entity/Q54905462006-10-04Paper
Structure for a graph with average genus2006-09-22Paper
Weak embedding of planar graphs2006-09-22Paper
https://portal.mardi4nfdi.de/entity/Q54883672006-09-14Paper
https://portal.mardi4nfdi.de/entity/Q54876392006-09-11Paper
The Number of Complete Maps on Surfaces2006-07-30Paper
Automorphisms and Enumeration of Maps of Cayley Graph of a Finite Group2006-07-30Paper
The semi-arc automorphism group of a graph with application to map enumeration2006-06-16Paper
https://portal.mardi4nfdi.de/entity/Q54724932006-06-12Paper
https://portal.mardi4nfdi.de/entity/Q33745902006-03-09Paper
https://portal.mardi4nfdi.de/entity/Q33710972006-02-21Paper
https://portal.mardi4nfdi.de/entity/Q33704512006-02-07Paper
The enumeration of general rooted planar maps2006-01-09Paper
Determination of the densest subgraph2005-11-01Paper
https://portal.mardi4nfdi.de/entity/Q56954572005-10-12Paper
https://portal.mardi4nfdi.de/entity/Q56947352005-10-04Paper
https://portal.mardi4nfdi.de/entity/Q56940062005-09-29Paper
Chromatic sums of rooted triangulations on the projective plane2005-08-25Paper
The enumeration of rooted cubic c-nets2005-08-25Paper
Chromatic sums of 2-edge-connected maps on the plane2005-08-17Paper
https://portal.mardi4nfdi.de/entity/Q54637762005-08-05Paper
https://portal.mardi4nfdi.de/entity/Q46796172005-06-21Paper
https://portal.mardi4nfdi.de/entity/Q46725912005-05-03Paper
https://portal.mardi4nfdi.de/entity/Q46726662005-05-03Paper
https://portal.mardi4nfdi.de/entity/Q46727132005-05-03Paper
Cycle spaces of graphs on the sphere and the projective plane2005-04-29Paper
https://portal.mardi4nfdi.de/entity/Q46594492005-03-21Paper
https://portal.mardi4nfdi.de/entity/Q46594732005-03-21Paper
Single machine preemptive scheduling with fixed jobs to minimize tardiness related criteria2005-03-08Paper
https://portal.mardi4nfdi.de/entity/Q46544822005-03-04Paper
Bisingular maps on some surfaces2005-01-31Paper
On chromatic polynomials of some kinds of graphs2005-01-25Paper
https://portal.mardi4nfdi.de/entity/Q48304042004-12-10Paper
https://portal.mardi4nfdi.de/entity/Q48205482004-10-15Paper
Chromatic sums of singular maps on some surfaces.2004-09-28Paper
https://portal.mardi4nfdi.de/entity/Q48091862004-08-24Paper
https://portal.mardi4nfdi.de/entity/Q48093352004-08-24Paper
https://portal.mardi4nfdi.de/entity/Q48110172004-08-17Paper
Chromatic sums of nonseparable simple maps on the plane.2004-06-22Paper
Maximum genus of strong embeddings2004-06-22Paper
The cutwidth of trees with diameters at most 42004-05-27Paper
Group action for enumerating maps on surfaces2004-05-18Paper
https://portal.mardi4nfdi.de/entity/Q44462732004-03-16Paper
Parallel machine scheduling of machine-dependent jobs with unit-length.2004-03-15Paper
On 3-cutwidth critical graphs2004-02-02Paper
https://portal.mardi4nfdi.de/entity/Q48018002004-01-22Paper
Weight reduction problems with certain bottleneck objectives.2004-01-05Paper
https://portal.mardi4nfdi.de/entity/Q44071762003-11-10Paper
https://portal.mardi4nfdi.de/entity/Q44158572003-08-07Paper
https://portal.mardi4nfdi.de/entity/Q44156552003-08-06Paper
https://portal.mardi4nfdi.de/entity/Q47896252003-06-26Paper
https://portal.mardi4nfdi.de/entity/Q47096072003-06-22Paper
Computation of the reverse shortest-path problem2003-06-09Paper
https://portal.mardi4nfdi.de/entity/Q48016202003-06-01Paper
Enumeration of loopless maps on the projective plane2003-04-28Paper
Singular maps on the Klein bottle2003-04-28Paper
https://portal.mardi4nfdi.de/entity/Q48037962003-04-09Paper
Enumeration on nonseparable planar maps2003-03-18Paper
A tight lower bound on the maximum genus of \(3\)-edge connected loopless graphs2003-03-17Paper
Determination of the star valency of a graph2003-03-09Paper
Enumeration of 2-connected loopless 4-regular maps on the plane2003-02-11Paper
Strong embeddings of planar graphs on higher surfaces2003-02-11Paper
A degree sequence method for the cutwidth problem of graphs2003-02-06Paper
https://portal.mardi4nfdi.de/entity/Q45474662003-01-30Paper
https://portal.mardi4nfdi.de/entity/Q47828052003-01-26Paper
https://portal.mardi4nfdi.de/entity/Q47828022003-01-21Paper
https://portal.mardi4nfdi.de/entity/Q44392892003-01-01Paper
Face size and the maximum genus of a graph. I: Simple graphs2002-12-10Paper
4-regular maps on the Klein bottle2002-12-10Paper
The number of loopless \(4\)-regular maps on the projective plane2002-12-10Paper
On the isomorphisms of Cayley graphs of Abelian groups.2002-12-10Paper
https://portal.mardi4nfdi.de/entity/Q31540852002-11-14Paper
https://portal.mardi4nfdi.de/entity/Q45457062002-11-11Paper
https://portal.mardi4nfdi.de/entity/Q45429162002-11-05Paper
Enumeration of simple bipartite maps on the sphere and the projective plane2002-10-24Paper
Enumeration of maps on the projective plane2002-09-11Paper
https://portal.mardi4nfdi.de/entity/Q45490062002-08-27Paper
https://portal.mardi4nfdi.de/entity/Q45490922002-08-27Paper
https://portal.mardi4nfdi.de/entity/Q45426632002-08-25Paper
https://portal.mardi4nfdi.de/entity/Q45426642002-08-25Paper
Boolean approaches to graph embeddings related to VLSI2002-08-15Paper
https://portal.mardi4nfdi.de/entity/Q45439912002-08-11Paper
https://portal.mardi4nfdi.de/entity/Q45440452002-08-11Paper
https://portal.mardi4nfdi.de/entity/Q27786482002-08-01Paper
https://portal.mardi4nfdi.de/entity/Q27741642002-05-20Paper
https://portal.mardi4nfdi.de/entity/Q43304972002-05-13Paper
https://portal.mardi4nfdi.de/entity/Q27742852002-05-07Paper
https://portal.mardi4nfdi.de/entity/Q45295502002-05-05Paper
https://portal.mardi4nfdi.de/entity/Q27809422002-04-23Paper
A note on strong embeddings of maximal planar graphs on non-orientable surfaces2002-03-29Paper
Enumerating rooted Eulerian planar maps2002-03-20Paper
https://portal.mardi4nfdi.de/entity/Q27249352002-03-14Paper
Enumerating near-4-regular maps on the sphere and the torus2002-02-17Paper
https://portal.mardi4nfdi.de/entity/Q27674142002-01-29Paper
https://portal.mardi4nfdi.de/entity/Q27674292002-01-29Paper
A relative maximum genus graph embedding and its local maximum genus2001-11-28Paper
The Obnoxious Center Problem on a Tree2001-11-11Paper
https://portal.mardi4nfdi.de/entity/Q27259862001-10-30Paper
https://portal.mardi4nfdi.de/entity/Q27473942001-10-14Paper
https://portal.mardi4nfdi.de/entity/Q47615342001-09-18Paper
Lower bounds on the maximum genus of loopless multigraphs2001-08-27Paper
https://portal.mardi4nfdi.de/entity/Q45036442001-08-16Paper
The number of rooted nearly cubic \(c\)-nets2001-08-01Paper
Bisingular maps on the sphere and the projective plane2001-07-23Paper
https://portal.mardi4nfdi.de/entity/Q27250272001-07-12Paper
https://portal.mardi4nfdi.de/entity/Q27079672001-07-08Paper
https://portal.mardi4nfdi.de/entity/Q45145942001-07-05Paper
https://portal.mardi4nfdi.de/entity/Q27149752001-06-20Paper
https://portal.mardi4nfdi.de/entity/Q27153042001-06-20Paper
https://portal.mardi4nfdi.de/entity/Q27153712001-06-20Paper
Maximum genus, girth and connectivity2001-05-10Paper
Maximum genus, independence number and girth2001-04-20Paper
https://portal.mardi4nfdi.de/entity/Q45036802001-03-30Paper
https://portal.mardi4nfdi.de/entity/Q45030942001-03-08Paper
A tight lower bound on the maximum genus of a 3-connected loopless multigraph2001-02-11Paper
https://portal.mardi4nfdi.de/entity/Q45284182001-01-31Paper
A class of bottleneck expansion problems2001-01-01Paper
Degenerate optimal basis graphs in linear programming2000-12-07Paper
https://portal.mardi4nfdi.de/entity/Q44900542000-12-03Paper
https://portal.mardi4nfdi.de/entity/Q45013472000-11-23Paper
https://portal.mardi4nfdi.de/entity/Q45029262000-11-22Paper
https://portal.mardi4nfdi.de/entity/Q45048402000-11-21Paper
https://portal.mardi4nfdi.de/entity/Q42370482000-11-20Paper
https://portal.mardi4nfdi.de/entity/Q44898012000-11-19Paper
The maximum genus of a 3-regular simplicial graph2000-10-08Paper
https://portal.mardi4nfdi.de/entity/Q45048562000-09-14Paper
https://portal.mardi4nfdi.de/entity/Q45048642000-09-14Paper
Upper embeddability of graphs2000-08-02Paper
On the number of fair triangulations2000-07-09Paper
https://portal.mardi4nfdi.de/entity/Q49378172000-06-09Paper
https://portal.mardi4nfdi.de/entity/Q38371012000-05-18Paper
https://portal.mardi4nfdi.de/entity/Q49521782000-05-09Paper
The enumeration of rooted nonseparable nearly cubic maps2000-04-09Paper
https://portal.mardi4nfdi.de/entity/Q49447192000-03-21Paper
https://portal.mardi4nfdi.de/entity/Q49447212000-03-21Paper
Extensions on 2-edge connected 3-regular up-embeddable graphs2000-02-02Paper
Counting rooted near-4-regular Eulerian maps on some surfaces1999-11-23Paper
https://portal.mardi4nfdi.de/entity/Q42450371999-10-18Paper
The bandwidth of the complement of a \(k\)-tree1999-09-12Paper
Enumeration of rooted planar Halin maps1999-08-12Paper
The maximum genus of graphs with diameter three1999-08-09Paper
https://portal.mardi4nfdi.de/entity/Q42460511999-07-20Paper
A linear algorithm for 2-bend embeddings of planar graphs in the two-dimensional grid1999-05-18Paper
https://portal.mardi4nfdi.de/entity/Q42328161999-04-28Paper
https://portal.mardi4nfdi.de/entity/Q42357551999-03-22Paper
Orthogonal drawings of graphs for the automation of VLSI circuit design1999-01-01Paper
https://portal.mardi4nfdi.de/entity/Q43915261998-12-10Paper
https://portal.mardi4nfdi.de/entity/Q43922201998-10-05Paper
https://portal.mardi4nfdi.de/entity/Q43884011998-09-14Paper
A characterization of embeddability of graphs on surfaces1998-08-20Paper
A graph partition problem1998-06-29Paper
https://portal.mardi4nfdi.de/entity/Q43933621998-06-08Paper
https://portal.mardi4nfdi.de/entity/Q43884031998-05-07Paper
Generalized bicycles1998-04-28Paper
https://portal.mardi4nfdi.de/entity/Q43846451998-04-26Paper
Maximum genus and maximum nonseparating independent set of a 3-regular graph1998-01-26Paper
https://portal.mardi4nfdi.de/entity/Q43472801997-12-14Paper
Embeddings of one kind of graphs1997-10-26Paper
https://portal.mardi4nfdi.de/entity/Q43460401997-07-28Paper
https://portal.mardi4nfdi.de/entity/Q48972451997-03-31Paper
https://portal.mardi4nfdi.de/entity/Q48829871997-02-17Paper
A characterization of the embeddability of graphs on the surface of given genus1997-02-13Paper
Transportation networks: Old and new1996-12-12Paper
https://portal.mardi4nfdi.de/entity/Q47168221996-11-28Paper
https://portal.mardi4nfdi.de/entity/Q48940691996-11-13Paper
Maximum cycle-means of weighted digraphs1996-10-20Paper
On the chromatic uniqueness of the graph \(W(n,n-2,k)\)1996-10-13Paper
Four counterfeit coins problem1996-08-01Paper
Combinatorial invariants on planar graphs1996-05-30Paper
On the chromatic uniqueness of the graph \(W(n,n-2)+K_ k\)1996-04-23Paper
https://portal.mardi4nfdi.de/entity/Q48427531995-11-27Paper
https://portal.mardi4nfdi.de/entity/Q43218271995-08-06Paper
A polyhedral theory on graphs1995-05-09Paper
At most single-bend embeddings of cubic graphs1995-03-07Paper
The existence of infinitely many primary trees1995-02-01Paper
https://portal.mardi4nfdi.de/entity/Q43117121994-10-30Paper
https://portal.mardi4nfdi.de/entity/Q43063261994-09-19Paper
An ordered independence system and its applications to scheduling problems1994-08-18Paper
Profile minimization problem for matrices and graphs1994-06-29Paper
The efficient recognition on net-extensibility of graphs1994-06-28Paper
https://portal.mardi4nfdi.de/entity/Q42946111994-05-17Paper
https://portal.mardi4nfdi.de/entity/Q31398621994-05-05Paper
Dichromatic sum equations for outerplanar maps1994-04-13Paper
Some combinatorial optimization problems arising from VLSI circuit design1994-04-12Paper
Counting rooted near-triangulations on the sphere1994-03-01Paper
On functional equations arising from map enumerations1994-03-01Paper
A recognition problem in converting linear programming to network flow models1994-02-28Paper
Boolean approach to planar embeddings of a graph1993-12-01Paper
On the characterization of path graphs1993-10-13Paper
https://portal.mardi4nfdi.de/entity/Q52895541993-08-23Paper
https://portal.mardi4nfdi.de/entity/Q52895811993-08-23Paper
https://portal.mardi4nfdi.de/entity/Q52896411993-08-23Paper
On the net-embeddability of graphs1993-08-17Paper
Theoretical results on at most 1-bend embeddability of graphs1993-05-25Paper
https://portal.mardi4nfdi.de/entity/Q40343041993-05-16Paper
https://portal.mardi4nfdi.de/entity/Q40317711993-04-22Paper
On the vertex partition equation of loopless Eulerian planar maps1993-04-01Paper
https://portal.mardi4nfdi.de/entity/Q40243491993-03-29Paper
https://portal.mardi4nfdi.de/entity/Q40254291993-02-18Paper
https://portal.mardi4nfdi.de/entity/Q40185081993-01-16Paper
On the loopless Eulerian vertex partition equation1992-09-27Paper
https://portal.mardi4nfdi.de/entity/Q39904231992-06-28Paper
Asymptotic enumerations for rooted planar maps and rooted outerplanar maps1992-06-26Paper
https://portal.mardi4nfdi.de/entity/Q47105401992-06-25Paper
https://portal.mardi4nfdi.de/entity/Q47128451992-06-25Paper
General theoretical results on rectilinear embeddability of graphs1991-01-01Paper
Chromatic enumeration for rooted outerplanar maps1990-01-01Paper
On Boolean characterizations of planarity and planar embeddings of graphs1990-01-01Paper
On chromatic and dichromatic sum equations1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34800711989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34800721989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34848591989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q42041761989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q42067571989-01-01Paper
Enumeration of rooted nonseparable outerplanar maps1989-01-01Paper
On chromatic enumeration for rooted outerplanar maps1989-01-01Paper
On face partition of rooted outerplanar maps1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34814871988-01-01Paper
Boolean planarity characterization of graphs1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38265761988-01-01Paper
Correction to ``Chromatic sum equations for rooted cubic planar maps1988-01-01Paper
A new approach to the linearity of testing planarity of graphs1988-01-01Paper
Enumeration of rooted vertex non-separable planar maps1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30351381988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37755801987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37811251987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37986771987-01-01Paper
Chromatic sum equations for rooted cubic planar maps1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37054801986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37416391986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37416401986-01-01Paper
On the linearity of testing planarity of graphs1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47235531986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36777821985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36808741985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37187501985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37225251985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37414281985-01-01Paper
Enumerating rooted simple planar maps1985-01-01Paper
Enumerating rooted loopless planar maps1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33440151984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33479061984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33479081984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36935441984-01-01Paper
On the number of rooted c-nets1984-01-01Paper
k-valent maps on the surfaces1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36668761983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36682811983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36746971983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36616091982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36746961982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39562231982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39374261981-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Yanpei Liu