牧野 和久

Last Update: 2015/11/24 15:58:40

Print

Name(Kanji/Kana/Abecedarium Latinum)
牧野 和久/マキノ カズヒサ/Makino, Kazuhisa
Primary Affiliation(Org1/Job title)
Research Institute for Mathematical Sciences (RIMS)/Professor
Affiliated programs (koza)
Org1 Job title
Graduate Schools Science Associate Professor
Academic Degree
Field(Japanese) Field(English) University(Japanese) University(English) Method
修士(工学) 京都大学
博士(工学) 京都大学
researchmap URL
https://researchmap.jp/read0051675
Published Papers
Author Author(Japanese) Author(English) Title Title(Japanese) Title(English) Bibliography Bibliography(Japanese) Bibliography(English) Publication date Refereed paper Language Publishing type Disclose
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino Markov Decision Processes and Stochastic Games with Total Effective Markov Decision Processes and Stochastic Games with Total Effective Markov Decision Processes and Stochastic Games with Total Effective Payoff. STACS, 103-115 Payoff. STACS, 103-115 Payoff. STACS, 103-115 2015 Refereed English Disclose to all
Xin Han, Yasushi Kawase, Kazuhisa Makino Xin Han, Yasushi Kawase, Kazuhisa Makino Xin Han, Yasushi Kawase, Kazuhisa Makino Randomized algorithms for online knapsack problems Randomized algorithms for online knapsack problems Randomized algorithms for online knapsack problems Theor. Comput. Sci., 562, 395-405 Theor. Comput. Sci., 562, 395-405 Theor. Comput. Sci., 562, 395-405 2015 Refereed English Disclose to all
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino A Potential Reduction Algorithm for Ergodic Two-Person Zero-Sum Limiting Average Payoff Stochastic Games A Potential Reduction Algorithm for Ergodic Two-Person Zero-Sum Limiting Average Payoff Stochastic Games A Potential Reduction Algorithm for Ergodic Two-Person Zero-Sum Limiting Average Payoff Stochastic Games COCOA, 694-709 COCOA, 694-709 COCOA, 694-709 2014 Refereed English Disclose to all
Xin Han, Yasushi Kawase, Kazuhisa Makino, He Guo Xin Han, Yasushi Kawase, Kazuhisa Makino, He Guo Xin Han, Yasushi Kawase, Kazuhisa Makino, He Guo Online removable knapsack problem under convex function Online removable knapsack problem under convex function Online removable knapsack problem under convex function Theor. Comput. Sci., 540, 62-69 Theor. Comput. Sci., 540, 62-69 Theor. Comput. Sci., 540, 62-69 2014 Refereed English Disclose to all
Xin Han, Yasushi Kawase, Kazuhisa Makino Xin Han, Yasushi Kawase, Kazuhisa Makino Xin Han, Yasushi Kawase, Kazuhisa Makino Online Unweighted Knapsack Problem with Removal Cost Online Unweighted Knapsack Problem with Removal Cost Online Unweighted Knapsack Problem with Removal Cost Algorithmica, 70, 1, 76-91 Algorithmica, 70, 1, 76-91 Algorithmica, 70, 1, 76-91 2014 Refereed English Disclose to all
Toshimasa Ishii, Kazuhisa Makino Toshimasa Ishii, Kazuhisa Makino Toshimasa Ishii, Kazuhisa Makino Augmenting Edge-Connectivity between Vertex Subsets Augmenting Edge-Connectivity between Vertex Subsets Augmenting Edge-Connectivity between Vertex Subsets Algorithmica, 69, 1, 130-147 Algorithmica, 69, 1, 130-147 Algorithmica, 69, 1, 130-147 2014 Refereed English Disclose to all
K. Makino; S. Tamaki; M. Yamamoto K. Makino; S. Tamaki; M. Yamamoto K. Makino; S. Tamaki; M. Yamamoto Derandomizing the HSSW Algorithm for 3-SAT Derandomizing the HSSW Algorithm for 3-SAT Derandomizing the HSSW Algorithm for 3-SAT Algorithmica, 67, 2, 112-124 Algorithmica, 67, 2, 112-124 Algorithmica, 67, 2, 112-124 2013/10 Refereed English Disclose to all
Y. Kawase; K. Makino Y. Kawase; K. Makino Y. Kawase; K. Makino Nash equilibria with minimum potential in undirected broadcast games Nash equilibria with minimum potential in undirected broadcast games Nash equilibria with minimum potential in undirected broadcast games Theoretical Computer Science, 482, 33-47 Theoretical Computer Science, 482, 33-47 Theoretical Computer Science, 482, 33-47 2013 Refereed English Disclose to all
E. Boros; K. Elbassioni; V. Gurvich; K. Makino E. Boros; K. Elbassioni; V. Gurvich; K. Makino E. Boros; K. Elbassioni; V. Gurvich; K. Makino On discounted approximations of undiscounted stochastic games and Markov decision processes with limited randomness On discounted approximations of undiscounted stochastic games and Markov decision processes with limited randomness On discounted approximations of undiscounted stochastic games and Markov decision processes with limited randomness Operations Research Letters, 41, 4, 357-362 Operations Research Letters, 41, 4, 357-362 Operations Research Letters, 41, 4, 357-362 2013 Refereed English Disclose to all
E. Boros; K. Elbassioni; V. Gurvich; K. Makino E. Boros; K. Elbassioni; V. Gurvich; K. Makino E. Boros; K. Elbassioni; V. Gurvich; K. Makino On Canonical Forms for Zero-Sum Stochastic Mean Payoff Games On Canonical Forms for Zero-Sum Stochastic Mean Payoff Games On Canonical Forms for Zero-Sum Stochastic Mean Payoff Games Dynamic Games and Applications, 3, 2, 128-161 Dynamic Games and Applications, 3, 2, 128-161 Dynamic Games and Applications, 3, 2, 128-161 2013 Refereed English Disclose to all
E. Boros; K. Elbassioni; V. Gurvich; K. Makino E. Boros; K. Elbassioni; V. Gurvich; K. Makino E. Boros; K. Elbassioni; V. Gurvich; K. Makino A pseudo-polynomial algorithm for mean payoff stochastic games with perfect information and a few random positions A pseudo-polynomial algorithm for mean payoff stochastic games with perfect information and a few random positions A pseudo-polynomial algorithm for mean payoff stochastic games with perfect information and a few random positions Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7965 LNCS, PART 1, 220-231 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7965 LNCS, PART 1, 220-231 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7965 LNCS, PART 1, 220-231 2013 Refereed English Disclose to all
X. Han; Y. Kawase; K. Makino X. Han; Y. Kawase; K. Makino X. Han; Y. Kawase; K. Makino Online Unweighted Knapsack Problem with Removal Cost Online Unweighted Knapsack Problem with Removal Cost Online Unweighted Knapsack Problem with Removal Cost Algorithmica, 1-16 Algorithmica, 1-16 Algorithmica, 1-16 2013 Refereed English Disclose to all
H. Sumita; N. Kakimura; K. Makino H. Sumita; N. Kakimura; K. Makino H. Sumita; N. Kakimura; K. Makino Sparse linear complementarity problems Sparse linear complementarity problems Sparse linear complementarity problems Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7878 LNCS, 358-369 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7878 LNCS, 358-369 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7878 LNCS, 358-369 2013 Refereed English Disclose to all
X. Han; Y. Kawase; K. Makino X. Han; Y. Kawase; K. Makino X. Han; Y. Kawase; K. Makino Randomized algorithms for removable online knapsack problems Randomized algorithms for removable online knapsack problems Randomized algorithms for removable online knapsack problems Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7924 LNCS, 60-71 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7924 LNCS, 60-71 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7924 LNCS, 60-71 2013 Refereed English Disclose to all
K. Elbassioni; K. Makino; K. Mehlhorn; F. Ramezani K. Elbassioni; K. Makino; K. Mehlhorn; F. Ramezani K. Elbassioni; K. Makino; K. Mehlhorn; F. Ramezani On randomized fictitious play for approximating saddle points over convex sets On randomized fictitious play for approximating saddle points over convex sets On randomized fictitious play for approximating saddle points over convex sets Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7936 LNCS, 65-76 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7936 LNCS, 65-76 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7936 LNCS, 65-76 2013 Refereed English Disclose to all
X. Han; Y. Kawase; K. Makino; H. Guo X. Han; Y. Kawase; K. Makino; H. Guo X. Han; Y. Kawase; K. Makino; H. Guo Online removable knapsack problem under convex function Online removable knapsack problem under convex function Online removable knapsack problem under convex function Theoretical Computer Science Theoretical Computer Science Theoretical Computer Science 2013 Refereed English Disclose to all
N. Kakimura; K. Makino N. Kakimura; K. Makino N. Kakimura; K. Makino Robust independence systems Robust independence systems Robust independence systems SIAM Journal on Discrete Mathematics, 27, 3, 1257-1273 SIAM Journal on Discrete Mathematics, 27, 3, 1257-1273 SIAM Journal on Discrete Mathematics, 27, 3, 1257-1273 2013 Refereed English Disclose to all
R. Fujita; Y. Kobayashi; K. Makino R. Fujita; Y. Kobayashi; K. Makino R. Fujita; Y. Kobayashi; K. Makino Robust matchings and matroid intersections Robust matchings and matroid intersections Robust matchings and matroid intersections SIAM Journal on Discrete Mathematics, 27, 3, 1234-1256 SIAM Journal on Discrete Mathematics, 27, 3, 1234-1256 SIAM Journal on Discrete Mathematics, 27, 3, 1234-1256 2013 Refereed English Disclose to all
Y. Kawase; X. Han; K. Makino Y. Kawase; X. Han; K. Makino Y. Kawase; X. Han; K. Makino Unit cost buyback problem Unit cost buyback problem Unit cost buyback problem Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 8283 LNCS, 435-445 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 8283 LNCS, 435-445 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 8283 LNCS, 435-445 2013 Refereed English Disclose to all
E. Boros; K. Elbassioni; V. Gurvich; K. Makino E. Boros; K. Elbassioni; V. Gurvich; K. Makino E. Boros; K. Elbassioni; V. Gurvich; K. Makino On Nash equilibria and improvement cycles in pure positional strategies for Chess-like and Backgammon-like n-person games On Nash equilibria and improvement cycles in pure positional strategies for Chess-like and Backgammon-like n-person games On Nash equilibria and improvement cycles in pure positional strategies for Chess-like and Backgammon-like n-person games Discrete Mathematics, 312, 4, 772-788 Discrete Mathematics, 312, 4, 772-788 Discrete Mathematics, 312, 4, 772-788 2012 Refereed English Disclose to all
Y. Kawase; K. Makino Y. Kawase; K. Makino Y. Kawase; K. Makino Nash equilibria with minimum potential in undirected broadcast games Nash equilibria with minimum potential in undirected broadcast games Nash equilibria with minimum potential in undirected broadcast games Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7157 LNCS, 217-228 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7157 LNCS, 217-228 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7157 LNCS, 217-228 2012 Refereed English Disclose to all
X. Han; Y. Kawase; K. Makino X. Han; Y. Kawase; K. Makino X. Han; Y. Kawase; K. Makino Online knapsack problem with removal cost Online knapsack problem with removal cost Online knapsack problem with removal cost Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7434 LNCS, 61-73 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7434 LNCS, 61-73 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7434 LNCS, 61-73 2012 Refereed English Disclose to all
K. Makino; H. Ono K. Makino; H. Ono K. Makino; H. Ono Deductive inference for the interiors and exteriors of horn theories Deductive inference for the interiors and exteriors of horn theories Deductive inference for the interiors and exteriors of horn theories ACM Transactions on Computational Logic, 13, 3 ACM Transactions on Computational Logic, 13, 3 ACM Transactions on Computational Logic, 13, 3 2012 Refereed English Disclose to all
N. Kakimura; K. Makino; K. Seimi N. Kakimura; K. Makino; K. Seimi N. Kakimura; K. Makino; K. Seimi Computing knapsack solutions with cardinality robustness Computing knapsack solutions with cardinality robustness Computing knapsack solutions with cardinality robustness Japan Journal of Industrial and Applied Mathematics, 29, 3, 469-483 Japan Journal of Industrial and Applied Mathematics, 29, 3, 469-483 Japan Journal of Industrial and Applied Mathematics, 29, 3, 469-483 2012 Refereed English Disclose to all
牧野和久, K. Kimura, 牧野和久, K. Kimura, 牧野和久, K. Kimura, Trichotomy for Internet Linear Systems Based on Their Sign Patterns Trichotomy for Internet Linear Systems Based on Their Sign Patterns Trichotomy for Internet Linear Systems Based on Their Sign Patterns STACAS 2012. STACAS 2012. STACAS 2012. 2012 Refereed English Disclose to all
K. Makino; S. Tamaki; M. Yamamoto K. Makino; S. Tamaki; M. Yamamoto K. Makino; S. Tamaki; M. Yamamoto An exact algorithm for the Boolean connectivity problem for k-CNF An exact algorithm for the Boolean connectivity problem for k-CNF An exact algorithm for the Boolean connectivity problem for k-CNF Theoretical Computer Science, 412, 35, 4613-4618 Theoretical Computer Science, 412, 35, 4613-4618 Theoretical Computer Science, 412, 35, 4613-4618 2011/08/12 Refereed English Disclose to all
M. Chrobak; G.J. Woeginger; K. Makino; H. Xu M. Chrobak; G.J. Woeginger; K. Makino; H. Xu M. Chrobak; G.J. Woeginger; K. Makino; H. Xu Caching Is Hard-Even in the Fault Model Caching Is Hard-Even in the Fault Model Caching Is Hard-Even in the Fault Model Algorithmica (New York), 1-14 Algorithmica (New York), 1-14 Algorithmica (New York), 1-14 2011 Refereed English Disclose to all
E. Boros; K. Elbassioni; M. Fouz; V. Gurvich; K. Makino; B. Manthey E. Boros; K. Elbassioni; M. Fouz; V. Gurvich; K. Makino; B. Manthey E. Boros; K. Elbassioni; M. Fouz; V. Gurvich; K. Makino; B. Manthey Stochastic mean payoff games: Smoothed analysis and approximation schemes Stochastic mean payoff games: Smoothed analysis and approximation schemes Stochastic mean payoff games: Smoothed analysis and approximation schemes Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 6755 LNCS, PART 1, 147-158 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 6755 LNCS, PART 1, 147-158 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 6755 LNCS, PART 1, 147-158 2011 Refereed English Disclose to all
N. Kakimura; K. Makino N. Kakimura; K. Makino N. Kakimura; K. Makino Robust independence systems Robust independence systems Robust independence systems Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 6755 LNCS, PART 1, 367-378 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 6755 LNCS, PART 1, 367-378 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 6755 LNCS, PART 1, 367-378 2011 Refereed English Disclose to all
E. Boros; Y. Crama; P.L. Hammer; T. Ibaraki; A. Kogan; K. Makino E. Boros; Y. Crama; P.L. Hammer; T. Ibaraki; A. Kogan; K. Makino E. Boros; Y. Crama; P.L. Hammer; T. Ibaraki; A. Kogan; K. Makino Logical analysis of data: Classification with justification Logical analysis of data: Classification with justification Logical analysis of data: Classification with justification Annals of Operations Research, 188, 1, 33-61 Annals of Operations Research, 188, 1, 33-61 Annals of Operations Research, 188, 1, 33-61 2011 Refereed English Disclose to all
E. Boros; V. Gurvich; K. Makino; W. Shao E. Boros; V. Gurvich; K. Makino; W. Shao E. Boros; V. Gurvich; K. Makino; W. Shao Nash-solvable two-person symmetric cycle game forms Nash-solvable two-person symmetric cycle game forms Nash-solvable two-person symmetric cycle game forms Discrete Applied Mathematics, 159, 15, 1461-1487 Discrete Applied Mathematics, 159, 15, 1461-1487 Discrete Applied Mathematics, 159, 15, 1461-1487 2011 Refereed English Disclose to all
K. Makino; S. Tamaki; M. Yamamoto K. Makino; S. Tamaki; M. Yamamoto K. Makino; S. Tamaki; M. Yamamoto Derandomizing HSSW algorithm for 3-SAT Derandomizing HSSW algorithm for 3-SAT Derandomizing HSSW algorithm for 3-SAT Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 6842 LNCS, 1-12 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 6842 LNCS, 1-12 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 6842 LNCS, 1-12 2011 Refereed English Disclose to all
K. Elbassioni; K. Makino; I. Rauf K. Elbassioni; K. Makino; I. Rauf K. Elbassioni; K. Makino; I. Rauf On the readability of monotone Boolean formulae On the readability of monotone Boolean formulae On the readability of monotone Boolean formulae Journal of Combinatorial Optimization, 22, 3, 293-304 Journal of Combinatorial Optimization, 22, 3, 293-304 Journal of Combinatorial Optimization, 22, 3, 293-304 2011 Refereed English Disclose to all
K. Elbassioni; A. Elmasry; K. Makino K. Elbassioni; A. Elmasry; K. Makino K. Elbassioni; A. Elmasry; K. Makino Finding simplices containing the origin in two and three dimensions Finding simplices containing the origin in two and three dimensions Finding simplices containing the origin in two and three dimensions International Journal of Computational Geometry and Applications, 21, 5, 495-506 International Journal of Computational Geometry and Applications, 21, 5, 495-506 International Journal of Computational Geometry and Applications, 21, 5, 495-506 2011 Refereed English Disclose to all
N. Kakimura; K. Makino; K. Seimi N. Kakimura; K. Makino; K. Seimi N. Kakimura; K. Makino; K. Seimi Computing knapsack solutions with cardinality robustness Computing knapsack solutions with cardinality robustness Computing knapsack solutions with cardinality robustness Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7074 LNCS, 693-702 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7074 LNCS, 693-702 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7074 LNCS, 693-702 2011 Refereed English Disclose to all
K. Makino; S. Tamaki; M. Yamamoto K. Makino; S. Tamaki; M. Yamamoto K. Makino; S. Tamaki; M. Yamamoto On the Boolean connectivity problem for Horn relations On the Boolean connectivity problem for Horn relations On the Boolean connectivity problem for Horn relations Discrete Applied Mathematics, 158, 18, 2024-2030 Discrete Applied Mathematics, 158, 18, 2024-2030 Discrete Applied Mathematics, 158, 18, 2024-2030 2010/11/28 Refereed English Disclose to all
X. Han; K. Makino X. Han; K. Makino X. Han; K. Makino Online removable knapsack with limited cuts Online removable knapsack with limited cuts Online removable knapsack with limited cuts Theoretical Computer Science, 411, 44-46, 3956-3964 Theoretical Computer Science, 411, 44-46, 3956-3964 Theoretical Computer Science, 411, 44-46, 3956-3964 2010/10/25 Refereed English Disclose to all
E. Boros; V. Gurvich; K. Makino; D. Papp E. Boros; V. Gurvich; K. Makino; D. Papp E. Boros; V. Gurvich; K. Makino; D. Papp Acyclic, or totally tight, two-person game forms: Characterization and main properties Acyclic, or totally tight, two-person game forms: Characterization and main properties Acyclic, or totally tight, two-person game forms: Characterization and main properties Discrete Mathematics, 310, 6月7日, 1135-1151 Discrete Mathematics, 310, 6月7日, 1135-1151 Discrete Mathematics, 310, 6月7日, 1135-1151 2010 Refereed English Disclose to all
E. Boros; K. Elbassioni; V. Gurvich; K. Makino E. Boros; K. Elbassioni; V. Gurvich; K. Makino E. Boros; K. Elbassioni; V. Gurvich; K. Makino On effectivity functions of game forms On effectivity functions of game forms On effectivity functions of game forms Games and Economic Behavior, 68, 2, 512-531 Games and Economic Behavior, 68, 2, 512-531 Games and Economic Behavior, 68, 2, 512-531 2010 Refereed English Disclose to all
E. Boros; K. Elbassioni; V. Gurvich; K. Makino E. Boros; K. Elbassioni; V. Gurvich; K. Makino E. Boros; K. Elbassioni; V. Gurvich; K. Makino A pumping algorithm for ergodic stochastic mean payoff games with perfect information A pumping algorithm for ergodic stochastic mean payoff games with perfect information A pumping algorithm for ergodic stochastic mean payoff games with perfect information Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 6080 LNCS, 341-354 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 6080 LNCS, 341-354 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 6080 LNCS, 341-354 2010 Refereed English Disclose to all
K. Makino; S. Tamaki; M. Yamamoto K. Makino; S. Tamaki; M. Yamamoto K. Makino; S. Tamaki; M. Yamamoto An exact algorithm for the Boolean connectivity problem for k-CNF An exact algorithm for the Boolean connectivity problem for k-CNF An exact algorithm for the Boolean connectivity problem for k-CNF Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 6175 LNCS, 172-180 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 6175 LNCS, 172-180 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 6175 LNCS, 172-180 2010 Refereed English Disclose to all
E. Boros; K. Elbassioni; K. Makino E. Boros; K. Elbassioni; K. Makino E. Boros; K. Elbassioni; K. Makino Left-to-right multiplication for monotone Boolean dualization Left-to-right multiplication for monotone Boolean dualization Left-to-right multiplication for monotone Boolean dualization SIAM Journal on Computing, 39, 7, 3424-3439 SIAM Journal on Computing, 39, 7, 3424-3439 SIAM Journal on Computing, 39, 7, 3424-3439 2010 Refereed English Disclose to all
M. Chrobak; G.J. Woeginger; K. Makino; H. Xu M. Chrobak; G.J. Woeginger; K. Makino; H. Xu M. Chrobak; G.J. Woeginger; K. Makino; H. Xu Caching is hard - Even in the fault model Caching is hard - Even in the fault model Caching is hard - Even in the fault model Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 6346 LNCS, PART 1, 195-206 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 6346 LNCS, PART 1, 195-206 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 6346 LNCS, PART 1, 195-206 2010 Refereed English Disclose to all
R. Fujita; Y. Kobayashi; K. Makino R. Fujita; Y. Kobayashi; K. Makino R. Fujita; Y. Kobayashi; K. Makino Robust matchings and matroid intersections Robust matchings and matroid intersections Robust matchings and matroid intersections Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 6347 LNCS, PART 2, 123-134 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 6347 LNCS, PART 2, 123-134 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 6347 LNCS, PART 2, 123-134 2010 Refereed English Disclose to all
D.R. Gaur; K. Makino D.R. Gaur; K. Makino D.R. Gaur; K. Makino On the fractional chromatic number of monotone self-dual Boolean functions On the fractional chromatic number of monotone self-dual Boolean functions On the fractional chromatic number of monotone self-dual Boolean functions Discrete Mathematics, 309, 4, 867-877 Discrete Mathematics, 309, 4, 867-877 Discrete Mathematics, 309, 4, 867-877 2009 Refereed English Disclose to all
E. Boros; V. Gurvich; K. Makino E. Boros; V. Gurvich; K. Makino E. Boros; V. Gurvich; K. Makino Minimal and locally minimal games and game forms Minimal and locally minimal games and game forms Minimal and locally minimal games and game forms Discrete Mathematics, 309, 13, 4456-4468 Discrete Mathematics, 309, 13, 4456-4468 Discrete Mathematics, 309, 13, 4456-4468 2009 Refereed English Disclose to all
K. Elbassioni; K. Makino; I. Rauf K. Elbassioni; K. Makino; I. Rauf K. Elbassioni; K. Makino; I. Rauf Output-sensitive algorithms for enumerating minimal transversals for some geometric hypergraphs Output-sensitive algorithms for enumerating minimal transversals for some geometric hypergraphs Output-sensitive algorithms for enumerating minimal transversals for some geometric hypergraphs Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 5757 LNCS, 143-154 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 5757 LNCS, 143-154 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 5757 LNCS, 143-154 2009 Refereed English Disclose to all
E. Boros; K. Makino E. Boros; K. Makino E. Boros; K. Makino A fast and simple parallel algorithm for the monotone duality problem A fast and simple parallel algorithm for the monotone duality problem A fast and simple parallel algorithm for the monotone duality problem Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 5555 LNCS, PART 1, 183-194 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 5555 LNCS, PART 1, 183-194 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 5555 LNCS, PART 1, 183-194 2009 Refereed English Disclose to all
M. Sakashita; K. Makino; H. Nagamochi; S. Fujishige M. Sakashita; K. Makino; H. Nagamochi; S. Fujishige M. Sakashita; K. Makino; H. Nagamochi; S. Fujishige Minimum transversals in posimodular systems Minimum transversals in posimodular systems Minimum transversals in posimodular systems SIAM Journal on Discrete Mathematics, 23, 2, 858-871 SIAM Journal on Discrete Mathematics, 23, 2, 858-871 SIAM Journal on Discrete Mathematics, 23, 2, 858-871 2009 Refereed English Disclose to all
T. Ishii; K. Makino T. Ishii; K. Makino T. Ishii; K. Makino Posi-modular systems with modulotone requirements under permutation constraints Posi-modular systems with modulotone requirements under permutation constraints Posi-modular systems with modulotone requirements under permutation constraints Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 5878 LNCS, 473-482 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 5878 LNCS, 473-482 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 5878 LNCS, 473-482 2009 Refereed English Disclose to all
X. Han; K. Makino X. Han; K. Makino X. Han; K. Makino Online knapsack problems with limited cuts Online knapsack problems with limited cuts Online knapsack problems with limited cuts Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 5878 LNCS, 341-351 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 5878 LNCS, 341-351 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 5878 LNCS, 341-351 2009 Refereed English Disclose to all
K. Elbassioni; K. Makino; I. Rauf K. Elbassioni; K. Makino; I. Rauf K. Elbassioni; K. Makino; I. Rauf On the readability of monotone boolean formulae On the readability of monotone boolean formulae On the readability of monotone boolean formulae Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 5609 LNCS, 496-505 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 5609 LNCS, 496-505 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 5609 LNCS, 496-505 2009 Refereed English Disclose to all
X. Han; K. Makino X. Han; K. Makino X. Han; K. Makino Online minimization knapsack problem Online minimization knapsack problem Online minimization knapsack problem Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 5893 LNCS, 182-193 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 5893 LNCS, 182-193 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 5893 LNCS, 182-193 2009 Refereed English Disclose to all
M. Sakashita; K. Makino; S. Fujishige M. Sakashita; K. Makino; S. Fujishige M. Sakashita; K. Makino; S. Fujishige Minimizing a monotone concave function with laminar covering constraints Minimizing a monotone concave function with laminar covering constraints Minimizing a monotone concave function with laminar covering constraints Discrete Applied Mathematics, 156, 11, 2004-2019 Discrete Applied Mathematics, 156, 11, 2004-2019 Discrete Applied Mathematics, 156, 11, 2004-2019 2008/06/06 Refereed English Disclose to all
M. Sakashita; K. Makino; S. Fujishige M. Sakashita; K. Makino; S. Fujishige M. Sakashita; K. Makino; S. Fujishige Minimum cost source location problems with flow requirements Minimum cost source location problems with flow requirements Minimum cost source location problems with flow requirements Algorithmica (New York), 50, 4, 555-583 Algorithmica (New York), 50, 4, 555-583 Algorithmica (New York), 50, 4, 555-583 2008/04 Refereed English Disclose to all
T. Eiter; K. Makino; G. Gottlob T. Eiter; K. Makino; G. Gottlob T. Eiter; K. Makino; G. Gottlob Computational aspects of monotone dualization: A brief survey Computational aspects of monotone dualization: A brief survey Computational aspects of monotone dualization: A brief survey Discrete Applied Mathematics, 156, 11, 2035-2049 Discrete Applied Mathematics, 156, 11, 2035-2049 Discrete Applied Mathematics, 156, 11, 2035-2049 2008 Refereed English Disclose to all
E. Boros; K. Elbassioni; K. Makino E. Boros; K. Elbassioni; K. Makino E. Boros; K. Elbassioni; K. Makino On Berge multiplication for monotone Boolean dualization On Berge multiplication for monotone Boolean dualization On Berge multiplication for monotone Boolean dualization Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 5125 LNCS, PART 1, 48-59 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 5125 LNCS, PART 1, 48-59 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 5125 LNCS, PART 1, 48-59 2008 Refereed English Disclose to all
K. Makino; H. Ono K. Makino; H. Ono K. Makino; H. Ono Deductive inference for the interiors and exteriors of horn theories Deductive inference for the interiors and exteriors of horn theories Deductive inference for the interiors and exteriors of horn theories Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 5369 LNCS, 390-401 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 5369 LNCS, 390-401 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 5369 LNCS, 390-401 2008 Refereed English Disclose to all
L. Khachiyan; E. Boros; K. Borys; K. Elbassioni; V. Gurvich; K. Makino L. Khachiyan; E. Boros; K. Borys; K. Elbassioni; V. Gurvich; K. Makino L. Khachiyan; E. Boros; K. Borys; K. Elbassioni; V. Gurvich; K. Makino Generating cut conjunctions in graphs and related problems Generating cut conjunctions in graphs and related problems Generating cut conjunctions in graphs and related problems Algorithmica (New York), 51, 3, 239-263 Algorithmica (New York), 51, 3, 239-263 Algorithmica (New York), 51, 3, 239-263 2008 Refereed English Disclose to all
E. Boros; K. Elbassioni; V. Gurvich; K. Makino; V. Oudalov E. Boros; K. Elbassioni; V. Gurvich; K. Makino; V. Oudalov E. Boros; K. Elbassioni; V. Gurvich; K. Makino; V. Oudalov A complete characterization of nash-solvability of bimatrix games in terms of the exclusion of certain 2×2 subgames A complete characterization of nash-solvability of bimatrix games in terms of the exclusion of certain 2×2 subgames A complete characterization of nash-solvability of bimatrix games in terms of the exclusion of certain 2×2 subgames Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 5010 LNCS, 99-109 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 5010 LNCS, 99-109 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 5010 LNCS, 99-109 2008 Refereed English Disclose to all
L. Khachiyan; E. Boros; K. Elbassioni; V. Gurvich; K. Makino L. Khachiyan; E. Boros; K. Elbassioni; V. Gurvich; K. Makino L. Khachiyan; E. Boros; K. Elbassioni; V. Gurvich; K. Makino Enumerating disjunctions and conjunctions of paths and cuts in reliability theory Enumerating disjunctions and conjunctions of paths and cuts in reliability theory Enumerating disjunctions and conjunctions of paths and cuts in reliability theory Discrete Applied Mathematics, 155, 2, 137-149 Discrete Applied Mathematics, 155, 2, 137-149 Discrete Applied Mathematics, 155, 2, 137-149 2007 Refereed English Disclose to all
L. Khachiyan; E. Boros; K. Elbassioni; V. Gurvich; K. Makino L. Khachiyan; E. Boros; K. Elbassioni; V. Gurvich; K. Makino L. Khachiyan; E. Boros; K. Elbassioni; V. Gurvich; K. Makino Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data Theoretical Computer Science, 379, 3, 361-376 Theoretical Computer Science, 379, 3, 361-376 Theoretical Computer Science, 379, 3, 361-376 2007 Refereed English Disclose to all
T. Eiter; K. Makino T. Eiter; K. Makino T. Eiter; K. Makino On computing all abductive explanations from a propositional Horn theory On computing all abductive explanations from a propositional Horn theory On computing all abductive explanations from a propositional Horn theory Journal of the ACM, 54, 5 Journal of the ACM, 54, 5 Journal of the ACM, 54, 5 2007 Refereed English Disclose to all
N. Katoh; H. Yabe; S. Kasahara; K. Makino; T. Matsui; H. Morita; M. Muramatsu; A. Suzuki N. Katoh; H. Yabe; S. Kasahara; K. Makino; T. Matsui; H. Morita; M. Muramatsu; A. Suzuki N. Katoh; H. Yabe; S. Kasahara; K. Makino; T. Matsui; H. Morita; M. Muramatsu; A. Suzuki A special issue on the 50th anniversary of the Operations Research Society of Japan A special issue on the 50th anniversary of the Operations Research Society of Japan A special issue on the 50th anniversary of the Operations Research Society of Japan Journal of the Operations Research Society of Japan, 50, 4, 277- Journal of the Operations Research Society of Japan, 50, 4, 277- Journal of the Operations Research Society of Japan, 50, 4, 277- 2007 Refereed English Disclose to all
L. Khachiyan; E. Boros; K. Borys; K. Elbassioni; V. Gurvich; K. Makino L. Khachiyan; E. Boros; K. Borys; K. Elbassioni; V. Gurvich; K. Makino L. Khachiyan; E. Boros; K. Borys; K. Elbassioni; V. Gurvich; K. Makino Enumerating spanning and connected subsets in graphs and matroids Enumerating spanning and connected subsets in graphs and matroids Enumerating spanning and connected subsets in graphs and matroids Journal of the Operations Research Society of Japan, 50, 4, 325-338 Journal of the Operations Research Society of Japan, 50, 4, 325-338 Journal of the Operations Research Society of Japan, 50, 4, 325-338 2007 Refereed English Disclose to all
S. Mamada; T. Uno; K. Makino; S. Fujishige S. Mamada; T. Uno; K. Makino; S. Fujishige S. Mamada; T. Uno; K. Makino; S. Fujishige An O (n log<sup>2</sup> n) algorithm for the optimal sink location problem in dynamic tree networks An O (n log<sup>2</sup> n) algorithm for the optimal sink location problem in dynamic tree networks An O (n log<sup>2</sup> n) algorithm for the optimal sink location problem in dynamic tree networks Discrete Applied Mathematics, 154, 16, 2387-2401 Discrete Applied Mathematics, 154, 16, 2387-2401 Discrete Applied Mathematics, 154, 16, 2387-2401 2006/11/01 Refereed English Disclose to all
K. Makino; Y. Uno; T. Ibaraki K. Makino; Y. Uno; T. Ibaraki K. Makino; Y. Uno; T. Ibaraki Minimum edge ranking spanning trees of split graphs Minimum edge ranking spanning trees of split graphs Minimum edge ranking spanning trees of split graphs Discrete Applied Mathematics, 154, 16, 2373-2386 Discrete Applied Mathematics, 154, 16, 2373-2386 Discrete Applied Mathematics, 154, 16, 2373-2386 2006 Refereed English Disclose to all
Y. Asahiro; T. Horiyama; K. Makino; H. Ono; T. Sakuma; M. Yamashita Y. Asahiro; T. Horiyama; K. Makino; H. Ono; T. Sakuma; M. Yamashita Y. Asahiro; T. Horiyama; K. Makino; H. Ono; T. Sakuma; M. Yamashita How to collect balls moving in the Euclidean plane How to collect balls moving in the Euclidean plane How to collect balls moving in the Euclidean plane Discrete Applied Mathematics, 154, 16, 2247-2262 Discrete Applied Mathematics, 154, 16, 2247-2262 Discrete Applied Mathematics, 154, 16, 2247-2262 2006 Refereed English Disclose to all
M. Sakashita; K. Makino; S. Fujishige M. Sakashita; K. Makino; S. Fujishige M. Sakashita; K. Makino; S. Fujishige Minimum cost source location problems with flow requirements Minimum cost source location problems with flow requirements Minimum cost source location problems with flow requirements Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3887, 769-780 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3887, 769-780 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3887, 769-780 2006 Refereed English Disclose to all
M. Sakashita; K. Makino; S. Fujishige M. Sakashita; K. Makino; S. Fujishige M. Sakashita; K. Makino; S. Fujishige Minimizing a monotone concave function with laminar covering constraints Minimizing a monotone concave function with laminar covering constraints Minimizing a monotone concave function with laminar covering constraints Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3827 LNCS, 71-81 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3827 LNCS, 71-81 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3827 LNCS, 71-81 2005 Refereed English Disclose to all
L. Khachiyan; E. Boros; K. Borys; K. Elbassioni; V. Gurvich; K. Makino L. Khachiyan; E. Boros; K. Borys; K. Elbassioni; V. Gurvich; K. Makino L. Khachiyan; E. Boros; K. Borys; K. Elbassioni; V. Gurvich; K. Makino Generating cut conjunctions and bridge avoiding extensions in graphs Generating cut conjunctions and bridge avoiding extensions in graphs Generating cut conjunctions and bridge avoiding extensions in graphs Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3827 LNCS, 156-165 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3827 LNCS, 156-165 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3827 LNCS, 156-165 2005 Refereed English Disclose to all
L. Khachiyan; E. Boros; K. Elbassioni; V. Gurvich; K. Makino L. Khachiyan; E. Boros; K. Elbassioni; V. Gurvich; K. Makino L. Khachiyan; E. Boros; K. Elbassioni; V. Gurvich; K. Makino On the complexity of some enumeration problems for matroids On the complexity of some enumeration problems for matroids On the complexity of some enumeration problems for matroids SIAM Journal on Discrete Mathematics, 19, 4, 966-984 SIAM Journal on Discrete Mathematics, 19, 4, 966-984 SIAM Journal on Discrete Mathematics, 19, 4, 966-984 2005 Refereed English Disclose to all
S. Mamada; K. Makino; S. Fujishige S. Mamada; K. Makino; S. Fujishige S. Mamada; K. Makino; S. Fujishige An Evacuation Problem in Tree Dynamic Networks with Multiple Exits An Evacuation Problem in Tree Dynamic Networks with Multiple Exits An Evacuation Problem in Tree Dynamic Networks with Multiple Exits Systems and Human Science - For Safety, Security and Dependability, 517-526 Systems and Human Science - For Safety, Security and Dependability, 517-526 Systems and Human Science - For Safety, Security and Dependability, 517-526 2005 Refereed English Disclose to all
T. Arai; S. Yamamoto; K. Makino T. Arai; S. Yamamoto; K. Makino T. Arai; S. Yamamoto; K. Makino Preface Preface Preface Systems and Human Science - For Safety, Security and Dependability, v-v Systems and Human Science - For Safety, Security and Dependability, v-v Systems and Human Science - For Safety, Security and Dependability, v-v 2005 Refereed English Disclose to all
K. Makino K. Makino K. Makino Special section on discrete mathematics and its applications Special section on discrete mathematics and its applications Special section on discrete mathematics and its applications IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E88-A, 5, 1103- IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E88-A, 5, 1103- IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E88-A, 5, 1103- 2005 Refereed English Disclose to all
S. Mamada; T. Uno; K. Makino; S. Fujishige S. Mamada; T. Uno; K. Makino; S. Fujishige S. Mamada; T. Uno; K. Makino; S. Fujishige A tree partitioning problem arising from an evacuation problem in tree dynamic networks A tree partitioning problem arising from an evacuation problem in tree dynamic networks A tree partitioning problem arising from an evacuation problem in tree dynamic networks Journal of the Operations Research Society of Japan, 48, 3, 196-206 Journal of the Operations Research Society of Japan, 48, 3, 196-206 Journal of the Operations Research Society of Japan, 48, 3, 196-206 2005 Refereed English Disclose to all
S. Fujishige; K. Makino; T. Takabatake; K. Kashiwabara S. Fujishige; K. Makino; T. Takabatake; K. Kashiwabara S. Fujishige; K. Makino; T. Takabatake; K. Kashiwabara Polybasic polyhedra: Structure of polyhedra with edge vectors of support size at most 2 Polybasic polyhedra: Structure of polyhedra with edge vectors of support size at most 2 Polybasic polyhedra: Structure of polyhedra with edge vectors of support size at most 2 Discrete Mathematics, 280, 1月3日, 13-27 Discrete Mathematics, 280, 1月3日, 13-27 Discrete Mathematics, 280, 1月3日, 13-27 2004 Refereed English Disclose to all
Y. Asahiro; T. Horiyama; K. Makino; H. Ono; T. Sakuma; M. Yamashita Y. Asahiro; T. Horiyama; K. Makino; H. Ono; T. Sakuma; M. Yamashita Y. Asahiro; T. Horiyama; K. Makino; H. Ono; T. Sakuma; M. Yamashita How to collect balls moving in the euclidean plane How to collect balls moving in the euclidean plane How to collect balls moving in the euclidean plane Electronic Notes in Theoretical Computer Science, 91, 229-245 Electronic Notes in Theoretical Computer Science, 91, 229-245 Electronic Notes in Theoretical Computer Science, 91, 229-245 2004 Refereed English Disclose to all
E. Boros; V.A. Gurvich; L. Khachiyan; K. Makino E. Boros; V.A. Gurvich; L. Khachiyan; K. Makino E. Boros; V.A. Gurvich; L. Khachiyan; K. Makino Dual-bounded generating problems: Weighted transversals of a hypergraph Dual-bounded generating problems: Weighted transversals of a hypergraph Dual-bounded generating problems: Weighted transversals of a hypergraph Discrete Applied Mathematics, 142, 1-3 SPEC. ISS., 1-15 Discrete Applied Mathematics, 142, 1-3 SPEC. ISS., 1-15 Discrete Applied Mathematics, 142, 1-3 SPEC. ISS., 1-15 2004 Refereed English Disclose to all
T. Ibaraki; A. Kogan; K. Makino T. Ibaraki; A. Kogan; K. Makino T. Ibaraki; A. Kogan; K. Makino Inferring minimal functional dependencies in Horn and q-Horn theories Inferring minimal functional dependencies in Horn and q-Horn theories Inferring minimal functional dependencies in Horn and q-Horn theories Annals of Mathematics and Artificial Intelligence, 38, 4, 233-255 Annals of Mathematics and Artificial Intelligence, 38, 4, 233-255 Annals of Mathematics and Artificial Intelligence, 38, 4, 233-255 2003 Refereed English Disclose to all
E. Boros; T. Ibaraki; K. Makino E. Boros; T. Ibaraki; K. Makino E. Boros; T. Ibaraki; K. Makino Variations on extending partially defined Boolean functions with missing bits Variations on extending partially defined Boolean functions with missing bits Variations on extending partially defined Boolean functions with missing bits Information and Computation, 180, 1, 53-70 Information and Computation, 180, 1, 53-70 Information and Computation, 180, 1, 53-70 2003 Refereed English Disclose to all
E. Boros; T. Horiyama; T. Ibaraki; K. Makino; M. Yagiura E. Boros; T. Horiyama; T. Ibaraki; K. Makino; M. Yagiura E. Boros; T. Horiyama; T. Ibaraki; K. Makino; M. Yagiura Finding essential attributes from binary data Finding essential attributes from binary data Finding essential attributes from binary data Annals of Mathematics and Artificial Intelligence, 39, 3, 223-257 Annals of Mathematics and Artificial Intelligence, 39, 3, 223-257 Annals of Mathematics and Artificial Intelligence, 39, 3, 223-257 2003 Refereed English Disclose to all
E. Boros; V. Gurvich; L. Khachiyan; K. Makino E. Boros; V. Gurvich; L. Khachiyan; K. Makino E. Boros; V. Gurvich; L. Khachiyan; K. Makino On maximal frequent and minimal infrequent sets in binary matrices On maximal frequent and minimal infrequent sets in binary matrices On maximal frequent and minimal infrequent sets in binary matrices Annals of Mathematics and Artificial Intelligence, 39, 3, 211-221 Annals of Mathematics and Artificial Intelligence, 39, 3, 211-221 Annals of Mathematics and Artificial Intelligence, 39, 3, 211-221 2003 Refereed English Disclose to all
K. Makino; H. Ono; T. Ibaraki K. Makino; H. Ono; T. Ibaraki K. Makino; H. Ono; T. Ibaraki Interior and exterior functions of positive Boolean functions Interior and exterior functions of positive Boolean functions Interior and exterior functions of positive Boolean functions Discrete Applied Mathematics, 130, 3, 417-436 Discrete Applied Mathematics, 130, 3, 417-436 Discrete Applied Mathematics, 130, 3, 417-436 2003 Refereed English Disclose to all
H. Ito; K. Makino; K. Arata; S. Honami; Y. Itatsu; S. Fujishige H. Ito; K. Makino; K. Arata; S. Honami; Y. Itatsu; S. Fujishige H. Ito; K. Makino; K. Arata; S. Honami; Y. Itatsu; S. Fujishige Source location problem with flow requirements in directed networks Source location problem with flow requirements in directed networks Source location problem with flow requirements in directed networks Optimization Methods and Software, 18, 4 II, 427-435 Optimization Methods and Software, 18, 4 II, 427-435 Optimization Methods and Software, 18, 4 II, 427-435 2003 Refereed English Disclose to all
K. Makino K. Makino K. Makino Efficient dualization of O (log n) -term monotone disjunctive normal forms Efficient dualization of O (log n) -term monotone disjunctive normal forms Efficient dualization of O (log n) -term monotone disjunctive normal forms Discrete Applied Mathematics, 126, 2月3日, 305-312 Discrete Applied Mathematics, 126, 2月3日, 305-312 Discrete Applied Mathematics, 126, 2月3日, 305-312 2003 Refereed English Disclose to all
T. Eiter; G. Gottlob; K. Makino T. Eiter; G. Gottlob; K. Makino T. Eiter; G. Gottlob; K. Makino New results on monotone dualization and generating hypergraph transversals New results on monotone dualization and generating hypergraph transversals New results on monotone dualization and generating hypergraph transversals SIAM Journal on Computing, 32, 2, 514-537 SIAM Journal on Computing, 32, 2, 514-537 SIAM Journal on Computing, 32, 2, 514-537 2003 Refereed English Disclose to all
K. Arata; S. Iwata; K. Makino; S. Fujishige K. Arata; S. Iwata; K. Makino; S. Fujishige K. Arata; S. Iwata; K. Makino; S. Fujishige Locating sources to meet flow demands in undirected networks Locating sources to meet flow demands in undirected networks Locating sources to meet flow demands in undirected networks Journal of Algorithms, 42, 1, 54-68 Journal of Algorithms, 42, 1, 54-68 Journal of Algorithms, 42, 1, 54-68 2002 Refereed English Disclose to all
E. Boros; K. Elbassioni; V. Gurvich; L. Khachiyan; K. Makino E. Boros; K. Elbassioni; V. Gurvich; L. Khachiyan; K. Makino E. Boros; K. Elbassioni; V. Gurvich; L. Khachiyan; K. Makino Dual-bounded generating problems: All minimal integer solutions for a monotone system of linear inequalities Dual-bounded generating problems: All minimal integer solutions for a monotone system of linear inequalities Dual-bounded generating problems: All minimal integer solutions for a monotone system of linear inequalities SIAM Journal on Computing, 31, 5, 1624-1643 SIAM Journal on Computing, 31, 5, 1624-1643 SIAM Journal on Computing, 31, 5, 1624-1643 2002 Refereed English Disclose to all
K. Makino K. Makino K. Makino A linear time algorithm for recognizing regular Boolean functions A linear time algorithm for recognizing regular Boolean functions A linear time algorithm for recognizing regular Boolean functions Journal of Algorithms, 43, 2, 155-176 Journal of Algorithms, 43, 2, 155-176 Journal of Algorithms, 43, 2, 155-176 2002 Refereed English Disclose to all
T. Eiter; T. Ibaraki; K. Makino T. Eiter; T. Ibaraki; K. Makino T. Eiter; T. Ibaraki; K. Makino Decision lists and related Boolean functions Decision lists and related Boolean functions Decision lists and related Boolean functions Theoretical Computer Science, 270, 1月2日, 493-524 Theoretical Computer Science, 270, 1月2日, 493-524 Theoretical Computer Science, 270, 1月2日, 493-524 2002 Refereed English Disclose to all
T. Eiter; T. Ibaraki; K. Makino T. Eiter; T. Ibaraki; K. Makino T. Eiter; T. Ibaraki; K. Makino Recognition and dualization of disguised bidual Horn functions Recognition and dualization of disguised bidual Horn functions Recognition and dualization of disguised bidual Horn functions Information Processing Letters, 82, 6, 283-291 Information Processing Letters, 82, 6, 283-291 Information Processing Letters, 82, 6, 283-291 2002 Refereed English Disclose to all
H. Ono; K. Makino; T. Ibaraki H. Ono; K. Makino; T. Ibaraki H. Ono; K. Makino; T. Ibaraki Logical analysis of data with decomposable structures Logical analysis of data with decomposable structures Logical analysis of data with decomposable structures Theoretical Computer Science, 289, 2, 977-995 Theoretical Computer Science, 289, 2, 977-995 Theoretical Computer Science, 289, 2, 977-995 2002 Refereed English Disclose to all
K. Makino; T. Takabatake; S. Fujishige K. Makino; T. Takabatake; S. Fujishige K. Makino; T. Takabatake; S. Fujishige A simple matching algorithm for regular bipartite graphs A simple matching algorithm for regular bipartite graphs A simple matching algorithm for regular bipartite graphs Information Processing Letters, 84, 4, 189-193 Information Processing Letters, 84, 4, 189-193 Information Processing Letters, 84, 4, 189-193 2002 Refereed English Disclose to all
K. Makino; M. Yamashita; T. Kameda K. Makino; M. Yamashita; T. Kameda K. Makino; M. Yamashita; T. Kameda Max- and min-neighborhood monopolies Max- and min-neighborhood monopolies Max- and min-neighborhood monopolies Algorithmica (New York), 34, 3, 240-260 Algorithmica (New York), 34, 3, 240-260 Algorithmica (New York), 34, 3, 240-260 2002 Refereed English Disclose to all
K. Makino; Y. Uno; T. Ibaraki K. Makino; Y. Uno; T. Ibaraki K. Makino; Y. Uno; T. Ibaraki Minimum edge ranking spanning trees of threshold graphs Minimum edge ranking spanning trees of threshold graphs Minimum edge ranking spanning trees of threshold graphs Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2518 LNCS, 428-440 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2518 LNCS, 428-440 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2518 LNCS, 428-440 2002 Refereed English Disclose to all
S. Mamada; K. Makino; S. Fujishige S. Mamada; K. Makino; S. Fujishige S. Mamada; K. Makino; S. Fujishige Optimal sink location problem for dynamic flows in a tree network Optimal sink location problem for dynamic flows in a tree network Optimal sink location problem for dynamic flows in a tree network IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E85-A, 5, 1020-1025 IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E85-A, 5, 1020-1025 IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E85-A, 5, 1020-1025 2002 Refereed English Disclose to all
K. Makino; T. Kameda K. Makino; T. Kameda K. Makino; T. Kameda Transformations on regular nondominated coteries and their applications Transformations on regular nondominated coteries and their applications Transformations on regular nondominated coteries and their applications SIAM Journal on Discrete Mathematics, 14, 3, 381-407 SIAM Journal on Discrete Mathematics, 14, 3, 381-407 SIAM Journal on Discrete Mathematics, 14, 3, 381-407 2001 Refereed English Disclose to all
T. Ibaraki; A. Kogan; K. Makino T. Ibaraki; A. Kogan; K. Makino T. Ibaraki; A. Kogan; K. Makino On functional dependencies in q-Horn theories On functional dependencies in q-Horn theories On functional dependencies in q-Horn theories Artificial Intelligence, 131, 1月2日, 171-187 Artificial Intelligence, 131, 1月2日, 171-187 Artificial Intelligence, 131, 1月2日, 171-187 2001 Refereed English Disclose to all
T. Eiter; T. Ibaraki; K. Makino T. Eiter; T. Ibaraki; K. Makino T. Eiter; T. Ibaraki; K. Makino Disjunctions of Horn theories and their cores Disjunctions of Horn theories and their cores Disjunctions of Horn theories and their cores SIAM Journal on Computing, 31, 1, 269-288 SIAM Journal on Computing, 31, 1, 269-288 SIAM Journal on Computing, 31, 1, 269-288 2001 Refereed English Disclose to all
K. Makino; Y. Uno; T. Ibaraki K. Makino; Y. Uno; T. Ibaraki K. Makino; Y. Uno; T. Ibaraki On Minimum Edge Ranking Spanning Trees On Minimum Edge Ranking Spanning Trees On Minimum Edge Ranking Spanning Trees Journal of Algorithms, 38, 2, 411-437 Journal of Algorithms, 38, 2, 411-437 Journal of Algorithms, 38, 2, 411-437 2001 Refereed English Disclose to all
B. Randerath; E. Speckenmeyer; E. Boros; P. Hammer; A. Kogan; K. Makino; B. Simeone; O. Cepek B. Randerath; E. Speckenmeyer; E. Boros; P. Hammer; A. Kogan; K. Makino; B. Simeone; O. Cepek B. Randerath; E. Speckenmeyer; E. Boros; P. Hammer; A. Kogan; K. Makino; B. Simeone; O. Cepek A satisfiability formulation of problems on level graphs A satisfiability formulation of problems on level graphs A satisfiability formulation of problems on level graphs Electronic Notes in Discrete Mathematics, 9, 269-277 Electronic Notes in Discrete Mathematics, 9, 269-277 Electronic Notes in Discrete Mathematics, 9, 269-277 2001 Refereed English Disclose to all
T. Eiter; T. Ibaraki; K. Makino T. Eiter; T. Ibaraki; K. Makino T. Eiter; T. Ibaraki; K. Makino On the difference of Horn theories On the difference of Horn theories On the difference of Horn theories Journal of Computer and System Sciences, 61, 3, 478-507 Journal of Computer and System Sciences, 61, 3, 478-507 Journal of Computer and System Sciences, 61, 3, 478-507 2000 Refereed English Disclose to all
E. Boros; T. Ibaraki; K. Makino E. Boros; T. Ibaraki; K. Makino E. Boros; T. Ibaraki; K. Makino Logical analysis of binary data with missing bits Logical analysis of binary data with missing bits Logical analysis of binary data with missing bits Artificial Intelligence, 107, 2, 219-263 Artificial Intelligence, 107, 2, 219-263 Artificial Intelligence, 107, 2, 219-263 1999 Refereed English Disclose to all
T. Eiter; T. Ibaraki; K. Makino T. Eiter; T. Ibaraki; K. Makino T. Eiter; T. Ibaraki; K. Makino Computing intersections of Horn theories for reasoning with models Computing intersections of Horn theories for reasoning with models Computing intersections of Horn theories for reasoning with models Artificial Intelligence, 110, 1, 57-101 Artificial Intelligence, 110, 1, 57-101 Artificial Intelligence, 110, 1, 57-101 1999 Refereed English Disclose to all
K. Makinq; K.-I. Hatanaka; T. Ibaraki K. Makinq; K.-I. Hatanaka; T. Ibaraki K. Makinq; K.-I. Hatanaka; T. Ibaraki Horn extensions of a partially defined boolean function Horn extensions of a partially defined boolean function Horn extensions of a partially defined boolean function SIAM Journal on Computing, 28, 6, 2168-2186 SIAM Journal on Computing, 28, 6, 2168-2186 SIAM Journal on Computing, 28, 6, 2168-2186 1999 Refereed English Disclose to all
T. Ibaraki; A. Kogan; K. Makino T. Ibaraki; A. Kogan; K. Makino T. Ibaraki; A. Kogan; K. Makino Functional dependencies in Horn theories Functional dependencies in Horn theories Functional dependencies in Horn theories Artificial Intelligence, 108, 1, 1-30 Artificial Intelligence, 108, 1, 1-30 Artificial Intelligence, 108, 1, 1-30 1999 Refereed English Disclose to all
T. Eiter; T. Ibaraki; K. Makino T. Eiter; T. Ibaraki; K. Makino T. Eiter; T. Ibaraki; K. Makino Bidual Horn functions and extensions Bidual Horn functions and extensions Bidual Horn functions and extensions Discrete Applied Mathematics, 96-97, 55-88 Discrete Applied Mathematics, 96-97, 55-88 Discrete Applied Mathematics, 96-97, 55-88 1999 Refereed English Disclose to all
J.C. Bioch; T. Ibaraki; K. Makino J.C. Bioch; T. Ibaraki; K. Makino J.C. Bioch; T. Ibaraki; K. Makino Minimum self-dual decompositions of positive dual-minor Boolean functions Minimum self-dual decompositions of positive dual-minor Boolean functions Minimum self-dual decompositions of positive dual-minor Boolean functions Discrete Applied Mathematics, 96-97, 307-326 Discrete Applied Mathematics, 96-97, 307-326 Discrete Applied Mathematics, 96-97, 307-326 1999 Refereed English Disclose to all
K. Makino; T. Ibaraki K. Makino; T. Ibaraki K. Makino; T. Ibaraki A fast and simple algorithm for identifying 2-monotonic positive Boolean functions A fast and simple algorithm for identifying 2-monotonic positive Boolean functions A fast and simple algorithm for identifying 2-monotonic positive Boolean functions Journal of Algorithms, 26, 2, 291-305 Journal of Algorithms, 26, 2, 291-305 Journal of Algorithms, 26, 2, 291-305 1998 Refereed English Disclose to all
T. Eiter; T. Ibaraki; K. Makino T. Eiter; T. Ibaraki; K. Makino T. Eiter; T. Ibaraki; K. Makino Double Horn Functions Double Horn Functions Double Horn Functions Information and Computation, 144, 2, 155-190 Information and Computation, 144, 2, 155-190 Information and Computation, 144, 2, 155-190 1998 Refereed English Disclose to all
T. Eiter; T. Ibaraki; K. Makino T. Eiter; T. Ibaraki; K. Makino T. Eiter; T. Ibaraki; K. Makino On disguised double horn functions and extensions On disguised double horn functions and extensions On disguised double horn functions and extensions Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 1373 LNCS, 50-60 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 1373 LNCS, 50-60 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 1373 LNCS, 50-60 1998 Refereed English Disclose to all
K. Makino; T. Ibaraki K. Makino; T. Ibaraki K. Makino; T. Ibaraki The maximum latency and identification of positive Boolean functions The maximum latency and identification of positive Boolean functions The maximum latency and identification of positive Boolean functions SIAM Journal on Computing, 26, 5, 1363-1383 SIAM Journal on Computing, 26, 5, 1363-1383 SIAM Journal on Computing, 26, 5, 1363-1383 1997 Refereed English Disclose to all
K. Makino; K. Yano; T. Ibaraki K. Makino; K. Yano; T. Ibaraki K. Makino; K. Yano; T. Ibaraki Positive and Horn decomposability of partially defined Boolean functions Positive and Horn decomposability of partially defined Boolean functions Positive and Horn decomposability of partially defined Boolean functions Discrete Applied Mathematics, 74, 3, 251-274 Discrete Applied Mathematics, 74, 3, 251-274 Discrete Applied Mathematics, 74, 3, 251-274 1997 Refereed English Disclose to all
K. Makino; T. Ibaraki K. Makino; T. Ibaraki K. Makino; T. Ibaraki Interior and exterior functions of Boolean functions Interior and exterior functions of Boolean functions Interior and exterior functions of Boolean functions Discrete Applied Mathematics, 69, 3, 209-231 Discrete Applied Mathematics, 69, 3, 209-231 Discrete Applied Mathematics, 69, 3, 209-231 1996 Refereed English Disclose to all

  • <<
  • >>
