Kazuhisa Makino

发表

Generating Cut Conjunctions and Bridge Avoiding Extensions in Graphs

Vladimir Gurvich, Konrad Borys, Khaled M. Elbassioni, 2005, ISAAC.

On the Difference of Horn Theories

Toshihide Ibaraki, Kazuhisa Makino, Thomas Eiter, 1999, STACS.

Online Knapsack Problem with Removal Cost

Kazuhisa Makino, Xin Han, Yasushi Kawase, 2012, COCOON.

Recognition and dualization of disguised bidual Horn functions

Toshihide Ibaraki, Kazuhisa Makino, Thomas Eiter, 2002, Inf. Process. Lett..

Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data

Vladimir Gurvich, Khaled M. Elbassioni, Endre Boros, 2007, Theor. Comput. Sci..

Minimum Transversals in Posimodular Systems

Hiroshi Nagamochi, Kazuhisa Makino, Mariko Sakashita, 2009, SIAM J. Discret. Math..

Minimal and locally minimal games and game forms

Vladimir Gurvich, Endre Boros, Kazuhisa Makino, 2009, Discret. Math..

Nonadaptive broadcasting in trees

Kazuhisa Makino, Arthur L. Liestman, Thomas C. Shermer, 2011, Networks.

On the fractional chromatic number of monotone self-dual Boolean functions

Kazuhisa Makino, Daya Ram Gaur, K. Makino, 2007, Discret. Math..

Minimum Edge Ranking Spanning Trees of Threshold Graphs

Toshihide Ibaraki, Kazuhisa Makino, Yushi Uno, 2002, ISAAC.

A Satisfiability Formulation of Problems on Level Graphs

Endre Boros, Kazuhisa Makino, Peter L. Hammer, 2001, Electron. Notes Discret. Math..

Online Minimization Knapsack Problem

Kazuhisa Makino, Xin Han, 2009, WAOA.

The evacuation problem and related topics

Kazuhisa Makino, Satoru Fujishige, Takashi Takabatake, 2002, Proceedings of the 41st SICE Annual Conference. SICE 2002..

Inner-core and Outer-core Functions of Partially Defined Boolean Functions

Toshihide Ibaraki, Kazuhisa Makino, T. Ibaraki, 1999, Discret. Appl. Math..

Sprague-Grundy function of matroids and related hypergraphs

Vladimir Gurvich, Endre Boros, Kazuhisa Makino, 2018, Theor. Comput. Sci..

Generating clause sequences of a CNF formula

Khaled M. Elbassioni, Endre Boros, Kazuhisa Makino, 2021, Theor. Comput. Sci..

On the Readability of Monotone Boolean Formulae

Khaled M. Elbassioni, Kazuhisa Makino, Imran Rauf, 2009, COCOON.

Sufficient conditions for the existence of Nash equilibria in bimatrix games in terms of forbidden $$2 \times 2$$2×2 subgames

Vladimir Gurvich, Khaled M. Elbassioni, Endre Boros, 2016, Int. J. Game Theory.

Posi-Modular Systems with Modulotone Requirements under Permutation Constraints

Kazuhisa Makino, Toshimasa Ishii, K. Makino, 2009, Discret. Math. Algorithms Appl..

Finding Essential Attributes in Binary Data

Toshihide Ibaraki, Endre Boros, Kazuhisa Makino, 2000, IDEAL.

Trichotomy for integer linear systems based on their sign patterns

Kazuhisa Makino, Kei Kimura, K. Makino, 2016, Discret. Appl. Math..

Proportional cost buyback problem with weight bounds

Kazuhisa Makino, Xin Han, Yasushi Kawase, 2019, Theor. Comput. Sci..

On Berge Multiplication for Monotone Boolean Dualization

Khaled M. Elbassioni, Endre Boros, Kazuhisa Makino, 2008, ICALP.

MATHEMATICAL ENGINEERING TECHNICAL REPORTS Robust Independence Systems

Kazuhisa Makino, Naonori Kakimura, K. Makino, 2011 .

Linear Satisfiability Preserving Assignments

Kazuhisa Makino, Kei Kimura, 2018, J. Artif. Intell. Res..

Undirected Broadcast Games

Kazuhisa Makino, Yasushi Kawase, 2011 .

Locating Sources to Meet Flow Demands in Undirected Networks

Kazuhisa Makino, Satoru Iwata, Satoru Fujishige, 2000, J. Algorithms.

On functional dependencies in q-Horn theories

Toshihide Ibaraki, Kazuhisa Makino, Alexander Kogan, 2001, Artif. Intell..

On the Fractional Chromatic Number of Monotone Self-dual Boolean Functions

Kazuhisa Makino, Daya Ram Gaur, 2007, FAW.

Generating Paths and Cuts in Multi-pole (Di)graphs

Vladimir Gurvich, Khaled M. Elbassioni, Endre Boros, 2004, MFCS.

A nested family of $$\varvec{k}$$k-total effective rewards for positional games

