Kazuhisa Makino

277 papers A* 9A 15B 37C 6Misc 13Journal 172Unranked 25

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	A Combinatorial Certifying Algorithm for Linear Programming Problems with Gainfree Leontief Substitution Systems. Ann. Oper. Res. Kei Kimura, Kazuhisa Makino
2025	J	`jnl`	A 3/4 differential approximation algorithm for traveling salesman problem. Theor. Comput. Sci. Yuki Amano, Kazuhisa Makino
2025	J	`jnl`	Fair Ride Allocation on a Line. ACM Trans. Economics and Comput. Yuki Amano, Ayumi Igarashi, Yasushi Kawase, Kazuhisa Makino, Hirotaka Ono
2025	J	`jnl`	Markov decision processes and stochastic games with total effective payoff. Ann. Oper. Res. Endre Boros, Khaled Elbassioni, Vladimir Gurvich, Kazuhisa Makino
2025	J	`jnl`	On Nash Equilibria in Play-Once and Terminal Deterministic Graphical Games. CoRR Endre Boros, Vladimir Gurvich, Kazuhisa Makino
2025	J	`jnl`	Popular Arborescences and Their Matroid Generalization. ACM Trans. Algorithms Telikepalli Kavitha, Kazuhisa Makino, Ildikó Schlotter, Yu Yokoi
2025	J	`jnl`	Reallocation Problems with Minimum Completion Time. Algorithmica Toshimasa Ishii, Jun Kawahara, Kazuhisa Makino, Hirotaka Ono
2025	B	`conf`	Scheduling on Identical Machines with Setup Time and Unknown Execution Time. WADS Yasushi Kawase, Kazuhisa Makino, Vinh Long Phan, Hanna Sumita
2025	J	`jnl`	Scheduling on Identical Machines with Setup Time and Unknown Execution Time. CoRR Yasushi Kawase, Kazuhisa Makino, Vinh Long Phan, Hanna Sumita
2025	J	`jnl`	Towards optimal subsidy bounds for envy-freeable allocations. Artif. Intell. Yasushi Kawase, Kazuhisa Makino, Hanna Sumita, Akihisa Tamura, Makoto Yokoo
2024	J	`jnl`	A fair and truthful mechanism with limited subsidy. Games Econ. Behav. Hiromichi Goko, Ayumi Igarashi, Yasushi Kawase, Kazuhisa Makino, Hanna Sumita, Akihisa Tamura, Yu Yokoi, Makoto Yokoo
2024	J	`jnl`	A polynomial time algorithm for finding a minimum 4-partition of a submodular function. Math. Program. Tsuyoshi Hirayama, Yuhao Liu, Kazuhisa Makino, Ke Shi, Chao Xu
2024	A*	`conf`	Arborescences, Colorful Forests, and Popularity. SODA Telikepalli Kavitha, Kazuhisa Makino, Ildikó Schlotter, Yu Yokoi
2024	J	`jnl`	Characterizing the integer points in 2-decomposable polyhedra by closedness under operations. CoRR Kei Kimura, Kazuhisa Makino, Shota Yamada, Ryo Yoshizumi
2024	B	`conf`	Composition Orderings for Linear Functions and Matrix Multiplication Orderings. ISAAC Susumu Kubo, Kazuhisa Makino, Souta Sakamoto
2024	J	`jnl`	Composition Orderings for Linear Functions and Matrix Multiplication Orderings. CoRR Susumu Kubo, Kazuhisa Makino, Souta Sakamoto
2024	J	`jnl`	Computing remoteness functions of Moore, Wythoff, and Euclid's games. Int. J. Game Theory Endre Boros, Vladimir Gurvich, Kazuhisa Makino, Michael N. Vyalyi
2024	J	`jnl`	Envy-free relaxations for goods, chores, and mixed items. Theor. Comput. Sci. Kristóf Bérczi, Erika R. Bérczi-Kovács, Endre Boros, Fekadu Tolessa Gedefa, Naoyuki Kamiyama, Telikepalli Kavitha, Yusuke Kobayashi, Kazuhisa Makino
2024	J	`jnl`	Generating minimal redundant and maximal irredundant subhypergraphs. Discret. Appl. Math. Endre Boros, Kazuhisa Makino
2024	J	`jnl`	Hypergraph Horn Functions. SIAM J. Discret. Math. Kristóf Bérczi, Endre Boros, Kazuhisa Makino
2024	J	`jnl`	Impartial games with decreasing Sprague-Grundy function and their hypergraph compound. Int. J. Game Theory Endre Boros, Vladimir Gurvich, Nhan Bao Ho, Kazuhisa Makino, Peter Mursic
2024	J	`jnl`	Matroid Horn functions. J. Comb. Theory A Kristóf Bérczi, Endre Boros, Kazuhisa Makino
2024	J	`jnl`	Perfect Matchings and Popularity in the Many-to-Many Setting. CoRR Telikepalli Kavitha, Kazuhisa Makino
2024	J	`jnl`	Recognizing distributed approval voting forms and correspondences. Ann. Oper. Res. Endre Boros, Ondrej Cepek, Vladimir Gurvich, Kazuhisa Makino
2024	A*	`conf`	Towards Optimal Subsidy Bounds for Envy-Freeable Allocations. AAAI Yasushi Kawase, Kazuhisa Makino, Hanna Sumita, Akihisa Tamura, Makoto Yokoo
2023	B	`conf`	A Combinatorial Certifying Algorithm for Linear Programming Problems with Gainfree Leontief Substitution Systems. ISAAC Kei Kimura, Kazuhisa Makino
2023	J	`jnl`	A Combinatorial Certifying Algorithm for Linear Programming Problems with Gainfree Leontief Substitution Systems. CoRR Kei Kimura, Kazuhisa Makino
2023	A*	`conf`	A Polynomial Time Algorithm for Finding a Minimum 4-Partition of a Submodular Function. SODA Tsuyoshi Hirayama, Yuhao Liu, Kazuhisa Makino, Ke Shi, Chao Xu
2023	J	`jnl`	Arborescences, Colorful Forests, and Popularity. CoRR Telikepalli Kavitha, Kazuhisa Makino, Ildikó Schlotter, Yu Yokoi
2023	J	`jnl`	Computing Remoteness Functions of Moore, Wythoff, and Euclid's games. CoRR Endre Boros, Vladimir Gurvich, Kazuhisa Makino, Michael N. Vyalyi
2023	J	`jnl`	Hypergraph Horn functions. CoRR Kristóf Bérczi, Endre Boros, Kazuhisa Makino
2023	J	`jnl`	Matroid Horn functions. CoRR Kristóf Bérczi, Endre Boros, Kazuhisa Makino
2023	—	`conf`	Perfect Matchings and Popularity in the Many-To-Many Setting. FSTTCS Telikepalli Kavitha, Kazuhisa Makino
2023	J	`jnl`	Ranking Top-$k$ Trees in Tree-Based Phylogenetic Networks. IEEE ACM Trans. Comput. Biol. Bioinform. Momoko Hayamizu, Kazuhisa Makino
2023	J	`jnl`	Towards Optimal Subsidy Bounds for Envy-freeable Allocations. CoRR Yasushi Kawase, Kazuhisa Makino, Hanna Sumita, Akihisa Tamura, Makoto Yokoo
2023	J	`jnl`	Trade-offs among degree, diameter, and number of paths. Discret. Appl. Math. Toshimasa Ishii, Akitoshi Kawamura, Yusuke Kobayashi, Kazuhisa Makino
2022	C	`conf`	A 3/4 Differential Approximation Algorithm for Traveling Salesman Problem. TAMC Yuki Amano, Kazuhisa Makino
2022	J	`jnl`	Approximating Minimum Representations of Key Horn Functions. SIAM J. Comput. Kristóf Bérczi, Endre Boros, Ondrej Cepek, Petr Kucera, Kazuhisa Makino
2022	B	`conf`	Fair Ride Allocation on a Line. SAGT Yuki Amano, Ayumi Igarashi, Yasushi Kawase, Kazuhisa Makino, Hirotaka Ono
2022	A	`conf`	Fair and Truthful Mechanism with Limited Subsidy. AAMAS Hiromichi Goko, Ayumi Igarashi, Yasushi Kawase, Kazuhisa Makino, Hanna Sumita, Akihisa Tamura, Yu Yokoi, Makoto Yokoo
2022	J	`jnl`	Finding Sparse Solutions for Packing and Covering Semidefinite Programs. SIAM J. Optim. Khaled M. Elbassioni, Kazuhisa Makino, Waleed Najy
2022	B	`conf`	Incomplete List Setting of the Hospitals/Residents Problem with Maximally Satisfying Lower Quotas. SAGT Kazuhisa Makino, Shuichi Miyazaki, Yu Yokoi
2022	J	`jnl`	Maximally Satisfying Lower Quotas in the Hospitals/Residents Problem with Ties and Incomplete Lists. CoRR Kazuhisa Makino, Shuichi Miyazaki, Yu Yokoi
2022	A	`conf`	Maximally Satisfying Lower Quotas in the Hospitals/Residents Problem with Ties. STACS Hiromichi Goko, Kazuhisa Makino, Shuichi Miyazaki, Yu Yokoi
2022	J	`jnl`	Minimizing submodular functions on diamonds via generalized fractional matroid matchings. J. Comb. Theory B Satoru Fujishige, Tamás Király, Kazuhisa Makino, Kenjiro Takazawa, Shin-ichi Tanigawa
2022	A	`conf`	Online Scheduling on Identical Machines with a Metric State Space. STACS Hiromichi Goko, Akitoshi Kawamura, Yasushi Kawase, Kazuhisa Makino, Hanna Sumita
2022	J	`jnl`	Posimodular Function Optimization. Algorithmica Magnús M. Halldórsson, Toshimasa Ishii, Kazuhisa Makino, Kenjiro Takazawa
2022	Misc	`conf`	Reallocation Problems with Minimum Completion Time. COCOON Toshimasa Ishii, Jun Kawahara, Kazuhisa Makino, Hirotaka Ono
2022	J	`jnl`	Unique key Horn functions. Theor. Comput. Sci. Kristóf Bérczi, Endre Boros, Ondrej Cepek, Petr Kucera, Kazuhisa Makino
2021	J	`jnl`	Fair and Truthful Mechanism with Limited Subsidy. CoRR Hiromichi Goko, Ayumi Igarashi, Yasushi Kawase, Kazuhisa Makino, Hanna Sumita, Akihisa Tamura, Yu Yokoi, Makoto Yokoo
2021	J	`jnl`	Generating clause sequences of a CNF formula. Theor. Comput. Sci. Kristóf Bérczi, Endre Boros, Ondrej Cepek, Khaled M. Elbassioni, Petr Kucera, Kazuhisa Makino
2021	J	`jnl`	Maximally Satisfying Lower Quotas in the Hospitals/Residents Problem with Ties. CoRR Hiromichi Goko, Kazuhisa Makino, Shuichi Miyazaki, Yu Yokoi
2021	J	`jnl`	On the Sprague-Grundy function of extensions of proper Nim. Int. J. Game Theory Endre Boros, Vladimir Gurvich, Nhan Bao Ho, Kazuhisa Makino
2021	J	`jnl`	Optimal Matroid Partitioning Problems. Algorithmica Yasushi Kawase, Kei Kimura, Kazuhisa Makino, Hanna Sumita
2021	J	`jnl`	Reallocation Problems with Minimum Completion Time. CoRR Toshimasa Ishii, Jun Kawahara, Kazuhisa Makino, Hirotaka Ono
2020	J	`jnl`	A 3/4 Differential Approximation Algorithm for Traveling Salesman Problem. CoRR Yuki Amano, Kazuhisa Makino
2020	Misc	`conf`	Approximating minimum representations of key Horn functions. ISAIM Kristóf Bérczi, Endre Boros, Ondrej Cepek, Petr Kucera, Kazuhisa Makino
2020	J	`jnl`	Enumerating Vertices of Covering Polyhedra with Totally Unimodular Constraint Matrices. SIAM J. Discret. Math. Khaled M. Elbassioni, Kazuhisa Makino
2020	J	`jnl`	Envy-free Relaxations for Goods, Chores, and Mixed Items. CoRR Kristóf Bérczi, Erika R. Bérczi-Kovács, Endre Boros, Fekadu Tolessa Gedefa, Naoyuki Kamiyama, Telikepalli Kavitha, Yusuke Kobayashi, Kazuhisa Makino
2020	J	`jnl`	Fair Ride Allocation on a Line. CoRR Yuki Amano, Ayumi Igarashi, Yasushi Kawase, Kazuhisa Makino, Hirotaka Ono
2020	J	`jnl`	Generating clause sequences of a CNF formula. CoRR Kristóf Bérczi, Endre Boros, Ondrej Cepek, Khaled M. Elbassioni, Petr Kucera, Kazuhisa Makino
2020	J	`jnl`	On Expressing Majority as a Majority of Majorities. SIAM J. Discret. Math. Christian Engels, Mohit Garg, Kazuhisa Makino, Anup Rao
2020	C	`conf`	The Steiner Problem for Count Matroids. IWOCA Tibor Jordán, Yusuke Kobayashi, Ryoga Mahara, Kazuhisa Makino
2020	J	`jnl`	Unique key Horn functions. CoRR Kristóf Bérczi, Endre Boros, Ondrej Cepek, Petr Kucera, Kazuhisa Makino
2019	J	`jnl`	A Multiplicative Weight Updates Algorithm for Packing and Covering Semi-infinite Linear Programs. Algorithmica Khaled M. Elbassioni, Kazuhisa Makino, Waleed Najy
2019	J	`jnl`	A pseudo-polynomial algorithm for mean payoff stochastic games with perfect information and few random positions. Inf. Comput. Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
2019	B	`conf`	Online Knapsack Problems with a Resource Buffer. ISAAC Xin Han, Yasushi Kawase, Kazuhisa Makino, Haruki Yokomaku
2019	J	`jnl`	Online Knapsack Problems with a Resource Buffer. CoRR Xin Han, Yasushi Kawase, Kazuhisa Makino, Haruki Yokomaku
2019	J	`jnl`	Online knapsack problem under concave functions. Theor. Comput. Sci. Xin Han, Qinyang Chen, Kazuhisa Makino
2019	A	`conf`	Oracle-Based Primal-Dual Algorithms for Packing and Covering Semidefinite Programs. ESA Khaled M. Elbassioni, Kazuhisa Makino
2019	J	`jnl`	Proportional cost buyback problem with weight bounds. Theor. Comput. Sci. Yasushi Kawase, Xin Han, Kazuhisa Makino
2019	J	`jnl`	Ranking top-k trees in tree-based phylogenetic networks. CoRR Momoko Hayamizu, Kazuhisa Makino
2019	J	`jnl`	Sprague-Grundy function of matroids and related hypergraphs. Theor. Comput. Sci. Endre Boros, Vladimir Gurvich, Nhan Bao Ho, Kazuhisa Makino, Peter Mursic
2019	J	`jnl`	Sprague-Grundy function of symmetric hypergraphs. J. Comb. Theory A Endre Boros, Vladimir Gurvich, Nhan Bao Ho, Kazuhisa Makino, Peter Mursic
2019	J	`jnl`	Surrogate optimization for p-norms. Discret. Optim. Yasushi Kawase, Kazuhisa Makino
2019	J	`jnl`	Total dual integrality of the linear complementarity problem. Ann. Oper. Res. Hanna Sumita, Naonori Kakimura, Kazuhisa Makino
2019	J	`jnl`	Unit Cost Buyback Problem. Theory Comput. Syst. Yasushi Kawase, Xin Han, Kazuhisa Makino
2018	J	`jnl`	A Potential Reduction Algorithm for Two-Person Zero-Sum Mean Payoff Stochastic Games. Dyn. Games Appl. Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
2018	J	`jnl`	Approximating minimum representations of key Horn functions. CoRR Kristóf Bérczi, Endre Boros, Ondrej Cepek, Petr Kucera, Kazuhisa Makino
2018	J	`jnl`	Approximation Schemes for Stochastic Mean Payoff Games with Perfect Information and Few Random Positions. Algorithmica Endre Boros, Khaled M. Elbassioni, Mahmoud Fouz, Vladimir Gurvich, Kazuhisa Makino, Bodo Manthey
2018	—	`conf`	Enumerating Vertices of 0/1-Polyhedra associated with 0/1-Totally Unimodular Matrices. SWAT Khaled M. Elbassioni, Kazuhisa Makino
2018	J	`jnl`	Finding Sparse Solutions for Packing and Covering Semidefinite Programs. CoRR Khaled M. Elbassioni, Kazuhisa Makino
2018	A*	`conf`	Linear Satisfiability Preserving Assignments (Extended Abstract). IJCAI Kei Kimura, Kazuhisa Makino
2018	J	`jnl`	Linear Satisfiability Preserving Assignments. J. Artif. Intell. Res. Kei Kimura, Kazuhisa Makino
2018	J	`jnl`	On the Sprague-Grundyfunction of Exact k-Nim. Discret. Appl. Math. Endre Boros, Vladimir Gurvich, Nhan Bao Ho, Kazuhisa Makino, Peter Mursic
2018	J	`jnl`	Optimal Composition Ordering Problems for Piecewise Linear Functions. Algorithmica Yasushi Kawase, Kazuhisa Makino, Kento Seimi
2018	J	`jnl`	Parameterized Edge Hamiltonicity. Discret. Appl. Math. Michael Lampis, Kazuhisa Makino, Valia Mitsou, Yushi Uno
2017	J	`jnl`	A convex programming-based algorithm for mean payoff stochastic games with perfect information. Optim. Lett. Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
2017	J	`jnl`	A nested family of $\varvec{k}$ -total effective rewards for positional games. Int. J. Game Theory Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
2017	J	`jnl`	Enumerating Vertices of $0/1$-Polyhedra associated with $0/1$-Totally Unimodular Matrices. CoRR Khaled M. Elbassioni, Kazuhisa Makino
2017	J	`jnl`	Guest Editors' Foreword. Algorithmica Khaled M. Elbassioni, Kazuhisa Makino
2017	J	`jnl`	On Expressing Majority as a Majority of Majorities. Electron. Colloquium Comput. Complex. Christian Engels, Mohit Garg, Kazuhisa Makino, Anup Rao
2017	Misc	`conf`	Online Knapsack Problem Under Concave Functions. FAW Xin Han, Ning Ma, Kazuhisa Makino, He Chen
2017	B	`conf`	Optimal Matroid Partitioning Problems. ISAAC Yasushi Kawase, Kei Kimura, Kazuhisa Makino, Hanna Sumita
2017	J	`jnl`	Optimal Matroid Partitioning Problems. CoRR Yasushi Kawase, Kei Kimura, Kazuhisa Makino, Hanna Sumita
2017	J	`jnl`	Parameterized Complexity of Sparse Linear Complementarity Problems. Algorithmica Hanna Sumita, Naonori Kakimura, Kazuhisa Makino
2017	B	`conf`	Posimodular Function Optimization. WADS Magnús M. Halldórsson, Toshimasa Ishii, Kazuhisa Makino, Kenjiro Takazawa
2017	B	`conf`	Strong Duality in Horn Minimization. FCT Endre Boros, Ondrej Cepek, Kazuhisa Makino
2016	J	`jnl`	A Convex Programming-based Algorithm for Mean Payoff Stochastic Games with Perfect Information. CoRR Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
2016	B	`conf`	A Multiplicative Weights Update Algorithm for Packing and Covering Semi-infinite Linear Programs. WAOA Khaled M. Elbassioni, Kazuhisa Makino, Waleed Najy
2016	Misc	`conf`	A combinatorial min-max theorem and minimization of pure-Horn functions. ISAIM Endre Boros, Ondrej Cepek, Kazuhisa Makino
2016	J	`jnl`	Online minimization knapsack problem. Theor. Comput. Sci. Xin Han, Kazuhisa Makino
2016	B	`conf`	Optimal Composition Ordering Problems for Piecewise Linear Functions. ISAAC Yasushi Kawase, Kazuhisa Makino, Kento Seimi
2016	J	`jnl`	Optimal Composition Ordering Problems for Piecewise Linear Functions. CoRR Yasushi Kawase, Kazuhisa Makino, Kento Seimi
2016	J	`jnl`	Sufficient conditions for the existence of Nash equilibria in bimatrix games in terms of forbidden $2 \times 2$ subgames. Int. J. Game Theory Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino, Vladimir Oudalov
2016	B	`conf`	Surrogate Optimization for p-Norms. ISAAC Yasushi Kawase, Kazuhisa Makino
2016	J	`jnl`	Trichotomy for integer linear systems based on their sign patterns. Discret. Appl. Math. Kei Kimura, Kazuhisa Makino
2015	J	`jnl`	A Potential Reduction Algorithm for Two-person Zero-sum Mean Payoff Stochastic Games. CoRR Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
2015	J	`jnl`	A Pseudo-Polynomial Algorithm for Mean Payoff Stochastic Games with Perfect Information and Few Random Positions. CoRR Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
2015	J	`jnl`	A representation of antimatroids by Horn rules and its application to educational systems. CoRR Hiyori Yoshikawa, Hiroshi Hirai, Kazuhisa Makino
2015	B	`ed.`	Algorithms and Computation - 26th International Symposium, ISAAC 2015, Nagoya, Japan, December 9-11, 2015, Proceedings ISAAC Khaled M. Elbassioni, Kazuhisa Makino
2015	J	`jnl`	Deterministic random walks on finite graphs. Random Struct. Algorithms Shuji Kijima, Kentaro Koga, Kazuhisa Makino
2015	A	`conf`	Markov Decision Processes and Stochastic Games with Total Effective Payoff. STACS Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
2015	J	`jnl`	On Randomized Fictitious Play for Approximating Saddle Points Over Convex Sets. Algorithmica Khaled M. Elbassioni, Kazuhisa Makino, Kurt Mehlhorn, Fahimeh Ramezani
2015	—	`conf`	Parameterized Algorithms for Parity Games. MFCS (2) Jakub Gajarský, Michael Lampis, Kazuhisa Makino, Valia Mitsou, Sebastian Ordyniak
2015	B	`conf`	Parameterized Complexity of Sparse Linear Complementarity Problems. IPEC Hanna Sumita, Naonori Kakimura, Kazuhisa Makino
2015	C	`conf`	Proportional Cost Buyback Problem with Weight Bounds. COCOA Yasushi Kawase, Xin Han, Kazuhisa Makino
2015	J	`jnl`	Randomized algorithms for online knapsack problems. Theor. Comput. Sci. Xin Han, Yasushi Kawase, Kazuhisa Makino
2015	J	`jnl`	The Linear Complementarity Problems with a Few Variables per Constraint. Math. Oper. Res. Hanna Sumita, Naonori Kakimura, Kazuhisa Makino
2014	C	`conf`	A Potential Reduction Algorithm for Ergodic Two-Person Zero-Sum Limiting Average Payoff Stochastic Games. COCOA Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
2014	J	`jnl`	Augmenting Edge-Connectivity between Vertex Subsets. Algorithmica Toshimasa Ishii, Kazuhisa Makino
2014	J	`jnl`	Nested Family of Cyclic Games with $k$-total Effective Rewards. CoRR Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
2014	J	`jnl`	Online Unweighted Knapsack Problem with Removal Cost. Algorithmica Xin Han, Yasushi Kawase, Kazuhisa Makino
2014	J	`jnl`	Online removable knapsack problem under convex function. Theor. Comput. Sci. Xin Han, Yasushi Kawase, Kazuhisa Makino, He Guo
2014	B	`conf`	Parameterized Edge Hamiltonicity. WG Michael Lampis, Kazuhisa Makino, Valia Mitsou, Yushi Uno
2014	J	`jnl`	Parameterized Edge Hamiltonicity. CoRR Michael Lampis, Kazuhisa Makino, Valia Mitsou, Yushi Uno
2014	J	`jnl`	Posimodular Function Optimization. CoRR Toshimasa Ishii, Kazuhisa Makino
2013	—	`conf`	A Pseudo-Polynomial Algorithm for Mean Payoff Stochastic Games with Perfect Information and a Few Random Positions. ICALP (1) Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
2013	J	`jnl`	Derandomizing the HSSW Algorithm for 3-SAT. Algorithmica Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto
2013	J	`jnl`	Nash equilibria with minimum potential in undirected broadcast games. Theor. Comput. Sci. Yasushi Kawase, Kazuhisa Makino
2013	J	`jnl`	On Canonical Forms for Zero-Sum Stochastic Mean Payoff Games. Dyn. Games Appl. Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
2013	J	`jnl`	On Randomized Fictitious Play for Approximating Saddle Points Over Convex Sets CoRR Khaled M. Elbassioni, Kazuhisa Makino, Kurt Mehlhorn, Fahimeh Ramezani
2013	Misc	`conf`	On Randomized Fictitious Play for Approximating Saddle Points over Convex Sets. COCOON Khaled M. Elbassioni, Kazuhisa Makino, Kurt Mehlhorn, Fahimeh Ramezani
2013	J	`jnl`	On discounted approximations of undiscounted stochastic games and Markov decision processes with limited randomness. Oper. Res. Lett. Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
2013	—	`conf`	Randomized Algorithms for Removable Online Knapsack Problems. FAW-AAIM Xin Han, Yasushi Kawase, Kazuhisa Makino
2013	J	`jnl`	Robust Independence Systems. SIAM J. Discret. Math. Naonori Kakimura, Kazuhisa Makino
2013	J	`jnl`	Robust Matchings and Matroid Intersections. SIAM J. Discret. Math. Ryo Fujita, Yusuke Kobayashi, Kazuhisa Makino
2013	C	`conf`	Sparse Linear Complementarity Problems. CIAC Hanna Sumita, Naonori Kakimura, Kazuhisa Makino
2013	B	`conf`	Unit Cost Buyback Problem. ISAAC Yasushi Kawase, Xin Han, Kazuhisa Makino
2012	J	`jnl`	Caching Is Hard - Even in the Fault Model. Algorithmica Marek Chrobak, Gerhard J. Woeginger, Kazuhisa Makino, Haifeng Xu
2012	J	`jnl`	Deductive inference for the interiors and exteriors of horn theories. ACM Trans. Comput. Log. Kazuhisa Makino, Hirotaka Ono
2012	—	`conf`	Deterministic Random Walks on Finite Graphs. ANALCO Shuji Kijima, Kentaro Koga, Kazuhisa Makino
2012	—	`conf`	Interactive regret minimization. SIGMOD Conference Danupon Nanongkai, Ashwin Lall, Atish Das Sarma, Kazuhisa Makino
2012	B	`conf`	Nash Equilibria with Minimum Potential in Undirected Broadcast Games. WALCOM Yasushi Kawase, Kazuhisa Makino
2012	J	`jnl`	On Nash equilibria and improvement cycles in pure positional strategies for Chess-like and Backgammon-like n-person games. Discret. Math. Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
2012	Misc	`conf`	Online Knapsack Problem with Removal Cost. COCOON Xin Han, Yasushi Kawase, Kazuhisa Makino
2012	Misc	`conf`	Source Location Problems with Flow Requirements. ICNC Kazuhisa Makino
2012	A	`conf`	Trichotomy for Integer Linear Systems Based on Their Sign Patterns. STACS Kei Kimura, Kazuhisa Makino
2011	J	`jnl`	An exact algorithm for the Boolean connectivity problem for k-CNF. Theor. Comput. Sci. Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto
2011	B	`conf`	Computing Knapsack Solutions with Cardinality Robustness. ISAAC Naonori Kakimura, Kazuhisa Makino, Kento Seimi
2011	J	`jnl`	Derandomizing HSSW Algorithm for 3-SAT CoRR Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto
2011	Misc	`conf`	Derandomizing HSSW Algorithm for 3-SAT. COCOON Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto
2011	J	`jnl`	Finding Simplices containing the Origin in Two and Three Dimensions. Int. J. Comput. Geom. Appl. Khaled M. Elbassioni, Amr Elmasry, Kazuhisa Makino
2011	J	`jnl`	Logical analysis of data: classification with justification. Ann. Oper. Res. Endre Boros, Yves Crama, Peter L. Hammer, Toshihide Ibaraki, Alexander Kogan, Kazuhisa Makino
2011	J	`jnl`	Nash-solvable two-person symmetric cycle game forms. Discret. Appl. Math. Endre Boros, Vladimir Gurvich, Kazuhisa Makino, Wei Shao
2011	J	`jnl`	Nonadaptive broadcasting in trees. Networks Hovhannes A. Harutyunyan, Arthur L. Liestman, Kazuhisa Makino, Thomas C. Shermer
2011	J	`jnl`	On the readability of monotone Boolean formulae. J. Comb. Optim. Khaled M. Elbassioni, Kazuhisa Makino, Imran Rauf
2011	—	`conf`	Robust Independence Systems. ICALP (1) Naonori Kakimura, Kazuhisa Makino
2011	—	`conf`	Stochastic Mean Payoff Games: Smoothed Analysis and Approximation Schemes. ICALP (1) Endre Boros, Khaled M. Elbassioni, Mahmoud Fouz, Vladimir Gurvich, Kazuhisa Makino, Bodo Manthey
2010	B	`conf`	A Pumping Algorithm for Ergodic Stochastic Mean Payoff Games with Perfect Information. IPCO Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
2010	J	`jnl`	Acyclic, or totally tight, two-person game forms: Characterization and main properties. Discret. Math. Endre Boros, Vladimir Gurvich, Kazuhisa Makino, Dávid Papp
2010	A	`conf`	An Exact Algorithm for the Boolean Connectivity Problem for SAT Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto
2010	—	`conf`	Caching Is Hard - Even in the Fault Model. ESA (1) Marek Chrobak, Gerhard J. Woeginger, Kazuhisa Makino, Haifeng Xu
2010	J	`jnl`	Left-to-Right Multiplication for Monotone Boolean Dualization. SIAM J. Comput. Endre Boros, Khaled M. Elbassioni, Kazuhisa Makino
2010	J	`jnl`	On effectivity functions of game forms. Games Econ. Behav. Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
2010	J	`jnl`	On the Boolean connectivity problem for Horn relations. Discret. Appl. Math. Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto
2010	J	`jnl`	Online removable knapsack with limited cuts. Theor. Comput. Sci. Xin Han, Kazuhisa Makino
2010	J	`jnl`	Posi-Modular Systems with Modulotone Requirements under Permutation Constraints. Discret. Math. Algorithms Appl. Toshimasa Ishii, Kazuhisa Makino
2010	—	`conf`	Robust Matchings and Matroid Intersections. ESA (2) Ryo Fujita, Yusuke Kobayashi, Kazuhisa Makino
2009	—	`conf`	A Fast and Simple Parallel Algorithm for the Monotone Duality Problem. ICALP (1) Endre Boros, Kazuhisa Makino
2009	—	`conf`	Augmenting Edge-Connectivity between Vertex Subsets. CATS Toshimasa Ishii, Kazuhisa Makino
2009	J	`jnl`	Deductive Inference for the Interiors and Exteriors of Horn Theories CoRR Kazuhisa Makino, Hirotaka Ono
2009	J	`jnl`	Minimal and locally minimal games and game forms. Discret. Math. Endre Boros, Vladimir Gurvich, Kazuhisa Makino
2009	J	`jnl`	Minimum Transversals in Posimodular Systems. SIAM J. Discret. Math. Mariko Sakashita, Kazuhisa Makino, Hiroshi Nagamochi, Satoru Fujishige
2009	Misc	`conf`	On the Readability of Monotone Boolean Formulae. COCOON Khaled M. Elbassioni, Kazuhisa Makino, Imran Rauf
2009	J	`jnl`	On the fractional chromatic number of monotone self-dual Boolean functions. Discret. Math. Daya Ram Gaur, Kazuhisa Makino
2009	B	`conf`	Online Knapsack Problems with Limited Cuts. ISAAC Xin Han, Kazuhisa Makino
2009	B	`conf`	Online Minimization Knapsack Problem. WAOA Xin Han, Kazuhisa Makino
2009	A	`conf`	Output-Sensitive Algorithms for Enumerating Minimal Transversals for Some Geometric Hypergraphs. ESA Khaled M. Elbassioni, Kazuhisa Makino, Imran Rauf
2009	B	`conf`	Posi-modular Systems with Modulotone Requirements under Permutation Constraints. ISAAC Toshimasa Ishii, Kazuhisa Makino
2008	Misc	`conf`	A Complete Characterization of Nash-Solvability of Bimatrix Games in Terms of the Exclusion of Certain 2×2 Subgames. CSR Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino, Vladimir Oudalov
2008	J	`jnl`	Computational aspects of monotone dualization: A brief survey. Discret. Appl. Math. Thomas Eiter, Kazuhisa Makino, Georg Gottlob
2008	B	`conf`	Deductive Inference for the Interiors and Exteriors of Horn Theories. ISAAC Kazuhisa Makino, Hirotaka Ono
2008	J	`jnl`	Generating Cut Conjunctions in Graphs and Related Problems. Algorithmica Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
2008	J	`jnl`	Minimizing a monotone concave function with laminar covering constraints. Discret. Appl. Math. Mariko Sakashita, Kazuhisa Makino, Satoru Fujishige
2008	J	`jnl`	Minimum Cost Source Location Problems with Flow Requirements. Algorithmica Mariko Sakashita, Kazuhisa Makino, Satoru Fujishige
2008	A	`conf`	New Results for Horn Cores and Envelopes of Horn Disjunctions. ECAI Thomas Eiter, Kazuhisa Makino
2008	—	`conf`	On Berge Multiplication for Monotone Boolean Dualization. ICALP (1) Endre Boros, Khaled M. Elbassioni, Kazuhisa Makino
2007	J	`jnl`	A Dichotomy Theorem within Schaefer for the Boolean Connectivity Problem. Electron. Colloquium Comput. Complex. Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto
2007	J	`jnl`	Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data. Theor. Comput. Sci. Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
2007	J	`jnl`	Enumerating disjunctions and conjunctions of paths and cuts in reliability theory. Discret. Appl. Math. Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
2007	—	`conf`	Finding Intersections of Bichromatic Segments Defined by Points. CCCG Amr Elmasry, Kazuhisa Makino
2007	Misc	`conf`	Generating Minimal k-Vertex Connected Spanning Subgraphs. COCOON Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino, Gábor Rudolf
2007	J	`jnl`	On computing all abductive explanations from a propositional Horn theory. J. ACM Thomas Eiter, Kazuhisa Makino
2007	A	`conf`	On the Boolean Connectivity Problem for Horn Relations. SAT Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto
2007	Misc	`conf`	On the Fractional Chromatic Number of Monotone Self-dual Boolean Functions. FAW Daya Ram Gaur, Kazuhisa Makino
2006	J	`jnl`	An O(n log Discret. Appl. Math. Satoko Mamada, Takeaki Uno, Kazuhisa Makino, Satoru Fujishige
2006	A	`conf`	Enumerating Spanning and Connected Subsets in Graphs and Matroids. ESA Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
2006	J	`jnl`	How to collect balls moving in the Euclidean plane. Discret. Appl. Math. Yuichi Asahiro, Takashi Horiyama, Kazuhisa Makino, Hirotaka Ono, Toshinori Sakuma, Masafumi Yamashita
2006	B	`conf`	Minimum Cost Source Location Problems with Flow Requirements. LATIN Mariko Sakashita, Kazuhisa Makino, Satoru Fujishige
2006	A	`conf`	Minimum Transversals in Posi-modular Systems. ESA Mariko Sakashita, Kazuhisa Makino, Hiroshi Nagamochi, Satoru Fujishige
2006	J	`jnl`	Minimum edge ranking spanning trees of split graphs. Discret. Appl. Math. Kazuhisa Makino, Yushi Uno, Toshihide Ibaraki
2005	B	`conf`	Generating Cut Conjunctions and Bridge Avoiding Extensions in Graphs. ISAAC Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
2005	B	`conf`	Minimizing a Monotone Concave Function with Laminar Covering Constraints. ISAAC Mariko Sakashita, Kazuhisa Makino, Satoru Fujishige
2005	J	`jnl`	On the Complexity of Some Enumeration Problems for Matroids. SIAM J. Discret. Math. Leonid G. Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
2005	J	`jnl`	Special Section on Discrete Mathematics and Its Applications. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Kazuhisa Makino
2004	—	`conf`	An O(n log 2n) Algorithm for the Optimal Sink Location Problem in Dynamic Tree Networks. IFIP TCS Satoko Mamada, Takeaki Uno, Kazuhisa Makino, Satoru Fujishige
2004	J	`jnl`	Dual-bounded generating problems: weighted transversals of a hypergraph. Discret. Appl. Math. Endre Boros, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino
2004	B	`conf`	Generating Paths and Cuts in Multi-pole (Di)graphs. MFCS Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino
2004	—	`conf`	How to Collect Balls Moving in the Euclidean Plane. CATS Yuichi Asahiro, Takashi Horiyama, Kazuhisa Makino, Hirotaka Ono, Toshinori Sakuma, Masafumi Yamashita
2004	—	`conf`	New Algorithms for Enumerating All Maximal Cliques. SWAT Kazuhisa Makino, Takeaki Uno
2004	J	`jnl`	Polybasic polyhedra: structure of polyhedra with edge vectors of support size at most 2. Discret. Math. Satoru Fujishige, Kazuhisa Makino, Takashi Takabatake, Kenji Kashiwabara
2003	B	`conf`	Abduction and the Dualization Problem. Discovery Science Thomas Eiter, Kazuhisa Makino
2003	A*	`conf`	An Intersection Inequality for Discrete Distributions and Related Generation Problems. ICALP Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino
2003	J	`jnl`	Efficient dualization of O(log n)-term monotone disjunctive normal forms. Discret. Appl. Math. Kazuhisa Makino
2003	J	`jnl`	Finding Essential Attributes from Binary Data. Ann. Math. Artif. Intell. Endre Boros, Takashi Horiyama, Toshihide Ibaraki, Kazuhisa Makino, Mutsunori Yagiura
2003	B	`conf`	Generating All Abductive Explanations for Queries on Propositional Horn Theories. CSL Thomas Eiter, Kazuhisa Makino
2003	J	`jnl`	Inferring Minimal Functional Dependencies in Horn and q-Horn Theories. Ann. Math. Artif. Intell. Toshihide Ibaraki, Alexander Kogan, Kazuhisa Makino
2003	J	`jnl`	Interior and exterior functions of positive Boolean functions. Discret. Appl. Math. Kazuhisa Makino, Hirotaka Ono, Toshihide Ibaraki
2003	J	`jnl`	New Results on Monotone Dualization and Generating Hypergraph Transversals. SIAM J. Comput. Thomas Eiter, Georg Gottlob, Kazuhisa Makino
2003	J	`jnl`	On Maximal Frequent and Minimal Infrequent Sets in Binary Matrices. Ann. Math. Artif. Intell. Endre Boros, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino
2003	J	`jnl`	Source location problem with flow requirements in directed networks. Optim. Methods Softw. Hiro Ito, Kazuhisa Makino, Kouji Arata, Shoji Honami, Yuichiro Itatsu, Satoru Fujishige
2003	J	`jnl`	Variations on extending partially defined Boolean functions with missing bits. Inf. Comput. Endre Boros, Toshihide Ibaraki, Kazuhisa Makino
2002	J	`jnl`	A linear time algorithm for recognizing regular Boolean functions. J. Algorithms Kazuhisa Makino
2002	J	`jnl`	A simple matching algorithm for regular bipartite graphs. Inf. Process. Lett. Kazuhisa Makino, Takashi Takabatake, Satoru Fujishige
2002	J	`jnl`	Decision lists and related Boolean functions. Theor. Comput. Sci. Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino
2002	J	`jnl`	Dual-Bounded Generating Problems: All Minimal Integer Solutions for a Monotone System of Linear Inequalities. SIAM J. Comput. Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino
2002	J	`jnl`	Locating Sources to Meet Flow Demands in Undirected Networks. J. Algorithms Kouji Arata, Satoru Iwata, Kazuhisa Makino, Satoru Fujishige
2002	J	`jnl`	Logical analysis of data with decomposable structures. Theor. Comput. Sci. Hirotaka Ono, Kazuhisa Makino, Toshihide Ibaraki
2002	J	`jnl`	Max- and Min-Neighborhood Monopolies. Algorithmica Kazuhisa Makino, Masafumi Yamashita, Tiko Kameda
2002	B	`conf`	Minimum Edge Ranking Spanning Trees of Threshold Graphs. ISAAC Kazuhisa Makino, Yushi Uno, Toshihide Ibaraki
2002	J	`jnl`	New Results on Monotone Dualization and Generating Hypergraph Transversals CoRR Thomas Eiter, Georg Gottlob, Kazuhisa Makino
2002	A*	`conf`	New results on monotone dualization and generating hypergraph transversals. STOC Thomas Eiter, Georg Gottlob, Kazuhisa Makino
2002	—	`conf`	On Computing all Abductive Explanations. AAAI/IAAI Thomas Eiter, Kazuhisa Makino
2002	A	`conf`	On the Complexity of Generating Maximal Frequent and Minimal Infrequent Sets. STACS Endre Boros, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino
2002	J	`jnl`	Optimal Sink Location Problem for Dynamic Flows in a Tree Network. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Satoko Mamada, Kazuhisa Makino, Satoru Fujishige
2002	J	`jnl`	Recognition and dualization of disguised bidual Horn functions. Inf. Process. Lett. Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino
2001	J	`jnl`	A Satisfiability Formulation of Problems on Level Graphs. Electron. Notes Discret. Math. Bert Randerath, Ewald Speckenmeyer, Endre Boros, Peter L. Hammer, Alexander Kogan, Kazuhisa Makino, Bruno Simeone, Ondrej Cepek
2001	J	`jnl`	Disjunctions of Horn Theories and Their Cores. SIAM J. Comput. Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino
2001	A*	`conf`	On Generating All Minimal Integer Solutions for a Monotone System of Linear Inequalities. ICALP Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino
2001	J	`jnl`	On Minimum Edge Ranking Spanning Trees. J. Algorithms Kazuhisa Makino, Yushi Uno, Toshihide Ibaraki
2001	J	`jnl`	On functional dependencies in q-Horn theories. Artif. Intell. Toshihide Ibaraki, Alexander Kogan, Kazuhisa Makino
2001	J	`jnl`	Transformations on Regular Nondominated Coteries and Their Applications. SIAM J. Discret. Math. Kazuhisa Makino, Tiko Kameda
2000	J	`jnl`	Dual-Bounded Generating Problems: Partial and Multiple Transversals of a Hypergraph. SIAM J. Comput. Endre Boros, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino
2000	A*	`conf`	Efficient generation of all regular non-dominated coteries. PODC Kazuhisa Makino, Tiko Kameda
2000	C	`conf`	Finding Essential Attributes in Binary Data. IDEAL Endre Boros, Takashi Horiyama, Toshihide Ibaraki, Kazuhisa Makino, Mutsunori Yagiura
2000	—	`conf`	Fully Consistent Extensions of Partially Defined Boolean Functions with Missing Bits. IFIP TCS Endre Boros, Toshihide Ibaraki, Kazuhisa Makino
2000	A*	`conf`	Generating Partial and Multiple Transversals of a Hypergraph. ICALP Endre Boros, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino
2000	—	`conf`	Locating Sources to Meet Flow Demands in Undirected Networks. SWAT Kouji Arata, Satoru Iwata, Kazuhisa Makino, Satoru Fujishige
2000	Misc	`conf`	Logical Analysis of Data with Decomposable Structures. COCOON Hirotaka Ono, Kazuhisa Makino, Toshihide Ibaraki
2000	—	`conf`	Max- and Min-Neighborhood Monopolies. SWAT Kazuhisa Makino, Masafumi Yamashita, Tiko Kameda
2000	J	`jnl`	On the Difference of Horn Theories. J. Comput. Syst. Sci. Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino
1999	B	`conf`	A Linear Time Algorithm for Recognizing Regular Boolean Functions. ISAAC Kazuhisa Makino
1999	J	`jnl`	Bidual Horn Functions and Extensions. Discret. Appl. Math. Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino
1999	J	`jnl`	Computing Intersections of Horn Theories for Reasoning with Models. Artif. Intell. Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino
1999	J	`jnl`	Functional Dependencies in Horn Theories. Artif. Intell. Toshihide Ibaraki, Alexander Kogan, Kazuhisa Makino
1999	J	`jnl`	Horn Extensions of a Partially Defined Boolean Function. SIAM J. Comput. Kazuhisa Makino, Ken'ichi Hatanaka, Toshihide Ibaraki
1999	J	`jnl`	Inner-core and Outer-core Functions of Partially Defined Boolean Functions. Discret. Appl. Math. Kazuhisa Makino, Toshihide Ibaraki
1999	J	`jnl`	Logical Analysis of Binary Data with Missing Bits. Artif. Intell. Endre Boros, Toshihide Ibaraki, Kazuhisa Makino
1999	J	`jnl`	Minimum Self-dual Decompositions of Positive Dual-minor Boolean Functions. Discret. Appl. Math. Jan C. Bioch, Toshihide Ibaraki, Kazuhisa Makino
1999	B	`conf`	On Minimum Edge Ranking Spanning Trees. MFCS Kazuhisa Makino, Yushi Uno, Toshihide Ibaraki
1999	A	`conf`	On the Difference of Horn Theories. STACS Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino
1998	J	`jnl`	A Fast and Simple Algorithm for Identifying 2-Monotonic Positive Boolean Functions. J. Algorithms Kazuhisa Makino, Toshihide Ibaraki
1998	—	`conf`	Computing Intersections of Horn Theories for Reasoning with Models. AAAI/IAAI Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino
1998	B	`conf`	Disjunctions of Horn Theories and Their Cores. ISAAC Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino
1998	J	`jnl`	Double Horn Functions. Inf. Comput. Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino
1998	J	`jnl`	Error-Free and Best-Fit Extensions of Partially Defined Boolean Functions. Inf. Comput. Endre Boros, Toshihide Ibaraki, Kazuhisa Makino
1998	A	`conf`	On Disguised Double Horn Functions and Extensions. STACS Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino
1997	B	`conf`	Monotone Extensions of Boolean Data Sets. ALT Endre Boros, Toshihide Ibaraki, Kazuhisa Makino
1997	J	`jnl`	Positive and Horn Decomposability of Partially Defined Boolean Functions. Discret. Appl. Math. Kazuhisa Makino, Kojin Yano, Toshihide Ibaraki
1997	J	`jnl`	The Maximum Latency and Identification of Positive Boolean Functions. SIAM J. Comput. Kazuhisa Makino, Toshihide Ibaraki
1997	B	`conf`	Two-Face Horn Extensions. ISAAC Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino
1996	—	`conf`	Boolean Analysis of Incomplete Examples. SWAT Endre Boros, Toshihide Ibaraki, Kazuhisa Makino
1996	—	`conf`	Data Analysis by Positive Decision Trees. CODAS Kazuhisa Makino, Takashi Suda, Kojin Yano, Toshihide Ibaraki
1996	J	`jnl`	Interior and Exterior Functions of Boolean Functions. Discret. Appl. Math. Kazuhisa Makino, Toshihide Ibaraki
1995	B	`conf`	A Fast and Simple Algorithm for Identifying 2-Monotonic Positive Boolean Functions. ISAAC Kazuhisa Makino, Toshihide Ibaraki
1994	B	`conf`	The Maximum Latency and Identification of Positive Boolean Functions. ISAAC Kazuhisa Makino, Toshihide Ibaraki