Wenan Zang

Qiulan Zhao

SIAM J. Optim., 2019

2018

When Is the Matching Polytope Box-Totally Dual Integral?

[BibT_eX]

[DOI]

Lei Tan

Math. Oper. Res., 2018

On box-perfect graphs.

[BibT_eX]

[DOI]

Qiulan Zhao

J. Comb. Theory B, 2018

2016

A Polyhedral Description of Kernels.

[BibT_eX]

[DOI]

Qin Chen

Math. Oper. Res., 2016

2015

Coloring digraphs with forbidden cycles.

[BibT_eX]

[DOI]

Jie Ma

J. Comb. Theory B, 2015

2014

Nowhere-Zero 3-Flows in Signed Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2014

2013

An Optimal Binding Number Condition for Bipancyclism.

[BibT_eX]

[DOI]

Zhiquan Hu

Ka Ho Law

SIAM J. Discret. Math., 2013

Approximate min-max relations on plane graphs.

[BibT_eX]

[DOI]

Jie Ma

J. Comb. Optim., 2013

2012

The Maximum-Weight Stable Matching Problem: Duality and Efficiency.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2012

Total Dual Integrality in Some Facility Location Problems.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2012

The circumference of a graph with no K3, t-minor, II.

[BibT_eX]

[DOI]

Guantao Chen

J. Comb. Theory B, 2012

Bonds with parity constraints.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2012

2011

Approximating the chromatic index of multigraphs.

[BibT_eX]

[DOI]

Guantao Chen

J. Comb. Optim., 2011

2010

A Unified Approach to Box-Mengerian Hypergraphs.

[BibT_eX]

[DOI]

Math. Oper. Res., 2010

2009

A Characterization of Almost CIS Graphs.

[BibT_eX]

[DOI]

Yezhou Wu

Cun-Quan Zhang

SIAM J. Discret. Math., 2009

Packing circuits in matroids.

[BibT_eX]

[DOI]

Math. Program., 2009

Odd-K4's in stability critical graphs.

[BibT_eX]

[DOI]

Discret. Math., 2009

Preface.

[BibT_eX]

[DOI]

Guantao Chen

Discret. Math., 2009

The box-TDI system associated with 2-edge connected spanning subgraphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

2008

Realizing Degree Sequences with Graphs Having Nowhere-Zero 3-Flows.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2008

The complexity of recognizing linear systems with certain integrality properties.

[BibT_eX]

[DOI]

Li Feng

Math. Program., 2008

A Characterization of Box-Mengerian Matroid Ports.

[BibT_eX]

[DOI]

Math. Oper. Res., 2008

2007

A Min-Max Theorem on Tournaments.

[BibT_eX]

[DOI]

Xiaodong Hu

SIAM J. Comput., 2007

2006

Differential Methods for Finding Independent Sets in Hypergraphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2006

Approximating Longest Cycles in Graphs with Bounded Degrees.

[BibT_eX]

[DOI]

SIAM J. Comput., 2006

A Min-Max Relation on Packing Feedback Vertex Sets.

[BibT_eX]

[DOI]

Math. Oper. Res., 2006

The circumference of a graph with no K3, t-minor.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2006

An Efficient Algorithm for Finding Maximum Cycle Packings in Reducible Flow Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2006

2005

Hamilton paths in toroidal graphs.

[BibT_eX]

[DOI]

Robin Thomas

J. Comb. Theory B, 2005

Corrigendum to Proof of Chvátal's conjecture on maximal stable sets and maximal cliques in graphs: [J. Combin. Theory Ser. B 91 (2004) 301-325].

[BibT_eX]

[DOI]

Guojun Li

J. Comb. Theory B, 2005

A Combinatorial Algorithm for Minimum Weighted Colorings of Claw-Free Perfect Graphs.

[BibT_eX]

[DOI]

Xueliang Li

J. Comb. Optim., 2005

Perfect Circular Arc Coloring.

[BibT_eX]

[DOI]