Vladimir Gurvich, Khaled M. Elbassioni, Endre Boros, 2017, Int. J. Game Theory.

Minimizing a Monotone Concave Function with Laminar Covering Constraints

Kazuhisa Makino, Mariko Sakashita, Satoru Fujishige, 2005, ISAAC.

On Maximal Frequent and Minimal Infrequent Sets in Binary Matrices

Vladimir Gurvich, Endre Boros, Leonid Khachiyan, 2003, Annals of Mathematics and Artificial Intelligence.

Robust Matchings and Matroid Intersections

Kazuhisa Makino, Yusuke Kobayashi, Ryo Fujita, 2010, SIAM J. Discret. Math..

Nested Family of Cyclic Games with $k$-total Effective Rewards pdf

Vladimir Gurvich, Khaled M. Elbassioni, Endre Boros, 2014, ArXiv.

Randomized Algorithms for Removable Online Knapsack Problems

Kazuhisa Makino, Xin Han, Yasushi Kawase, 2013, FAW-AAIM.

New Results on Monotone Dualization and Generating Hypergraph Transversals

Georg Gottlob, Kazuhisa Makino, Thomas Eiter, 2003, SIAM J. Comput..

Disjunctions of Horn Theories and Their Cores

Toshihide Ibaraki, Kazuhisa Makino, Thomas Eiter, 2001, SIAM J. Comput..

Logical analysis of data with decomposable structures

Toshihide Ibaraki, Kazuhisa Makino, Hirotaka Ono, 2000, Theor. Comput. Sci..

Interior and exterior functions of positive Boolean functions

Toshihide Ibaraki, Kazuhisa Makino, Hirotaka Ono, 2003, Discret. Appl. Math..

Approximating minimum representations of key Horn functions pdf

Endre Boros, Kazuhisa Makino, Kristóf Bérczi, 2018, ISAIM.

Approximation Schemes for Stochastic Mean Payoff Games with Perfect Information and Few Random Positions

Vladimir Gurvich, Khaled M. Elbassioni, Mahmoud Fouz, 2017, Algorithmica.

Augmenting Edge-Connectivity between Vertex Subsets

Kazuhisa Makino, Toshimasa Ishii, 2012, Algorithmica.

Logical Analysis of Data with Decomposable Structures

Toshihide Ibaraki, Kazuhisa Makino, Hirotaka Ono, 2000, COCOON.

Markov decision processes and stochastic games with total effective payoff

Vladimir Gurvich, Khaled M. Elbassioni, Endre Boros, 2018, STACS.

Derandomizing the HSSW Algorithm for 3-SAT

Kazuhisa Makino, Masaki Yamamoto, Suguru Tamaki, 2012, Algorithmica.

On the Boolean connectivity problem for Horn relations

Kazuhisa Makino, Masaki Yamamoto, Suguru Tamaki, 2010, Discret. Appl. Math..

Oracle-Based Primal-Dual Algorithms for Packing and Covering Semidefinite Programs

Khaled M. Elbassioni, Kazuhisa Makino, 2019, ESA.

Online removable knapsack with limited cuts

Kazuhisa Makino, Xin Han, K. Makino, 2010, Theor. Comput. Sci..

On computing all abductive explanations

Kazuhisa Makino, Thomas Eiter, K. Makino, 2002, AAAI/IAAI.

A linear time algorithm for recognizing regular Boolean functions

Kazuhisa Makino, K. Makino, 1999, J. Algorithms.

Data Analysis by Positive Decision Trees

Toshihide Ibaraki, Kazuhisa Makino, Takashi Suda, 1999, CODAS.

Max- and Min-Neighborhood Monopolies

Kazuhisa Makino, Masafumi Yamashita, Tiko Kameda, 2002, Algorithmica.

A simple matching algorithm for regular bipartite graphs

Kazuhisa Makino, Satoru Fujishige, Takashi Takabatake, 2002, Inf. Process. Lett..

Polybasic polyhedra: structure of polyhedra with edge vectors of support size at most 2

Kenji Kashiwabara, Kazuhisa Makino, Satoru Fujishige, 2004, Discret. Math..

A Fast and Simple Algorithm for Identifying 2-Monotonic Positive Boolean Functions

Toshihide Ibaraki, Kazuhisa Makino, 1998, J. Algorithms.

On the Complexity of Generating Maximal Frequent and Minimal Infrequent Sets

Vladimir Gurvich, Endre Boros, Leonid Khachiyan, 2002, STACS.

Online removable knapsack problem under convex function

Kazuhisa Makino, He Guo, Xin Han, 2014, Theor. Comput. Sci..

On Disguised Double Horn Functions and Extensions

Toshihide Ibaraki, Kazuhisa Makino, Thomas Eiter, 1998, STACS.

A Linear Time Algorithm for Recognizing Regular Boolean Functions

Kazuhisa Makino, 1999, ISAAC.

