Local Tournaments and Proper Circular Arc Gaphs. - Pavol Hell; Jørgen Bang-Jensen; Jing Huang 007 (SIGAL International Symposium on Algorithms, 1990)

Recognition and Representation of Proper Circular Arc Graphs. - Xiaotie Deng; Pavol Hell; Jing Huang 007 (IPCO, 1992)

In-Tournament Digraphs. - Jørgen Bang-Jensen; Jing Huang 007; Erich Prisner (J. Comb. Theory B, 1993)

Weakly Hamiltonian-connected ordinary multipartite tournaments. - Jørgen Bang-Jensen; Gregory Z. Gutin; Jing Huang 007 (Discret. Math., 1995)

On the Structure of Local Tournaments. - Jing Huang 007 (J. Comb. Theory B, 1995)

Quasi-transitive digraphs. - Jørgen Bang-Jensen; Jing Huang 007 (J. Graph Theory, 1995)

Lexicographic orientation and representation algorithms for comparability graphs, proper circular arc graphs, and proper interval graphs. - Pavol Hell; Jing Huang 007 (J. Graph Theory, 1995)

A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian. - Jørgen Bang-Jensen; Gregory Z. Gutin; Jing Huang 007 (Discret. Math., 1996)

Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs. - Xiaotie Deng; Pavol Hell; Jing Huang 007 (SIAM J. Comput., 1996)

A Linear Algorithm for Maximum Weight Cliques in Proper Circular Arc Graphs. - Binay K. Bhattacharya; Pavol Hell; Jing Huang 007 (SIAM J. Discret. Math., 1996)

Two remarks on circular arc graphs. - Pavol Hell; Jing Huang 007 (Graphs Comb., 1997)

A Note on Spanning Local Tournaments in Locally Semicomplete Digraphs. - Jing Huang 007 (Discret. Appl. Math., 1998)

Kings in quasi-transitive digraphs. - Jørgen Bang-Jensen; Jing Huang 007 (Discret. Math., 1998)

Maximal and Minimal Vertex-Critical Graphs of Diameter Two. - Jing Huang 007; Anders Yeo (J. Comb. Theory B, 1998)

Which digraphs are round? - Jing Huang 007 (Australas. J Comb., 1999)

List Homomorphisms and Circular Arc Graphs. - Tomás Feder; Pavol Hell; Jing Huang 007 (Comb., 1999)

Convex-Round and Concave-Round Graphs. - Jørgen Bang-Jensen; Jing Huang 007; Anders Yeo (SIAM J. Discret. Math., 2000)

Nearly-acyclically pushable tournaments. - Jing Huang 007; Kathryn L. B. Wood (Australas. J Comb., 2001)

Pushing the cycles out of multipartite tournaments. - Jing Huang 007; Gary MacGillivray; Kathryn L. B. Wood (Discret. Math., 2001)

Pushing vertices in digraphs without long induced cycles. - Jing Huang 007; Gary MacGillivray; Anders Yeo (Discret. Appl. Math., 2002)

Convex-round graphs are circular-perfect. - Jørgen Bang-Jensen; Jing Huang 007 (J. Graph Theory, 2002)

Bi-arc graphs and the complexity of list homomorphisms. - Tomás Feder; Pavol Hell; Jing Huang 007 (J. Graph Theory, 2003)

Strongly Connected Spanning Subdigraphs with the Minimum Number of Arcs in Quasi-transitive Digraphs. - Jørgen Bang-Jensen; Jing Huang 007; Anders Yeo (SIAM J. Discret. Math., 2003)

Spanning k-arc-strong subdigraphs with few arcs in k-arc-strong tournaments. - Jørgen Bang-Jensen; Jing Huang 007; Anders Yeo (J. Graph Theory, 2004)

Interval bigraphs and circular arc graphs. - Pavol Hell; Jing Huang 007 (J. Graph Theory, 2004)

Certifying LexBFS Recognition Algorithms for Proper Interval Graphs and Proper Interval Bigraphs. - Pavol Hell; Jing Huang 007 (SIAM J. Discret. Math., 2004)

A generalization of the theorem of Lekkerkerker and Boland. - Pavol Hell; Jing Huang 007 (Discret. Math., 2005)

Representation characterizations of chordal bipartite graphs. - Jing Huang 007 (J. Comb. Theory B, 2006)

Sharp Bounds for the Oriented Diameters of Interval Graphs and 2-Connected Proper Interval Graphs. - Jing Huang 007; Dong Ye 002 (International Conference on Computational Science (3), 2007)

Recognizing and representing proper interval graphs in parallel using merging and sorting. - Jørgen Bang-Jensen; Jing Huang 007; Louis Ibarra (Discret. Appl. Math., 2007)

List homomorphisms of graphs with bounded degrees. - Tomás Feder; Pavol Hell; Jing Huang 007 (Discret. Math., 2007)

The structure of bi-arc trees. - Tomás Feder; Pavol Hell; Jing Huang 007 (Discret. Math., 2007)

Worst case analysis of Max-Regret, Greedy and other heuristics for Multidimensional Assignment and Traveling Salesman Problems. - Gregory Z. Gutin; Boris Goldengorin; Jing Huang 007 (J. Heuristics, 2008)

Near-Unanimity Functions and Varieties of Reflexive Graphs. - Richard C. Brewster; Tomás Feder; Pavol Hell; Jing Huang 007; Gary MacGillivray (SIAM J. Discret. Math., 2008)

Brooks-Type Theorems for Pair-List Colorings and List Homomorphisms. - Tomás Feder; Pavol Hell; Jing Huang 007 (SIAM J. Discret. Math., 2008)

