Refereed Papers : Journal Conference

  1. Discrete convexity in joint winner property. [arXiv]
    Yuni Iwamasa, Kazuo Murota, and Stanislav Živný.
    Discrete Optimization, to appear.
  2. Beyond JWP: A tractable class of binary VCSPs via M-convex intersection.
    Hiroshi Hirai, Yuni Iwamasa, Kazuo Murota, and Stanislav Živný.
    Proceedings of the 35th International Symposium on Theoretical Aspects of Computer Science (STACS'18), to appear.
  3. The quadratic M-convexity testing problem. [Journal Website] [arXiv]
    Yuni Iwamasa.
    Discrete Applied Mathematics, to appear.
    Proceedings of the 10th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications (JH'17), pp.247--256, 2017.
  4. On a general framework for network representability in discrete optimization. [Journal Website] [arXiv]
    Yuni Iwamasa.
    Journal of Combinatorial Optimization, to appear.
    Proceedings of the 4th International Symposium on Combinatorial Optimization (ISCO'16), LNCS 9849, pp.369--380, 2016.
  5. On k-submodular relaxation. [Journal Website] [arXiv]
    Hiroshi Hirai and Yuni Iwamasa.
    SIAM Journal on Discrete Mathematics, 30(3):1726--1736, 2016.
    Proceedings of the 9th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications (HJ'15), pp.331--335, 2015.
  6. Threshold influence model for allocating advertising budgets.
    Atsushi Miyauchi, Yuni Iwamasa, Takuro Fukunaga, and Naonori Kakimura.
    Proceedings of the 32nd International Conference on Machine Learning (ICML'15), pp.1395--1404, 2015.
  7. Networks maximizing the consensus time of voter models. [Journal Website]
    Yuni Iwamasa and Naoki Masuda.
    Physical Review E, 90, 012816, 2014.

Preprint

  1. A tractable class of binary VCSPs via M-convex intersection. [arXiv]
    Hiroshi Hirai, Yuni Iwamasa, Kazuo Murota, and Stanislav Živný.
    // the full version of STACS'18 paper [6]

International Talks

  1. Hiroshi Hirai, Yuni Iwamasa, Kazuo Murota, and Stanislav Živný.
    Beyond JWP: A tractable class of binary VCSPs via M-convex intersection.
    The 35th International Symposium on Theoretical Aspects of Computer Science (STACS'18), Caen, France, February--March 2018.
  2. Yuni Iwamasa, Kazuo Murota, and Stanislav Živný.
    Discrete convexity in joint winner property. [poster]
    The 19th Conference on Integer Programming and Combinatorial Optimization (IPCO'17), Waterloo, Canada, June 2017.
    // poster session
  3. Yuni Iwamasa.
    The quadratic M-convexity testing problem. [slide]
    The 10th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications (JH'17), Budapest, Hungary, May 2017.
  4. Yuni Iwamasa.
    On a general framework for network representability in discrete optimization. [slide]
    The 4th International Symposium on Combinatorial Optimization (ISCO'16), Salerno, Italy, May 2016.
  5. Hiroshi Hirai and Yuni Iwamasa.
    On k-submodular relaxation. [slide]
    The 9th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications (HJ'15), Fukuoka, Japan, June 2015.