Data Analysis by Positive Decision Trees. - Kazuhisa Makino; Takashi Suda; Kojin Yano; Toshihide Ibaraki (CODAS, 1996)

Boolean Analysis of Incomplete Examples. - Endre Boros; Toshihide Ibaraki; Kazuhisa Makino (SWAT, 1996)

Interior and Exterior Functions of Boolean Functions. - Kazuhisa Makino; Toshihide Ibaraki (Discret. Appl. Math., 1996)

Monotone Extensions of Boolean Data Sets. - Endre Boros; Toshihide Ibaraki; Kazuhisa Makino (ALT, 1997)

Two-Face Horn Extensions. - Thomas Eiter; Toshihide Ibaraki; Kazuhisa Makino (ISAAC, 1997)

Positive and Horn Decomposability of Partially Defined Boolean Functions. - Kazuhisa Makino; Kojin Yano; Toshihide Ibaraki (Discret. Appl. Math., 1997)

The Maximum Latency and Identification of Positive Boolean Functions. - Kazuhisa Makino; Toshihide Ibaraki (SIAM J. Comput., 1997)

On Disguised Double Horn Functions and Extensions. - Thomas Eiter; Toshihide Ibaraki; Kazuhisa Makino (STACS, 1998)

Error-Free and Best-Fit Extensions of Partially Defined Boolean Functions. - Endre Boros; Toshihide Ibaraki; Kazuhisa Makino (Inf. Comput., 1998)

Double Horn Functions. - Thomas Eiter; Toshihide Ibaraki; Kazuhisa Makino (Inf. Comput., 1998)

A Fast and Simple Algorithm for Identifying 2-Monotonic Positive Boolean Functions. - Kazuhisa Makino; Toshihide Ibaraki (J. Algorithms, 1998)

Logical Analysis of Binary Data with Missing Bits. - Endre Boros; Toshihide Ibaraki; Kazuhisa Makino (Artif. Intell., 1999)

Computing Intersections of Horn Theories for Reasoning with Models. - Thomas Eiter; Toshihide Ibaraki; Kazuhisa Makino (Artif. Intell., 1999)

Functional Dependencies in Horn Theories. - Toshihide Ibaraki; Alexander Kogan; Kazuhisa Makino (Artif. Intell., 1999)

Minimum Self-dual Decompositions of Positive Dual-minor Boolean Functions. - Jan C. Bioch; Toshihide Ibaraki; Kazuhisa Makino (Discret. Appl. Math., 1999)

Bidual Horn Functions and Extensions. - Thomas Eiter; Toshihide Ibaraki; Kazuhisa Makino (Discret. Appl. Math., 1999)

Inner-core and Outer-core Functions of Partially Defined Boolean Functions. - Kazuhisa Makino; Toshihide Ibaraki (Discret. Appl. Math., 1999)

Horn Extensions of a Partially Defined Boolean Function. - Kazuhisa Makino; Ken'ichi Hatanaka; Toshihide Ibaraki (SIAM J. Comput., 1999)

Generating Partial and Multiple Transversals of a Hypergraph. - Endre Boros; Vladimir Gurvich; Leonid Khachiyan; Kazuhisa Makino (ICALP, 2000)

Finding Essential Attributes in Binary Data. - Endre Boros; Takashi Horiyama; Toshihide Ibaraki; Kazuhisa Makino; Mutsunori Yagiura (IDEAL, 2000)

Fully Consistent Extensions of Partially Defined Boolean Functions with Missing Bits. - Endre Boros; Toshihide Ibaraki; Kazuhisa Makino (IFIP TCS, 2000)

Efficient generation of all regular non-dominated coteries. - Kazuhisa Makino; Tiko Kameda (PODC, 2000)

On the Difference of Horn Theories. - Thomas Eiter; Toshihide Ibaraki; Kazuhisa Makino (J. Comput. Syst. Sci., 2000)

Dual-Bounded Generating Problems: Partial and Multiple Transversals of a Hypergraph. - Endre Boros; Vladimir Gurvich; Leonid Khachiyan; Kazuhisa Makino (SIAM J. Comput., 2000)

On Generating All Minimal Integer Solutions for a Monotone System of Linear Inequalities. - Endre Boros; Khaled M. Elbassioni; Vladimir Gurvich; Leonid Khachiyan; Kazuhisa Makino (ICALP, 2001)

On functional dependencies in q-Horn theories. - Toshihide Ibaraki; Alexander Kogan; Kazuhisa Makino (Artif. Intell., 2001)

