kazuhisa makino
kazuhisa makino
京大
Verifierad e-postadress på kurims.kyoto-u.ac.jp
Titel
Citeras av
Citeras av
År
New algorithms for enumerating all maximal cliques
K Makino, T Uno
Scandinavian workshop on algorithm theory, 260-272, 2004
4262004
New results on monotone dualization and generating hypergraph transversals
T Eiter, G Gottlob, K Makino
SIAM Journal on Computing 32 (2), 514-537, 2003
1892003
Computational aspects of monotone dualization: A brief survey
T Eiter, K Makino, G Gottlob
Discrete Applied Mathematics 156 (11), 2035-2049, 2008
1692008
On the complexity of generating maximal frequent and minimal infrequent sets
E Boros, V Gurvich, L Khachiyan, K Makino
Annual Symposium on Theoretical Aspects of Computer Science, 133-141, 2002
1132002
Error-free and best-fit extensions of partially defined Boolean functions
E Boros, T Ibaraki, K Makino
Information and Computation 140 (2), 254-283, 1998
991998
Dual-bounded generating problems: All minimal integer solutions for a monotone system of linear inequalities
E Boros, K Elbassioni, V Gurvich, L Khachiyan, K Makino
SIAM Journal on Computing 31 (5), 1624-1643, 2002
782002
On computing all abductive explanations from a propositional Horn theory
T Eiter, K Makino
Journal of the ACM (JACM) 54 (5), 24-es, 2007
732007
On the complexity of some enumeration problems for matroids
L Khachiyan, E Boros, K Elbassioni, V Gurvich, K Makino
SIAM Journal on Discrete Mathematics 19 (4), 966-984, 2005
722005
The maximum latency and identification of positive Boolean functions
K Makino, T Ibaraki
SIAM Journal on Computing 26 (5), 1363-1383, 1997
681997
Locating sources to meet flow demands in undirected networks
K Arata, S Iwata, K Makino, S Fujishige
Journal of Algorithms 42 (1), 54-68, 2002
582002
Dual-bounded generating problems: partial and multiple transversals of a hypergraph
E Boros, V Gurvich, L Khachiyan, K Makino
SIAM Journal on Computing 30 (6), 2036-2050, 2001
572001
Data analysis by positive decision trees
K Makino, T Suda, H Ono, T Ibaraki
IEICE Transactions on Information and Systems 82 (1), 76-88, 1999
531999
A fast and simple algorithm for identifying 2-monotonic positive Boolean functions
K Makino, T Ibaraki
Journal of Algorithms 26 (2), 291-305, 1998
511998
On maximal frequent and minimal infrequent sets in binary matrices
E Boros, V Gurvich, L Khachiyan, K Makino
Annals of Mathematics and Artificial Intelligence 39 (3), 211-221, 2003
442003
An O (nlog2n) algorithm for the optimal sink location problem in dynamic tree networks
S Mamada, T Uno, K Makino, S Fujishige
Discrete Applied Mathematics 154 (16), 2387-2401, 2006
422006
On minimum edge ranking spanning trees
K Makino, Y Uno, T Ibaraki
Journal of Algorithms 38 (2), 411-437, 2001
412001
Functional dependencies in Horn theories
T Ibaraki, A Kogan, K Makino
Artificial Intelligence 108 (1-2), 1-30, 1999
391999
Logical analysis of data: classification with justification
E Boros, Y Crama, PL Hammer, T Ibaraki, A Kogan, K Makino
Annals of Operations Research 188 (1), 33, 2011
382011
Source location problem with flow requirements in directed networks
H Ito, K Makino, K Arata, S Honami, Y Itatsu, S Fujishige
Optimization Methods and Software 18 (4), 427-435, 2003
372003
Finding essential attributes from binary data
E Boros, T Horiyama, T Ibaraki, K Makino, M Yagiura
Annals of Mathematics and Artificial Intelligence 39 (3), 223-257, 2003
362003
Systemet kan inte utföra åtgärden just nu. Försök igen senare.
Artiklar 1–20