Kazuhisa Makino - Citegraph

Author Info

Name	Affiliation	Papers
KAZUHISA MAKINO	Division of Systems Science, Graduate School of Engineering Science, Osaka University, Toyonaka, Osaka 560, Japan	159
Collaborators	Citations	PageRank
126	1088	102.74
Referers	Referees	References
1315	1320	1865

Search Limit

1001000

Publications (100 rows)

Collaborators (100 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
Fair Ride Allocation on a Line	0	0.34	2022
Fair and Truthful Mechanism with Limited Subsidy.	0	0.34	2022
Minimizing submodular functions on diamonds via generalized fractional matroid matchings	0	0.34	2022
Generating Clause Sequences Of A Cnf Formula	0	0.34	2021
Optimal Matroid Partitioning Problems	0	0.34	2021
Ranking top-k trees in tree-based phylogenetic networks.	0	0.34	2019
Total dual integrality of the linear complementarity problem.	0	0.34	2019
Online knapsack problem under concave functions.	0	0.34	2019
Online Knapsack Problems with a Resource Buffer.	0	0.34	2019
Approximation Schemes for Stochastic Mean Payoff Games with Perfect Information and Few Random Positions.	0	0.34	2018
Linear Satisfiability Preserving Assignments.	0	0.34	2018
Strong Duality in Horn Minimization.	0	0.34	2017
Parameterized Complexity of Sparse Linear Complementarity Problems.	0	0.34	2017
Online Knapsack Problem Under Concave Functions.	0	0.34	2017
A Convex Programming-based Algorithm for Mean Payoff Stochastic Games with Perfect Information.	1	0.35	2017
A nested family of $\varvec{k}$ -total effective rewards for positional games.	1	0.37	2017
Enumerating Vertices of $0/1$-Polyhedra associated with $0/1$-Totally Unimodular Matrices.	0	0.34	2017
Surrogate Optimization for p-Norms.	0	0.34	2016
Markov Decision Processes and Stochastic Games with Total Effective Payoff.	1	0.36	2015
A Potential Reduction Algorithm for Two-person Zero-sum Mean Payoff Stochastic Games	0	0.34	2015
Parameterized Algorithms for Parity Games.	2	0.38	2015
Randomized algorithms for online knapsack problems.	7	0.53	2015
Augmenting edge-connectivity between vertex subsets	2	0.45	2014
Nested Family of Cyclic Games with $k$-total Effective Rewards.	1	0.35	2014
On Randomized Fictitious Play for Approximating Saddle Points Over Convex Sets	1	0.37	2013
A pseudo-polynomial algorithm for mean payoff stochastic games with perfect information and a few random positions	4	0.44	2013
On discounted approximations of undiscounted stochastic games and Markov decision processes with limited randomness.	2	0.38	2013
On Canonical Forms for Zero-Sum Stochastic Mean Payoff Games	7	0.51	2013
Unit Cost Buyback Problem.	1	0.37	2013
Robust independence systems	0	0.34	2013
Sparse Linear Complementarity Problems.	1	0.36	2013
Robust Matchings and Matroid Intersections	1	0.36	2013
On Nash equilibria and improvement cycles in pure positional strategies for Chess-like and Backgammon-like n-person games	9	0.88	2012
Source Location Problems with Flow Requirements	0	0.34	2012
Online Knapsack Problem with Removal Cost.	5	0.47	2012
Caching Is Hard—Even in the Fault Model	26	0.90	2012
Finding Simplices Containing The Origin In Two And Three Dimensions	2	0.40	2011
Derandomizing HSSW algorithm for 3-SAT	1	0.36	2011
Nash-solvable two-person symmetric cycle game forms	6	0.82	2011
An exact algorithm for the Boolean connectivity problem for k-CNF	9	0.64	2011
On the readability of monotone Boolean formulae	7	0.55	2011
Stochastic mean payoff games: smoothed analysis and approximation schemes	9	0.49	2011
On the Boolean Connectivity Problem for Horn Relations	7	0.65	2010
A pumping algorithm for ergodic stochastic mean payoff games with perfect information	13	1.27	2010
Acyclic, or totally tight, two-person game forms: Characterization and main properties	7	0.73	2010
On effectivity functions of game forms	7	0.76	2010
Online removable knapsack with limited cuts	6	0.51	2010
Left-to-Right Multiplication for Monotone Boolean Dualization	1	0.36	2010
Online Knapsack Problems with Limited Cuts	1	0.35	2009
Minimal and locally minimal games and game forms	5	0.63	2009

1
2
50 / page