A Satisfiability Formulation of Problems on Level Graphs. - Bert Randerath; Ewald Speckenmeyer; Endre Boros; Peter L. Hammer; Alexander Kogan; Kazuhisa Makino; Bruno Simeone; Ondrej Cepek (Electron. Notes Discret. Math., 2001)

On Minimum Edge Ranking Spanning Trees. - Kazuhisa Makino; Yushi Uno; Toshihide Ibaraki (J. Algorithms, 2001)

Disjunctions of Horn Theories and Their Cores. - Thomas Eiter; Toshihide Ibaraki; Kazuhisa Makino (SIAM J. Comput., 2001)

Transformations on Regular Nondominated Coteries and Their Applications. - Kazuhisa Makino; Tiko Kameda (SIAM J. Discret. Math., 2001)

On Computing all Abductive Explanations. - Thomas Eiter; Kazuhisa Makino (AAAI/IAAI, 2002)

Minimum Edge Ranking Spanning Trees of Threshold Graphs. - Kazuhisa Makino; Yushi Uno; Toshihide Ibaraki (ISAAC, 2002)

On the Complexity of Generating Maximal Frequent and Minimal Infrequent Sets. - Endre Boros; Vladimir Gurvich; Leonid Khachiyan; Kazuhisa Makino (STACS, 2002)

Max- and Min-Neighborhood Monopolies. - Kazuhisa Makino; Masafumi Yamashita; Tiko Kameda (Algorithmica, 2002)

Optimal Sink Location Problem for Dynamic Flows in a Tree Network. - Satoko Mamada; Kazuhisa Makino; Satoru Fujishige (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2002)

Recognition and dualization of disguised bidual Horn functions. - Thomas Eiter; Toshihide Ibaraki; Kazuhisa Makino (Inf. Process. Lett., 2002)

A simple matching algorithm for regular bipartite graphs. - Kazuhisa Makino; Takashi Takabatake; Satoru Fujishige (Inf. Process. Lett., 2002)

Locating Sources to Meet Flow Demands in Undirected Networks. - Kouji Arata; Satoru Iwata 001; Kazuhisa Makino; Satoru Fujishige (J. Algorithms, 2002)

A linear time algorithm for recognizing regular Boolean functions. - Kazuhisa Makino (J. Algorithms, 2002)

Dual-Bounded Generating Problems: All Minimal Integer Solutions for a Monotone System of Linear Inequalities. - Endre Boros; Khaled M. Elbassioni; Vladimir Gurvich; Leonid Khachiyan; Kazuhisa Makino (SIAM J. Comput., 2002)

Decision lists and related Boolean functions. - Thomas Eiter; Toshihide Ibaraki; Kazuhisa Makino (Theor. Comput. Sci., 2002)

Logical analysis of data with decomposable structures. - Hirotaka Ono 001; Kazuhisa Makino; Toshihide Ibaraki (Theor. Comput. Sci., 2002)

Generating All Abductive Explanations for Queries on Propositional Horn Theories. - Thomas Eiter; Kazuhisa Makino (CSL, 2003)

Abduction and the Dualization Problem. - Thomas Eiter; Kazuhisa Makino (Discovery Science, 2003)

An Intersection Inequality for Discrete Distributions and Related Generation Problems. - Endre Boros; Khaled M. Elbassioni; Vladimir Gurvich; Leonid Khachiyan; Kazuhisa Makino (ICALP, 2003)

On Maximal Frequent and Minimal Infrequent Sets in Binary Matrices. - Endre Boros; Vladimir Gurvich; Leonid Khachiyan; Kazuhisa Makino (Ann. Math. Artif. Intell., 2003)

Finding Essential Attributes from Binary Data. - Endre Boros; Takashi Horiyama; Toshihide Ibaraki; Kazuhisa Makino; Mutsunori Yagiura (Ann. Math. Artif. Intell., 2003)

Inferring Minimal Functional Dependencies in Horn and q-Horn Theories. - Toshihide Ibaraki; Alexander Kogan; Kazuhisa Makino (Ann. Math. Artif. Intell., 2003)

Efficient dualization of O(log n)-term monotone disjunctive normal forms. - Kazuhisa Makino (Discret. Appl. Math., 2003)

Interior and exterior functions of positive Boolean functions. - Kazuhisa Makino; Hirotaka Ono 001; Toshihide Ibaraki (Discret. Appl. Math., 2003)

Variations on extending partially defined Boolean functions with missing bits. - Endre Boros; Toshihide Ibaraki; Kazuhisa Makino (Inf. Comput., 2003)

Source location problem with flow requirements in directed networks. - Hiro Ito; Kazuhisa Makino; Kouji Arata; Shoji Honami; Yuichiro Itatsu; Satoru Fujishige (Optim. Methods Softw., 2003)