Every stochastic game with perfect information admits a canonical form

Vladimir Gurvich, Khaled M. Elbassioni, Endre Boros, 2009 .

A Pumping Algorithm for Ergodic Stochastic Mean Payoff Games with Perfect Information

Vladimir Gurvich, Khaled M. Elbassioni, Endre Boros, 2010, IPCO.

An exact algorithm for the Boolean connectivity problem for k-CNF

Kazuhisa Makino, Masaki Yamamoto, Suguru Tamaki, 2011, Theor. Comput. Sci..

Deterministic Random Walks on Finite Graphs

Kazuhisa Makino, Shuji Kijima, Kentaro Koga, 2012, ANALCO.

On Randomized Fictitious Play for Approximating Saddle Points Over Convex Sets

Kurt Mehlhorn, Khaled M. Elbassioni, Kazuhisa Makino, 2014, Algorithmica.

On the readability of monotone Boolean formulae

Khaled M. Elbassioni, Kazuhisa Makino, Imran Rauf, 2011, J. Comb. Optim..

Parameterized Complexity of Sparse Linear Complementarity Problems

Kazuhisa Makino, Naonori Kakimura, Hanna Sumita, 2015, Algorithmica.

Error-Free and Best-Fit Extensions of Partially Defined Boolean Functions

Toshihide Ibaraki, Endre Boros, Kazuhisa Makino, 1998, Inf. Comput..

Parameterized Edge Hamiltonicity

Kazuhisa Makino, Michael Lampis, Yushi Uno, 2018, Discret. Appl. Math..

Finding Sparse Solutions for Packing and Covering Semidefinite Programs pdf

Khaled M. Elbassioni, Kazuhisa Makino, K. Makino, 2018, SIAM J. Optim..

Nash Equilibria with Minimum Potential in Undirected Broadcast Games

Kazuhisa Makino, Yasushi Kawase, 2012, WALCOM.

Minimum Self-dual Decompositions of Positive Dual-minor Boolean Functions

Toshihide Ibaraki, Kazuhisa Makino, Jan C. Bioch, 1997, Discret. Appl. Math..

The Steiner Problem for Count Matroids

Kazuhisa Makino, Tibor Jordán, Yusuke Kobayashi, 2020, IWOCA.

The evacuation problem, dynamic network flows, and algorithms

Kazuhisa Makino, Satoru Fujishige, Takashi Takabatake, 2003, SICE 2003 Annual Conference (IEEE Cat. No.03TH8734).

An Intersection Inequality for Discrete Distributions and Related Generation Problems

Vladimir Gurvich, Khaled M. Elbassioni, Endre Boros, 2003, ICALP.

An O(n log 2n) Algorithm for the Optimal Sink Location Problem in Dynamic Tree Networks

Kazuhisa Makino, Takeaki Uno, Satoru Fujishige, 2004, IFIP TCS.

Fair Ride Allocation on a Line pdf

Kazuhisa Makino, Yasushi Kawase, Yuki Amano, 2020, SAGT.

Positive and Horn Decomposability of Partially Defined Boolean Functions

Toshihide Ibaraki, Kazuhisa Makino, Kojin Yano, 1997, Discret. Appl. Math..

Nash equilibria with minimum potential in undirected broadcast games

Kazuhisa Makino, Yasushi Kawase, 2013, Theor. Comput. Sci..

Monotone Extensions of Boolean Data Sets

Toshihide Ibaraki, Endre Boros, Kazuhisa Makino, 1997, ALT.

A Fast and Simple Parallel Algorithm for the Monotone Duality Problem

Endre Boros, Kazuhisa Makino, 2009, ICALP.

Robust Matchings and Matroid Intersections

Kazuhisa Makino, Yusuke Kobayashi, Ryo Fujita, 2013, SIAM J. Discret. Math..

Optimal Matroid Partitioning Problems

Kazuhisa Makino, Yasushi Kawase, Kei Kimura, 2017, Algorithmica.

A Potential Reduction Algorithm for Ergodic Two-Person Zero-Sum Limiting Average Payoff Stochastic Games

Vladimir Gurvich, Khaled M. Elbassioni, Endre Boros, 2014, COCOA.

Dual-Bounded Generating Problems: All Minimal Integer Solutions for a Monotone System of Linear Inequalities

Vladimir Gurvich, Khaled M. Elbassioni, Endre Boros, 2002, SIAM J. Comput..

Finding Intersections of Bichromatic Segments Defined by Points

Amr Elmasry, Kazuhisa Makino, Amr Elmasry, 2007, CCCG.

MATHEMATICAL ENGINEERING TECHNICAL REPORTS Online Unweighted Knapsack Problem with Removal Cost

Kazuhisa Makino, Xin Han, Yasushi Kawase, 2012 .

On the Complexity of Some Enumeration Problems for Matroids

Vladimir Gurvich, Khaled M. Elbassioni, Endre Boros, 2005, SIAM J. Discret. Math..

