Kazuhisa Makino
According to our database1,
Kazuhisa Makino
authored at least 191 papers
between 1996 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
CoRR, 2024
Characterizing the integer points in 2-decomposable polyhedra by closedness under operations.
CoRR, 2024
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024
2023
IEEE ACM Trans. Comput. Biol. Bioinform., 2023
A Polynomial Time Algorithm for Finding a Minimum 4-Partition of a Submodular Function.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023
A Combinatorial Certifying Algorithm for Linear Programming Problems with Gainfree Leontief Substitution Systems.
Proceedings of the 34th International Symposium on Algorithms and Computation, 2023
Proceedings of the 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2023
2022
SIAM J. Optim., 2022
Minimizing submodular functions on diamonds via generalized fractional matroid matchings.
J. Comb. Theory, Ser. B, 2022
Maximally Satisfying Lower Quotas in the Hospitals/Residents Problem with Ties and Incomplete Lists.
CoRR, 2022
Proceedings of the Theory and Applications of Models of Computation, 2022
Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022
Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022
Incomplete List Setting of the Hospitals/Residents Problem with Maximally Satisfying Lower Quotas.
Proceedings of the Algorithmic Game Theory - 15th International Symposium, 2022
Proceedings of the Algorithmic Game Theory - 15th International Symposium, 2022
Proceedings of the Computing and Combinatorics - 28th International Conference, 2022
Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems, 2022
2021
Int. J. Game Theory, 2021
2020
Enumerating Vertices of Covering Polyhedra with Totally Unimodular Constraint Matrices.
SIAM J. Discret. Math., 2020
Proceedings of the Combinatorial Algorithms - 31st International Workshop, 2020
2019
Theor. Comput. Sci., 2019
A pseudo-polynomial algorithm for mean payoff stochastic games with perfect information and few random positions.
Inf. Comput., 2019
A Multiplicative Weight Updates Algorithm for Packing and Covering Semi-infinite Linear Programs.
Algorithmica, 2019
Proceedings of the 30th International Symposium on Algorithms and Computation, 2019
Proceedings of the 27th Annual European Symposium on Algorithms, 2019
2018
A Potential Reduction Algorithm for Two-Person Zero-Sum Mean Payoff Stochastic Games.
Dyn. Games Appl., 2018
Algorithmica, 2018
Approximation Schemes for Stochastic Mean Payoff Games with Perfect Information and Few Random Positions.
Algorithmica, 2018
Enumerating Vertices of 0/1-Polyhedra associated with 0/1-Totally Unimodular Matrices.
Proceedings of the 16th Scandinavian Symposium and Workshops on Algorithm Theory, 2018
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018
2017
A convex programming-based algorithm for mean payoff stochastic games with perfect information.
Optim. Lett., 2017
Int. J. Game Theory, 2017
Algorithmica, 2017
Proceedings of the Fundamentals of Computation Theory - 21st International Symposium, 2017
Proceedings of the Frontiers in Algorithmics - 11th International Workshop, 2017
2016
Sufficient conditions for the existence of Nash equilibria in bimatrix games in terms of forbidden \(2 \times 2\) subgames.
Int. J. Game Theory, 2016
Discret. Appl. Math., 2016
A Multiplicative Weights Update Algorithm for Packing and Covering Semi-infinite Linear Programs.
Proceedings of the Approximation and Online Algorithms - 14th International Workshop, 2016
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2016
2015
Math. Oper. Res., 2015
A representation of antimatroids by Horn rules and its application to educational systems.
CoRR, 2015
Algorithmica, 2015
Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, 2015
Proceedings of the Mathematical Foundations of Computer Science 2015, 2015
2014
A Potential Reduction Algorithm for Ergodic Two-Person Zero-Sum Limiting Average Payoff Stochastic Games.
Proceedings of the Combinatorial Optimization and Applications, 2014
2013
Theor. Comput. Sci., 2013
On discounted approximations of undiscounted stochastic games and Markov decision processes with limited randomness.
Oper. Res. Lett., 2013
Proceedings of the Algorithms and Complexity, 8th International Conference, 2013
Proceedings of the Frontiers in Algorithmics <i>and</i> Algorithmic Aspects in Information and Management, 2013
2012
ACM Trans. Comput. Log., 2012
On Nash equilibria and improvement cycles in pure positional strategies for Chess-like and Backgammon-like n-person games.
Discret. Math., 2012
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2012
Proceedings of the Third International Conference on Networking and Computing, 2012
Proceedings of the Computing and Combinatorics - 18th Annual International Conference, 2012
2011
Theor. Comput. Sci., 2011
Int. J. Comput. Geom. Appl., 2011
Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011
Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011
2010
Discret. Math. Algorithms Appl., 2010
Acyclic, or totally tight, two-person game forms: Characterization and main properties.
Discret. Math., 2010
Proceedings of the Theory and Applications of Satisfiability Testing, 2010
A Pumping Algorithm for Ergodic Stochastic Mean Payoff Games with Perfect Information.
Proceedings of the Integer Programming and Combinatorial Optimization, 2010
2009
Discret. Math., 2009
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009
Proceedings of the Automata, Languages and Programming, 36th International Colloquium, 2009
Output-Sensitive Algorithms for Enumerating Minimal Transversals for Some Geometric Hypergraphs.
Proceedings of the Algorithms, 2009
2008
Discret. Appl. Math., 2008
Discret. Appl. Math., 2008
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008
Proceedings of the ECAI 2008, 2008
A Complete Characterization of Nash-Solvability of Bimatrix Games in Terms of the Exclusion of Certain 2×2 Subgames.
Proceedings of the Computer Science, 2008
2007
Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data.
Theor. Comput. Sci., 2007
J. ACM, 2007
Electron. Colloquium Comput. Complex., 2007
Discret. Appl. Math., 2007
Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007
Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007
2006
An O(n log<sup>2</sup>n) algorithm for the optimal sink location problem in dynamic tree networks.
Discret. Appl. Math., 2006
Proceedings of the Algorithms, 2006
2005
SIAM J. Discret. Math., 2005
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2005
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005
2004
Proceedings of Computing: The Australasian Theory Symposium, 2004
Polybasic polyhedra: structure of polyhedra with edge vectors of support size at most 2.
Discret. Math., 2004
Discret. Appl. Math., 2004
Proceedings of the Algorithm Theory, 2004
Proceedings of the Mathematical Foundations of Computer Science 2004, 2004
An O(n log 2n) Algorithm for the Optimal Sink Location Problem in Dynamic Tree Networks.
Proceedings of the Exploring New Frontiers of Theoretical Informatics, 2004
2003
SIAM J. Comput., 2003
Optim. Methods Softw., 2003
Inf. Comput., 2003
Discret. Appl. Math., 2003
Discret. Appl. Math., 2003
Ann. Math. Artif. Intell., 2003
Ann. Math. Artif. Intell., 2003
An Intersection Inequality for Discrete Distributions and Related Generation Problems.
Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003
Proceedings of the Discovery Science, 6th International Conference, 2003
Proceedings of the Computer Science Logic, 17th International Workshop, 2003
2002
Dual-Bounded Generating Problems: All Minimal Integer Solutions for a Monotone System of Linear Inequalities.
SIAM J. Comput., 2002
J. Algorithms, 2002
Inf. Process. Lett., 2002
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2002
Proceedings of the STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes, 2002
Proceedings of the Algorithms and Computation, 13th International Symposium, 2002
Proceedings of the Eighteenth National Conference on Artificial Intelligence and Fourteenth Conference on Innovative Applications of Artificial Intelligence, July 28, 2002
2001
SIAM J. Discret. Math., 2001
Electron. Notes Discret. Math., 2001
On Generating All Minimal Integer Solutions for a Monotone System of Linear Inequalities.
Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001
2000
SIAM J. Comput., 2000
Proceedings of the Nineteenth Annual ACM Symposium on Principles of Distributed Computing, 2000
Fully Consistent Extensions of Partially Defined Boolean Functions with Missing Bits.
Proceedings of the Theoretical Computer Science, 2000
Proceedings of the Intelligent Data Engineering and Automated Learning, 2000
Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000
1999
Discret. Appl. Math., 1999
Discret. Appl. Math., 1999
Artif. Intell., 1999
1998
J. Algorithms, 1998
Inf. Comput., 1998
1997
SIAM J. Comput., 1997
Discret. Appl. Math., 1997
Proceedings of the Algorithms and Computation, 8th International Symposium, 1997
Proceedings of the Algorithmic Learning Theory, 8th International Conference, 1997
1996
Data Analysis by Positive Decision Trees.
Proceedings of the International Symposium on Cooperative Database Systems for Advanced Applications, 1996