New Results on Monotone Dualization and Generating Hypergraph Transversals. - Thomas Eiter; Georg Gottlob; Kazuhisa Makino (SIAM J. Comput., 2003)

An O(n log 2n) Algorithm for the Optimal Sink Location Problem in Dynamic Tree Networks. - Satoko Mamada; Takeaki Uno; Kazuhisa Makino; Satoru Fujishige (IFIP TCS, 2004)

Generating Paths and Cuts in Multi-pole (Di)graphs. - Endre Boros; Khaled M. Elbassioni; Vladimir Gurvich; Leonid Khachiyan; Kazuhisa Makino (MFCS, 2004)

New Algorithms for Enumerating All Maximal Cliques. - Kazuhisa Makino; Takeaki Uno (SWAT, 2004)

Dual-bounded generating problems: weighted transversals of a hypergraph. - Endre Boros; Vladimir Gurvich; Leonid Khachiyan; Kazuhisa Makino (Discret. Appl. Math., 2004)

Polybasic polyhedra: structure of polyhedra with edge vectors of support size at most 2. - Satoru Fujishige; Kazuhisa Makino; Takashi Takabatake; Kenji Kashiwabara (Discret. Math., 2004)

Generating Cut Conjunctions and Bridge Avoiding Extensions in Graphs. - Leonid Khachiyan; Endre Boros; Konrad Borys; Khaled M. Elbassioni; Vladimir Gurvich; Kazuhisa Makino (ISAAC, 2005)

Special Section on Discrete Mathematics and Its Applications. - Kazuhisa Makino (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2005)

On the Complexity of Some Enumeration Problems for Matroids. - Leonid G. Khachiyan; Endre Boros; Khaled M. Elbassioni; Vladimir Gurvich; Kazuhisa Makino (SIAM J. Discret. Math., 2005)

Enumerating Spanning and Connected Subsets in Graphs and Matroids. - Leonid Khachiyan; Endre Boros; Konrad Borys; Khaled M. Elbassioni; Vladimir Gurvich; Kazuhisa Makino (ESA, 2006)

Minimum Transversals in Posi-modular Systems. - Mariko Sakashita; Kazuhisa Makino; Hiroshi Nagamochi; Satoru Fujishige (ESA, 2006)

How to collect balls moving in the Euclidean plane. - Yuichi Asahiro; Takashi Horiyama; Kazuhisa Makino; Hirotaka Ono 001; Toshinori Sakuma; Masafumi Yamashita (Discret. Appl. Math., 2006)

Minimum edge ranking spanning trees of split graphs. - Kazuhisa Makino; Yushi Uno; Toshihide Ibaraki (Discret. Appl. Math., 2006)

An O(n log2n) algorithm for the optimal sink location problem in dynamic tree networks. - Satoko Mamada; Takeaki Uno; Kazuhisa Makino; Satoru Fujishige (Discret. Appl. Math., 2006)

Finding Intersections of Bichromatic Segments Defined by Points. - Amr Elmasry; Kazuhisa Makino (CCCG, 2007)

Generating Minimal k-Vertex Connected Spanning Subgraphs. - Endre Boros; Konrad Borys; Khaled M. Elbassioni; Vladimir Gurvich; Kazuhisa Makino; Gábor Rudolf (COCOON, 2007)

Enumerating disjunctions and conjunctions of paths and cuts in reliability theory. - Leonid Khachiyan; Endre Boros; Khaled M. Elbassioni; Vladimir Gurvich; Kazuhisa Makino (Discret. Appl. Math., 2007)

A Dichotomy Theorem within Schaefer for the Boolean Connectivity Problem. - Kazuhisa Makino; Suguru Tamaki; Masaki Yamamoto 001 (Electron. Colloquium Comput. Complex., 2007)

On computing all abductive explanations from a propositional Horn theory. - Thomas Eiter; Kazuhisa Makino (J. ACM, 2007)

Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data. - Leonid Khachiyan; Endre Boros; Khaled M. Elbassioni; Vladimir Gurvich; Kazuhisa Makino (Theor. Comput. Sci., 2007)

A Complete Characterization of Nash-Solvability of Bimatrix Games in Terms of the Exclusion of Certain 2×2 Subgames. - Endre Boros; Khaled M. Elbassioni; Vladimir Gurvich; Kazuhisa Makino; Vladimir Oudalov (CSR, 2008)

New Results for Horn Cores and Envelopes of Horn Disjunctions. - Thomas Eiter; Kazuhisa Makino (ECAI, 2008)