Interior and Exterior Functions of Boolean Functions

Toshihide Ibaraki, Kazuhisa Makino, T. Ibaraki, 1996, Discret. Appl. Math..

Deductive inference for the interiors and exteriors of horn theories pdf

Kazuhisa Makino, Hirotaka Ono, 2012, TOCL.

On discounted approximations of undiscounted stochastic games and Markov decision processes with limited randomness

Vladimir Gurvich, Khaled M. Elbassioni, Endre Boros, 2013, Oper. Res. Lett..

A Complete Characterization of Nash-Solvability of Bimatrix Games in Terms of the Exclusion of Certain 2×2 Subgames

Vladimir Gurvich, Khaled M. Elbassioni, Endre Boros, 2008, CSR.

Unique key Horn functions pdf

Endre Boros, Kazuhisa Makino, Kristóf Bérczi, 2020, Theor. Comput. Sci..

Efficient generation of all regular non-dominated coteries

Kazuhisa Makino, Tiko Kameda, T. Kameda, 2000, PODC '00.

Inferring Minimal Functional Dependencies in Horn and q-Horn Theories

Toshihide Ibaraki, Kazuhisa Makino, Alexander Kogan, 2003, Annals of Mathematics and Artificial Intelligence.

Caching Is Hard - Even in the Fault Model

Marek Chrobak, Gerhard J. Woeginger, Haifeng Xu, 2010, ESA.

Disjunctions of Horn Theories and Their Cores

Toshihide Ibaraki, Kazuhisa Makino, Thomas Eiter, 1998, ISAAC.

On effectivity functions of game forms

Vladimir Gurvich, Khaled M. Elbassioni, Endre Boros, 2010, Games Econ. Behav..

New Results for Horn Cores and Envelopes of Horn Disjunctions

Kazuhisa Makino, Thomas Eiter, 2008, ECAI.

Acyclic, or totally tight, two-person game forms: Characterization and main properties

Vladimir Gurvich, Endre Boros, Kazuhisa Makino, 2010, Discret. Math..

How to Collect Balls Moving in the Euclidean Plane

Kazuhisa Makino, Takashi Horiyama, Masafumi Yamashita, 2004, CATS.

Ranking Top-$k$ Trees in Tree-Based Phylogenetic Networks pdf

Kazuhisa Makino, Momoko Hayamizu, K. Makino, 2019, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

Transformations on Regular Nondominated Coteries and Their Applications

Kazuhisa Makino, Tiko Kameda, T. Kameda, 2001, SIAM J. Discret. Math..

Stochastic Mean Payoff Games: Smoothed Analysis and Approximation Schemes

Vladimir Gurvich, Khaled M. Elbassioni, Mahmoud Fouz, 2011, ICALP.

The Linear Complementarity Problems with a Few Variables per Constraint

Kazuhisa Makino, Naonori Kakimura, Hanna Sumita, 2015, Math. Oper. Res..

Bidual Horn Functions and Extensions

Toshihide Ibaraki, Kazuhisa Makino, Thomas Eiter, 1999, Discret. Appl. Math..

Output-Sensitive Algorithms for Enumerating Minimal Transversals for Some Geometric Hypergraphs

Khaled M. Elbassioni, Kazuhisa Makino, Imran Rauf, 2009, ESA.

Variations on extending partially defined Boolean functions with missing bits

Toshihide Ibaraki, Endre Boros, Kazuhisa Makino, 2003, Inf. Comput..

Dual-bounded generating problems: weighted transversals of a hypergraph

Vladimir Gurvich, Endre Boros, Leonid Khachiyan, 2004, Discret. Appl. Math..

Derandomizing the HSSW Algorithm for 3-SAT

Kazuhisa Makino, Masaki Yamamoto, Suguru Tamaki, 2011, Algorithmica.

Generating Minimal k-Vertex Connected Spanning Subgraphs

Vladimir Gurvich, Konrad Borys, Gábor Rudolf, 2007, COCOON.

On Canonical Forms for Zero-Sum Stochastic Mean Payoff Games

Vladimir Gurvich, Khaled M. Elbassioni, Endre Boros, 2013, Dyn. Games Appl..

Left-to-Right Multiplication for Monotone Boolean Dualization

Khaled M. Elbassioni, Endre Boros, Kazuhisa Makino, 2010, SIAM J. Comput..

A Fast and Simple Algorithm for Identifying 2-Monotonic Positive Boolean Functions

Toshihide Ibaraki, Kazuhisa Makino, T. Ibaraki, 1995, J. Algorithms.

A Multiplicative Weight Updates Algorithm for Packing and Covering Semi-infinite Linear Programs

Khaled M. Elbassioni, Kazuhisa Makino, Waleed Najy, 2018, Algorithmica.

Caching Is Hard—Even in the Fault Model

Marek Chrobak, Gerhard J. Woeginger, Haifeng Xu, 2012, Algorithmica.