Title language:
Misc
Author Author(Japanese) Author(English) Title Title(Japanese) Title(English) Bibliography Bibliography(Japanese) Bibliography(English) Publication date Refereed paper Language Publishing type Disclose
D. Nanongkai; A. Lall; A. Das Sarma; K. Makino D. Nanongkai; A. Lall; A. Das Sarma; K. Makino D. Nanongkai; A. Lall; A. Das Sarma; K. Makino Interactive regret minimization Interactive regret minimization Interactive regret minimization Proceedings of the ACM SIGMOD International Conference on Management of Data, 109-120 Proceedings of the ACM SIGMOD International Conference on Management of Data, 109-120 Proceedings of the ACM SIGMOD International Conference on Management of Data, 109-120 2012 Refereed English Disclose to all
K. Makino K. Makino K. Makino Source location problems with flow requirements Source location problems with flow requirements Source location problems with flow requirements Proceedings of the 2012 3rd International Conference on Networking and Computing, ICNC 2012, 404-406 Proceedings of the 2012 3rd International Conference on Networking and Computing, ICNC 2012, 404-406 Proceedings of the 2012 3rd International Conference on Networking and Computing, ICNC 2012, 404-406 2012 Refereed English Disclose to all
K. Kimura; K. Makino K. Kimura; K. Makino K. Kimura; K. Makino Trichotomy for integer linear systems based on their sign patterns Trichotomy for integer linear systems based on their sign patterns Trichotomy for integer linear systems based on their sign patterns Leibniz International Proceedings in Informatics, LIPIcs, 14, 613-623 Leibniz International Proceedings in Informatics, LIPIcs, 14, 613-623 Leibniz International Proceedings in Informatics, LIPIcs, 14, 613-623 2012 Refereed English Disclose to all
T. Ishii; K. Makino T. Ishii; K. Makino T. Ishii; K. Makino Augmenting edge-connectivity between vertex subsets Augmenting edge-connectivity between vertex subsets Augmenting edge-connectivity between vertex subsets Conferences in Research and Practice in Information Technology Series, 94 Conferences in Research and Practice in Information Technology Series, 94 Conferences in Research and Practice in Information Technology Series, 94 2009 Refereed English Disclose to all
A. Elmasry; K. Makino A. Elmasry; K. Makino A. Elmasry; K. Makino Finding intersections of bichromatic segments defined by points Finding intersections of bichromatic segments defined by points Finding intersections of bichromatic segments defined by points CCCG 2007 - 19th Canadian Conference on Computational Geometry, 269-272 CCCG 2007 - 19th Canadian Conference on Computational Geometry, 269-272 CCCG 2007 - 19th Canadian Conference on Computational Geometry, 269-272 2007 Refereed English Disclose to all
S. Mamada; K. Makino; S. Fujishige S. Mamada; K. Makino; S. Fujishige S. Mamada; K. Makino; S. Fujishige Evacuation problems and dynamic network flows Evacuation problems and dynamic network flows Evacuation problems and dynamic network flows Proceedings of the SICE Annual Conference, 2373-2378 Proceedings of the SICE Annual Conference, 2373-2378 Proceedings of the SICE Annual Conference, 2373-2378 2004 Refereed English Disclose to all
T. Eiter; K. Makino T. Eiter; K. Makino T. Eiter; K. Makino On computing all abductive explanations On computing all abductive explanations On computing all abductive explanations Proceedings of the National Conference on Artificial Intelligence, 62-67 Proceedings of the National Conference on Artificial Intelligence, 62-67 Proceedings of the National Conference on Artificial Intelligence, 62-67 2002 Refereed English Disclose to all
Title language:
Books etc
Author Author(Japanese) Author(English) Title Title(Japanese) Title(English) Publisher Publisher(Japanese) Publisher(English) Publication date Language Type Disclose
Efficient generation of all regular non-dominated coteries(共著) Efficient generation of all regular non-dominated coteries(共著) Proceedings of PODC2000 Proceedings of PODC2000 2000 Disclose to all
Max-and Min-neighborhood monopolies(共著) Max-and Min-neighborhood monopolies(共著) SWAT2000, LNCS 1851 SWAT2000, LNCS 1851 2000 Disclose to all
Locating sources to meet flow demands in undirected networks(共著) Locating sources to meet flow demands in undirected networks(共著) SWAT 2000, LNCS 1851 SWAT 2000, LNCS 1851 2000 Disclose to all
Logical analysis of data with decomposable structures(共著) Logical analysis of data with decomposable structures(共著) COCOON 2000, LNCS 1858 COCOON 2000, LNCS 1858 2000 Disclose to all
Fully consistent extensions of partially defined Boolean functions with missing bits(共著) Fully consistent extensions of partially defined Boolean functions with missing bits(共著) IFIP TCS2000, LNCS 1872 IFIP TCS2000, LNCS 1872 2000 Disclose to all
Finding essential attributes in binary data(共著) Finding essential attributes in binary data(共著) IDEAL 2000, LNCS 1983 IDEAL 2000, LNCS 1983 2000 Disclose to all
On the difference of Horn theories(共著) On the difference of Horn theories(共著) STACS '99 LNCS STACS '99 LNCS 1999 Disclose to all
Interior and exterior functions of positive Booleam functions(共著) Interior and exterior functions of positive Booleam functions(共著) Proceedings of the 1st Japanese-Hungastan Symposium on Discrete Mathematics and Its applications Proceedings of the 1st Japanese-Hungastan Symposium on Discrete Mathematics and Its applications 1999 Disclose to all
On minimum edge ranking spanning trees (共著) On minimum edge ranking spanning trees (共著) MFCS'99 . LNCS MFCS'99 . LNCS 1999 Disclose to all
A linear time algorithm for recognizing regular Boolean functions A linear time algorithm for recognizing regular Boolean functions ISAAC'99 , LNCS ISAAC'99 , LNCS 1999 Disclose to all
Computing intersections of Horn theories for reasoning with models(共著) Computing intersections of Horn theories for reasoning with models(共著) Proceedings of AAAI98 Proceedings of AAAI98 1998 Disclose to all
Disjunctions of Horn theories and their cores(共著) Disjunctions of Horn theories and their cores(共著) Algorithms and Computation ISAAC '98 LNCS Algorithms and Computation ISAAC '98 LNCS 1998 Disclose to all
Monotone extensions of Booleam data(共著) Monotone extensions of Booleam data(共著) LNAI Algorithmic Learning Theory ALT'97 LNAI Algorithmic Learning Theory ALT'97 1997 Disclose to all
Two-face Horn extensions(共著) Two-face Horn extensions(共著) Algorithms and Computation ISAAC'97 LNCS Algorithms and Computation ISAAC'97 LNCS 1997 Disclose to all
On disguised double how functions and extensions(共著) On disguised double how functions and extensions(共著) STACS '98 LNCS STACS '98 LNCS 1997 Disclose to all
Boolean analysis of imcomplete examples(共著) Boolean analysis of imcomplete examples(共著) Algorithm Theory-SWAT'96, LNCS 1097, springer Algorithm Theory-SWAT'96, LNCS 1097, springer 1996 Disclose to all
Data analysis by positive decision trees(共著) Data analysis by positive decision trees(共著) Proceedings of International Symposium on cooperative Database Systems for advanced applications Proceedings of International Symposium on cooperative Database Systems for advanced applications 1996 Disclose to all
A fast and simple algorithm for identifying 2-monotonic positive functions(共著) A fast and simple algorithm for identifying 2-monotonic positive functions(共著) Algorithms and Computation LNCS1004, Srpringer Algorithms and Computation LNCS1004, Srpringer 1995 Disclose to all
The Maximum latency and Identification of positive Boolean Fanctions(共著) The Maximum latency and Identification of positive Boolean Fanctions(共著) Algorithms and Computation, LNCS 834, Springer Algorithms and Computation, LNCS 834, Springer 1994 Disclose to all

  • <<
  • >>