On Berge Multiplication for Monotone Boolean Dualization. - Endre Boros; Khaled M. Elbassioni; Kazuhisa Makino (ICALP (1), 2008)

Generating Cut Conjunctions in Graphs and Related Problems. - Leonid Khachiyan; Endre Boros; Konrad Borys; Khaled M. Elbassioni; Vladimir Gurvich; Kazuhisa Makino (Algorithmica, 2008)

Minimum Cost Source Location Problems with Flow Requirements. - Mariko Sakashita; Kazuhisa Makino; Satoru Fujishige (Algorithmica, 2008)

Computational aspects of monotone dualization: A brief survey. - Thomas Eiter; Kazuhisa Makino; Georg Gottlob (Discret. Appl. Math., 2008)

Minimizing a monotone concave function with laminar covering constraints. - Mariko Sakashita; Kazuhisa Makino; Satoru Fujishige (Discret. Appl. Math., 2008)

Output-Sensitive Algorithms for Enumerating Minimal Transversals for Some Geometric Hypergraphs. - Khaled M. Elbassioni; Kazuhisa Makino; Imran Rauf (ESA, 2009)

A Fast and Simple Parallel Algorithm for the Monotone Duality Problem. - Endre Boros; Kazuhisa Makino (ICALP (1), 2009)

Online Knapsack Problems with Limited Cuts. - Xin Han; Kazuhisa Makino (ISAAC, 2009)

Minimal and locally minimal games and game forms. - Endre Boros; Vladimir Gurvich; Kazuhisa Makino (Discret. Math., 2009)

On the fractional chromatic number of monotone self-dual Boolean functions. - Daya Ram Gaur; Kazuhisa Makino (Discret. Math., 2009)

Minimum Transversals in Posimodular Systems. - Mariko Sakashita; Kazuhisa Makino; Hiroshi Nagamochi; Satoru Fujishige (SIAM J. Discret. Math., 2009)

A Pumping Algorithm for Ergodic Stochastic Mean Payoff Games with Perfect Information. - Endre Boros; Khaled M. Elbassioni; Vladimir Gurvich; Kazuhisa Makino (IPCO, 2010)

An Exact Algorithm for the Boolean Connectivity Problem for k-CNF. - Kazuhisa Makino; Suguru Tamaki; Masaki Yamamoto 001 (SAT, 2010)

On the Boolean connectivity problem for Horn relations. - Kazuhisa Makino; Suguru Tamaki; Masaki Yamamoto 001 (Discret. Appl. Math., 2010)

Acyclic, or totally tight, two-person game forms: Characterization and main properties. - Endre Boros; Vladimir Gurvich; Kazuhisa Makino; Dávid Papp (Discret. Math., 2010)

Posi-Modular Systems with Modulotone Requirements under Permutation Constraints. - Toshimasa Ishii; Kazuhisa Makino (Discret. Math. Algorithms Appl., 2010)

On effectivity functions of game forms. - Endre Boros; Khaled M. Elbassioni; Vladimir Gurvich; Kazuhisa Makino (Games Econ. Behav., 2010)

Left-to-Right Multiplication for Monotone Boolean Dualization. - Endre Boros; Khaled M. Elbassioni; Kazuhisa Makino (SIAM J. Comput., 2010)

Online removable knapsack with limited cuts. - Xin Han; Kazuhisa Makino (Theor. Comput. Sci., 2010)

Stochastic Mean Payoff Games: Smoothed Analysis and Approximation Schemes. - Endre Boros; Khaled M. Elbassioni; Mahmoud Fouz; Vladimir Gurvich; Kazuhisa Makino; Bodo Manthey (ICALP (1), 2011)

Computing Knapsack Solutions with Cardinality Robustness. - Naonori Kakimura; Kazuhisa Makino; Kento Seimi (ISAAC, 2011)

Logical analysis of data: classification with justification. - Endre Boros; Yves Crama; Peter L. Hammer; Toshihide Ibaraki; Alexander Kogan; Kazuhisa Makino (Ann. Oper. Res., 2011)

Nash-solvable two-person symmetric cycle game forms. - Endre Boros; Vladimir Gurvich; Kazuhisa Makino; Wei Shao (Discret. Appl. Math., 2011)

Finding Simplices containing the Origin in Two and Three Dimensions. - Khaled M. Elbassioni; Amr Elmasry; Kazuhisa Makino (Int. J. Comput. Geom. Appl., 2011)

On the readability of monotone Boolean formulae. - Khaled M. Elbassioni; Kazuhisa Makino; Imran Rauf (J. Comb. Optim., 2011)

Nonadaptive broadcasting in trees. - Hovhannes A. Harutyunyan; Arthur L. Liestman; Kazuhisa Makino; Thomas C. Shermer (Networks, 2011)

