The Japanese Conference on Combinatorics and its Applications  (JCCA 2018)

in Sendai

May 20-24 , 2018


2017. 11. 27    Call for talks  started.

2017. 12. 11    Registration is open.

2017. 12. 28    The page for mini-symposia opens. Some mini-symposia call for talks. The page for visa application opens.

2018. 2. 15    Deadline for 20-minute contributed talks is extended.  Go to Contributed talks.

2018. 2. 20    The first set of accepted contributed talks is announced. 

2018. 2. 28    The call for contributed talks is closed.

2018. 3. 5    Accepted contributed talks (1st+2nd sets) are announced.

2018. 3. 15    Due to the error in the registration system, we will extend the early registration until March 20th.  See also for "Registration".

2018. 3. 29    The excursion and the banquet are moved from Day 2 (May 21) to Day 3(May 22).  See "Daily Schedule".  Information on foods of the banquet is added.  See "Social Programs"

2018. 4. 20   The assistance for visa application will soon be closed.  See the "Visa" section below.


The Japanese Center for Combinatorics and its Applications is organizing a conference, JCCA 2018 during May 20-24, 2018, at Sendai International Center in Sendai, Japan.  This is a sequel of JCCA 2016(Kyoto, 2016) and JCCA2014 (Tsukuba, 2014).

JCCA2018 is supported  by the following program and the organizations:
  • National Institute of Informatics
  • Kawarabayashi Large Graph Project
  • NICT International Exchange Program of National Institute of Information and Communications Technology (NICT)
  • National Institute of Information and Communications Technology, Research Alliance
  • Center for Mathematical Sciences (RACMaS) of Tohoku University
  • Graduate School of Information Sciences of Tohoku University.

This conference focuses on research topics across all areas in combinatorics and their applications, including but not limiting to the following ones.

    Graph Theory
    Enumerative Combinatorics
    Algebraic Combinatorics
    Combinatorial Designs
    Combinatorial Optimization
    Coding Theory
    Applications of Combinatorics

Plenary Speakers

Contributed Talks

We invite the participants to give a 20-minute contributed talk at the conference. Deadline is extended. For details, please go to the menu "Contributed Talks".

Post-Conference Proceedings

We will publish the post-conference proceedings as a special issue of Graphs and Combinatorics.The submitted papers will be refereed. We expect that the submitted papers are based on the talks presented in the conference. The details will be announced during the conference.


The registration is now open.  Please click "Registration" button around the top-left of this page.


For the participants who need a visa for the entry to Japan, please visit HERE. The assistance for visa application will be closed on April 25, 2018.  We request the participants who need the assistance to contact us by this date.


We plan to organize mini-symposia during the conference.   Some of them call for talks.  For details please visit HERE. The titles and the organizers are:
  1. Combinatorial Optimization and Related Topics (Organizers: Shin-ichi Tanigawa, Tokyo University, and Kenjiro Takazawa, Hosei University)
  2. Combinatorics on Convex Polytopes (Organizers: Akihiro Higashitani, Kyoto Sangyo University, and Satoshi Murai, Osaka University)
  3. Finite Combinatorics and Infinite Combinatorics (Organizer: Masanori Sawa, Kobe University, Hirotaka Kikyo, Kobe University, Shohei Satake, Kobe University, and Shunsuke Okabe, Kobe University)
  4. Graph Colouring and Forbidden Subgraphs (Organizer: Ingo Schiermeyer, Technical University of Freiberg, Germany)
  5. Graph Structure (Organizer: Kenta Ozeki, Yokohama National University)
  6. Spectral Graph Theory and Related Topics (Organizers: Tetsuji Taniguchi, Hiroshima Institute of Technology, Hajime Tanaka, Tohoku University, and Yoshio Sano, Tsukuba University)
The attendants of the mini-symposia are required to make a registration.


    the committee members

If you have a question, please contact us at .