#### Graph Structures in Polynomial Systems Solving: from the Viewpoint of Variable Orderings

Joint International Meeting of CMS and AMS, Shanghai, China, June 2018

#### On the chordality of polynomial sets in triangular decomposition in top-down style

+ ISSAC 2018, New York, USA, July 2018

+ Computer Mathematics Seminar, KLMM, CAS, China, Apr. 2018 (Slides)

+ PCA 2018, St. Petersburg, Russia, Apr. 2018 (Plenary talk)

+ Dasa 2018, Nanning, China, Jan. 2018

#### Decomposing polynomial sets simultaneously into GrÃ¶bner bases and normal triangular sets

CASC 2017, Beijing, China, Sep. 2017

#### On W-characteristic Sets of Lexicographic Groebner Bases (Poster)

ISSAC 2017, Kaiserslautern, Germany, July 2017

#### On the Connection Between Lexicographic Groebner Bases and Triangular Sets

SIAM AG 2017, Atlanta, Georgia, USA, July-Aug. 2017

#### Epsilon 1: A Software Library for Triangular Decomposition

ICMS 2016, Berlin, Germany, July 2016

#### Triangular sets over F2 VS satisfiability checking: a potential connection and interaction?

Dagstuhl Seminar 15471: Symbolic Computation and Satisfiability Checking

Schloss Dagstuhl, Germany, Nov. 2015

#### Simple Triangular Decomposition over Finite Fields

ICIAM 2015 (Minisymposia: Triangular decomposition of polynomial systems: solvers and applications)

Beijing, China, Aug. 2015

#### Sparse FGLM Algorithms for Solving Polynomial Systems

+ CARAMEL team seminar, INRIA Nancy Grand-Est, Nancy, France, Nov. 2015

+ CM 2015, Hefei, China, Oct.-Nov. 2015

+ CDZ Sino-German Workshop on Computation and Reasoning with Constraints, Beijing, China, Nov. 2014

#### Reconstructing Chemical Reaction Networks by Solving Boolean Polynomial Systems

MACIS 2013, Nanning, China, Dec. 2013

#### Fast Algorithm for Change of Ordering of Zero-dimensional Gröbner Bases with Sparse Multiplication Matrices

+ International Workshop on Certified and Reliable Computation, Nanning, China, Jul. 2011

+ ISSAC 2011, San Jose, USA, Jun. 2011