Zhiquan Hu

J. Comb. Optim., 2005

Ramsey functions involving Km, n with n large.

[BibT_eX]

[DOI]

Xueqing Tang

Discret. Math., 2005

Approximating the Longest Cycle Problem on Graphs with Bounded Degree.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

2004

Proof of Chvátal's conjecture on maximal stable sets and maximal cliques in graphs.

[BibT_eX]

[DOI]

Guojun Li

J. Comb. Theory B, 2004

On-Line Scheduling a Batch Processing System to Minimize Total Weighted Job Completion Time.

[BibT_eX]

[DOI]

Bo Chen

J. Comb. Optim., 2004

f-Factors in bipartite (mf)-graphs.

[BibT_eX]

[DOI]

Guizhen Liu

Discret. Appl. Math., 2004

Nowhere-Zero 4-Flows, Simultaneous Edge-Colorings, And Critical Partial Latin Squares.

[BibT_eX]

[DOI]

Rong Luo

Cun-Quan Zhang

Comb., 2004

An upper bound for ramsey numbers.

[BibT_eX]

[DOI]

Cecil C. Rousseau

Appl. Math. Lett., 2004

2003

Ramsey numbers involving large dense graphs and bipartite Turán numbers.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2003

Packing cycles in graphs, II.

[BibT_eX]

[DOI]

Zhenzhen Xu

J. Comb. Theory B, 2003

The Independence Number of Graphs with a Forbidden Cycle and Ramsey Numbers.

[BibT_eX]

[DOI]

J. Comb. Optim., 2003

A 2-approximation algorithm for path coloring on a restricted class of trees of rings.

[BibT_eX]

[DOI]

J. Algorithms, 2003

2002

A Min-Max Theorem on Feedback Vertex Sets.

[BibT_eX]

[DOI]

Math. Oper. Res., 2002

Packing Cycles in Graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2002

Group testing and fault detection for replicated files.

[BibT_eX]

[DOI]

Frank K. Hwang

Discret. Appl. Math., 2002

2001

Asymptotic Upper Bounds for Ramsey Functions.

[BibT_eX]

[DOI]

Cecil C. Rousseau

Graphs Comb., 2001

2000

An Approximation Algorithm for Feedback Vertex Sets in Tournaments.

[BibT_eX]

[DOI]

SIAM J. Comput., 2000

Wavelength allocation on trees of rings.

[BibT_eX]

[DOI]

Guojun Li

Networks, 2000

Totally balanced combinatorial optimization games.

[BibT_eX]

[DOI]

Math. Program., 2000

Solution to a problem on degree sequences of graphs.

[BibT_eX]

[DOI]

Discret. Math., 2000

A 2-Approximation Algorithm for Path Coloring on Trees of Rings.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 11th International Conference, 2000

1999

Acyclic diagraphs with the Gallai-Milgram-Linial property for clique-covers.

[BibT_eX]

[DOI]

Discret. Math., 1999

1998

Proof of Toft's Conjecture: Every Graph Containing No Fully Odd K4 is 3-Colorable.

[BibT_eX]

[DOI]

J. Comb. Optim., 1998

Coloring graphs with no odd-K4.

[BibT_eX]

[DOI]

Discret. Math., 1998

A TDI System and its Application to Approximation Algorithms.

[BibT_eX]

[DOI]

Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998

Proof of Toft's Conjecture: Every Graph Containing No Fully Odd K4 Is 3-Colorable.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 4th Annual International Conference, 1998

1997

Detecting Corrupted Pages in M Replicated Large Files.

[BibT_eX]

[DOI]

Frank K. Hwang

IEEE Trans. Parallel Distributed Syst., 1997

1995

Generalizations of Grillet's theorem on maximal stable sets and maximal cliques in graphs.

[BibT_eX]

[DOI]

Discret. Math., 1995

1991

The maximum number of diagonals of a cycle in a block and its extremal graphs.

[BibT_eX]

[DOI]

Feng Tian