An exact algorithm for the Boolean connectivity problem for k-CNF. - Kazuhisa Makino; Suguru Tamaki; Masaki Yamamoto 001 (Theor. Comput. Sci., 2011)

Online Knapsack Problem with Removal Cost. - Xin Han; Yasushi Kawase; Kazuhisa Makino (COCOON, 2012)

Source Location Problems with Flow Requirements. - Kazuhisa Makino (ICNC, 2012)

Interactive regret minimization. - Danupon Nanongkai; Ashwin Lall; Atish Das Sarma; Kazuhisa Makino (SIGMOD Conference, 2012)

Caching Is Hard - Even in the Fault Model. - Marek Chrobak; Gerhard J. Woeginger; Kazuhisa Makino; Haifeng Xu (Algorithmica, 2012)

On Nash equilibria and improvement cycles in pure positional strategies for Chess-like and Backgammon-like n-person games. - Endre Boros; Khaled M. Elbassioni; Vladimir Gurvich; Kazuhisa Makino (Discret. Math., 2012)

Deductive inference for the interiors and exteriors of horn theories. - Kazuhisa Makino; Hirotaka Ono 001 (ACM Trans. Comput. Log., 2012)

Randomized Algorithms for Removable Online Knapsack Problems. - Xin Han; Yasushi Kawase; Kazuhisa Makino (FAW-AAIM, 2013)

Sparse Linear Complementarity Problems. - Hanna Sumita; Naonori Kakimura; Kazuhisa Makino (CIAC, 2013)

Derandomizing the HSSW Algorithm for 3-SAT. - Kazuhisa Makino; Suguru Tamaki; Masaki Yamamoto 001 (Algorithmica, 2013)

On Canonical Forms for Zero-Sum Stochastic Mean Payoff Games. - Endre Boros; Khaled M. Elbassioni; Vladimir Gurvich; Kazuhisa Makino (Dyn. Games Appl., 2013)

On discounted approximations of undiscounted stochastic games and Markov decision processes with limited randomness. - Endre Boros; Khaled M. Elbassioni; Vladimir Gurvich; Kazuhisa Makino (Oper. Res. Lett., 2013)

Robust Matchings and Matroid Intersections. - Ryo Fujita; Yusuke Kobayashi 001; Kazuhisa Makino (SIAM J. Discret. Math., 2013)

Robust Independence Systems. - Naonori Kakimura; Kazuhisa Makino (SIAM J. Discret. Math., 2013)

Nash equilibria with minimum potential in undirected broadcast games. - Yasushi Kawase; Kazuhisa Makino (Theor. Comput. Sci., 2013)

A Potential Reduction Algorithm for Ergodic Two-Person Zero-Sum Limiting Average Payoff Stochastic Games. - Endre Boros; Khaled M. Elbassioni; Vladimir Gurvich; Kazuhisa Makino (COCOA, 2014)

Online Unweighted Knapsack Problem with Removal Cost. - Xin Han; Yasushi Kawase; Kazuhisa Makino (Algorithmica, 2014)

Augmenting Edge-Connectivity between Vertex Subsets. - Toshimasa Ishii; Kazuhisa Makino (Algorithmica, 2014)

Nested Family of Cyclic Games with $k$-total Effective Rewards. - Endre Boros; Khaled M. Elbassioni; Vladimir Gurvich; Kazuhisa Makino (CoRR, 2014)

Posimodular Function Optimization. - Toshimasa Ishii; Kazuhisa Makino (CoRR, 2014)

Online removable knapsack problem under convex function. - Xin Han; Yasushi Kawase; Kazuhisa Makino; He Guo 001 (Theor. Comput. Sci., 2014)

Parameterized Algorithms for Parity Games. - Jakub Gajarský; Michael Lampis; Kazuhisa Makino; Valia Mitsou; Sebastian Ordyniak (MFCS (2), 2015)

Markov Decision Processes and Stochastic Games with Total Effective Payoff. - Endre Boros; Khaled M. Elbassioni; Vladimir Gurvich; Kazuhisa Makino (STACS, 2015)

On Randomized Fictitious Play for Approximating Saddle Points Over Convex Sets. - Khaled M. Elbassioni; Kazuhisa Makino; Kurt Mehlhorn; Fahimeh Ramezani 002 (Algorithmica, 2015)

A representation of antimatroids by Horn rules and its application to educational systems. - Hiyori Yoshikawa; Hiroshi Hirai 001; Kazuhisa Makino (CoRR, 2015)

