default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKenji Kashiwabara
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j18]Kenji Kashiwabara, Ikumi Horie, Kazunori Yamaguchi
:
Higher-Order Rank Functions on Directed Graphs. Fundam. Informaticae 173(1): 1-31 (2020)
2010 – 2019
- 2019
- [c7]Yoshitatsu Matsuda, Tadanori Teruya, Kenji Kashiwabara:
Efficient Estimation of Number of Short Lattice Vectors in Search Space under Randomness Assumption. APKC@AsiaCCS 2019: 13-22 - 2018
- [c6]Tadanori Teruya, Kenji Kashiwabara, Goichiro Hanaoka:
Fast Lattice Basis Reduction Suitable for Massive Parallelization and Its Application to the Shortest Vector Problem. Public Key Cryptography (1) 2018: 437-460 - [i3]Tadanori Teruya, Kenji Kashiwabara, Goichiro Hanaoka:
Fast Lattice Basis Reduction Suitable for Massive Parallelization and Its Application to the Shortest Vector Problem. IACR Cryptol. ePrint Arch. 2018: 44 (2018) - [i2]Yoshitatsu Matsuda, Tadanori Teruya, Kenji Kashiwabara:
Estimation of the Success Probability of Random Sampling by the Gram-Charlier Approximation. IACR Cryptol. ePrint Arch. 2018: 815 (2018) - 2015
- [j17]Masaharu Fukase, Kenji Kashiwabara:
An Accelerated Algorithm for Solving SVP Based on Statistical Analysis. J. Inf. Process. 23(1): 67-80 (2015) - 2014
- [c5]Ikumi Horie, Kazunori Yamaguchi, Kenji Kashiwabara, Yoshitatsu Matsuda:
Improvement of difficulty estimation of personalized teaching material generator by JACET. ITHET 2014: 1-8 - 2013
- [j16]Masataka Nakamura, Kenji Kashiwabara:
The Prime Stems of Rooted Circuits of Closure Spaces and Minimum Implicational Bases. Electron. J. Comb. 20(1): 22 (2013) - 2012
- [i1]Kenji Kashiwabara, Tadashi Sakuma:
On ideal minimally non-packing clutters. CoRR abs/1210.4753 (2012) - 2011
- [j15]Masahiro Hachimori, Kenji Kashiwabara:
Obstructions to shellability, partitionability, and sequential Cohen-Macaulayness. J. Comb. Theory A 118(5): 1608-1623 (2011) - 2010
- [j14]Kenji Kashiwabara:
The Toric Ideal of a Matroid of Rank 3 is Generated by Quadrics. Electron. J. Comb. 17(1) (2010) - [j13]Kenji Kashiwabara, Masataka Nakamura:
Characterizations of the convex geometries arising from the double shellings of posets. Discret. Math. 310(15-16): 2100-2112 (2010) - [j12]Kenji Kashiwabara, Tadashi Sakuma:
The positive circuits of oriented matroids with the packing property or idealness. Electron. Notes Discret. Math. 36: 287-294 (2010)
2000 – 2009
- 2009
- [j11]Kenji Kashiwabara:
Scheduling Partial Round Robin Tournaments Subject to Home Away Pattern Sets. Electron. J. Comb. 16(1) (2009) - 2007
- [j10]Kenji Kashiwabara, Yoshio Okamoto, Takeaki Uno:
Matroid representation of clique complexes. Discret. Appl. Math. 155(15): 1910-1929 (2007) - [j9]Masahiro Hachimori, Kenji Kashiwabara:
On the topology of the free complexes of convex geometries. Discret. Math. 307(2): 274-279 (2007) - [c4]Ikumi Horie, Kazunori Yamaguchi, Kenji Kashiwabara:
Pattern detection from web using AFA set theory. WIDM 2007: 113-120 - 2006
- [j8]Kenji Kashiwabara, Tadashi Sakuma:
Grinstead's conjecture is true for graphs with a small clique number. Discret. Math. 306(19-20): 2572-2581 (2006) - 2005
- [j7]Kenji Kashiwabara, Masataka Nakamura, Yoshio Okamoto:
The affine representation theorem for abstract convex geometries. Comput. Geom. 30(2): 129-144 (2005) - [c3]Ikumi Horie, Kazunori Yamaguchi, Kenji Kashiwabara:
Higher-order rank analysis for web structure. Hypertext 2005: 98-106 - 2004
- [j6]Satoru Fujishige, Kazuhisa Makino, Takashi Takabatake, Kenji Kashiwabara:
Polybasic polyhedra: structure of polyhedra with edge vectors of support size at most 2. Discret. Math. 280(1-3): 13-27 (2004) - 2003
- [j5]Kenji Kashiwabara, Takashi Takabatake:
Polyhedra with submodular support functions and their unbalanced simultaneous exchangeability. Discret. Appl. Math. 131(2): 433-448 (2003) - [j4]Kenji Kashiwabara, Yoshio Okamoto:
A greedy algorithm for convex geometries. Discret. Appl. Math. 131(2): 449-465 (2003) - [c2]Kenji Kashiwabara, Yoshio Okamoto, Takeaki Uno:
Matroid Representation of Clique Complexes. COCOON 2003: 192-201 - 2001
- [j3]Kenji Kashiwabara:
Subdivisions of integral base polytopes. Discret. Appl. Math. 115(1-3): 89-97 (2001) - 2000
- [j2]Kenji Kashiwabara, Bunpei Nakano:
Envelopes and clutters. Discret. Appl. Math. 101(1-3): 177-185 (2000) - [j1]Kenji Kashiwabara:
Extremality of submodular functions. Theor. Comput. Sci. 235(2): 239-256 (2000)
1990 – 1999
- 1999
- [c1]Kenji Kashiwabara, Masataka Nakamura, Takashi Takabatake:
Integral Polyhedra Associated with Certain Submodular Functions Defined on 012-Vectors. IPCO 1999: 289-303
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:27 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
