The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Kazuhisa Makino: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino
    Computing Intersections of Horn Theories for Reasoning with Models. [Citation Graph (0, 0)][DBLP]
    AAAI/IAAI, 1998, pp:292-297 [Conf]
  2. Thomas Eiter, Kazuhisa Makino
    On Computing all Abductive Explanations. [Citation Graph (0, 0)][DBLP]
    AAAI/IAAI, 2002, pp:62-67 [Conf]
  3. Endre Boros, Toshihide Ibaraki, Kazuhisa Makino
    Monotone Extensions of Boolean Data Sets. [Citation Graph (0, 0)][DBLP]
    ALT, 1997, pp:161-175 [Conf]
  4. Hirotaka Ono, Kazuhisa Makino, Toshihide Ibaraki
    Logical Analysis of Data with Decomposable Structures. [Citation Graph (0, 0)][DBLP]
    COCOON, 2000, pp:396-406 [Conf]
  5. Kazuhisa Makino, Takashi Suda, Kojin Yano, Toshihide Ibaraki
    Data Analysis by Positive Decision Trees. [Citation Graph (0, 0)][DBLP]
    CODAS, 1996, pp:257-264 [Conf]
  6. Thomas Eiter, Kazuhisa Makino
    Generating All Abductive Explanations for Queries on Propositional Horn Theories. [Citation Graph (0, 0)][DBLP]
    CSL, 2003, pp:197-211 [Conf]
  7. Thomas Eiter, Kazuhisa Makino
    Abduction and the Dualization Problem. [Citation Graph (0, 0)][DBLP]
    Discovery Science, 2003, pp:1-20 [Conf]
  8. Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
    Enumerating Spanning and Connected Subsets in Graphs and Matroids. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:444-455 [Conf]
  9. Mariko Sakashita, Kazuhisa Makino, Hiroshi Nagamochi, Satoru Fujishige
    Minimum Transversals in Posi-modular Systems. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:576-587 [Conf]
  10. Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino
    On Generating All Minimal Integer Solutions for a Monotone System of Linear Inequalities. [Citation Graph (0, 0)][DBLP]
    ICALP, 2001, pp:92-103 [Conf]
  11. Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino
    An Intersection Inequality for Discrete Distributions and Related Generation Problems. [Citation Graph (0, 0)][DBLP]
    ICALP, 2003, pp:543-555 [Conf]
  12. Endre Boros, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino
    Generating Partial and Multiple Transversals of a Hypergraph. [Citation Graph (0, 0)][DBLP]
    ICALP, 2000, pp:588-599 [Conf]
  13. Endre Boros, Takashi Horiyama, Toshihide Ibaraki, Kazuhisa Makino, Mutsunori Yagiura
    Finding Essential Attributes in Binary Data. [Citation Graph (0, 0)][DBLP]
    IDEAL, 2000, pp:133-138 [Conf]
  14. Endre Boros, Toshihide Ibaraki, Kazuhisa Makino
    Fully Consistent Extensions of Partially Defined Boolean Functions with Missing Bits. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2000, pp:257-272 [Conf]
  15. Satoko Mamada, Takeaki Uno, Kazuhisa Makino, Satoru Fujishige
    An O(n log 2n) Algorithm for the Optimal Sink Location Problem in Dynamic Tree Networks. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2004, pp:251-264 [Conf]
  16. Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino
    Two-Face Horn Extensions. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1997, pp:112-121 [Conf]
  17. Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino
    Disjunctions of Horn Theories and Their Cores. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1998, pp:49-58 [Conf]
  18. Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
    Generating Cut Conjunctions and Bridge Avoiding Extensions in Graphs. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2005, pp:156-165 [Conf]
  19. Kazuhisa Makino
    A Linear Time Algorithm for Recognizing Regular Boolean Functions. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1999, pp:259-268 [Conf]
  20. Kazuhisa Makino, Toshihide Ibaraki
    The Maximum Latency and Identification of Positive Boolean Functions. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1994, pp:324-332 [Conf]
  21. Kazuhisa Makino, Toshihide Ibaraki
    A Fast and Simple Algorithm for Identifying 2-Monotonic Positive Boolean Functions. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1995, pp:291-300 [Conf]
  22. Kazuhisa Makino, Yushi Uno, Toshihide Ibaraki
    Minimum Edge Ranking Spanning Trees of Threshold Graphs. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:428-440 [Conf]
  23. Mariko Sakashita, Kazuhisa Makino, Satoru Fujishige
    Minimizing a Monotone Concave Function with Laminar Covering Constraints. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2005, pp:71-81 [Conf]
  24. Mariko Sakashita, Kazuhisa Makino, Satoru Fujishige
    Minimum Cost Source Location Problems with Flow Requirements. [Citation Graph (0, 0)][DBLP]
    LATIN, 2006, pp:769-780 [Conf]
  25. Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino
    Generating Paths and Cuts in Multi-pole (Di)graphs. [Citation Graph (0, 0)][DBLP]
    MFCS, 2004, pp:298-309 [Conf]
  26. Kazuhisa Makino, Yushi Uno, Toshihide Ibaraki
    On Minimum Edge Ranking Spanning Trees. [Citation Graph (0, 0)][DBLP]
    MFCS, 1999, pp:398-409 [Conf]
  27. Kazuhisa Makino, Tiko Kameda
    Efficient generation of all regular non-dominated coteries. [Citation Graph (0, 0)][DBLP]
    PODC, 2000, pp:279-288 [Conf]
  28. Endre Boros, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino
    On the Complexity of Generating Maximal Frequent and Minimal Infrequent Sets. [Citation Graph (0, 0)][DBLP]
    STACS, 2002, pp:133-141 [Conf]
  29. Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino
    On Disguised Double Horn Functions and Extensions. [Citation Graph (0, 0)][DBLP]
    STACS, 1998, pp:50-60 [Conf]
  30. Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino
    On the Difference of Horn Theories. [Citation Graph (0, 0)][DBLP]
    STACS, 1999, pp:467-477 [Conf]
  31. Thomas Eiter, Georg Gottlob, Kazuhisa Makino
    New results on monotone dualization and generating hypergraph transversals. [Citation Graph (0, 0)][DBLP]
    STOC, 2002, pp:14-22 [Conf]
  32. Endre Boros, Toshihide Ibaraki, Kazuhisa Makino
    Boolean Analysis of Incomplete Examples. [Citation Graph (0, 0)][DBLP]
    SWAT, 1996, pp:440-451 [Conf]
  33. Kouji Arata, Satoru Iwata, Kazuhisa Makino, Satoru Fujishige
    Locating Sources to Meet Flow Demands in Undirected Networks. [Citation Graph (0, 0)][DBLP]
    SWAT, 2000, pp:300-313 [Conf]
  34. Kazuhisa Makino, Takeaki Uno
    New Algorithms for Enumerating All Maximal Cliques. [Citation Graph (0, 0)][DBLP]
    SWAT, 2004, pp:260-272 [Conf]
  35. Kazuhisa Makino, Masafumi Yamashita, Tiko Kameda
    Max- and Min-Neighborhood Monopolies. [Citation Graph (0, 0)][DBLP]
    SWAT, 2000, pp:513-526 [Conf]
  36. Endre Boros, Toshihide Ibaraki, Kazuhisa Makino
    Logical Analysis of Binary Data with Missing Bits. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1999, v:107, n:2, pp:219-263 [Journal]
  37. Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino
    Computing Intersections of Horn Theories for Reasoning with Models. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1999, v:110, n:1, pp:57-101 [Journal]
  38. Toshihide Ibaraki, Alexander Kogan, Kazuhisa Makino
    On functional dependencies in q-Horn theories. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 2001, v:131, n:1-2, pp:171-187 [Journal]
  39. Toshihide Ibaraki, Alexander Kogan, Kazuhisa Makino
    Functional Dependencies in Horn Theories. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1999, v:108, n:1-2, pp:1-30 [Journal]
  40. Kazuhisa Makino, Masafumi Yamashita, Tiko Kameda
    Max- and Min-Neighborhood Monopolies. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2002, v:34, n:3, pp:240-260 [Journal]
  41. Endre Boros, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino
    On Maximal Frequent and Minimal Infrequent Sets in Binary Matrices. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 2003, v:39, n:3, pp:211-221 [Journal]
  42. Endre Boros, Takashi Horiyama, Toshihide Ibaraki, Kazuhisa Makino, Mutsunori Yagiura
    Finding Essential Attributes from Binary Data. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 2003, v:39, n:3, pp:223-257 [Journal]
  43. Toshihide Ibaraki, Alexander Kogan, Kazuhisa Makino
    Inferring Minimal Functional Dependencies in Horn and q-Horn Theories. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 2003, v:38, n:4, pp:233-255 [Journal]
  44. Thomas Eiter, Georg Gottlob, Kazuhisa Makino
    New Results on Monotone Dualization and Generating Hypergraph Transversals [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  45. Jan C. Bioch, Toshihide Ibaraki, Kazuhisa Makino
    Minimum Self-dual Decompositions of Positive Dual-minor Boolean Functions. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:96, n:, pp:307-326 [Journal]
  46. Endre Boros, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino
    Dual-bounded generating problems: weighted transversals of a hypergraph. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:142, n:1-3, pp:1-15 [Journal]
  47. Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino
    Bidual Horn Functions and Extensions. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:96, n:, pp:55-88 [Journal]
  48. Kazuhisa Makino
    Efficient dualization of O(log n)-term monotone disjunctive normal forms. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:126, n:2-3, pp:305-312 [Journal]
  49. Kazuhisa Makino, Toshihide Ibaraki
    Interior and Exterior Functions of Boolean Functions. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1996, v:69, n:3, pp:209-231 [Journal]
  50. Kazuhisa Makino, Toshihide Ibaraki
    Inner-core and Outer-core Functions of Partially Defined Boolean Functions. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:96, n:, pp:443-460 [Journal]
  51. Kazuhisa Makino, Hirotaka Ono, Toshihide Ibaraki
    Interior and exterior functions of positive Boolean functions. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:130, n:3, pp:417-436 [Journal]
  52. Kazuhisa Makino, Kojin Yano, Toshihide Ibaraki
    Positive and Horn Decomposability of Partially Defined Boolean Functions. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1997, v:74, n:3, pp:251-274 [Journal]
  53. Satoko Mamada, Takeaki Uno, Kazuhisa Makino, Satoru Fujishige
    An O(n log2n) algorithm for the optimal sink location problem in dynamic tree networks. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:16, pp:2387-2401 [Journal]
  54. Kazuhisa Makino, Yushi Uno, Toshihide Ibaraki
    Minimum edge ranking spanning trees of split graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:16, pp:2373-2386 [Journal]
  55. Yuichi Asahiro, Takashi Horiyama, Kazuhisa Makino, Hirotaka Ono, Toshinori Sakuma, Masafumi Yamashita
    How to collect balls moving in the Euclidean plane. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:16, pp:2247-2262 [Journal]
  56. Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
    Enumerating disjunctions and conjunctions of paths and cuts in reliability theory. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:2, pp:137-149 [Journal]
  57. Satoru Fujishige, Kazuhisa Makino, Takashi Takabatake, Kenji Kashiwabara
    Polybasic polyhedra: structure of polyhedra with edge vectors of support size at most 2. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:280, n:1-3, pp:13-27 [Journal]
  58. Yuichi Asahiro, Takashi Horiyama, Kazuhisa Makino, Hirotaka Ono, Toshinori Sakuma, Masafumi Yamashita
    How to Collect Balls Moving in the Euclidean Plane. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2004, v:91, n:, pp:229-245 [Journal]
  59. Endre Boros, Toshihide Ibaraki, Kazuhisa Makino
    Variations on extending partially defined Boolean functions with missing bits. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2003, v:180, n:1, pp:53-70 [Journal]
  60. Endre Boros, Toshihide Ibaraki, Kazuhisa Makino
    Error-Free and Best-Fit Extensions of Partially Defined Boolean Functions. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1998, v:140, n:2, pp:254-283 [Journal]
  61. Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino
    Double Horn Functions. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1998, v:144, n:2, pp:155-190 [Journal]
  62. Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino
    Recognition and dualization of disguised bidual Horn functions. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:82, n:6, pp:283-291 [Journal]
  63. Kazuhisa Makino, Takashi Takabatake, Satoru Fujishige
    A simple matching algorithm for regular bipartite graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:84, n:4, pp:189-193 [Journal]
  64. Kouji Arata, Satoru Iwata, Kazuhisa Makino, Satoru Fujishige
    Locating Sources to Meet Flow Demands in Undirected Networks. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2002, v:42, n:1, pp:54-68 [Journal]
  65. Kazuhisa Makino
    A linear time algorithm for recognizing regular Boolean functions. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2002, v:43, n:2, pp:155-176 [Journal]
  66. Kazuhisa Makino, Toshihide Ibaraki
    A Fast and Simple Algorithm for Identifying 2-Monotonic Positive Boolean Functions. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1998, v:26, n:2, pp:291-305 [Journal]
  67. Kazuhisa Makino, Yushi Uno, Toshihide Ibaraki
    On Minimum Edge Ranking Spanning Trees. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2001, v:38, n:2, pp:411-437 [Journal]
  68. Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino
    On the Difference of Horn Theories. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2000, v:61, n:3, pp:478-507 [Journal]
  69. 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. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2002, v:31, n:5, pp:1624-1643 [Journal]
  70. Endre Boros, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino
    Dual-Bounded Generating Problems: Partial and Multiple Transversals of a Hypergraph. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:6, pp:2036-2050 [Journal]
  71. Thomas Eiter, Georg Gottlob, Kazuhisa Makino
    New Results on Monotone Dualization and Generating Hypergraph Transversals. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2003, v:32, n:2, pp:514-537 [Journal]
  72. Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino
    Disjunctions of Horn Theories and Their Cores. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2001, v:31, n:1, pp:269-288 [Journal]
  73. Kazuhisa Makino, Ken-ichi Hatanaka, Toshihide Ibaraki
    Horn Extensions of a Partially Defined Boolean Function. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:6, pp:2168-2186 [Journal]
  74. Kazuhisa Makino, Toshihide Ibaraki
    The Maximum Latency and Identification of Positive Boolean Functions. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1997, v:26, n:5, pp:1363-1383 [Journal]
  75. Leonid G. Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
    On the Complexity of Some Enumeration Problems for Matroids. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2005, v:19, n:4, pp:966-984 [Journal]
  76. Kazuhisa Makino, Tiko Kameda
    Transformations on Regular Nondominated Coteries and Their Applications. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2001, v:14, n:3, pp:381-407 [Journal]
  77. Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino
    Decision lists and related Boolean functions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:270, n:1-2, pp:493-524 [Journal]
  78. Hirotaka Ono, Kazuhisa Makino, Toshihide Ibaraki
    Logical analysis of data with decomposable structures. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:289, n:2, pp:977-995 [Journal]
  79. Amr Elmasry, Kazuhisa Makino
    Finding Intersections of Bichromatic Segments Defined by Points. [Citation Graph (0, 0)][DBLP]
    CCCG, 2007, pp:269-272 [Conf]
  80. Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino, Gábor Rudolf
    Generating Minimal k-Vertex Connected Spanning Subgraphs. [Citation Graph (0, 0)][DBLP]
    COCOON, 2007, pp:222-231 [Conf]
  81. Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto
    On the Boolean Connectivity Problem for Horn Relations. [Citation Graph (0, 0)][DBLP]
    SAT, 2007, pp:187-200 [Conf]
  82. Daya Ram Gaur, Kazuhisa Makino
    On the Fractional Chromatic Number of Monotone Self-dual Boolean Functions. [Citation Graph (0, 0)][DBLP]
    FAW, 2007, pp:148-159 [Conf]
  83. Thomas Eiter, Kazuhisa Makino
    On computing all abductive explanations from a propositional Horn theory. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2007, v:54, n:5, pp:- [Journal]
  84. 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. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:379, n:3, pp:361-376 [Journal]

  85. On the Readability of Monotone Boolean Formulae. [Citation Graph (, )][DBLP]


  86. A Complete Characterization of Nash-Solvability of Bimatrix Games in Terms of the Exclusion of Certain 2×2 Subgames. [Citation Graph (, )][DBLP]


  87. New Results for Horn Cores and Envelopes of Horn Disjunctions. [Citation Graph (, )][DBLP]


  88. Output-Sensitive Algorithms for Enumerating Minimal Transversals for Some Geometric Hypergraphs. [Citation Graph (, )][DBLP]


  89. Caching Is Hard - Even in the Fault Model. [Citation Graph (, )][DBLP]


  90. Robust Matchings and Matroid Intersections. [Citation Graph (, )][DBLP]


  91. A Fast and Simple Parallel Algorithm for the Monotone Duality Problem. [Citation Graph (, )][DBLP]


  92. On Berge Multiplication for Monotone Boolean Dualization. [Citation Graph (, )][DBLP]


  93. A Pumping Algorithm for Ergodic Stochastic Mean Payoff Games with Perfect Information. [Citation Graph (, )][DBLP]


  94. Deductive Inference for the Interiors and Exteriors of Horn Theories. [Citation Graph (, )][DBLP]


  95. Online Knapsack Problems with Limited Cuts. [Citation Graph (, )][DBLP]


  96. An Exact Algorithm for the Boolean Connectivity Problem for k-CNF. [Citation Graph (, )][DBLP]


  97. Online Minimization Knapsack Problem. [Citation Graph (, )][DBLP]


  98. Minimum Cost Source Location Problems with Flow Requirements. [Citation Graph (, )][DBLP]


  99. Generating Cut Conjunctions in Graphs and Related Problems. [Citation Graph (, )][DBLP]


  100. Deductive Inference for the Interiors and Exteriors of Horn Theories [Citation Graph (, )][DBLP]


  101. Minimizing a monotone concave function with laminar covering constraints. [Citation Graph (, )][DBLP]


  102. Computational aspects of monotone dualization: A brief survey. [Citation Graph (, )][DBLP]


  103. Minimal and locally minimal games and game forms. [Citation Graph (, )][DBLP]


  104. On the fractional chromatic number of monotone self-dual Boolean functions. [Citation Graph (, )][DBLP]


  105. Acyclic, or totally tight, two-person game forms: Characterization and main properties. [Citation Graph (, )][DBLP]


  106. A Dichotomy Theorem within Schaefer for the Boolean Connectivity Problem. [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.758secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002