| 2009 |
|---|
| 96 | EE | Kazuhisa Makino,
Hirotaka Ono:
Deductive Inference for the Interiors and Exteriors of Horn Theories
CoRR abs/0903.0422: (2009) |
| 2008 |
|---|
| 95 | EE | 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 |
| 94 | EE | Thomas Eiter,
Kazuhisa Makino:
New Results for Horn Cores and Envelopes of Horn Disjunctions.
ECAI 2008: 60-64 |
| 93 | EE | Endre Boros,
Khaled M. Elbassioni,
Kazuhisa Makino:
On Berge Multiplication for Monotone Boolean Dualization.
ICALP (1) 2008: 48-59 |
| 92 | EE | Kazuhisa Makino,
Hirotaka Ono:
Deductive Inference for the Interiors and Exteriors of Horn Theories.
ISAAC 2008: 390-401 |
| 91 | EE | Mariko Sakashita,
Kazuhisa Makino,
Satoru Fujishige:
Minimum Cost Source Location Problems with Flow Requirements.
Algorithmica 50(4): 555-583 (2008) |
| 90 | EE | 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) |
| 89 | EE | Mariko Sakashita,
Kazuhisa Makino,
Satoru Fujishige:
Minimizing a monotone concave function with laminar covering constraints.
Discrete Applied Mathematics 156(11): 2004-2019 (2008) |
| 88 | EE | Thomas Eiter,
Kazuhisa Makino,
Georg Gottlob:
Computational aspects of monotone dualization: A brief survey.
Discrete Applied Mathematics 156(11): 2035-2049 (2008) |
| 2007 |
|---|
| 87 | | Amr Elmasry,
Kazuhisa Makino:
Finding Intersections of Bichromatic Segments Defined by Points.
CCCG 2007: 269-272 |
| 86 | EE | 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 |
| 85 | EE | Daya Ram Gaur,
Kazuhisa Makino:
On the Fractional Chromatic Number of Monotone Self-dual Boolean Functions.
FAW 2007: 148-159 |
| 84 | EE | Kazuhisa Makino,
Suguru Tamaki,
Masaki Yamamoto:
On the Boolean Connectivity Problem for Horn Relations.
SAT 2007: 187-200 |
| 83 | EE | 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) |
| 82 | EE | 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) |
| 81 | EE | Thomas Eiter,
Kazuhisa Makino:
On computing all abductive explanations from a propositional Horn theory.
J. ACM 54(5): (2007) |
| 80 | EE | 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) |
| 2006 |
|---|
| 79 | EE | 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 |
| 78 | EE | Mariko Sakashita,
Kazuhisa Makino,
Hiroshi Nagamochi,
Satoru Fujishige:
Minimum Transversals in Posi-modular Systems.
ESA 2006: 576-587 |
| 77 | EE | Mariko Sakashita,
Kazuhisa Makino,
Satoru Fujishige:
Minimum Cost Source Location Problems with Flow Requirements.
LATIN 2006: 769-780 |
| 76 | EE | 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) |
| 75 | EE | Kazuhisa Makino,
Yushi Uno,
Toshihide Ibaraki:
Minimum edge ranking spanning trees of split graphs.
Discrete Applied Mathematics 154(16): 2373-2386 (2006) |
| 74 | EE | 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) |
| 2005 |
|---|
| 73 | EE | 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 |
| 72 | EE | Mariko Sakashita,
Kazuhisa Makino,
Satoru Fujishige:
Minimizing a Monotone Concave Function with Laminar Covering Constraints.
ISAAC 2005: 71-81 |
| 71 | EE | Kazuhisa Makino:
Special Section on Discrete Mathematics and Its Applications.
IEICE Transactions 88-A(5): 1103 (2005) |
| 70 | EE | 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) |
| 2004 |
|---|
| 69 | | 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 |
| 68 | EE | Endre Boros,
Khaled M. Elbassioni,
Vladimir Gurvich,
Leonid Khachiyan,
Kazuhisa Makino:
Generating Paths and Cuts in Multi-pole (Di)graphs.
MFCS 2004: 298-309 |
| 67 | EE | Kazuhisa Makino,
Takeaki Uno:
New Algorithms for Enumerating All Maximal Cliques.
SWAT 2004: 260-272 |
| 66 | EE | 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) |
| 65 | EE | 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) |
| 64 | EE | 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) |
| 2003 |
|---|
| 63 | EE | Thomas Eiter,
Kazuhisa Makino:
Generating All Abductive Explanations for Queries on Propositional Horn Theories.
CSL 2003: 197-211 |
| 62 | EE | Thomas Eiter,
Kazuhisa Makino:
Abduction and the Dualization Problem.
Discovery Science 2003: 1-20 |
| 61 | EE | 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 |
| 60 | | 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) |
| 59 | | 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) |
| 58 | | 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) |
| 57 | | Kazuhisa Makino:
Efficient dualization of O(log n)-term monotone disjunctive normal forms.
Discrete Applied Mathematics 126(2-3): 305-312 (2003) |
| 56 | EE | Kazuhisa Makino,
Hirotaka Ono,
Toshihide Ibaraki:
Interior and exterior functions of positive Boolean functions.
Discrete Applied Mathematics 130(3): 417-436 (2003) |
| 55 | EE | Endre Boros,
Toshihide Ibaraki,
Kazuhisa Makino:
Variations on extending partially defined Boolean functions with missing bits.
Inf. Comput. 180(1): 53-70 (2003) |
| 54 | EE | Thomas Eiter,
Georg Gottlob,
Kazuhisa Makino:
New Results on Monotone Dualization and Generating Hypergraph Transversals.
SIAM J. Comput. 32(2): 514-537 (2003) |
| 2002 |
|---|
| 53 | | Thomas Eiter,
Kazuhisa Makino:
On Computing all Abductive Explanations.
AAAI/IAAI 2002: 62-67 |
| 52 | EE | Kazuhisa Makino,
Yushi Uno,
Toshihide Ibaraki:
Minimum Edge Ranking Spanning Trees of Threshold Graphs.
ISAAC 2002: 428-440 |
| 51 | EE | Endre Boros,
Vladimir Gurvich,
Leonid Khachiyan,
Kazuhisa Makino:
On the Complexity of Generating Maximal Frequent and Minimal Infrequent Sets.
STACS 2002: 133-141 |
| 50 | EE | Thomas Eiter,
Georg Gottlob,
Kazuhisa Makino:
New results on monotone dualization and generating hypergraph transversals.
STOC 2002: 14-22 |
| 49 | EE | Kazuhisa Makino,
Masafumi Yamashita,
Tiko Kameda:
Max- and Min-Neighborhood Monopolies.
Algorithmica 34(3): 240-260 (2002) |
| 48 | EE | Thomas Eiter,
Georg Gottlob,
Kazuhisa Makino:
New Results on Monotone Dualization and Generating Hypergraph Transversals
CoRR cs.DS/0204009: (2002) |
| 47 | EE | Thomas Eiter,
Toshihide Ibaraki,
Kazuhisa Makino:
Recognition and dualization of disguised bidual Horn functions.
Inf. Process. Lett. 82(6): 283-291 (2002) |
| 46 | EE | Kazuhisa Makino,
Takashi Takabatake,
Satoru Fujishige:
A simple matching algorithm for regular bipartite graphs.
Inf. Process. Lett. 84(4): 189-193 (2002) |
| 45 | EE | Kouji Arata,
Satoru Iwata,
Kazuhisa Makino,
Satoru Fujishige:
Locating Sources to Meet Flow Demands in Undirected Networks.
J. Algorithms 42(1): 54-68 (2002) |
| 44 | EE | Kazuhisa Makino:
A linear time algorithm for recognizing regular Boolean functions.
J. Algorithms 43(2): 155-176 (2002) |
| 43 | EE | 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) |
| 42 | EE | Thomas Eiter,
Toshihide Ibaraki,
Kazuhisa Makino:
Decision lists and related Boolean functions.
Theor. Comput. Sci. 270(1-2): 493-524 (2002) |
| 41 | | Hirotaka Ono,
Kazuhisa Makino,
Toshihide Ibaraki:
Logical analysis of data with decomposable structures.
Theor. Comput. Sci. 289(2): 977-995 (2002) |
| 2001 |
|---|
| 40 | EE | 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 |
| 39 | EE | Toshihide Ibaraki,
Alexander Kogan,
Kazuhisa Makino:
On functional dependencies in q-Horn theories.
Artif. Intell. 131(1-2): 171-187 (2001) |
| 38 | EE | 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) |
| 37 | | Kazuhisa Makino,
Yushi Uno,
Toshihide Ibaraki:
On Minimum Edge Ranking Spanning Trees.
J. Algorithms 38(2): 411-437 (2001) |
| 36 | EE | Thomas Eiter,
Toshihide Ibaraki,
Kazuhisa Makino:
Disjunctions of Horn Theories and Their Cores.
SIAM J. Comput. 31(1): 269-288 (2001) |
| 35 | EE | Kazuhisa Makino,
Tiko Kameda:
Transformations on Regular Nondominated Coteries and Their Applications.
SIAM J. Discrete Math. 14(3): 381-407 (2001) |
| 2000 |
|---|
| 34 | EE | Hirotaka Ono,
Kazuhisa Makino,
Toshihide Ibaraki:
Logical Analysis of Data with Decomposable Structures.
COCOON 2000: 396-406 |
| 33 | EE | Endre Boros,
Vladimir Gurvich,
Leonid Khachiyan,
Kazuhisa Makino:
Generating Partial and Multiple Transversals of a Hypergraph.
ICALP 2000: 588-599 |
| 32 | EE | Endre Boros,
Takashi Horiyama,
Toshihide Ibaraki,
Kazuhisa Makino,
Mutsunori Yagiura:
Finding Essential Attributes in Binary Data.
IDEAL 2000: 133-138 |
| 31 | EE | Endre Boros,
Toshihide Ibaraki,
Kazuhisa Makino:
Fully Consistent Extensions of Partially Defined Boolean Functions with Missing Bits.
IFIP TCS 2000: 257-272 |
| 30 | EE | Kazuhisa Makino,
Tiko Kameda:
Efficient generation of all regular non-dominated coteries.
PODC 2000: 279-288 |
| 29 | EE | Kouji Arata,
Satoru Iwata,
Kazuhisa Makino,
Satoru Fujishige:
Locating Sources to Meet Flow Demands in Undirected Networks.
SWAT 2000: 300-313 |
| 28 | EE | Kazuhisa Makino,
Masafumi Yamashita,
Tiko Kameda:
Max- and Min-Neighborhood Monopolies.
SWAT 2000: 513-526 |
| 27 | | Thomas Eiter,
Toshihide Ibaraki,
Kazuhisa Makino:
On the Difference of Horn Theories.
J. Comput. Syst. Sci. 61(3): 478-507 (2000) |
| 26 | EE | 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) |
| 1999 |
|---|
| 25 | EE | Kazuhisa Makino:
A Linear Time Algorithm for Recognizing Regular Boolean Functions.
ISAAC 1999: 259-268 |
| 24 | | Kazuhisa Makino,
Yushi Uno,
Toshihide Ibaraki:
On Minimum Edge Ranking Spanning Trees.
MFCS 1999: 398-409 |
| 23 | EE | Thomas Eiter,
Toshihide Ibaraki,
Kazuhisa Makino:
On the Difference of Horn Theories.
STACS 1999: 467-477 |
| 22 | EE | Endre Boros,
Toshihide Ibaraki,
Kazuhisa Makino:
Logical Analysis of Binary Data with Missing Bits.
Artif. Intell. 107(2): 219-263 (1999) |
| 21 | EE | Toshihide Ibaraki,
Alexander Kogan,
Kazuhisa Makino:
Functional Dependencies in Horn Theories.
Artif. Intell. 108(1-2): 1-30 (1999) |
| 20 | EE | Thomas Eiter,
Toshihide Ibaraki,
Kazuhisa Makino:
Computing Intersections of Horn Theories for Reasoning with Models.
Artif. Intell. 110(1): 57-101 (1999) |
| 19 | EE | 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) |
| 18 | EE | Kazuhisa Makino,
Toshihide Ibaraki:
Inner-core and Outer-core Functions of Partially Defined Boolean Functions.
Discrete Applied Mathematics 96-97: 443-460 (1999) |
| 17 | EE | Thomas Eiter,
Toshihide Ibaraki,
Kazuhisa Makino:
Bidual Horn Functions and Extensions.
Discrete Applied Mathematics 96-97: 55-88 (1999) |
| 16 | | Kazuhisa Makino,
Ken-ichi Hatanaka,
Toshihide Ibaraki:
Horn Extensions of a Partially Defined Boolean Function.
SIAM J. Comput. 28(6): 2168-2186 (1999) |
| 1998 |
|---|
| 15 | | Thomas Eiter,
Toshihide Ibaraki,
Kazuhisa Makino:
Computing Intersections of Horn Theories for Reasoning with Models.
AAAI/IAAI 1998: 292-297 |
| 14 | EE | Thomas Eiter,
Toshihide Ibaraki,
Kazuhisa Makino:
Disjunctions of Horn Theories and Their Cores.
ISAAC 1998: 49-58 |
| 13 | | Thomas Eiter,
Toshihide Ibaraki,
Kazuhisa Makino:
On Disguised Double Horn Functions and Extensions.
STACS 1998: 50-60 |
| 12 | | Endre Boros,
Toshihide Ibaraki,
Kazuhisa Makino:
Error-Free and Best-Fit Extensions of Partially Defined Boolean Functions.
Inf. Comput. 140(2): 254-283 (1998) |
| 11 | | Thomas Eiter,
Toshihide Ibaraki,
Kazuhisa Makino:
Double Horn Functions.
Inf. Comput. 144(2): 155-190 (1998) |
| 10 | | Kazuhisa Makino,
Toshihide Ibaraki:
A Fast and Simple Algorithm for Identifying 2-Monotonic Positive Boolean Functions.
J. Algorithms 26(2): 291-305 (1998) |
| 1997 |
|---|
| 9 | | Endre Boros,
Toshihide Ibaraki,
Kazuhisa Makino:
Monotone Extensions of Boolean Data Sets.
ALT 1997: 161-175 |
| 8 | | Thomas Eiter,
Toshihide Ibaraki,
Kazuhisa Makino:
Two-Face Horn Extensions.
ISAAC 1997: 112-121 |
| 7 | EE | Kazuhisa Makino,
Kojin Yano,
Toshihide Ibaraki:
Positive and Horn Decomposability of Partially Defined Boolean Functions.
Discrete Applied Mathematics 74(3): 251-274 (1997) |
| 6 | | Kazuhisa Makino,
Toshihide Ibaraki:
The Maximum Latency and Identification of Positive Boolean Functions.
SIAM J. Comput. 26(5): 1363-1383 (1997) |
| 1996 |
|---|
| 5 | | Kazuhisa Makino,
Takashi Suda,
Kojin Yano,
Toshihide Ibaraki:
Data Analysis by Positive Decision Trees.
CODAS 1996: 257-264 |
| 4 | | Endre Boros,
Toshihide Ibaraki,
Kazuhisa Makino:
Boolean Analysis of Incomplete Examples.
SWAT 1996: 440-451 |
| 3 | EE | Kazuhisa Makino,
Toshihide Ibaraki:
Interior and Exterior Functions of Boolean Functions.
Discrete Applied Mathematics 69(3): 209-231 (1996) |
| 1995 |
|---|
| 2 | | Kazuhisa Makino,
Toshihide Ibaraki:
A Fast and Simple Algorithm for Identifying 2-Monotonic Positive Boolean Functions.
ISAAC 1995: 291-300 |
| 1994 |
|---|
| 1 | | Kazuhisa Makino,
Toshihide Ibaraki:
The Maximum Latency and Identification of Positive Boolean Functions.
ISAAC 1994: 324-332 |
