Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Kazuhisa Makino
2010 – today
- 2013
[j69]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)- [j68]Yasushi Kawase, Kazuhisa Makino: Nash equilibria with minimum potential in undirected broadcast games. Theor. Comput. Sci. 482: 33-47 (2013)
- [c67]Xin Han, Yasushi Kawase, Kazuhisa Makino: Randomized Algorithms for Removable Online Knapsack Problems. FAW-AAIM 2013: 60-71
- [c66]Hanna Sumita, Naonori Kakimura, Kazuhisa Makino: Sparse Linear Complementarity Problems. CIAC 2013: 358-369
- [c65]Khaled M. Elbassioni, Kazuhisa Makino, Kurt Mehlhorn, Fahimeh Ramezani: On Randomized Fictitious Play for Approximating Saddle Points over Convex Sets. COCOON 2013: 65-76
- [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
- [j67]Marek Chrobak, Gerhard J. Woeginger, Kazuhisa Makino, Haifeng Xu: Caching Is Hard - Even in the Fault Model. Algorithmica 63(4): 781-794 (2012)
- [j66]Kazuhisa Makino, Hirotaka Ono: Deductive inference for the interiors and exteriors of horn theories. ACM Trans. Comput. Log. 13(3): 23 (2012)
- [c64]Shuji Kijima, Kentaro Koga, Kazuhisa Makino: Deterministic Random Walks on Finite Graphs. ANALCO 2012: 18-27
- [c63]Xin Han, Yasushi Kawase, Kazuhisa Makino: Online Knapsack Problem with Removal Cost. COCOON 2012: 61-73
- [c62]
- [c61]Danupon Nanongkai, Ashwin Lall, Atish Das Sarma, Kazuhisa Makino: Interactive regret minimization. SIGMOD Conference 2012: 109-120
- [c60]Kei Kimura, Kazuhisa Makino: Trichotomy for Integer Linear Systems Based on Their Sign Patterns. STACS 2012: 613-623
- [c59]Yasushi Kawase, Kazuhisa Makino: Nash Equilibria with Minimum Potential in Undirected Broadcast Games. WALCOM 2012: 217-228
- 2011
- [j65]Endre Boros, Yves Crama, Peter L. Hammer, Toshihide Ibaraki, Alexander Kogan, Kazuhisa Makino: Logical analysis of data: classification with justification. Annals OR 188(1): 33-61 (2011)
- [j64]Endre Boros, Vladimir Gurvich, Kazuhisa Makino, Wei Shao: Nash-solvable two-person symmetric cycle game forms. Discrete Applied Mathematics 159(15): 1461-1487 (2011)
- [j63]Khaled M. Elbassioni, Amr Elmasry, Kazuhisa Makino: Finding Simplices containing the Origin in Two and Three Dimensions. Int. J. Comput. Geometry Appl. 21(5): 495-506 (2011)
- [j62]Khaled M. Elbassioni, Kazuhisa Makino, Imran Rauf: On the readability of monotone Boolean formulae. J. Comb. Optim. 22(3): 293-304 (2011)
- [j61]Hovhannes A. Harutyunyan, Arthur L. Liestman, Kazuhisa Makino, Thomas C. Shermer: Nonadaptive broadcasting in trees. Networks 57(2): 157-168 (2011)
- [j60]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)
- [c58]Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto: Derandomizing HSSW Algorithm for 3-SAT. COCOON 2011: 1-12
- [c57]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
- [c56]
- [c55]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
- [j59]Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto: On the Boolean connectivity problem for Horn relations. Discrete Applied Mathematics 158(18): 2024-2030 (2010)
- [j58]Endre Boros, Vladimir Gurvich, Kazuhisa Makino, Dávid Papp: Acyclic, or totally tight, two-person game forms: Characterization and main properties. Discrete Mathematics 310(6-7): 1135-1151 (2010)
- [j57]Toshimasa Ishii, Kazuhisa Makino: Posi-Modular Systems with Modulotone Requirements under Permutation Constraints. Discrete Math., Alg. and Appl. 2(1): 61-76 (2010)
- [j56]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino: On effectivity functions of game forms. Games and Economic Behavior 68(2): 512-531 (2010)
- [j55]Endre Boros, Khaled M. Elbassioni, Kazuhisa Makino: Left-to-Right Multiplication for Monotone Boolean Dualization. SIAM J. Comput. 39(7): 3424-3439 (2010)
- [j54]Xin Han, Kazuhisa Makino: Online removable knapsack with limited cuts. Theor. Comput. Sci. 411(44-46): 3956-3964 (2010)
- [c54]Ryo Fujita, Yusuke Kobayashi, Kazuhisa Makino: Robust Matchings and Matroid Intersections. ESA (2) 2010: 123-134
- [c53]Marek Chrobak, Gerhard J. Woeginger, Kazuhisa Makino, Haifeng Xu: Caching Is Hard - Even in the Fault Model. ESA (1) 2010: 195-206
- [c52]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
- [c51]Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto: An Exact Algorithm for the Boolean Connectivity Problem for k-CNF. SAT 2010: 172-180
2000 – 2009
- 2009
- [j53]Daya Ram Gaur, Kazuhisa Makino: On the fractional chromatic number of monotone self-dual Boolean functions. Discrete Mathematics 309(4): 867-877 (2009)
- [j52]Endre Boros, Vladimir Gurvich, Kazuhisa Makino: Minimal and locally minimal games and game forms. Discrete Mathematics 309(13): 4456-4468 (2009)
- [j51]Mariko Sakashita, Kazuhisa Makino, Hiroshi Nagamochi, Satoru Fujishige: Minimum Transversals in Posimodular Systems. SIAM J. Discrete Math. 23(2): 858-871 (2009)
- [c50]Toshimasa Ishii, Kazuhisa Makino: Augmenting Edge-Connectivity between Vertex Subsets. CATS 2009: 43-49
- [c49]Khaled M. Elbassioni, Kazuhisa Makino, Imran Rauf: On the Readability of Monotone Boolean Formulae. COCOON 2009: 496-505
- [c48]Khaled M. Elbassioni, Kazuhisa Makino, Imran Rauf: Output-Sensitive Algorithms for Enumerating Minimal Transversals for Some Geometric Hypergraphs. ESA 2009: 143-154
- [c47]Endre Boros, Kazuhisa Makino: A Fast and Simple Parallel Algorithm for the Monotone Duality Problem. ICALP (1) 2009: 183-194
- [c46]
- [c45]Toshimasa Ishii, Kazuhisa Makino: Posi-modular Systems with Modulotone Requirements under Permutation Constraints. ISAAC 2009: 473-482
- [c44]
- [i3]Kazuhisa Makino, Hirotaka Ono: Deductive Inference for the Interiors and Exteriors of Horn Theories. CoRR abs/0903.0422 (2009)
- 2008
- [j50]Mariko Sakashita, Kazuhisa Makino, Satoru Fujishige: Minimum Cost Source Location Problems with Flow Requirements. Algorithmica 50(4): 555-583 (2008)
- [j49]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)
- [j48]Mariko Sakashita, Kazuhisa Makino, Satoru Fujishige: Minimizing a monotone concave function with laminar covering constraints. Discrete Applied Mathematics 156(11): 2004-2019 (2008)
- [j47]Thomas Eiter, Kazuhisa Makino, Georg Gottlob: Computational aspects of monotone dualization: A brief survey. Discrete Applied Mathematics 156(11): 2035-2049 (2008)
- [c43]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
- [c42]Thomas Eiter, Kazuhisa Makino: New Results for Horn Cores and Envelopes of Horn Disjunctions. ECAI 2008: 60-64
- [c41]Endre Boros, Khaled M. Elbassioni, Kazuhisa Makino: On Berge Multiplication for Monotone Boolean Dualization. ICALP (1) 2008: 48-59
- [c40]Kazuhisa Makino, Hirotaka Ono: Deductive Inference for the Interiors and Exteriors of Horn Theories. ISAAC 2008: 390-401
- 2007
- [j46]Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino: Enumerating disjunctions and conjunctions of paths and cuts in reliability theory. Discrete Applied Mathematics 155(2): 137-149 (2007)
- [j45]Thomas Eiter, Kazuhisa Makino: On computing all abductive explanations from a propositional Horn theory. J. ACM 54(5) (2007)
- [j44]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)
- [c39]Amr Elmasry, Kazuhisa Makino: Finding Intersections of Bichromatic Segments Defined by Points. CCCG 2007: 269-272
- [c38]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
- [c37]Daya Ram Gaur, Kazuhisa Makino: On the Fractional Chromatic Number of Monotone Self-dual Boolean Functions. FAW 2007: 148-159
- [c36]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. Electronic Colloquium on Computational Complexity (ECCC) 14(029) (2007)
- 2006
- [j43]Yuichi Asahiro, Takashi Horiyama, Kazuhisa Makino, Hirotaka Ono, Toshinori Sakuma, Masafumi Yamashita: How to collect balls moving in the Euclidean plane. Discrete Applied Mathematics 154(16): 2247-2262 (2006)
- [j42]Kazuhisa Makino, Yushi Uno, Toshihide Ibaraki: Minimum edge ranking spanning trees of split graphs. Discrete Applied Mathematics 154(16): 2373-2386 (2006)
- [j41]Satoko Mamada, Takeaki Uno, Kazuhisa Makino, Satoru Fujishige: An O(n log2n) algorithm for the optimal sink location problem in dynamic tree networks. Discrete Applied Mathematics 154(16): 2387-2401 (2006)
- [c35]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
- [c34]Mariko Sakashita, Kazuhisa Makino, Hiroshi Nagamochi, Satoru Fujishige: Minimum Transversals in Posi-modular Systems. ESA 2006: 576-587
- [c33]Mariko Sakashita, Kazuhisa Makino, Satoru Fujishige: Minimum Cost Source Location Problems with Flow Requirements. LATIN 2006: 769-780
- 2005
- [j40]Kazuhisa Makino: Special Section on Discrete Mathematics and Its Applications. IEICE Transactions 88-A(5): 1103 (2005)
- [j39]Leonid G. Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino: On the Complexity of Some Enumeration Problems for Matroids. SIAM J. Discrete Math. 19(4): 966-984 (2005)
- [c32]Mariko Sakashita, Kazuhisa Makino, Satoru Fujishige: Minimizing a Monotone Concave Function with Laminar Covering Constraints. ISAAC 2005: 71-81
- [c31]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
- [j38]Endre Boros, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino: Dual-bounded generating problems: weighted transversals of a hypergraph. Discrete Applied Mathematics 142(1-3): 1-15 (2004)
- [j37]Satoru Fujishige, Kazuhisa Makino, Takashi Takabatake, Kenji Kashiwabara: Polybasic polyhedra: structure of polyhedra with edge vectors of support size at most 2. Discrete Mathematics 280(1-3): 13-27 (2004)
- [j36]Yuichi Asahiro, Takashi Horiyama, Kazuhisa Makino, Hirotaka Ono, Toshinori Sakuma, Masafumi Yamashita: How to Collect Balls Moving in the Euclidean Plane. Electr. Notes Theor. Comput. Sci. 91: 229-245 (2004)
- [c30]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
- [c29]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino: Generating Paths and Cuts in Multi-pole (Di)graphs. MFCS 2004: 298-309
- [c28]Kazuhisa Makino, Takeaki Uno: New Algorithms for Enumerating All Maximal Cliques. SWAT 2004: 260-272
- 2003
- [j35]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)
- [j34]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)
- [j33]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)
- [j32]Kazuhisa Makino: Efficient dualization of O(log n)-term monotone disjunctive normal forms. Discrete Applied Mathematics 126(2-3): 305-312 (2003)
- [j31]Kazuhisa Makino, Hirotaka Ono, Toshihide Ibaraki: Interior and exterior functions of positive Boolean functions. Discrete Applied Mathematics 130(3): 417-436 (2003)
- [j30]Endre Boros, Toshihide Ibaraki, Kazuhisa Makino: Variations on extending partially defined Boolean functions with missing bits. Inf. Comput. 180(1): 53-70 (2003)
- [j29]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]
- [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
- [j28]Kazuhisa Makino, Masafumi Yamashita, Tiko Kameda: Max- and Min-Neighborhood Monopolies. Algorithmica 34(3): 240-260 (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]
- [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. Electronic Notes in Discrete Mathematics 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. Discrete 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. Discrete Applied Mathematics 96-97: 55-88 (1999)
- [j9]Jan C. Bioch, Toshihide Ibaraki, Kazuhisa Makino: Minimum Self-dual Decompositions of Positive Dual-minor Boolean Functions. Discrete Applied Mathematics 96-97: 307-326 (1999)
- [j8]Kazuhisa Makino, Toshihide Ibaraki: Inner-core and Outer-core Functions of Partially Defined Boolean Functions. Discrete Applied Mathematics 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. Discrete Applied Mathematics 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]
- 1996
- [j1]Kazuhisa Makino, Toshihide Ibaraki: Interior and Exterior Functions of Boolean Functions. Discrete Applied Mathematics 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
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-04 22:17 CEST by the dblp team