Kazutoshi Ando

Orcid: 0000-0002-1415-062X

According to our database1, Kazutoshi Ando authored at least 14 papers between 1996 and 2022.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Optimal Algorithm for Finding Representation of Subtree Distance.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., September, 2022

2021
Signed ring families and signed posets.
Optim. Methods Softw., 2021

2019
Optimal Algorithm to Reconstruct a Tree from a Subtree Distance.
CoRR, 2019

2018
An algorithm for finding a representation of a subtree distance.
J. Comb. Optim., 2018

Characterizing Cycle-Complete Dissimilarities in Terms of Associated Indexed 2-Hierarchies.
Proceedings of the Combinatorial Optimization and Applications, 2018

2017
Monotonicity of minimum distance inefficiency measures for Data Envelopment Analysis.
Eur. J. Oper. Res., 2017

Efficient algorithms for subdominant cycle-complete cost functions and cycle-complete solutions.
Discret. Appl. Math., 2017

2008
Strategy-proof and symmetric allocation of an indivisible good.
Math. Soc. Sci., 2008

2006
Extreme point axioms for closure spaces.
Discret. Math., 2006

2003
Mobius Functions of Rooted Forests and Faigle-Kern's Dual Greedy Polyhedra.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2003

2002
K-submodular functions and convexity of their Lovász extension.
Discret. Appl. Math., 2002

1996
On structures of bisubmodular polyhedra.
Math. Program., 1996

A characterization of bisubmodular functions.
Discret. Math., 1996

Decomposition of a Bidirected Graph into Strongly Connected Components and Its Signed Poset Structure.
Discret. Appl. Math., 1996


  Loading...