The Linear Complementarity Problems with a Few Variables per Constraint. - Hanna Sumita; Naonori Kakimura; Kazuhisa Makino (Math. Oper. Res., 2015)

Deterministic random walks on finite graphs. - Shuji Kijima; Kentaro Koga; Kazuhisa Makino (Random Struct. Algorithms, 2015)

Randomized algorithms for online knapsack problems. - Xin Han; Yasushi Kawase; Kazuhisa Makino (Theor. Comput. Sci., 2015)

A combinatorial min-max theorem and minimization of pure-Horn functions. - Endre Boros; Ondrej Cepek; Kazuhisa Makino (ISAIM, 2016)

A Multiplicative Weights Update Algorithm for Packing and Covering Semi-infinite Linear Programs. - Khaled M. Elbassioni; Kazuhisa Makino; Waleed Najy (WAOA, 2016)

Trichotomy for integer linear systems based on their sign patterns. - Kei Kimura; Kazuhisa Makino (Discret. Appl. Math., 2016)

Sufficient conditions for the existence of Nash equilibria in bimatrix games in terms of forbidden (2 times 2 ) subgames. - Endre Boros; Khaled M. Elbassioni; Vladimir Gurvich; Kazuhisa Makino; Vladimir Oudalov (Int. J. Game Theory, 2016)

Online minimization knapsack problem. - Xin Han; Kazuhisa Makino (Theor. Comput. Sci., 2016)

Online Knapsack Problem Under Concave Functions. - Xin Han; Ning Ma; Kazuhisa Makino; He Chen (FAW, 2017)

Strong Duality in Horn Minimization. - Endre Boros; Ondrej Cepek; Kazuhisa Makino (FCT, 2017)

Guest Editors' Foreword. - Khaled M. Elbassioni; Kazuhisa Makino (Algorithmica, 2017)

Parameterized Complexity of Sparse Linear Complementarity Problems. - Hanna Sumita; Naonori Kakimura; Kazuhisa Makino (Algorithmica, 2017)

On Expressing Majority as a Majority of Majorities. - Christian Engels; Mohit Garg 003; Kazuhisa Makino; Anup Rao 001 (Electron. Colloquium Comput. Complex., 2017)

A nested family of ( varvec{k} ) -total effective rewards for positional games. - Endre Boros; Khaled M. Elbassioni; Vladimir Gurvich; Kazuhisa Makino (Int. J. Game Theory, 2017)

A convex programming-based algorithm for mean payoff stochastic games with perfect information. - Endre Boros; Khaled M. Elbassioni; Vladimir Gurvich; Kazuhisa Makino (Optim. Lett., 2017)

Linear Satisfiability Preserving Assignments (Extended Abstract). - Kei Kimura; Kazuhisa Makino (IJCAI, 2018)

Enumerating Vertices of 0/1-Polyhedra associated with 0/1-Totally Unimodular Matrices. - Khaled M. Elbassioni; Kazuhisa Makino (SWAT, 2018)

Approximation Schemes for Stochastic Mean Payoff Games with Perfect Information and Few Random Positions. - Endre Boros; Khaled M. Elbassioni; Mahmoud Fouz; Vladimir Gurvich; Kazuhisa Makino; Bodo Manthey (Algorithmica, 2018)

Optimal Composition Ordering Problems for Piecewise Linear Functions. - Yasushi Kawase; Kazuhisa Makino; Kento Seimi (Algorithmica, 2018)

Finding Sparse Solutions for Packing and Covering Semidefinite Programs. - Khaled M. Elbassioni; Kazuhisa Makino (CoRR, 2018)

On the Sprague-Grundyfunction of Exact k-Nim. - Endre Boros; Vladimir Gurvich; Nhan Bao Ho; Kazuhisa Makino; Peter Mursic (Discret. Appl. Math., 2018)

Parameterized Edge Hamiltonicity. - Michael Lampis; Kazuhisa Makino; Valia Mitsou; Yushi Uno (Discret. Appl. Math., 2018)

A Potential Reduction Algorithm for Two-Person Zero-Sum Mean Payoff Stochastic Games. - Endre Boros; Khaled M. Elbassioni; Vladimir Gurvich; Kazuhisa Makino (Dyn. Games Appl., 2018)

Linear Satisfiability Preserving Assignments. - Kei Kimura; Kazuhisa Makino (J. Artif. Intell. Res., 2018)

Oracle-Based Primal-Dual Algorithms for Packing and Covering Semidefinite Programs. - Khaled M. Elbassioni; Kazuhisa Makino (ESA, 2019)

Online Knapsack Problems with a Resource Buffer. - Xin Han; Yasushi Kawase; Kazuhisa Makino; Haruki Yokomaku (ISAAC, 2019)