Title language:
External funds: competitive funds and Grants-in-Aid for Scientific Research (Kakenhi)
Type Position Title(Japanese) Title(English) Period
基盤研究(C) Representative 離散列挙アルゴリズムの基礎研究 2010-2013
新学術領域研究(研究領域提案型) Representative 数理論理学からの計算限界解析 2012-2016
新学術領域研究(研究領域提案型) Representative 数理論理学からの計算限界解析 (平成26年度分) 2014/04/01-2015/03/31
基盤研究(B) Representative 列挙構造を利用した高速アルゴリズム開発 (平成26年度分) 2014/04/01-2015/03/31
Teaching subject(s)
Name(Japanese) Name(English) Term Department Period
数学講究 Mathematics seminary 通年 理学部 2014/04-2015/03
離散最適化セミナー研究A Seminar on Discrete Optimization A 前期 理学研究科 2014/04-2015/03
離散最適化セミナー研究B Seminar on Discrete Optimization B 後期 理学研究科 2014/04-2015/03
離散最適化セミナー研究C Seminar on Discrete Optimization C 前期 理学研究科 2014/04-2015/03
離散最適化セミナー研究D Seminar on Discrete Optimization D 後期 理学研究科 2014/04-2015/03
現代の数学と数理解析 Invitation to Modern Mathematics and Mathematical Sciences 前期 全学共通科目 2014/04-2015/03
数学講究 Mathematics seminary 通年 理学部 2015/04-2016/03
離散最適化セミナー研究A Seminar on Discrete Optimization A 前期 理学研究科 2015/04-2016/03
離散最適化セミナー研究B Seminar on Discrete Optimization B 後期 理学研究科 2015/04-2016/03
離散最適化セミナー研究C Seminar on Discrete Optimization C 前期 理学研究科 2015/04-2016/03
離散最適化セミナー研究D Seminar on Discrete Optimization D 後期 理学研究科 2015/04-2016/03

  • <<
  • >>