On Nash equilibria and improvement cycles in pure positional strategies for Chess-like and Backgammon-like n-person games

Vladimir Gurvich, Khaled M. Elbassioni, Endre Boros, 2012, Discret. Math..

Dual-Bounded Generating Problems: Partial and Multiple Transversals of a Hypergraph

Vladimir Gurvich, Endre Boros, Leonid Khachiyan, 2001, SIAM J. Comput..

Special Section on Discrete Mathematics and Its Applications

Kazuhisa Makino, 2005, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

A combinatorial min-max theorem and minimization of pure-Horn functions

Endre Boros, Kazuhisa Makino, Ondrej Cepek, 2016, ISAIM.

Parameterized Complexity of Sparse Linear Complementarity Problems

Kazuhisa Makino, Naonori Kakimura, Hanna Sumita, 2016, Algorithmica.

Parameterized Edge Hamiltonicity

Kazuhisa Makino, Michael Lampis, Yushi Uno, 2014, WG.

Boolean Analysis of Incomplete Examples

Toshihide Ibaraki, Endre Boros, Kazuhisa Makino, 1996, SWAT.

Posimodular Function Optimization

Kazuhisa Makino, Toshimasa Ishii, Magnús M. Halldórsson, 2014, Algorithmica.

Deterministic random walks on finite graphs

Kazuhisa Makino, Shuji Kijima, Kentaro Koga, 2015, Random Struct. Algorithms.

Optimal Composition Ordering Problems for Piecewise Linear Functions

Kazuhisa Makino, Yasushi Kawase, Kento Seimi, 2017, Algorithmica.

MATHEMATICAL ENGINEERING TECHNICAL REPORTS Sparse Linear Complementarity Problems

Kazuhisa Makino, Naonori Kakimura, Hanna Sumita, 2013 .

Online Knapsack Problem Under Concave Functions

Ning Ma, Kazuhisa Makino, He Chen, 2017, FAW.

Efficient dualization of O(log n)-term monotone disjunctive normal forms

Kazuhisa Makino, 2003, Discret. Appl. Math..

Generating Partial and Multiple Transversals of a Hypergraph

Vladimir Gurvich, Endre Boros, Leonid Khachiyan, 2000, ICALP.

Discovery Science

Kazuhisa Makino, Thomas Eiter, K. Makino, 2003, Lecture Notes in Computer Science.

Algorithms and computation : 26th international symposium, ISAAC 2015, Nagoya, Japan, December 9-11, 2015 : proceedings

Kazuhisa Makino, Khaled Elbassioni, 2015 .

Decision lists and related Boolean functions

Toshihide Ibaraki, Kazuhisa Makino, Thomas Eiter, 2002, Theor. Comput. Sci..

Computing Intersections of Horn Theories for Reasoning with Models

Toshihide Ibaraki, Kazuhisa Makino, Thomas Eiter, 1998, Artif. Intell..

Deductive Inference for the Interiors and Exteriors of Horn Theories

Kazuhisa Makino, Hirotaka Ono, 2008, ISAAC.

Finding Simplices containing the Origin in Two and Three Dimensions

Khaled M. Elbassioni, Amr Elmasry, Kazuhisa Makino, 2011, Int. J. Comput. Geom. Appl..

Max- and Min-Neighborhood Monopolies

Kazuhisa Makino, Masafumi Yamashita, Tiko Kameda, 2000, SWAT.

How to Collect Balls Moving in the Euclidean Plane

Kazuhisa Makino, Takashi Horiyama, Masafumi Yamashita, 2004, Electron. Notes Theor. Comput. Sci..

On the Boolean Connectivity Problem for Horn Relations

Kazuhisa Makino, Masaki Yamamoto, Suguru Tamaki, 2007, SAT.

On Minimum Edge Ranking Spanning Trees

Toshihide Ibaraki, Kazuhisa Makino, Yushi Uno, 1999, MFCS.

Autark assignments of Horn CNFs

Kazuhisa Makino, Kei Kimura, 2018 .

Source Location Problems with Flow Requirements

Kazuhisa Makino, 2012, 2012 Third International Conference on Networking and Computing.

A representation of antimatroids by Horn rules and its application to educational systems pdf

Kazuhisa Makino, Hiroshi Hirai, Hiyori Yoshikawa, 2015, ArXiv.

Generating All Abductive Explanations for Queries on Propositional Horn Theories

Kazuhisa Makino, Thomas Eiter, K. Makino, 2003, CSL.

Unit Cost Buyback Problem

Kazuhisa Makino, Xin Han, Yasushi Kawase, 2013, ISAAC.

Proportional Cost Buyback Problem with Weight Bounds

Kazuhisa Makino, Xin Han, Yasushi Kawase, 2015, COCOA.

Fully Consistent Extensions of Partially Defined Boolean Functions with Missing Bits

Toshihide Ibaraki, Endre Boros, Kazuhisa Makino, 1995, IFIP TCS.

Sprague-Grundy function of symmetric hypergraphs

