Kazuhisa Makino
 Affiliation history
Bibliometrics: publication history
SEARCH
ROLE
Author only

AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas

BOOKMARK & SHARE

 #resultstats2 { width:100%; padding: 10px; background-color:#ECE9D8; /*background:#9c9;*/ } #resultstats { width:100%; /*background-color:#ECE9D8;*/ font-size: 12px; /*background:#9c9;*/ } #resultstats a:link { text-decoration: none; } #resultstats div { padding-bottom: 5px; padding-top: 5px; } #resfound { background-color: #ece9d8; padding-left:5px } #searchtools { display:inline; float:right; padding-right: 10px; } #refinements { padding-top: 5px; } #refinements table { margin-left: 10px; } #refinements tr { vertical-align:top; } #refinements span { font-size: 12px; } .rectots { font-size:12px; } .problem { font-size:12px; color: red; } div.problem { height: 400px; } #results { /* float:right; */ /* width:80%; */ color: #000000; font-family: Verdana,Arial,Helvetica,sans-serif; font-size: 12px; padding-top: 10px; /*background:#9c9;*/ } #aggs { float:left; width:20%; font-family: Verdana,Arial,Helvetica,sans-serif; font-size:12px; } #pagelogic { font-family: Verdana,Arial,Helvetica,sans-serif; font-size:12px; float:right; padding-bottom: 10px; } #pagerange { font-family: Verdana,Arial,Helvetica,sans-serif; font-size:12px; float:left; padding-bottom: 10px; } #resultmenu { font-family: Verdana,Arial,Helvetica,sans-serif; font-size:12px; float:right; padding-bottom: 10px; } #resultmenu label { margin-right: 0px; vertical-align:bottom; } #resultmenu input { margin-right: 0px; vertical-align:bottom; } #resultmenu select { margin-right: 0px; background-color: #aff; border: 0; border-radius: 0; font-size: 12px; } #resultmenu option { font-size: 12px; background-color: white; } .aggHead { font-weight: bold; padding-bottom: 0; padding-top: 10px; } #aggs ul{ list-style-type: none; margin-top: 0.25em; padding-left: 0; font-size: 1em; } #upcevents li{ padding-bottom: 1.25em; } #upcevents div{ margin-top: 25px; } a.showhide:link { text-decoration: none; } #results .numbering{ font-size: 12px; font-weight:bold; width:30px; float:left; text-align: right; padding-top: 2px; } #results .details{ font-size: 12px; width:92%; float:right; padding-bottom: 20px; } #results .title{ font-size: 14px; padding-bottom:5px; } #results .authors{ font-size: 12px; padding-bottom:5px; } #results .source{ font-size: 12px; padding-bottom:5px; } #results .publisher{ font-size: 12px; padding-bottom:5px; } #results .metrics{ font-size: 12px; padding-bottom:5px; } #results .metricsCol1{ float: left; display:inline; padding-bottom:5px; } #results .metricsCol2{ float: right; display: inline; width: 590px; padding-bottom:5px; } #results .ft{ font-size: 12px; padding-bottom:5px; } #results .abstract{ font-size: 12px; padding-bottom:5px; } #results .kw{ font-size: 12px; padding-bottom:5px; } #results .pubother{ font-size: 12px; padding-bottom:5px; } .izers { margin-top: 10px; margin-bottom:10px; } .highlights em{ background-color: #FFFF00; font-style: normal; } .publicationDate { background-color: #aff; } .citedCount { } .download6Weeks { } .download12Months { } .downloadAll { } 112 results found Export Results: bibtex | endnote | acmref | csv Result 1 – 20 of 112 Result page: 1 2 3 4 5 6 Sort by: relevance publication date citation count downloads (6 Weeks) downloads (12 months) downloads (overall) 1 August 2012 ACM Transactions on Computational Logic (TOCL): Volume 13 Issue 3, August 2012 Publisher: ACM Bibliometrics: Citation Count: 0 Downloads (6 Weeks): 2,   Downloads (12 Months): 11,   Downloads (Overall): 110 Full text available: PDF In this article, we investigate deductive inference for interiors and exteriors of Horn knowledge bases, where interiors and exteriors were introduced by Makino and Ibaraki [1996] to study stability properties of knowledge bases. We present a linear time algorithm for deduction for interiors and show that deduction is coNP-complete for ... Keywords: NP-hardness, Propositional logic, model-based reasoning, deduction, interior/exterior function, tractability, Horn theory, characteristic set 2 August 2012 Algorithmica - Special Issue: Algorithm Design and Analysis: Volume 63 Issue 4, August 2012 Publisher: Springer-Verlag New York, Inc. Bibliometrics: Citation Count: 5 We prove strong ${\mathbb {NP}}$ -completeness for the four variants of caching with multi-size pages. These four variants are obtained by choosing either the fault cost or the bit cost model, and by combining it with either a forced or an optional caching policy. This resolves two questions in the ... 3 May 2012 SIGMOD '12: Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data Publisher: ACM Bibliometrics: Citation Count: 6 Downloads (6 Weeks): 3,   Downloads (12 Months): 34,   Downloads (Overall): 518 Full text available: PDF We study the notion of regret ratio proposed in [19] Nanongkai et al. [VLDB10] to deal with multi-criteria decision making in database systems. The regret minimization query proposed in [19] Nanongkai et al. was shown to have features of both skyline and top- k : it does not need information ... Keywords: skyline, regret minimization, top-k 4 February 2012 Discrete Mathematics: Volume 312 Issue 4, February, 2012 Publisher: Elsevier Science Publishers B. V. Bibliometrics: Citation Count: 0 We consider n-person positional games with perfect information modeled by finite directed graphs that may have directed cycles, assuming that all infinite plays form a single outcome c, in addition to the standard outcomes a"1,...,a"m formed by the terminal positions. (For example, in the case of Chess or Backgammon n=2 ... Keywords: Chess- and Backgammon-like games, Improvement cycle, Move, Nash equilibrium, Position, Random move, Stochastic game, Best reply, Perfect information, Subgame perfect 5 December 2011 ISAAC'11: Proceedings of the 22nd international conference on Algorithms and Computation Publisher: Springer-Verlag Bibliometrics: Citation Count: 1 In this paper, we study the robustness over the cardinality variation for the knapsack problem. For the knapsack problem and a positive number α ≤1, we say that a feasible solution is α-robust if, for any positive integer k , it includes an α -approximation of the maximum k -knapsack ... 6 October 2011 Journal of Combinatorial Optimization: Volume 22 Issue 3, October 2011 Publisher: Springer-Verlag New York, Inc. Bibliometrics: Citation Count: 2 Golumbic et al. (Discrete Appl. Math. 154:1465---1477, 2006) defined the readability of a monotone Boolean function f to be the minimum integer k such that there exists an ? ? ? -formula equivalent to f in which each variable appears at most k times. They asked whether there exists a ... Keywords: Monotone Boolean functions, Read-once functions, Readability, Complexity of monotone Boolean functions 7 September 2011 Discrete Applied Mathematics: Volume 159 Issue 15, September, 2011 Publisher: Elsevier Science Publishers B. V. Bibliometrics: Citation Count: 2 A two-person positional game form g (with perfect information and without moves of chance) is modeled by a finite directed graph (digraph) whose vertices and arcs are interpreted as positions and moves, respectively. All simple directed cycles of this digraph together with its terminal positions form the set A of ... Keywords: Game in normal form, Cycle game, Game form, Nash-solvable game form, Positional game, Mean-payoff game, Nash equilibrium, Tight game form 8 August 2011 COCOON'11: Proceedings of the 17th annual international conference on Computing and combinatorics Publisher: Springer-Verlag Bibliometrics: Citation Count: 1 We present a (full) derandomization of HSSW algorithm for 3-SAT, proposed by Hofmeister, Schöning, Schuler, and Watanabe in [STACS'02]. Thereby, we obtain an Õ(1.3303n)-time deterministic algorithm for 3-SAT, which is currently fastest. 9 August 2011 Theoretical Computer Science: Volume 412 Issue 35, August, 2011 Publisher: Elsevier Science Publishers Ltd. Bibliometrics: Citation Count: 4 We present an exact algorithm for a PSPACE-complete problem, denoted by CONNkSAT, which asks whether the solution space for a given k-CNF formula is connected on the n-dimensional hypercube. The problem is known to be PSPACE-complete for k>=3, and polynomial solvable for [email protected]?2 (Gopalan et al., 2009) [6]. We show ... Keywords: Boolean connectivity, CNF satisfiability, Exponential-time algorithms 10 July 2011 ICALP'11: Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I Publisher: Springer-Verlag Bibliometrics: Citation Count: 2 An independence system F is one of the most fundamental combinatorial concepts, which includes a variety of objects in graphs and hypergraphs such as matchings, stable sets, and matroids.We discuss the robustness for independence systems, which is a natural generalization of the greedy property of matroids. For a real number ... Keywords: independence systems, robustness, exchangeability, matroids 11 July 2011 ICALP'11: Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I Publisher: Springer-Verlag Bibliometrics: Citation Count: 6 In this paper, we consider two-player zero-sum stochastic mean payoff games with perfect information modeled by a digraph with black, white, and random vertices. These BWR-games games are polynomially equivalent with the classical Gillette games, which include many well-known subclasses, such as cyclic games, simple stochastic games, stochastic parity games, ... 12 March 2011 Networks: Volume 57 Issue 2, March 2011 Publisher: Wiley-Interscience Bibliometrics: Citation Count: 2 We study nonadaptive broadcasting in trees, a process of sending a message from one vertex in a tree to all other vertices. In the nonadaptive model, each vertex has a specified, ordered list of its neighbors. After receiving a broadcast message, a vertex sends the message to its neighbors, one ... Keywords: universal list, nonadaptive, broadcasting, path, tree 13 November 2010 Discrete Applied Mathematics: Volume 158 Issue 18, November, 2010 Publisher: Elsevier Science Publishers B. V. Bibliometrics: Citation Count: 2 Gopalan et al. studied in [P. Gopalan, P.G. Kolaitis, E.N. Maneva, C.H. Papadimitriou, The connectivity of Boolean satisfiability: computational and structural dichotomies, in: Proceedings of the 33rd International Colloquium on Automata, Languages and Programming, ICALP 2006, 2006, pp. 346-357] and [P. Gopalan, P.G. Kolaitis, E.N. Maneva, C.H. Papadimitriou, The connectivity ... Keywords: Schaefer's framework, Boolean connectivity, Horn relations 14 October 2010 Theoretical Computer Science: Volume 411 Issue 44, October 2010 Publisher: Elsevier Science Publishers Ltd. Bibliometrics: Citation Count: 0 In this paper, we study online maximization and minimization knapsack problems with limited cuts, in which (1) items are given one by one over time, i.e., after a decision is made on the current item, the next one is given, (2) items are allowed to be cut at most k(�1) ... Keywords: Online algorithms, Competitive ratio, Knapsack problem 15 October 2010 Theoretical Computer Science: Volume 411 Issue 44-46, October, 2010 Publisher: Elsevier Science Publishers Ltd. Bibliometrics: Citation Count: 4 In this paper, we study online maximization and minimization knapsack problems with limited cuts, in which (1) items are given one by one over time, i.e., after a decision is made on the current item, the next one is given, (2) items are allowed to be cut at most k(>=1) ... Keywords: Online algorithms, Competitive ratio, Knapsack problem 16 September 2010 ESA'10: Proceedings of the 18th annual European conference on Algorithms: Part I Publisher: Springer-Verlag Bibliometrics: Citation Count: 8 We prove strong NP-completeness for the four variants of caching with multi-size pages. These four variants are obtained by choosing either the fault cost or the bit cost model, and by combining it with either a forced or an optional caching policy. This resolves two questions in the area of ... 17 August 2010 SIAM Journal on Computing: Volume 39 Issue 7, May 2010 Publisher: Society for Industrial and Applied Mathematics Bibliometrics: Citation Count: 0 Given the prime conjunctive normal form (CNF) representation $\phi$ of a monotone Boolean function $f:\{0,1\}^n\to\{0,1\}$, the dualization problem calls for finding the corresponding prime disjunctive normal form representation $\psi$ of $f$. A very simple method works by multiplying out the clauses of $\phi$ from left to right in some order, ... Keywords: dualization, enumerating minimal hypergraph transversals, monotone Boolean function 18 July 2010 SAT'10: Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing Publisher: Springer-Verlag Bibliometrics: Citation Count: 0 We present an exact algorithm for a PSPACE-complete problem, denoted by CONN k SAT, which asks if the solution space for a given k -CNF formula is connected on the n -dimensional hypercube. The problem is known to be PSPACE-complete for k ≥3, and polynomial solvable for k ≤2 [6]. ... 19 June 2010 IPCO'10: Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization Publisher: Springer-Verlag Bibliometrics: Citation Count: 6 In this paper, we consider two-person zero-sum stochastic mean payoff games with perfect information, or BWR-games, given by a digraph G =( V = V B ∪ V W ∪ V R , E ), with local rewards $r: E \to {\mathbb R}$, and three types of vertices: black V ... Keywords: Gillette model, mean payoff games, local reward, potential, perfect information, stochastic games 20 April 2010 Discrete Mathematics: Volume 310 Issue 6-7, April, 2010 Publisher: Elsevier Science Publishers B. V. Bibliometrics: Citation Count: 1 It is known that a two-person game form g is Nash-solvable if and only if it is tight. We strengthen the concept of tightness as follows: a game form is called totally tight if each of its 2x2 subforms is tight. (It is easy to show that in this case ... Keywords: Game, Nash-solvable, Tight, Acyclic, Dominance-solvable, Game form, Improvement cycle, Totally tight, Assignable, Effectivity function