default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKazuhisa Makino
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j123]Endre Boros, Ondrej Cepek, Vladimir Gurvich
, Kazuhisa Makino:
Recognizing distributed approval voting forms and correspondences. Ann. Oper. Res. 336(3): 2091-2110 (2024)- [j122]Endre Boros, Kazuhisa Makino:
Generating minimal redundant and maximal irredundant subhypergraphs. Discret. Appl. Math. 358: 217-229 (2024) - [j121]Hiromichi Goko, Ayumi Igarashi, Yasushi Kawase, Kazuhisa Makino, Hanna Sumita, Akihisa Tamura, Yu Yokoi, Makoto Yokoo:
A fair and truthful mechanism with limited subsidy. Games Econ. Behav. 144: 49-70 (2024) - [j120]Kristóf Bérczi, Endre Boros, Kazuhisa Makino:
Matroid Horn functions. J. Comb. Theory A 203: 105838 (2024) - [j119]Tsuyoshi Hirayama, Yuhao Liu, Kazuhisa Makino, Ke Shi, Chao Xu:
A polynomial time algorithm for finding a minimum 4-partition of a submodular function. Math. Program. 207(1): 717-732 (2024) - [j118]Kristóf Bérczi, Endre Boros, Kazuhisa Makino:
Hypergraph Horn Functions. SIAM J. Discret. Math. 38(2): 1417-1437 (2024) - [j117]Kristóf Bérczi, Erika R. Bérczi-Kovács, Endre Boros, Fekadu Tolessa Gedefa, Naoyuki Kamiyama, Telikepalli Kavitha, Yusuke Kobayashi, Kazuhisa Makino:
Envy-free relaxations for goods, chores, and mixed items. Theor. Comput. Sci. 1002: 114596 (2024) - [c102]Yasushi Kawase, Kazuhisa Makino, Hanna Sumita, Akihisa Tamura, Makoto Yokoo:
Towards Optimal Subsidy Bounds for Envy-Freeable Allocations. AAAI 2024: 9824-9831 - [c101]Telikepalli Kavitha, Kazuhisa Makino, Ildikó Schlotter, Yu Yokoi:
Arborescences, Colorful Forests, and Popularity. SODA 2024: 3724-3746 - [i37]Kei Kimura, Kazuhisa Makino, Shota Yamada, Ryo Yoshizumi:
Characterizing the integer points in 2-decomposable polyhedra by closedness under operations. CoRR abs/2401.06405 (2024) - [i36]Susumu Kubo, Kazuhisa Makino, Souta Sakamoto:
Composition Orderings for Linear Functions and Matrix Multiplication Orderings. CoRR abs/2402.10451 (2024) - 2023
- [j116]Toshimasa Ishii, Akitoshi Kawamura, Yusuke Kobayashi, Kazuhisa Makino:
Trade-offs among degree, diameter, and number of paths. Discret. Appl. Math. 327: 96-100 (2023) - [j115]Momoko Hayamizu, Kazuhisa Makino:
Ranking Top-$k$ Trees in Tree-Based Phylogenetic Networks. IEEE ACM Trans. Comput. Biol. Bioinform. 20(3): 2349-2355 (2023) - [c100]Telikepalli Kavitha, Kazuhisa Makino:
Perfect Matchings and Popularity in the Many-To-Many Setting. FSTTCS 2023: 43:1-43:16 - [c99]Kei Kimura, Kazuhisa Makino:
A Combinatorial Certifying Algorithm for Linear Programming Problems with Gainfree Leontief Substitution Systems. ISAAC 2023: 47:1-47:17 - [c98]Tsuyoshi Hirayama, Yuhao Liu, Kazuhisa Makino, Ke Shi, Chao Xu:
A Polynomial Time Algorithm for Finding a Minimum 4-Partition of a Submodular Function. SODA 2023: 1680-1691 - [i35]Kristóf Bérczi, Endre Boros, Kazuhisa Makino:
Hypergraph Horn functions. CoRR abs/2301.05461 (2023) - [i34]Kristóf Bérczi, Endre Boros, Kazuhisa Makino:
Matroid Horn functions. CoRR abs/2301.06642 (2023) - [i33]Kei Kimura, Kazuhisa Makino:
A Combinatorial Certifying Algorithm for Linear Programming Problems with Gainfree Leontief Substitution Systems. CoRR abs/2306.03368 (2023) - [i32]Yasushi Kawase, Kazuhisa Makino, Hanna Sumita, Akihisa Tamura, Makoto Yokoo:
Towards Optimal Subsidy Bounds for Envy-freeable Allocations. CoRR abs/2308.11230 (2023) - [i31]Telikepalli Kavitha, Kazuhisa Makino, Ildikó Schlotter, Yu Yokoi:
Arborescences, Colorful Forests, and Popularity. CoRR abs/2310.19455 (2023) - [i30]Endre Boros, Vladimir Gurvich, Kazuhisa Makino, Michael N. Vyalyi:
Computing Remoteness Functions of Moore, Wythoff, and Euclid's games. CoRR abs/2311.02685 (2023) - 2022
- [j114]Magnús M. Halldórsson, Toshimasa Ishii, Kazuhisa Makino, Kenjiro Takazawa:
Posimodular Function Optimization. Algorithmica 84(4): 1107-1131 (2022) - [j113]Satoru Fujishige, Tamás Király, Kazuhisa Makino, Kenjiro Takazawa, Shin-ichi Tanigawa:
Minimizing submodular functions on diamonds via generalized fractional matroid matchings. J. Comb. Theory B 157: 294-345 (2022) - [j112]Kristóf Bérczi, Endre Boros, Ondrej Cepek, Petr Kucera, Kazuhisa Makino:
Approximating Minimum Representations of Key Horn Functions. SIAM J. Comput. 51(1): 116-138 (2022) - [j111]Khaled M. Elbassioni, Kazuhisa Makino, Waleed Najy:
Finding Sparse Solutions for Packing and Covering Semidefinite Programs. SIAM J. Optim. 32(2): 321-353 (2022) - [j110]Kristóf Bérczi, Endre Boros, Ondrej Cepek, Petr Kucera, Kazuhisa Makino:
Unique key Horn functions. Theor. Comput. Sci. 922: 170-178 (2022) - [c97]Hiromichi Goko, Ayumi Igarashi, Yasushi Kawase, Kazuhisa Makino, Hanna Sumita, Akihisa Tamura, Yu Yokoi, Makoto Yokoo:
Fair and Truthful Mechanism with Limited Subsidy. AAMAS 2022: 534-542 - [c96]Toshimasa Ishii, Jun Kawahara, Kazuhisa Makino, Hirotaka Ono:
Reallocation Problems with Minimum Completion Time. COCOON 2022: 292-304 - [c95]Yuki Amano, Ayumi Igarashi, Yasushi Kawase, Kazuhisa Makino, Hirotaka Ono:
Fair Ride Allocation on a Line. SAGT 2022: 421-435 - [c94]Kazuhisa Makino, Shuichi Miyazaki, Yu Yokoi:
Incomplete List Setting of the Hospitals/Residents Problem with Maximally Satisfying Lower Quotas. SAGT 2022: 544-561 - [c93]Hiromichi Goko, Kazuhisa Makino, Shuichi Miyazaki, Yu Yokoi:
Maximally Satisfying Lower Quotas in the Hospitals/Residents Problem with Ties. STACS 2022: 31:1-31:20 - [c92]Hiromichi Goko, Akitoshi Kawamura, Yasushi Kawase, Kazuhisa Makino, Hanna Sumita:
Online Scheduling on Identical Machines with a Metric State Space. STACS 2022: 32:1-32:21 - [c91]Yuki Amano, Kazuhisa Makino:
A 3/4 Differential Approximation Algorithm for Traveling Salesman Problem. TAMC 2022: 237-248 - [i29]Kazuhisa Makino, Shuichi Miyazaki, Yu Yokoi:
Maximally Satisfying Lower Quotas in the Hospitals/Residents Problem with Ties and Incomplete Lists. CoRR abs/2203.06660 (2022) - 2021
- [j109]Yasushi Kawase, Kei Kimura, Kazuhisa Makino, Hanna Sumita:
Optimal Matroid Partitioning Problems. Algorithmica 83(6): 1653-1676 (2021) - [j108]Endre Boros, Vladimir Gurvich, Nhan Bao Ho, Kazuhisa Makino:
On the Sprague-Grundy function of extensions of proper Nim. Int. J. Game Theory 50(3): 635-654 (2021) - [j107]Kristóf Bérczi, Endre Boros, Ondrej Cepek, Khaled M. Elbassioni, Petr Kucera, Kazuhisa Makino:
Generating clause sequences of a CNF formula. Theor. Comput. Sci. 856: 68-74 (2021) - [i28]Hiromichi Goko, Ayumi Igarashi, Yasushi Kawase, Kazuhisa Makino, Hanna Sumita, Akihisa Tamura, Yu Yokoi, Makoto Yokoo:
Fair and Truthful Mechanism with Limited Subsidy. CoRR abs/2105.01801 (2021) - [i27]Hiromichi Goko, Kazuhisa Makino, Shuichi Miyazaki, Yu Yokoi:
Maximally Satisfying Lower Quotas in the Hospitals/Residents Problem with Ties. CoRR abs/2105.03093 (2021) - [i26]Toshimasa Ishii, Jun Kawahara, Kazuhisa Makino, Hirotaka Ono:
Reallocation Problems with Minimum Completion Time. CoRR abs/2111.02579 (2021) - 2020
- [j106]Christian Engels, Mohit Garg, Kazuhisa Makino, Anup Rao:
On Expressing Majority as a Majority of Majorities. SIAM J. Discret. Math. 34(1): 730-741 (2020) - [j105]Khaled M. Elbassioni, Kazuhisa Makino:
Enumerating Vertices of Covering Polyhedra with Totally Unimodular Constraint Matrices. SIAM J. Discret. Math. 34(1): 843-864 (2020) - [c90]Kristóf Bérczi, Endre Boros, Ondrej Cepek, Petr Kucera, Kazuhisa Makino:
Approximating minimum representations of key Horn functions. ISAIM 2020 - [c89]Tibor Jordán, Yusuke Kobayashi, Ryoga Mahara, Kazuhisa Makino:
The Steiner Problem for Count Matroids. IWOCA 2020: 330-342 - [i25]Kristóf Bérczi, Endre Boros, Ondrej Cepek, Khaled M. Elbassioni, Petr Kucera, Kazuhisa Makino:
Generating clause sequences of a CNF formula. CoRR abs/2002.06727 (2020) - [i24]Kristóf Bérczi, Endre Boros, Ondrej Cepek, Petr Kucera, Kazuhisa Makino:
Unique key Horn functions. CoRR abs/2002.06964 (2020) - [i23]Kristóf Bérczi, Erika R. Bérczi-Kovács, Endre Boros, Fekadu Tolessa Gedefa, Naoyuki Kamiyama, Telikepalli Kavitha, Yusuke Kobayashi, Kazuhisa Makino:
Envy-free Relaxations for Goods, Chores, and Mixed Items. CoRR abs/2006.04428 (2020) - [i22]Yuki Amano, Ayumi Igarashi, Yasushi Kawase, Kazuhisa Makino, Hirotaka Ono:
Fair Ride Allocation on a Line. CoRR abs/2007.08045 (2020) - [i21]Yuki Amano, Kazuhisa Makino:
A 3/4 Differential Approximation Algorithm for Traveling Salesman Problem. CoRR abs/2012.14079 (2020)
2010 – 2019
- 2019
- [j104]Khaled M. Elbassioni, Kazuhisa Makino, Waleed Najy:
A Multiplicative Weight Updates Algorithm for Packing and Covering Semi-infinite Linear Programs. Algorithmica 81(6): 2377-2429 (2019) - [j103]Hanna Sumita, Naonori Kakimura, Kazuhisa Makino:
Total dual integrality of the linear complementarity problem. Ann. Oper. Res. 274(1-2): 531-553 (2019) - [j102]Yasushi Kawase, Kazuhisa Makino:
Surrogate optimization for p-norms. Discret. Optim. 34 (2019) - [j101]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino:
A pseudo-polynomial algorithm for mean payoff stochastic games with perfect information and few random positions. Inf. Comput. 267: 74-95 (2019) - [j100]Endre Boros, Vladimir Gurvich, Nhan Bao Ho, Kazuhisa Makino, Peter Mursic:
Sprague-Grundy function of symmetric hypergraphs. J. Comb. Theory A 165: 176-186 (2019) - [j99]Yasushi Kawase, Xin Han, Kazuhisa Makino:
Unit Cost Buyback Problem. Theory Comput. Syst. 63(6): 1185-1206 (2019) - [j98]Yasushi Kawase, Xin Han, Kazuhisa Makino:
Proportional cost buyback problem with weight bounds. Theor. Comput. Sci. 774: 51-64 (2019) - [j97]Xin Han, Qinyang Chen, Kazuhisa Makino:
Online knapsack problem under concave functions. Theor. Comput. Sci. 786: 88-95 (2019) - [j96]Endre Boros, Vladimir Gurvich, Nhan Bao Ho, Kazuhisa Makino, Peter Mursic:
Sprague-Grundy function of matroids and related hypergraphs. Theor. Comput. Sci. 799: 40-58 (2019) - [c88]Khaled M. Elbassioni, Kazuhisa Makino:
Oracle-Based Primal-Dual Algorithms for Packing and Covering Semidefinite Programs. ESA 2019: 43:1-43:15 - [c87]Xin Han, Yasushi Kawase, Kazuhisa Makino, Haruki Yokomaku:
Online Knapsack Problems with a Resource Buffer. ISAAC 2019: 28:1-28:14 - [i20]Momoko Hayamizu, Kazuhisa Makino:
Ranking top-k trees in tree-based phylogenetic networks. CoRR abs/1904.12432 (2019) - [i19]Xin Han, Yasushi Kawase, Kazuhisa Makino, Haruki Yokomaku:
Online Knapsack Problems with a Resource Buffer. CoRR abs/1909.10016 (2019) - 2018
- [j95]Yasushi Kawase, Kazuhisa Makino, Kento Seimi:
Optimal Composition Ordering Problems for Piecewise Linear Functions. Algorithmica 80(7): 2134-2159 (2018) - [j94]Endre Boros, Khaled M. Elbassioni, Mahmoud Fouz, Vladimir Gurvich, Kazuhisa Makino, Bodo Manthey:
Approximation Schemes for Stochastic Mean Payoff Games with Perfect Information and Few Random Positions. Algorithmica 80(11): 3132-3157 (2018) - [j93]Endre Boros, Vladimir Gurvich, Nhan Bao Ho, Kazuhisa Makino, Peter Mursic:
On the Sprague-Grundyfunction of Exact k-Nim. Discret. Appl. Math. 239: 1-14 (2018) - [j92]Michael Lampis, Kazuhisa Makino, Valia Mitsou, Yushi Uno:
Parameterized Edge Hamiltonicity. Discret. Appl. Math. 248: 68-78 (2018) - [j91]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino:
A Potential Reduction Algorithm for Two-Person Zero-Sum Mean Payoff Stochastic Games. Dyn. Games Appl. 8(1): 22-41 (2018) - [j90]Kei Kimura, Kazuhisa Makino:
Linear Satisfiability Preserving Assignments. J. Artif. Intell. Res. 61: 291-321 (2018) - [c86]Kei Kimura, Kazuhisa Makino:
Linear Satisfiability Preserving Assignments (Extended Abstract). IJCAI 2018: 5622-5626 - [c85]Khaled M. Elbassioni, Kazuhisa Makino:
Enumerating Vertices of 0/1-Polyhedra associated with 0/1-Totally Unimodular Matrices. SWAT 2018: 18:1-18:14 - [i18]Khaled M. Elbassioni, Kazuhisa Makino:
Finding Sparse Solutions for Packing and Covering Semidefinite Programs. CoRR abs/1809.09698 (2018) - [i17]Kristóf Bérczi, Endre Boros, Ondrej Cepek, Petr Kucera, Kazuhisa Makino:
Approximating minimum representations of key Horn functions. CoRR abs/1811.05160 (2018) - 2017
- [j89]Hanna Sumita, Naonori Kakimura, Kazuhisa Makino:
Parameterized Complexity of Sparse Linear Complementarity Problems. Algorithmica 79(1): 42-65 (2017) - [j88]Khaled M. Elbassioni, Kazuhisa Makino:
Guest Editors' Foreword. Algorithmica 79(3): 884-885 (2017) - [j87]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino:
A nested family of \(\varvec{k}\) -total effective rewards for positional games. Int. J. Game Theory 46(1): 263-293 (2017) - [j86]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino:
A convex programming-based algorithm for mean payoff stochastic games with perfect information. Optim. Lett. 11(8): 1499-1512 (2017) - [c84]Xin Han, Ning Ma, Kazuhisa Makino, He Chen:
Online Knapsack Problem Under Concave Functions. FAW 2017: 103-114 - [c83]Endre Boros, Ondrej Cepek, Kazuhisa Makino:
Strong Duality in Horn Minimization. FCT 2017: 123-135 - [c82]Yasushi Kawase, Kei Kimura, Kazuhisa Makino, Hanna Sumita:
Optimal Matroid Partitioning Problems. ISAAC 2017: 51:1-51:13 - [c81]Magnús M. Halldórsson, Toshimasa Ishii, Kazuhisa Makino, Kenjiro Takazawa:
Posimodular Function Optimization. WADS 2017: 437-448 - [i16]Khaled M. Elbassioni, Kazuhisa Makino:
Enumerating Vertices of $0/1$-Polyhedra associated with $0/1$-Totally Unimodular Matrices. CoRR abs/1707.03914 (2017) - [i15]Yasushi Kawase, Kei Kimura, Kazuhisa Makino, Hanna Sumita:
Optimal Matroid Partitioning Problems. CoRR abs/1710.00950 (2017) - [i14]Christian Engels, Mohit Garg, Kazuhisa Makino, Anup Rao:
On Expressing Majority as a Majority of Majorities. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [j85]Kei Kimura, Kazuhisa Makino:
Trichotomy for integer linear systems based on their sign patterns. Discret. Appl. Math. 200: 67-78 (2016) - [j84]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino, Vladimir Oudalov:
Sufficient conditions for the existence of Nash equilibria in bimatrix games in terms of forbidden \(2 \times 2\) subgames. Int. J. Game Theory 45(4): 1111-1131 (2016) - [j83]Xin Han, Kazuhisa Makino:
Online minimization knapsack problem. Theor. Comput. Sci. 609: 185-196 (2016) - [c80]Yasushi Kawase, Kazuhisa Makino:
Surrogate Optimization for p-Norms. ISAAC 2016: 41:1-41:13 - [c79]Yasushi Kawase, Kazuhisa Makino, Kento Seimi:
Optimal Composition Ordering Problems for Piecewise Linear Functions. ISAAC 2016: 42:1-42:13 - [c78]Endre Boros, Ondrej Cepek, Kazuhisa Makino:
A combinatorial min-max theorem and minimization of pure-Horn functions. ISAIM 2016 - [c77]Khaled M. Elbassioni, Kazuhisa Makino, Waleed Najy:
A Multiplicative Weights Update Algorithm for Packing and Covering Semi-infinite Linear Programs. WAOA 2016: 78-91 - [i13]Yasushi Kawase, Kazuhisa Makino, Kento Seimi:
Optimal Composition Ordering Problems for Piecewise Linear Functions. CoRR abs/1601.05480 (2016) - [i12]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino:
A Convex Programming-based Algorithm for Mean Payoff Stochastic Games with Perfect Information. CoRR abs/1610.06681 (2016) - 2015
- [j82]Khaled M. Elbassioni, Kazuhisa Makino, Kurt Mehlhorn, Fahimeh Ramezani:
On Randomized Fictitious Play for Approximating Saddle Points Over Convex Sets. Algorithmica 73(2): 441-459 (2015) - [j81]Hanna Sumita, Naonori Kakimura, Kazuhisa Makino:
The Linear Complementarity Problems with a Few Variables per Constraint. Math. Oper. Res. 40(4): 1015-1026 (2015) - [j80]Shuji Kijima, Kentaro Koga, Kazuhisa Makino:
Deterministic random walks on finite graphs. Random Struct. Algorithms 46(4): 739-761 (2015) - [j79]Xin Han, Yasushi Kawase, Kazuhisa Makino:
Randomized algorithms for online knapsack problems. Theor. Comput. Sci. 562: 395-405 (2015) - [c76]Yasushi Kawase, Xin Han, Kazuhisa Makino:
Proportional Cost Buyback Problem with Weight Bounds. COCOA 2015: 794-808 - [c75]Hanna Sumita, Naonori Kakimura, Kazuhisa Makino:
Parameterized Complexity of Sparse Linear Complementarity Problems. IPEC 2015: 355-364 - [c74]Jakub Gajarský, Michael Lampis, Kazuhisa Makino, Valia Mitsou, Sebastian Ordyniak:
Parameterized Algorithms for Parity Games. MFCS (2) 2015: 336-347 - [c73]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino:
Markov Decision Processes and Stochastic Games with Total Effective Payoff. STACS 2015: 103-115 - [e1]Khaled M. Elbassioni, Kazuhisa Makino:
Algorithms and Computation - 26th International Symposium, ISAAC 2015, Nagoya, Japan, December 9-11, 2015, Proceedings. Lecture Notes in Computer Science 9472, Springer 2015, ISBN 978-3-662-48970-3 [contents] - [i11]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino:
A Pseudo-Polynomial Algorithm for Mean Payoff Stochastic Games with Perfect Information and Few Random Positions. CoRR abs/1508.03431 (2015) - [i10]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino:
A Potential Reduction Algorithm for Two-person Zero-sum Mean Payoff Stochastic Games. CoRR abs/1508.03455 (2015) - [i9]Hiyori Yoshikawa, Hiroshi Hirai, Kazuhisa Makino:
A representation of antimatroids by Horn rules and its application to educational systems. CoRR abs/1508.05465 (2015) - 2014
- [j78]Toshimasa Ishii, Kazuhisa Makino:
Augmenting Edge-Connectivity between Vertex Subsets. Algorithmica 69(1): 130-147 (2014) - [j77]Xin Han, Yasushi Kawase, Kazuhisa Makino:
Online Unweighted Knapsack Problem with Removal Cost. Algorithmica 70(1): 76-91 (2014) - [j76]Xin Han, Yasushi Kawase, Kazuhisa Makino, He Guo:
Online removable knapsack problem under convex function. Theor. Comput. Sci. 540: 62-69 (2014) - [c72]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino:
A Potential Reduction Algorithm for Ergodic Two-Person Zero-Sum Limiting Average Payoff Stochastic Games. COCOA 2014: 694-709 - [c71]Michael Lampis, Kazuhisa Makino, Valia Mitsou, Yushi Uno:
Parameterized Edge Hamiltonicity. WG 2014: 348-359 - [i8]Michael Lampis, Kazuhisa Makino, Valia Mitsou, Yushi Uno:
Parameterized Edge Hamiltonicity. CoRR abs/1403.2041 (2014) - [i7]Toshimasa Ishii, Kazuhisa Makino:
Posimodular Function Optimization. CoRR abs/1410.6030 (2014) - [i6]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino:
Nested Family of Cyclic Games with $k$-total Effective Rewards. CoRR abs/1412.6072 (2014) - 2013
- [j75]Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto:
Derandomizing the HSSW Algorithm for 3-SAT. Algorithmica 67(2): 112-124 (2013) - [j74]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino:
On Canonical Forms for Zero-Sum Stochastic Mean Payoff Games. Dyn. Games Appl. 3(2): 128-161 (2013) - [j73]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino:
On discounted approximations of undiscounted stochastic games and Markov decision processes with limited randomness. Oper. Res. Lett. 41(4): 357-362 (2013) - [j72]Ryo Fujita, Yusuke Kobayashi, Kazuhisa Makino:
Robust Matchings and Matroid Intersections. SIAM J. Discret. Math. 27(3): 1234-1256 (2013) - [j71]Naonori Kakimura, Kazuhisa Makino:
Robust Independence Systems. SIAM J. Discret. Math. 27(3): 1257-1273 (2013) - [j70]Yasushi Kawase, Kazuhisa Makino:
Nash equilibria with minimum potential in undirected broadcast games. Theor. Comput. Sci. 482: 33-47 (2013) - [c70]Xin Han, Yasushi Kawase, Kazuhisa Makino:
Randomized Algorithms for Removable Online Knapsack Problems. FAW-AAIM 2013: 60-71 - [c69]Hanna Sumita, Naonori Kakimura, Kazuhisa Makino:
Sparse Linear Complementarity Problems. CIAC 2013: 358-369 - [c68]Khaled M. Elbassioni, Kazuhisa Makino, Kurt Mehlhorn, Fahimeh Ramezani:
On Randomized Fictitious Play for Approximating Saddle Points over Convex Sets. COCOON 2013: 65-76 - [c67]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino:
A Pseudo-Polynomial Algorithm for Mean Payoff Stochastic Games with Perfect Information and a Few Random Positions. ICALP (1) 2013: 220-231 - [c66]Yasushi Kawase, Xin Han, Kazuhisa Makino:
Unit Cost Buyback Problem. ISAAC 2013: 435-445 - [i5]Khaled M. Elbassioni, Kazuhisa Makino, Kurt Mehlhorn, Fahimeh Ramezani:
On Randomized Fictitious Play for Approximating Saddle Points Over Convex Sets. CoRR abs/1301.5290 (2013) - 2012
- [j69]Marek Chrobak, Gerhard J. Woeginger, Kazuhisa Makino, Haifeng Xu:
Caching Is Hard - Even in the Fault Model. Algorithmica 63(4): 781-794 (2012) - [j68]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino:
On Nash equilibria and improvement cycles in pure positional strategies for Chess-like and Backgammon-like n-person games. Discret. Math. 312(4): 772-788 (2012) - [j67]Kazuhisa Makino, Hirotaka Ono:
Deductive inference for the interiors and exteriors of horn theories. ACM Trans. Comput. Log. 13(3): 23:1-23:16 (2012) - [c65]Shuji Kijima, Kentaro Koga, Kazuhisa Makino:
Deterministic Random Walks on Finite Graphs. ANALCO 2012: 16-25 - [c64]Xin Han, Yasushi Kawase, Kazuhisa Makino:
Online Knapsack Problem with Removal Cost. COCOON 2012: 61-73 - [c63]Kazuhisa Makino:
Source Location Problems with Flow Requirements. ICNC 2012: 404-406 - [c62]Danupon Nanongkai, Ashwin Lall, Atish Das Sarma, Kazuhisa Makino:
Interactive regret minimization. SIGMOD Conference 2012: 109-120 - [c61]Kei Kimura, Kazuhisa Makino:
Trichotomy for Integer Linear Systems Based on Their Sign Patterns. STACS 2012: 613-623 - [c60]Yasushi Kawase, Kazuhisa Makino:
Nash Equilibria with Minimum Potential in Undirected Broadcast Games. WALCOM 2012: 217-228 - 2011
- [j66]Endre Boros, Yves Crama, Peter L. Hammer, Toshihide Ibaraki, Alexander Kogan, Kazuhisa Makino:
Logical analysis of data: classification with justification. Ann. Oper. Res. 188(1): 33-61 (2011) - [j65]Endre Boros, Vladimir Gurvich, Kazuhisa Makino, Wei Shao:
Nash-solvable two-person symmetric cycle game forms. Discret. Appl. Math. 159(15): 1461-1487 (2011) - [j64]Khaled M. Elbassioni, Amr Elmasry, Kazuhisa Makino:
Finding Simplices containing the Origin in Two and Three Dimensions. Int. J. Comput. Geom. Appl. 21(5): 495-506 (2011) - [j63]Khaled M. Elbassioni, Kazuhisa Makino, Imran Rauf:
On the readability of monotone Boolean formulae. J. Comb. Optim. 22(3): 293-304 (2011) - [j62]Hovhannes A. Harutyunyan, Arthur L. Liestman, Kazuhisa Makino, Thomas C. Shermer:
Nonadaptive broadcasting in trees. Networks 57(2): 157-168 (2011) - [j61]Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto:
An exact algorithm for the Boolean connectivity problem for k-CNF. Theor. Comput. Sci. 412(35): 4613-4618 (2011) - [c59]Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto:
Derandomizing HSSW Algorithm for 3-SAT. COCOON 2011: 1-12 - [c58]Endre Boros, Khaled M. Elbassioni, Mahmoud Fouz, Vladimir Gurvich, Kazuhisa Makino, Bodo Manthey:
Stochastic Mean Payoff Games: Smoothed Analysis and Approximation Schemes. ICALP (1) 2011: 147-158 - [c57]Naonori Kakimura, Kazuhisa Makino:
Robust Independence Systems. ICALP (1) 2011: 367-378 - [c56]Naonori Kakimura, Kazuhisa Makino, Kento Seimi:
Computing Knapsack Solutions with Cardinality Robustness. ISAAC 2011: 693-702 - [i4]Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto:
Derandomizing HSSW Algorithm for 3-SAT. CoRR abs/1102.3766 (2011) - 2010
- [j60]Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto:
On the Boolean connectivity problem for Horn relations. Discret. Appl. Math. 158(18): 2024-2030 (2010) - [j59]Endre Boros, Vladimir Gurvich, Kazuhisa Makino, Dávid Papp:
Acyclic, or totally tight, two-person game forms: Characterization and main properties. Discret. Math. 310(6-7): 1135-1151 (2010) - [j58]Toshimasa Ishii, Kazuhisa Makino:
Posi-Modular Systems with Modulotone Requirements under Permutation Constraints. Discret. Math. Algorithms Appl. 2(1): 61-76 (2010) - [j57]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino:
On effectivity functions of game forms. Games Econ. Behav. 68(2): 512-531 (2010) - [j56]Endre Boros, Khaled M. Elbassioni, Kazuhisa Makino:
Left-to-Right Multiplication for Monotone Boolean Dualization. SIAM J. Comput. 39(7): 3424-3439 (2010) - [j55]Xin Han, Kazuhisa Makino:
Online removable knapsack with limited cuts. Theor. Comput. Sci. 411(44-46): 3956-3964 (2010) - [c55]Ryo Fujita, Yusuke Kobayashi, Kazuhisa Makino:
Robust Matchings and Matroid Intersections. ESA (2) 2010: 123-134 - [c54]Marek Chrobak, Gerhard J. Woeginger, Kazuhisa Makino, Haifeng Xu:
Caching Is Hard - Even in the Fault Model. ESA (1) 2010: 195-206 - [c53]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino:
A Pumping Algorithm for Ergodic Stochastic Mean Payoff Games with Perfect Information. IPCO 2010: 341-354 - [c52]Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto:
An Exact Algorithm for the Boolean Connectivity Problem for k-CNF. SAT 2010: 172-180
2000 – 2009
- 2009
- [j54]Daya Ram Gaur, Kazuhisa Makino:
On the fractional chromatic number of monotone self-dual Boolean functions. Discret. Math. 309(4): 867-877 (2009) - [j53]Endre Boros, Vladimir Gurvich, Kazuhisa Makino:
Minimal and locally minimal games and game forms. Discret. Math. 309(13): 4456-4468 (2009) - [j52]Mariko Sakashita, Kazuhisa Makino, Hiroshi Nagamochi, Satoru Fujishige:
Minimum Transversals in Posimodular Systems. SIAM J. Discret. Math. 23(2): 858-871 (2009) - [c51]Toshimasa Ishii, Kazuhisa Makino:
Augmenting Edge-Connectivity between Vertex Subsets. CATS 2009: 43-49 - [c50]Khaled M. Elbassioni, Kazuhisa Makino, Imran Rauf:
On the Readability of Monotone Boolean Formulae. COCOON 2009: 496-505 - [c49]Khaled M. Elbassioni, Kazuhisa Makino, Imran Rauf:
Output-Sensitive Algorithms for Enumerating Minimal Transversals for Some Geometric Hypergraphs. ESA 2009: 143-154 - [c48]Endre Boros, Kazuhisa Makino:
A Fast and Simple Parallel Algorithm for the Monotone Duality Problem. ICALP (1) 2009: 183-194 - [c47]Xin Han, Kazuhisa Makino:
Online Knapsack Problems with Limited Cuts. ISAAC 2009: 341-351 - [c46]Toshimasa Ishii, Kazuhisa Makino:
Posi-modular Systems with Modulotone Requirements under Permutation Constraints. ISAAC 2009: 473-482 - [c45]Xin Han, Kazuhisa Makino:
Online Minimization Knapsack Problem. WAOA 2009: 182-193 - [i3]Kazuhisa Makino, Hirotaka Ono:
Deductive Inference for the Interiors and Exteriors of Horn Theories. CoRR abs/0903.0422 (2009) - 2008
- [j51]Mariko Sakashita, Kazuhisa Makino, Satoru Fujishige:
Minimum Cost Source Location Problems with Flow Requirements. Algorithmica 50(4): 555-583 (2008) - [j50]Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino:
Generating Cut Conjunctions in Graphs and Related Problems. Algorithmica 51(3): 239-263 (2008) - [j49]Mariko Sakashita, Kazuhisa Makino, Satoru Fujishige:
Minimizing a monotone concave function with laminar covering constraints. Discret. Appl. Math. 156(11): 2004-2019 (2008) - [j48]Thomas Eiter, Kazuhisa Makino, Georg Gottlob:
Computational aspects of monotone dualization: A brief survey. Discret. Appl. Math. 156(11): 2035-2049 (2008) - [c44]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino, Vladimir Oudalov:
A Complete Characterization of Nash-Solvability of Bimatrix Games in Terms of the Exclusion of Certain 2×2 Subgames. CSR 2008: 99-109 - [c43]Thomas Eiter, Kazuhisa Makino:
New Results for Horn Cores and Envelopes of Horn Disjunctions. ECAI 2008: 60-64 - [c42]Endre Boros, Khaled M. Elbassioni, Kazuhisa Makino:
On Berge Multiplication for Monotone Boolean Dualization. ICALP (1) 2008: 48-59 - [c41]Kazuhisa Makino, Hirotaka Ono:
Deductive Inference for the Interiors and Exteriors of Horn Theories. ISAAC 2008: 390-401 - 2007
- [j47]Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino:
Enumerating disjunctions and conjunctions of paths and cuts in reliability theory. Discret. Appl. Math. 155(2): 137-149 (2007) - [j46]Thomas Eiter, Kazuhisa Makino:
On computing all abductive explanations from a propositional Horn theory. J. ACM 54(5): 24 (2007) - [j45]Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino:
Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data. Theor. Comput. Sci. 379(3): 361-376 (2007) - [c40]Amr Elmasry, Kazuhisa Makino:
Finding Intersections of Bichromatic Segments Defined by Points. CCCG 2007: 269-272 - [c39]Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino, Gábor Rudolf:
Generating Minimal k-Vertex Connected Spanning Subgraphs. COCOON 2007: 222-231 - [c38]Daya Ram Gaur, Kazuhisa Makino:
On the Fractional Chromatic Number of Monotone Self-dual Boolean Functions. FAW 2007: 148-159 - [c37]Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto:
On the Boolean Connectivity Problem for Horn Relations. SAT 2007: 187-200 - [i2]Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto:
A Dichotomy Theorem within Schaefer for the Boolean Connectivity Problem. Electron. Colloquium Comput. Complex. TR07 (2007) - 2006
- [j44]Yuichi Asahiro, Takashi Horiyama, Kazuhisa Makino, Hirotaka Ono, Toshinori Sakuma, Masafumi Yamashita:
How to collect balls moving in the Euclidean plane. Discret. Appl. Math. 154(16): 2247-2262 (2006) - [j43]Kazuhisa Makino, Yushi Uno, Toshihide Ibaraki:
Minimum edge ranking spanning trees of split graphs. Discret. Appl. Math. 154(16): 2373-2386 (2006) - [j42]Satoko Mamada, Takeaki Uno, Kazuhisa Makino, Satoru Fujishige:
An O(n log2n) algorithm for the optimal sink location problem in dynamic tree networks. Discret. Appl. Math. 154(16): 2387-2401 (2006) - [c36]Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino:
Enumerating Spanning and Connected Subsets in Graphs and Matroids. ESA 2006: 444-455 - [c35]Mariko Sakashita, Kazuhisa Makino, Hiroshi Nagamochi, Satoru Fujishige:
Minimum Transversals in Posi-modular Systems. ESA 2006: 576-587 - [c34]Mariko Sakashita, Kazuhisa Makino, Satoru Fujishige:
Minimum Cost Source Location Problems with Flow Requirements. LATIN 2006: 769-780 - 2005
- [j41]Kazuhisa Makino:
Special Section on Discrete Mathematics and Its Applications. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 88-A(5): 1103 (2005) - [j40]Leonid G. Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino:
On the Complexity of Some Enumeration Problems for Matroids. SIAM J. Discret. Math. 19(4): 966-984 (2005) - [c33]Mariko Sakashita, Kazuhisa Makino, Satoru Fujishige:
Minimizing a Monotone Concave Function with Laminar Covering Constraints. ISAAC 2005: 71-81 - [c32]Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino:
Generating Cut Conjunctions and Bridge Avoiding Extensions in Graphs. ISAAC 2005: 156-165 - 2004
- [j39]Endre Boros, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino:
Dual-bounded generating problems: weighted transversals of a hypergraph. Discret. Appl. Math. 142(1-3): 1-15 (2004) - [j38]Satoru Fujishige, Kazuhisa Makino, Takashi Takabatake, Kenji Kashiwabara:
Polybasic polyhedra: structure of polyhedra with edge vectors of support size at most 2. Discret. Math. 280(1-3): 13-27 (2004) - [c31]Satoko Mamada, Takeaki Uno, Kazuhisa Makino, Satoru Fujishige:
An O(n log 2n) Algorithm for the Optimal Sink Location Problem in Dynamic Tree Networks. IFIP TCS 2004: 251-264 - [c30]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino:
Generating Paths and Cuts in Multi-pole (Di)graphs. MFCS 2004: 298-309 - [c29]Kazuhisa Makino, Takeaki Uno:
New Algorithms for Enumerating All Maximal Cliques. SWAT 2004: 260-272 - [c28]Yuichi Asahiro, Takashi Horiyama, Kazuhisa Makino, Hirotaka Ono, Toshinori Sakuma, Masafumi Yamashita:
How to Collect Balls Moving in the Euclidean Plane. CATS 2004: 229-245 - 2003
- [j37]Toshihide Ibaraki, Alexander Kogan, Kazuhisa Makino:
Inferring Minimal Functional Dependencies in Horn and q-Horn Theories. Ann. Math. Artif. Intell. 38(4): 233-255 (2003) - [j36]Endre Boros, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino:
On Maximal Frequent and Minimal Infrequent Sets in Binary Matrices. Ann. Math. Artif. Intell. 39(3): 211-221 (2003) - [j35]Endre Boros, Takashi Horiyama, Toshihide Ibaraki, Kazuhisa Makino, Mutsunori Yagiura:
Finding Essential Attributes from Binary Data. Ann. Math. Artif. Intell. 39(3): 223-257 (2003) - [j34]Kazuhisa Makino:
Efficient dualization of O(log n)-term monotone disjunctive normal forms. Discret. Appl. Math. 126(2-3): 305-312 (2003) - [j33]Kazuhisa Makino, Hirotaka Ono, Toshihide Ibaraki:
Interior and exterior functions of positive Boolean functions. Discret. Appl. Math. 130(3): 417-436 (2003) - [j32]Endre Boros, Toshihide Ibaraki, Kazuhisa Makino:
Variations on extending partially defined Boolean functions with missing bits. Inf. Comput. 180(1): 53-70 (2003) - [j31]Hiro Ito, Kazuhisa Makino, Kouji Arata, Shoji Honami, Yuichiro Itatsu, Satoru Fujishige:
Source location problem with flow requirements in directed networks. Optim. Methods Softw. 18(4): 427-435 (2003) - [j30]Thomas Eiter, Georg Gottlob, Kazuhisa Makino:
New Results on Monotone Dualization and Generating Hypergraph Transversals. SIAM J. Comput. 32(2): 514-537 (2003) - [c27]Thomas Eiter, Kazuhisa Makino:
Generating All Abductive Explanations for Queries on Propositional Horn Theories. CSL 2003: 197-211 - [c26]Thomas Eiter, Kazuhisa Makino:
Abduction and the Dualization Problem. Discovery Science 2003: 1-20 - [c25]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino:
An Intersection Inequality for Discrete Distributions and Related Generation Problems. ICALP 2003: 543-555 - 2002
- [j29]Kazuhisa Makino, Masafumi Yamashita, Tiko Kameda:
Max- and Min-Neighborhood Monopolies. Algorithmica 34(3): 240-260 (2002) - [j28]Satoko Mamada, Kazuhisa Makino, Satoru Fujishige:
Optimal Sink Location Problem for Dynamic Flows in a Tree Network. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 85-A(5): 1020-1025 (2002) - [j27]Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino:
Recognition and dualization of disguised bidual Horn functions. Inf. Process. Lett. 82(6): 283-291 (2002) - [j26]Kazuhisa Makino, Takashi Takabatake, Satoru Fujishige:
A simple matching algorithm for regular bipartite graphs. Inf. Process. Lett. 84(4): 189-193 (2002) - [j25]Kouji Arata, Satoru Iwata, Kazuhisa Makino, Satoru Fujishige:
Locating Sources to Meet Flow Demands in Undirected Networks. J. Algorithms 42(1): 54-68 (2002) - [j24]Kazuhisa Makino:
A linear time algorithm for recognizing regular Boolean functions. J. Algorithms 43(2): 155-176 (2002) - [j23]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino:
Dual-Bounded Generating Problems: All Minimal Integer Solutions for a Monotone System of Linear Inequalities. SIAM J. Comput. 31(5): 1624-1643 (2002) - [j22]Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino:
Decision lists and related Boolean functions. Theor. Comput. Sci. 270(1-2): 493-524 (2002) - [j21]Hirotaka Ono, Kazuhisa Makino, Toshihide Ibaraki:
Logical analysis of data with decomposable structures. Theor. Comput. Sci. 289(2): 977-995 (2002) - [c24]Thomas Eiter, Kazuhisa Makino:
On Computing all Abductive Explanations. AAAI/IAAI 2002: 62-67 - [c23]Kazuhisa Makino, Yushi Uno, Toshihide Ibaraki:
Minimum Edge Ranking Spanning Trees of Threshold Graphs. ISAAC 2002: 428-440 - [c22]Endre Boros, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino:
On the Complexity of Generating Maximal Frequent and Minimal Infrequent Sets. STACS 2002: 133-141 - [c21]Thomas Eiter, Georg Gottlob, Kazuhisa Makino:
New results on monotone dualization and generating hypergraph transversals. STOC 2002: 14-22 - [i1]Thomas Eiter, Georg Gottlob, Kazuhisa Makino:
New Results on Monotone Dualization and Generating Hypergraph Transversals. CoRR cs.DS/0204009 (2002) - 2001
- [j20]Toshihide Ibaraki, Alexander Kogan, Kazuhisa Makino:
On functional dependencies in q-Horn theories. Artif. Intell. 131(1-2): 171-187 (2001) - [j19]Bert Randerath, Ewald Speckenmeyer, Endre Boros, Peter L. Hammer, Alexander Kogan, Kazuhisa Makino, Bruno Simeone, Ondrej Cepek:
A Satisfiability Formulation of Problems on Level Graphs. Electron. Notes Discret. Math. 9: 269-277 (2001) - [j18]Kazuhisa Makino, Yushi Uno, Toshihide Ibaraki:
On Minimum Edge Ranking Spanning Trees. J. Algorithms 38(2): 411-437 (2001) - [j17]Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino:
Disjunctions of Horn Theories and Their Cores. SIAM J. Comput. 31(1): 269-288 (2001) - [j16]Kazuhisa Makino, Tiko Kameda:
Transformations on Regular Nondominated Coteries and Their Applications. SIAM J. Discret. Math. 14(3): 381-407 (2001) - [c20]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino:
On Generating All Minimal Integer Solutions for a Monotone System of Linear Inequalities. ICALP 2001: 92-103 - 2000
- [j15]Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino:
On the Difference of Horn Theories. J. Comput. Syst. Sci. 61(3): 478-507 (2000) - [j14]Endre Boros, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino:
Dual-Bounded Generating Problems: Partial and Multiple Transversals of a Hypergraph. SIAM J. Comput. 30(6): 2036-2050 (2000) - [c19]Hirotaka Ono, Kazuhisa Makino, Toshihide Ibaraki:
Logical Analysis of Data with Decomposable Structures. COCOON 2000: 396-406 - [c18]Endre Boros, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino:
Generating Partial and Multiple Transversals of a Hypergraph. ICALP 2000: 588-599 - [c17]Endre Boros, Takashi Horiyama, Toshihide Ibaraki, Kazuhisa Makino, Mutsunori Yagiura:
Finding Essential Attributes in Binary Data. IDEAL 2000: 133-138 - [c16]Endre Boros, Toshihide Ibaraki, Kazuhisa Makino:
Fully Consistent Extensions of Partially Defined Boolean Functions with Missing Bits. IFIP TCS 2000: 257-272 - [c15]Kazuhisa Makino, Tiko Kameda:
Efficient generation of all regular non-dominated coteries. PODC 2000: 279-288 - [c14]Kouji Arata, Satoru Iwata, Kazuhisa Makino, Satoru Fujishige:
Locating Sources to Meet Flow Demands in Undirected Networks. SWAT 2000: 300-313 - [c13]Kazuhisa Makino, Masafumi Yamashita, Tiko Kameda:
Max- and Min-Neighborhood Monopolies. SWAT 2000: 513-526
1990 – 1999
- 1999
- [j13]Endre Boros, Toshihide Ibaraki, Kazuhisa Makino:
Logical Analysis of Binary Data with Missing Bits. Artif. Intell. 107(2): 219-263 (1999) - [j12]Toshihide Ibaraki, Alexander Kogan, Kazuhisa Makino:
Functional Dependencies in Horn Theories. Artif. Intell. 108(1-2): 1-30 (1999) - [j11]Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino:
Computing Intersections of Horn Theories for Reasoning with Models. Artif. Intell. 110(1): 57-101 (1999) - [j10]Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino:
Bidual Horn Functions and Extensions. Discret. Appl. Math. 96-97: 55-88 (1999) - [j9]Jan C. Bioch, Toshihide Ibaraki, Kazuhisa Makino:
Minimum Self-dual Decompositions of Positive Dual-minor Boolean Functions. Discret. Appl. Math. 96-97: 307-326 (1999) - [j8]Kazuhisa Makino, Toshihide Ibaraki:
Inner-core and Outer-core Functions of Partially Defined Boolean Functions. Discret. Appl. Math. 96-97: 443-460 (1999) - [j7]Kazuhisa Makino, Ken'ichi Hatanaka, Toshihide Ibaraki:
Horn Extensions of a Partially Defined Boolean Function. SIAM J. Comput. 28(6): 2168-2186 (1999) - [c12]Kazuhisa Makino:
A Linear Time Algorithm for Recognizing Regular Boolean Functions. ISAAC 1999: 259-268 - [c11]Kazuhisa Makino, Yushi Uno, Toshihide Ibaraki:
On Minimum Edge Ranking Spanning Trees. MFCS 1999: 398-409 - [c10]Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino:
On the Difference of Horn Theories. STACS 1999: 467-477 - 1998
- [j6]Endre Boros, Toshihide Ibaraki, Kazuhisa Makino:
Error-Free and Best-Fit Extensions of Partially Defined Boolean Functions. Inf. Comput. 140(2): 254-283 (1998) - [j5]Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino:
Double Horn Functions. Inf. Comput. 144(2): 155-190 (1998) - [j4]Kazuhisa Makino, Toshihide Ibaraki:
A Fast and Simple Algorithm for Identifying 2-Monotonic Positive Boolean Functions. J. Algorithms 26(2): 291-305 (1998) - [c9]Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino:
Computing Intersections of Horn Theories for Reasoning with Models. AAAI/IAAI 1998: 292-297 - [c8]Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino:
Disjunctions of Horn Theories and Their Cores. ISAAC 1998: 49-58 - [c7]Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino:
On Disguised Double Horn Functions and Extensions. STACS 1998: 50-60 - 1997
- [j3]Kazuhisa Makino, Kojin Yano, Toshihide Ibaraki:
Positive and Horn Decomposability of Partially Defined Boolean Functions. Discret. Appl. Math. 74(3): 251-274 (1997) - [j2]Kazuhisa Makino, Toshihide Ibaraki:
The Maximum Latency and Identification of Positive Boolean Functions. SIAM J. Comput. 26(5): 1363-1383 (1997) - [c6]Endre Boros, Toshihide Ibaraki, Kazuhisa Makino:
Monotone Extensions of Boolean Data Sets. ALT 1997: 161-175 - [c5]Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino:
Two-Face Horn Extensions. ISAAC 1997: 112-121 - 1996
- [j1]Kazuhisa Makino, Toshihide Ibaraki:
Interior and Exterior Functions of Boolean Functions. Discret. Appl. Math. 69(3): 209-231 (1996) - [c4]Kazuhisa Makino, Takashi Suda, Kojin Yano, Toshihide Ibaraki:
Data Analysis by Positive Decision Trees. CODAS 1996: 257-264 - [c3]Endre Boros, Toshihide Ibaraki, Kazuhisa Makino:
Boolean Analysis of Incomplete Examples. SWAT 1996: 440-451 - 1995
- [c2]Kazuhisa Makino, Toshihide Ibaraki:
A Fast and Simple Algorithm for Identifying 2-Monotonic Positive Boolean Functions. ISAAC 1995: 291-300 - 1994
- [c1]Kazuhisa Makino, Toshihide Ibaraki:
The Maximum Latency and Identification of Positive Boolean Functions. ISAAC 1994: 324-332
Coauthor Index
[j123] [j122] [j120] [j118] [j117] [i35] [i34] [i30] [j112] [j110] [j108] [j107] [c90] [i25] [i24] [i23] [j101] [j100] [j96] [j94] [j93] [j91] [i17] [j87] [j86] [c83] [j84] [c78] [i12] [c73] [i11] [i10] [c72] [i6] [j74] [j73] [c67] [j68] [j66] [j65] [c58] [j59] [j57] [j56] [c53] [j53] [c48] [j50] [c44] [c42] [j47] [j45] [c39] [c36] [j40] [c32] [j39] [c30] [j36] [j35] [j32] [c25] [j23] [c22] [j19] [c20] [j14] [c18] [c17] [c16] [j13] [j6] [c6] [c3]
[j111] [j107] [j105] [i25] [j104] [j101] [c88] [j94] [j91] [c85] [i18] [j88] [j87] [j86] [i16] [j84] [c77] [i12] [j82] [c73] [e1] [i11] [i10] [c72] [i6] [j74] [j73] [c68] [c67] [i5] [j68] [j64] [j63] [c58] [j57] [j56] [c53] [c50] [c49] [j50] [c44] [c42] [j47] [j45] [c39] [c36] [j40] [c32] [c30] [c25] [j23] [c20]
Leonid Khachiyan
aka: Leonid G. Khachiyan
aka: Leonid G. Khachiyan
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