Vladimir Gurvich, Endre Boros, Kazuhisa Makino, 2018, J. Comb. Theory, Ser. A.

New results on monotone dualization and generating hypergraph transversals

Georg Gottlob, Kazuhisa Makino, Thomas Eiter, 2002, STOC '02.

Enumerating Vertices of Covering Polyhedra with Totally Unimodular Constraint Matrices

Khaled M. Elbassioni, Kazuhisa Makino, Khaled Elbassioni, 2020, SIAM J. Discret. Math..

Minimum Cost Source Location Problems with Flow Requirements

Kazuhisa Makino, Mariko Sakashita, Satoru Fujishige, 2006, LATIN.

Functional Dependencies in Horn Theories

Toshihide Ibaraki, Kazuhisa Makino, Alexander Kogan, 1999, Artif. Intell..

Double Horn Functions

Toshihide Ibaraki, Kazuhisa Makino, Thomas Eiter, 1998, Inf. Comput..

Finding Essential Attributes from Binary Data

Toshihide Ibaraki, Endre Boros, Kazuhisa Makino, 2003, Annals of Mathematics and Artificial Intelligence.

On the Sprague-Grundyfunction of Exact k-Nim

Vladimir Gurvich, Endre Boros, Kazuhisa Makino, 2015, Discret. Appl. Math..

A convex programming-based algorithm for mean payoff stochastic games with perfect information

Vladimir Gurvich, Khaled M. Elbassioni, Endre Boros, 2016, Optimization Letters.

Interactive regret minimization

Kazuhisa Makino, Ashwin Lall, Danupon Nanongkai, 2012, SIGMOD Conference.

Surrogate Optimization for p-Norms

Kazuhisa Makino, Yasushi Kawase, K. Makino, 2019, ISAAC.

Linear Satisfiability Preserving Assignments (Extended Abstract)

Kazuhisa Makino, Kei Kimura, K. Makino, 2018, IJCAI.

A Dichotomy Theorem within Schaefer for the Boolean Connectivity Problem

Kazuhisa Makino, Masaki Yamamoto, Suguru Tamaki, 2007, Electron. Colloquium Comput. Complex..

Enumerating Vertices of $0/1$-Polyhedra associated with $0/1$-Totally Unimodular Matrices

Khaled M. Elbassioni, Kazuhisa Makino, K. Makino, 2017, SWAT.

Minimizing a monotone concave function with laminar covering constraints

Kazuhisa Makino, Mariko Sakashita, Satoru Fujishige, 2005, Discret. Appl. Math..

Online Unweighted Knapsack Problem with Removal Cost

Kazuhisa Makino, Xin Han, Yasushi Kawase, 2013, Algorithmica.

An Evacuation Problem in Tree Dynamic Networks with Multiple Exits

Kazuhisa Makino, Satoru Fujishige, Satoko Mamada, 2005 .

Computational aspects of monotone dualization: A brief survey

Georg Gottlob, Kazuhisa Makino, Thomas Eiter, 2008, Discret. Appl. Math..

Enumerating Spanning and Connected Subsets in Graphs and Matroids

Vladimir Gurvich, Konrad Borys, Khaled M. Elbassioni, 2006, ESA.

On Randomized Fictitious Play for Approximating Saddle Points Over Convex Sets

Kurt Mehlhorn, Khaled M. Elbassioni, Kazuhisa Makino, 2013, Algorithmica.

The Maximum Latency and Identification of Positive Boolean Functions

Toshihide Ibaraki, Kazuhisa Makino, 1994, ISAAC.

On Expressing Majority as a Majority of Majorities

Kazuhisa Makino, Anup Rao, Christian Engels, 2017, Electron. Colloquium Comput. Complex..

Source location problem with flow requirements in directed networks

Kazuhisa Makino, Satoru Fujishige, Hiro Ito, 2003, Optim. Methods Softw..

Guest Editors’ Foreword

Khaled M. Elbassioni, Kazuhisa Makino, 2017, Algorithmica.

On the Difference of Horn Theories

Toshihide Ibaraki, Kazuhisa Makino, Thomas Eiter, 2000, J. Comput. Syst. Sci..

Randomized algorithms for online knapsack problems

Kazuhisa Makino, Xin Han, Yasushi Kawase, 2013, Theor. Comput. Sci..

Locating Sources to Meet Flow Demands in Undirected Networks

Kazuhisa Makino, Satoru Iwata, Satoru Fujishige, 2002, J. Algorithms.

Generating Cut Conjunctions in Graphs and Related Problems

Vladimir Gurvich, Konrad Borys, Khaled M. Elbassioni, 2007, Algorithmica.

Computing knapsack solutions with cardinality robustness

Kazuhisa Makino, Naonori Kakimura, Kento Seimi, 2011, ISAAC.

On Minimum Edge Ranking Spanning Trees

Toshihide Ibaraki, Kazuhisa Makino, Yushi Uno, 2001, J. Algorithms.

