default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKazutoshi Ando
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j12]Takanori Maehara, Kazutoshi Ando
:
Optimal Algorithm for Finding Representation of Subtree Distance. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 105-A(9): 1203-1210 (2022)- 2021
- [j11]Kazutoshi Ando, Satoru Fujishige:
Signed ring families and signed posets. Optim. Methods Softw. 36(2-3): 262-278 (2021)
2010 – 2019
- 2019
- [i1]Takanori Maehara, Kazutoshi Ando:
Optimal Algorithm to Reconstruct a Tree from a Subtree Distance. CoRR abs/1902.08742 (2019) - 2018
- [j10]Kazutoshi Ando, Koki Sato:
An algorithm for finding a representation of a subtree distance. J. Comb. Optim. 36(3): 742-762 (2018) - [c2]Kazutoshi Ando, Kazuya Shoji:
Characterizing Cycle-Complete Dissimilarities in Terms of Associated Indexed 2-Hierarchies. COCOA 2018: 640-650 - 2017
- [j9]Kazutoshi Ando, Ryosuke Inagaki, Kazuya Shoji:
Efficient algorithms for subdominant cycle-complete cost functions and cycle-complete solutions. Discret. Appl. Math. 225: 1-10 (2017) - [j8]Kazutoshi Ando, Masato Minamide, Kazuyuki Sekitani, Jianming Shi:
Monotonicity of minimum distance inefficiency measures for Data Envelopment Analysis. Eur. J. Oper. Res. 260(1): 232-243 (2017) - 2016
- [c1]Kazutoshi Ando, Koki Sato:
An Algorithm for Finding a Representation of a Subtree Distance. ISCO 2016: 249-259
2000 – 2009
- 2008
- [j7]Kazutoshi Ando, Miki Kato, Shinji Ohseto:
Strategy-proof and symmetric allocation of an indivisible good. Math. Soc. Sci. 55(1): 14-23 (2008) - 2006
- [j6]Kazutoshi Ando:
Extreme point axioms for closure spaces. Discret. Math. 306(24): 3181-3188 (2006) - 2003
- [j5]Kazutoshi Ando:
Mobius Functions of Rooted Forests and Faigle-Kern's Dual Greedy Polyhedra. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 86-A(5): 995-999 (2003) - 2002
- [j4]Kazutoshi Ando:
K-submodular functions and convexity of their Lovász extension. Discret. Appl. Math. 122(1-3): 1-12 (2002)
1990 – 1999
- 1996
- [j3]Kazutoshi Ando, Satoru Fujishige, Toshio Nemoto:
Decomposition of a Bidirected Graph into Strongly Connected Components and Its Signed Poset Structure. Discret. Appl. Math. 68(3): 237-248 (1996) - [j2]Kazutoshi Ando, Satoru Fujishige, Takeshi Naitoh:
A characterization of bisubmodular functions. Discret. Math. 148(1-3): 299-303 (1996) - [j1]Kazutoshi Ando, Satoru Fujishige:
On structures of bisubmodular polyhedra. Math. Program. 74: 293-317 (1996)
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 2025-01-09 13:28 CET 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:
