Guo Jun Li

From MaRDI portal
Revision as of 03:13, 7 October 2023 by Import231006081045 (talk | contribs) (Created automatically from import231006081045)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:237118

Available identifiers

zbMath Open li.guojunMaRDI QIDQ237118

List of research outcomes





PublicationDate of PublicationType
A polynomial-time approximation scheme for embedding hypergraph in a cycle2018-11-05Paper
Componentwise complementary cycles in multipartite tournaments2017-02-14Paper
https://portal.mardi4nfdi.de/entity/Q28289152016-10-26Paper
Maximally edge-connected graphs and zeroth-order general Randić index for \(\alpha\leq-1\)2016-02-23Paper
Coloring the square of Sierpiński graphs2015-09-24Paper
Shortest paths in Sierpiński graphs2014-09-12Paper
The linear \(t\)-colorings of Sierpiński-like graphs2014-06-16Paper
https://portal.mardi4nfdi.de/entity/Q53972882014-02-19Paper
https://portal.mardi4nfdi.de/entity/Q57473742014-02-14Paper
Equitable and list equitable colorings of planar graphs without 4-cycles2014-01-17Paper
Neighborhood unions for the existence of disjoint chorded cycles in graphs2013-09-26Paper
Every cycle-connected multipartite tournament with \(\delta\geq 2\) contains at least two universal ARCS2013-07-19Paper
The linear arboricity of planar graphs without 5-, 6-cycles with chords2013-06-26Paper
A vertex cover with chorded 4-cycles2013-03-18Paper
Vertex-disjoint cycles of order eight with chords in a bipartite graph2013-03-11Paper
https://portal.mardi4nfdi.de/entity/Q48974902012-12-19Paper
Equitable coloring and equitable choosability of planar graphs without 5- and 7-cycles2012-10-10Paper
https://portal.mardi4nfdi.de/entity/Q29062682012-09-05Paper
The hamiltonicity and path \(t\)-coloring of Sierpiński-like graphs2012-08-14Paper
LIST EDGE AND LIST TOTAL COLORINGS OF PLANAR GRAPHS WITHOUT 6-CYCLES WITH CHORD2012-04-13Paper
https://portal.mardi4nfdi.de/entity/Q28812572012-04-03Paper
https://portal.mardi4nfdi.de/entity/Q28812742012-04-03Paper
A polynomial time approximation scheme for embedding hypergraph in a weighted cycle2011-12-07Paper
Ore-type conditions for bipartite graphs containing hexagons2011-08-08Paper
Unbounded batch scheduling with a common due window on a single machine2010-12-14Paper
On a sharp degree sum condition for disjoint chorded cycles in graphs2010-11-12Paper
https://portal.mardi4nfdi.de/entity/Q30545422010-11-05Paper
A Polynomial Time Approximation Scheme for Embedding Hypergraph in a Weighted Cycle2010-09-07Paper
On 2-factors with cycles containing specified vertices in a bipartite graph2009-11-09Paper
Degree condition for the existence of a \(k\)-factor containing a given Hamiltonian cycle2009-06-19Paper
Removable Edges of a Spanning Tree in 3-Connected 3-Regular Graphs2009-03-10Paper
https://portal.mardi4nfdi.de/entity/Q36110202009-03-06Paper
Removable edges of cycles in 5-connected graphs2008-10-21Paper
An algorithm for simultaneous backbone threading and side-chain packing2008-07-01Paper
https://portal.mardi4nfdi.de/entity/Q54530442008-04-04Paper
An algorithm for simultaneous backbone threading and side-chain packing2007-09-10Paper
https://portal.mardi4nfdi.de/entity/Q34426822007-05-22Paper
https://portal.mardi4nfdi.de/entity/Q34311472007-04-05Paper
MINIMIZING TOTAL WEIGHTED COMPLETION TIME ON IDENTICAL PARALLEL BATCH MACHINES2007-02-08Paper
https://portal.mardi4nfdi.de/entity/Q54904702006-10-04Paper
SORTING SIGNED PERMUTATIONS BY FIXED-LENGTH REVERSALS2006-08-21Paper
On connencted \([g,f+1\)-factors in graphs]2006-06-27Paper
Automata, Languages and Programming2005-08-24Paper
https://portal.mardi4nfdi.de/entity/Q54614952005-07-26Paper
A PTAS FOR MINIMIZING TOTAL COMPLETION TIME OF BOUNDED BATCH SCHEDULING2005-06-22Paper
Computing and Combinatorics2005-06-15Paper
A PTAS for semiconductor burn-in scheduling2005-05-17Paper
Minimizing makespan with release times on identical parallel batching machines2005-05-04Paper
https://portal.mardi4nfdi.de/entity/Q46725902005-05-03Paper
Two feedback problems for graphs with bounded tree-width2005-02-24Paper
A linear time algorithm for the minimum-weight feedback vertex set problem in series-parallel graphs2005-01-25Paper
https://portal.mardi4nfdi.de/entity/Q48284932004-11-19Paper
https://portal.mardi4nfdi.de/entity/Q48271392004-11-16Paper
https://portal.mardi4nfdi.de/entity/Q48107542004-08-16Paper
https://portal.mardi4nfdi.de/entity/Q47372042004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q47375352004-08-11Paper
Proof of Chvátal's conjecture on maximal stable sets and maximal cliques in graphs2004-08-06Paper
Packing a tree of order \(p\) with a \((p,p+1)\)-graph2004-01-14Paper
Genetic Design of Drugs Without Side-Effects2003-09-28Paper
Center and distinguisher for strings with unbounded alphabet2003-06-09Paper
https://portal.mardi4nfdi.de/entity/Q45521862002-08-29Paper
Orthogonal factorizations of graphs2002-05-15Paper
A generalization of orthogonal factorizations in graphs2002-03-20Paper
Orthogonal (g, f)-factorizations in networks2001-12-12Paper
Wavelength allocation on trees of rings2001-10-14Paper
Edge disjoint Hamilton cycles in graphs2001-02-12Paper
https://portal.mardi4nfdi.de/entity/Q42622312000-01-30Paper
On connected factors in \(K_{1,3}\)-free graphs1999-08-30Paper
https://portal.mardi4nfdi.de/entity/Q42406831999-08-19Paper
\((g,f)\)-factorizations orthogonal to a subgraph of a graph1999-03-22Paper
https://portal.mardi4nfdi.de/entity/Q43845971998-10-27Paper
https://portal.mardi4nfdi.de/entity/Q31229281997-06-22Paper
https://portal.mardi4nfdi.de/entity/Q43332931997-06-16Paper
A new result on local forbidden graph and hamiltonicity1997-01-22Paper
https://portal.mardi4nfdi.de/entity/Q48876751996-11-24Paper
https://portal.mardi4nfdi.de/entity/Q48797211996-06-02Paper
https://portal.mardi4nfdi.de/entity/Q42788561994-04-06Paper
https://portal.mardi4nfdi.de/entity/Q52878141993-09-19Paper

Research outcomes over time

This page was built for person: Guo Jun Li