Surrogate optimization for p-norms

Kazuhisa Makino, Yasushi Kawase, 2019, Discret. Optim..

Horn Extensions of a Partially Defined Boolean Function

Toshihide Ibaraki, Kazuhisa Makino, Ken'ichi Hatanaka, 1999, SIAM J. Comput..

Unit Cost Buyback Problem

Kazuhisa Makino, Xin Han, Yasushi Kawase, 2018, Theory of Computing Systems.

Envy-free Relaxations for Goods, Chores, and Mixed Items pdf

Endre Boros, Kazuhisa Makino, Naoyuki Kamiyama, 2020, ArXiv.

MATHEMATICAL ENGINEERING TECHNICAL REPORTS

Kazuhisa Makino, Yusuke Kobayashi, Ryo Fujita, 2010 .

Parameterized Algorithms for Parity Games

Kazuhisa Makino, Jakub Gajarský, Sebastian Ordyniak, 2015, MFCS.

Total dual integrality of the linear complementarity problem

Kazuhisa Makino, Naonori Kakimura, Hanna Sumita, 2018, Ann. Oper. Res..

Online Knapsack Problems with a Resource Buffer pdf

Kazuhisa Makino, Yasushi Kawase, Xin Han, 2019, ISAAC.

An exact algorithm for the Boolean connectivity problem for k-CNF

Kazuhisa Makino, Masaki Yamamoto, Suguru Tamaki, 2010, Theor. Comput. Sci..

Logical Analysis of Binary Data with Missing Bits

Toshihide Ibaraki, Endre Boros, Kazuhisa Makino, 1999, Artif. Intell..

A pseudo-polynomial algorithm for mean payoff stochastic games with perfect information and few random positions

Vladimir Gurvich, Endre Boros, Kazuhisa Makino, 2019, Inf. Comput..

Two-Face Horn Extensions

Toshihide Ibaraki, Kazuhisa Makino, Thomas Eiter, 1997, ISAAC.

Minimum Transversals in Posi-modular Systems

Hiroshi Nagamochi, Kazuhisa Makino, Mariko Sakashita, 2006, ESA.

Optimal Composition Ordering Problems for Piecewise Linear Functions

Kazuhisa Makino, Yasushi Kawase, Kento Seimi, 2016, ISAAC.

On computing all abductive explanations from a propositional Horn theory

Kazuhisa Makino, Thomas Eiter, K. Makino, 2007, JACM.

Online minimization knapsack problem

Kazuhisa Makino, Xin Han, K. Makino, 2009, Theor. Comput. Sci..

Robust Independence Systems

Kazuhisa Makino, Naonori Kakimura, K. Makino, 2011, SIAM J. Discret. Math..

Enumerating disjunctions and conjunctions of paths and cuts in reliability theory

Vladimir Gurvich, Khaled M. Elbassioni, Endre Boros, 2007, Discret. Appl. Math..

A Potential Reduction Algorithm for Two-Person Zero-Sum Mean Payoff Stochastic Games

Vladimir Gurvich, Khaled M. Elbassioni, Endre Boros, 2018, Dyn. Games Appl..

Sparse Linear Complementarity Problems

Kazuhisa Makino, Naonori Kakimura, Hanna Sumita, 2013, CIAC.

Online Knapsack Problem Under Concave Functions

Kazuhisa Makino, Xin Han, Qinyang Chen, 2019, FAW.

New Algorithms for Enumerating All Maximal Cliques

Kazuhisa Makino, Takeaki Uno, K. Makino, 2004, SWAT.

Systems and human science : for safety, security, and dependability : selected papers of the 1st International Symposium SSR 2003

Tatsuo Arai, Kazuhisa Makino, Shigeru Yamamoto, 2005 .

MATHEMATICAL ENGINEERING TECHNICAL REPORTS Generating vertices of polyhedra and related problems of monotone generation

Vladimir Gurvich, Khaled M. Elbassioni, Endre Boros, 2009 .

MATHEMATICAL ENGINEERING TECHNICAL REPORTS Satisability Preserving Assignments and Their Local and Linear Forms

Kazuhisa Makino, Kei Kimura, 2014 .

On Generating All Minimal Integer Solutions for a Monotone System of Linear Inequalities

Vladimir Gurvich, Khaled M. Elbassioni, Endre Boros, 2001, ICALP.

The Maximum Latency and Identification of Positive Boolean Functions

Toshihide Ibaraki, Kazuhisa Makino, T. Ibaraki, 1994, SIAM J. Comput..

Strong Duality in Horn Minimization

Endre Boros, Kazuhisa Makino, Ondrej Cepek, 2017, FCT.

Abduction and the Dualization Problem

Kazuhisa Makino, Thomas Eiter, 2003, Discovery Science.

Logical analysis of data: classification with justification

Toshihide Ibaraki, Endre Boros, Kazuhisa Makino, 2011, Ann. Oper. Res..