A Multiplicative Weight Updates Algorithm for Packing and Covering Semi-infinite Linear Programs. - Khaled M. Elbassioni; Kazuhisa Makino; Waleed Najy (Algorithmica, 2019)

Total dual integrality of the linear complementarity problem. - Hanna Sumita; Naonori Kakimura; Kazuhisa Makino (Ann. Oper. Res., 2019)

Surrogate optimization for p-norms. - Yasushi Kawase; Kazuhisa Makino (Discret. Optim., 2019)

A pseudo-polynomial algorithm for mean payoff stochastic games with perfect information and few random positions. - Endre Boros; Khaled M. Elbassioni; Vladimir Gurvich; Kazuhisa Makino (Inf. Comput., 2019)

Sprague-Grundy function of symmetric hypergraphs. - Endre Boros; Vladimir Gurvich; Nhan Bao Ho; Kazuhisa Makino; Peter Mursic (J. Comb. Theory A, 2019)

Unit Cost Buyback Problem. - Yasushi Kawase; Xin Han; Kazuhisa Makino (Theory Comput. Syst., 2019)

Sprague-Grundy function of matroids and related hypergraphs. - Endre Boros; Vladimir Gurvich; Nhan Bao Ho; Kazuhisa Makino; Peter Mursic (Theor. Comput. Sci., 2019)

Online knapsack problem under concave functions. - Xin Han; Qinyang Chen; Kazuhisa Makino (Theor. Comput. Sci., 2019)

Proportional cost buyback problem with weight bounds. - Yasushi Kawase; Xin Han; Kazuhisa Makino (Theor. Comput. Sci., 2019)

The Steiner Problem for Count Matroids. - Tibor Jordán; Yusuke Kobayashi 001; Ryoga Mahara; Kazuhisa Makino (IWOCA, 2020)

Enumerating Vertices of Covering Polyhedra with Totally Unimodular Constraint Matrices. - Khaled M. Elbassioni; Kazuhisa Makino (SIAM J. Discret. Math., 2020)

Optimal Matroid Partitioning Problems. - Yasushi Kawase; Kei Kimura; Kazuhisa Makino; Hanna Sumita (Algorithmica, 2021)

On the Sprague-Grundy function of extensions of proper Nim. - Endre Boros; Vladimir Gurvich; Nhan Bao Ho; Kazuhisa Makino (Int. J. Game Theory, 2021)

Generating clause sequences of a CNF formula. - Kristóf Bérczi; Endre Boros; Ondrej Cepek; Khaled M. Elbassioni; Petr Kucera; Kazuhisa Makino (Theor. Comput. Sci., 2021)

Incomplete List Setting of the Hospitals/Residents Problem with Maximally Satisfying Lower Quotas. - Kazuhisa Makino; Shuichi Miyazaki; Yu Yokoi (SAGT, 2022)

Online Scheduling on Identical Machines with a Metric State Space. - Hiromichi Goko; Akitoshi Kawamura; Yasushi Kawase; Kazuhisa Makino; Hanna Sumita (STACS, 2022)

Maximally Satisfying Lower Quotas in the Hospitals/Residents Problem with Ties. - Hiromichi Goko; Kazuhisa Makino; Shuichi Miyazaki; Yu Yokoi (STACS, 2022)

Posimodular Function Optimization. - Magnús M. Halldórsson; Toshimasa Ishii; Kazuhisa Makino; Kenjiro Takazawa (Algorithmica, 2022)

Maximally Satisfying Lower Quotas in the Hospitals/Residents Problem with Ties and Incomplete Lists. - Kazuhisa Makino; Shuichi Miyazaki; Yu Yokoi (CoRR, 2022)

Minimizing submodular functions on diamonds via generalized fractional matroid matchings. - Satoru Fujishige; Tamás Király; Kazuhisa Makino; Kenjiro Takazawa; Shin-ichi Tanigawa (J. Comb. Theory B, 2022)

Approximating Minimum Representations of Key Horn Functions. - Kristóf Bérczi; Endre Boros; Ondrej Cepek; Petr Kucera; Kazuhisa Makino (SIAM J. Comput., 2022)

Finding Sparse Solutions for Packing and Covering Semidefinite Programs. - Khaled M. Elbassioni; Kazuhisa Makino; Waleed Najy (SIAM J. Optim., 2022)

Unique key Horn functions. - Kristóf Bérczi; Endre Boros; Ondrej Cepek; Petr Kucera; Kazuhisa Makino (Theor. Comput. Sci., 2022)

Perfect Matchings and Popularity in the Many-To-Many Setting. - Telikepalli Kavitha; Kazuhisa Makino (FSTTCS, 2023)