Extension problems with degree bounds. - Tomás Feder; Pavol Hell; Jing Huang 007 (Discret. Appl. Math., 2009)

Adjusted Interval Digraphs. - Tomás Feder; Pavol Hell; Jing Huang 007; Arash Rafiey (Electron. Notes Discret. Math., 2009)

Recognizing line-polar bipartite graphs in time O(n). - Tínaz Ekim; Jing Huang 007 (Discret. Appl. Math., 2010)

A note on the bichromatic numbers of graphs. - Dennis D. A. Epple; Jing Huang 007 (J. Graph Theory, 2010)

Complexity of Cycle Transverse Matching Problems. - Ross Churchley; Jing Huang 007; Xuding Zhu (IWOCA, 2011)

Line-Polar Graphs: Characterization and Recognition. - Ross Churchley; Jing Huang 007 (SIAM J. Discret. Math., 2011)

Interval graphs, adjusted interval digraphs, and reflexive list homomorphisms. - Tomás Feder; Pavol Hell; Jing Huang 007; Arash Rafiey (Discret. Appl. Math., 2012)

List monopolar partitions of claw-free graphs. - Ross Churchley; Jing Huang 007 (Discret. Math., 2012)

Decomposing locally semicomplete digraphs into strong spanning subdigraphs. - Jørgen Bang-Jensen; Jing Huang 007 (J. Comb. Theory B, 2012)

Recognition and Characterization of Chronological Interval Digraphs. - Sandip Das 001; Mathew C. Francis; Pavol Hell; Jing Huang 007 (Electron. J. Comb., 2013)

Solving Partition Problems with Colour-Bipartitions. - Ross Churchley; Jing Huang 007 (Graphs Comb., 2014)

Arc-Disjoint In- and Out-Branchings With the Same Root in Locally Semicomplete Digraphs. - Jørgen Bang-Jensen; Jing Huang 007 (J. Graph Theory, 2014)

On the Polarity and Monopolarity of Graphs. - Ross Churchley; Jing Huang 007 (J. Graph Theory, 2014)

Chronological Rectangle Digraphs. - Jing Huang 007; Josh Manzer (Electron. Notes Discret. Math., 2015)

A Brooks-Type Theorem for the Bichromatic Number. - Dennis D. A. Epple; Jing Huang 007 (J. Graph Theory, 2015)

End-vertices of LBFS of (AT-free) bigraphs. - Jan Gorzny; Jing Huang 007 (Discret. Appl. Math., 2017)

Lexicographic Orientation Algorithms. - Jing Huang 007 (Classes of Directed Graphs, 2018)

Interval-Like Graphs and Digraphs. - Pavol Hell; Jing Huang 007; Ross M. McConnell; Arash Rafiey (MFCS, 2018)

Non-edge orientation and vertex ordering characterizations of some classes of bigraphs. - Jing Huang 007 (Discret. Appl. Math., 2018)

Completing orientations of partially oriented graphs. - Jørgen Bang-Jensen; Jing Huang 007; Xuding Zhu (J. Graph Theory, 2018)

Strongly chordal digraphs and Γ-free matrices. - Pavol Hell; César Hernández-Cruz; Jing Huang 007; Jephian C.-H. Lin (CoRR, 2019)

Chronological rectangle digraphs which are two-terminal series-parallel. - Jing Huang 007; Josh Manzer (Discret. Appl. Math., 2019)

End-Vertices of AT-free Bigraphs. - Jan Gorzny; Jing Huang 007 (COCOON, 2020)

Bipartite Analogues of Comparability and Cocomparability Graphs. - Pavol Hell; Jing Huang 007; Jephian C.-H. Lin; Ross M. McConnell (SIAM J. Discret. Math., 2020)

Min-Orderable Digraphs. - Pavol Hell; Jing Huang 007; Ross M. McConnell; Arash Rafiey (SIAM J. Discret. Math., 2020)

Chordality of locally semicomplete and weakly quasi-transitive digraphs. - Jing Huang 007; Ying Ying Ye (Discret. Math., 2021)

(k, l)-colourings and Ferrers diagram representations of cographs. - Dennis D. A. Epple; Jing Huang 007 (Eur. J. Comb., 2021)

Corrigendum to "(k, l)-colourings and Ferrers diagram representations of cographs" [European J. Combin. 91 (2021) 103208]. - Dennis D. A. Epple; Jing Huang 007 (Eur. J. Comb., 2021)

Good orientations of unions of edge-disjoint spanning trees. - Jørgen Bang-Jensen; Stéphane Bessy; Jing Huang 007; Matthias Kriesell (J. Graph Theory, 2021)

Strong Chordality of Graphs with Possible Loops. - Pavol Hell; César Hernández-Cruz; Jing Huang 007; Jephian C.-H. Lin (SIAM J. Discret. Math., 2021)

Semi-strict Chordal Digraphs. - Jing Huang 007; Ying Ying Ye (COCOON, 2022)

Obstructions for acyclic local tournament orientation completions. - Kevin Hsu; Jing Huang 007 (Discret. Math., 2023)

Gallai-like characterization of strong cocomparability graphs. - Jing Huang 007 (J. Graph Theory, 2024)

Comparability digraphs: An analogue of comparability graphs. - Xiao-Lu Gao; Jing Huang 007; Shou-Jun Xu (Discret. Math., 2024)

Strong Cocomparability Graphs and Slash-Free Orderings of Matrices. - Pavol Hell; Jing Huang 007; Jephian C.-H. Lin (SIAM J. Discret. Math., 2024)

Semi-strict Chordality of Digraphs. - Jing Huang 007; Ying Ying Ye (Graphs Comb., 2024)