Trichotomy for Integer Linear Systems Based on Their Sign Patterns

Kazuhisa Makino, Kei Kimura, 2012, STACS.

Posi-modular Systems with Modulotone Requirements under Permutation Constraints

Kazuhisa Makino, Toshimasa Ishii, 2009, ISAAC.

Minimum Cost Source Location Problems with Flow Requirements

Kazuhisa Makino, Mariko Sakashita, Satoru Fujishige, 2007, Algorithmica.

in Graphs and Related Problems

Vladimir Gurvich, Konrad Borys, Endre Boros, 2007 .

A Pseudo-Polynomial Algorithm for Mean Payoff Stochastic Games with Perfect Information and a Few Random Positions pdf

Vladimir Gurvich, Khaled M. Elbassioni, Endre Boros, 2013, ICALP.

An O(n log2n) algorithm for the optimal sink location problem in dynamic tree networks

Kazuhisa Makino, Takeaki Uno, Satoru Fujishige, 2006, Discret. Appl. Math..

A Multiplicative Weight Updates Algorithm for Packing and Covering Semi-infinite Linear Programs

Khaled M. Elbassioni, Kazuhisa Makino, Waleed Najy, 2016, Algorithmica.

Robust Independence Systems

Kazuhisa Makino, Naonori Kakimura, 2011, ICALP.

Algorithms and Computation

Khaled M. Elbassioni, Kazuhisa Makino, Khaled Elbassioni, 2015, Lecture Notes in Computer Science.

Minimum edge ranking spanning trees of split graphs

Toshihide Ibaraki, Kazuhisa Makino, Yushi Uno, 2006, Discret. Appl. Math..

Online Knapsack Problems with Limited Cuts

Kazuhisa Makino, Xin Han, 2009, ISAAC.

Maximally Satisfying Lower Quotas in the Hospitals/Residents Problem with Ties pdf

Kazuhisa Makino, Shuichi Miyazaki, Yu Yokoi, 2021, STACS.

On the Sprague–Grundy function of extensions of proper Nim

Vladimir Gurvich, Endre Boros, Kazuhisa Makino, 2020, International Journal of Game Theory.

Optimal Matroid Partitioning Problems

Kazuhisa Makino, Yasushi Kawase, Hanna Sumita, 2021, Algorithmica.

Fair and Truthful Mechanism with Limited Subsidy pdf

Makoto Yokoo, Kazuhisa Makino, Yasushi Kawase, 2021, AAMAS.

Reallocation Problems with Minimum Completion Time pdf

Kazuhisa Makino, Toshimasa Ishii, Jun Kawahara, 2021, ArXiv.

Tetris Hypergraphs and Combinations of Impartial Games

Vladimir Gurvich, Endre Boros, Kazuhisa Makino, 2017, 1701.02819.

Nash-solvable two-person symmetric cycle game forms

Vladimir Gurvich, Endre Boros, Kazuhisa Makino, 2011, Discret. Appl. Math..

AN O ( n log 2 n ) ALGORITHM FOR A SINK LOCATION PROBLEM IN DYNAMIC TREE NETWORKS

Kazuhisa Makino, Takeaki Uno, Satoru Fujishige, 2004 .

A TREE PARTITIONING PROBLEM ARISING FROM AN EVACUATION PROBLEM IN TREE DYNAMIC NETWORKS

Kazuhisa Makino, Takeaki Uno, Satoru Fujishige, 2005 .

Extended Complementary Nim

Vladimir Gurvich, Endre Boros, Kazuhisa Makino, 2015 .

Dual-Bounded Hypergraphs: A Survey∗

Vladimir Gurvich, Khaled M. Elbassioni, Endre Boros, 2002 .

Extended Complementary Nim

Vladimir Gurvich, Endre Boros, Kazuhisa Makino, 2015, 1504.06926.

Nash-solvable bidirected cyclic two-person game forms

Vladimir Gurvich, Endre Boros, Kazuhisa Makino, 2008 .

Optimal Sink Location Problem for Dynamic Flows in a Tree Network

Kazuhisa Makino, Satoru Fujishige, Satoko Mamada, 2002, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

Generating k-Vertex Connected Spanning Subgraphs and k-Edge Connected Spanning Subgraphs

Vladimir Gurvich, Konrad Borys, Khaled M. Elbassioni, 2006 .

Enumerating Spanning and Connected Subsets in Graphs and Matroids

Vladimir Gurvich, Konrad Borys, Khaled M. Elbassioni, 2007 .

Games: Smoothed Analysis and Approximation Schemes ?

Vladimir Gurvich, Mahmoud Fouz, Endre Boros, 2011 .

Computing knapsack solutions with cardinality robustness

Kazuhisa Makino, Naonori Kakimura, Kento Seimi, 2012 .

On minimal and locally minimal true vectors and weakly monotone Boolean functions

Vladimir Gurvich, Endre Boros, Kazuhisa Makino, 2009 .