A Combinatorial Certifying Algorithm for Linear Programming Problems with Gainfree Leontief Substitution Systems. - Kei Kimura; Kazuhisa Makino (ISAAC, 2023)

Trade-offs among degree, diameter, and number of paths. - Toshimasa Ishii; Akitoshi Kawamura; Yusuke Kobayashi 001; Kazuhisa Makino (Discret. Appl. Math., 2023)

Ranking Top-$k$ Trees in Tree-Based Phylogenetic Networks. - Momoko Hayamizu; Kazuhisa Makino (IEEE ACM Trans. Comput. Biol. Bioinform., 2023)

Towards Optimal Subsidy Bounds for Envy-Freeable Allocations. - Yasushi Kawase; Kazuhisa Makino; Hanna Sumita; Akihisa Tamura; Makoto Yokoo (AAAI, 2024)

Composition Orderings for Linear Functions and Matrix Multiplication Orderings. - Susumu Kubo; Kazuhisa Makino; Souta Sakamoto (ISAAC, 2024)

Arborescences, Colorful Forests, and Popularity. - Telikepalli Kavitha; Kazuhisa Makino; Ildikó Schlotter; Yu Yokoi (SODA, 2024)

Characterizing the integer points in 2-decomposable polyhedra by closedness under operations. - Kei Kimura; Kazuhisa Makino; Shota Yamada 001; Ryo Yoshizumi (CoRR, 2024)

Generating minimal redundant and maximal irredundant subhypergraphs. - Endre Boros; Kazuhisa Makino (Discret. Appl. Math., 2024)

A fair and truthful mechanism with limited subsidy. - Hiromichi Goko; Ayumi Igarashi 001; Yasushi Kawase; Kazuhisa Makino; Hanna Sumita; Akihisa Tamura; Yu Yokoi; Makoto Yokoo (Games Econ. Behav., 2024)

Hypergraph Horn Functions. - Kristóf Bérczi; Endre Boros; Kazuhisa Makino (SIAM J. Discret. Math., 2024)

Envy-free relaxations for goods, chores, and mixed items. - Kristóf Bérczi; Erika R. Bérczi-Kovács; Endre Boros; Fekadu Tolessa Gedefa; Naoyuki Kamiyama; Telikepalli Kavitha; Yusuke Kobayashi 001; Kazuhisa Makino (Theor. Comput. Sci., 2024)

Matroid Horn functions. - Kristóf Bérczi; Endre Boros; Kazuhisa Makino (J. Comb. Theory A, 2024)

Recognizing distributed approval voting forms and correspondences. - Endre Boros; Ondrej Cepek; Vladimir Gurvich; Kazuhisa Makino (Ann. Oper. Res., 2024)

A polynomial time algorithm for finding a minimum 4-partition of a submodular function. - Tsuyoshi Hirayama; Yuhao Liu 003; Kazuhisa Makino; Ke Shi; Chao Xu 002 (Math. Program., 2024)

Impartial games with decreasing Sprague-Grundy function and their hypergraph compound. - Endre Boros; Vladimir Gurvich; Nhan Bao Ho; Kazuhisa Makino; Peter Mursic (Int. J. Game Theory, 2024)

Computing remoteness functions of Moore, Wythoff, and Euclid's games. - Endre Boros; Vladimir Gurvich; Kazuhisa Makino; Michael N. Vyalyi (Int. J. Game Theory, 2024)

Scheduling on Identical Machines with Setup Time and Unknown Execution Time. - Yasushi Kawase; Kazuhisa Makino; Vinh Long Phan; Hanna Sumita (WADS, 2025)

Popular Arborescences and Their Matroid Generalization. - Telikepalli Kavitha; Kazuhisa Makino; Ildikó Schlotter; Yu Yokoi (ACM Trans. Algorithms, 2025)

A 3/4 differential approximation algorithm for traveling salesman problem. - Yuki Amano; Kazuhisa Makino (Theor. Comput. Sci., 2025)

On Nash Equilibria in Play-Once and Terminal Deterministic Graphical Games. - Endre Boros; Vladimir Gurvich; Kazuhisa Makino (CoRR, 2025)

Fair Ride Allocation on a Line. - Yuki Amano; Ayumi Igarashi 001; Yasushi Kawase; Kazuhisa Makino; Hirotaka Ono 001 (ACM Trans. Economics and Comput., 2025)

Reallocation Problems with Minimum Completion Time. - Toshimasa Ishii; Jun Kawahara; Kazuhisa Makino; Hirotaka Ono 001 (Algorithmica, 2025)