Integral Polyhedra Associated with Certain Submodular Functions Defined on 012-Vectors. - Kenji Kashiwabara; Masataka Nakamura; Takashi Takabatake (IPCO, 1999)

Envelopes and clutters. - Kenji Kashiwabara; Bunpei Nakano (Discret. Appl. Math., 2000)

Extremality of submodular functions. - Kenji Kashiwabara (Theor. Comput. Sci., 2000)

Subdivisions of integral base polytopes. - Kenji Kashiwabara (Discret. Appl. Math., 2001)

A greedy algorithm for convex geometries. - Kenji Kashiwabara; Yoshio Okamoto (Discret. Appl. Math., 2003)

Polyhedra with submodular support functions and their unbalanced simultaneous exchangeability. - Kenji Kashiwabara; Takashi Takabatake (Discret. Appl. Math., 2003)

Polybasic polyhedra: structure of polyhedra with edge vectors of support size at most 2. - Satoru Fujishige; Kazuhisa Makino; Takashi Takabatake; Kenji Kashiwabara (Discret. Math., 2004)

Higher-order rank analysis for web structure. - Ikumi Horie; Kazunori Yamaguchi; Kenji Kashiwabara (Hypertext, 2005)

The affine representation theorem for abstract convex geometries. - Kenji Kashiwabara; Masataka Nakamura; Yoshio Okamoto (Comput. Geom., 2005)

Grinstead's conjecture is true for graphs with a small clique number. - Kenji Kashiwabara; Tadashi Sakuma (Discret. Math., 2006)

Pattern detection from web using AFA set theory. - Ikumi Horie; Kazunori Yamaguchi; Kenji Kashiwabara (WIDM, 2007)

Matroid representation of clique complexes. - Kenji Kashiwabara; Yoshio Okamoto; Takeaki Uno (Discret. Appl. Math., 2007)

On the topology of the free complexes of convex geometries. - Masahiro Hachimori; Kenji Kashiwabara (Discret. Math., 2007)

Scheduling Partial Round Robin Tournaments Subject to Home Away Pattern Sets. - Kenji Kashiwabara (Electron. J. Comb., 2009)

The Toric Ideal of a Matroid of Rank 3 is Generated by Quadrics. - Kenji Kashiwabara (Electron. J. Comb., 2010)

Characterizations of the convex geometries arising from the double shellings of posets. - Kenji Kashiwabara; Masataka Nakamura (Discret. Math., 2010)

The positive circuits of oriented matroids with the packing property or idealness. - Kenji Kashiwabara; Tadashi Sakuma (Electron. Notes Discret. Math., 2010)

Obstructions to shellability, partitionability, and sequential Cohen-Macaulayness. - Masahiro Hachimori; Kenji Kashiwabara (J. Comb. Theory A, 2011)

On ideal minimally non-packing clutters - Kenji Kashiwabara; Tadashi Sakuma (CoRR, 2012)

The Prime Stems of Rooted Circuits of Closure Spaces and Minimum Implicational Bases. - Masataka Nakamura; Kenji Kashiwabara (Electron. J. Comb., 2013)

Improvement of difficulty estimation of personalized teaching material generator by JACET. - Ikumi Horie; Kazunori Yamaguchi; Kenji Kashiwabara; Yoshitatsu Matsuda (ITHET, 2014)

An Accelerated Algorithm for Solving SVP Based on Statistical Analysis. - Masaharu Fukase; Kenji Kashiwabara (J. Inf. Process., 2015)

Estimation of the Success Probability of Random Sampling by the Gram-Charlier Approximation. - Yoshitatsu Matsuda; Tadanori Teruya; Kenji Kashiwabara (IACR Cryptol. ePrint Arch., 2018)

Fast Lattice Basis Reduction Suitable for Massive Parallelization and Its Application to the Shortest Vector Problem. - Tadanori Teruya; Kenji Kashiwabara; Goichiro Hanaoka (IACR Cryptol. ePrint Arch., 2018)

Efficient Estimation of Number of Short Lattice Vectors in Search Space under Randomness Assumption. - Yoshitatsu Matsuda; Tadanori Teruya; Kenji Kashiwabara (APKC@AsiaCCS, 2019)

Higher-Order Rank Functions on Directed Graphs. - Kenji Kashiwabara; Ikumi Horie; Kazunori Yamaguchi (Fundam. Informaticae, 2020)

Several Minimality Concepts Related to Frankl's Conjecture. - Masahiro Hachimori; Kenji Kashiwabara (Graphs Comb., 2024)