The following pages link to Yasushi Kawase (Q390910):
Displaying 37 items.
- Nash equilibria with minimum potential in undirected broadcast games (Q390911) (← links)
- Randomized algorithms for online knapsack problems (Q476887) (← links)
- On packing arborescences in temporal networks (Q477677) (← links)
- Online unweighted knapsack problem with removal cost (Q486978) (← links)
- Optimal composition ordering problems for piecewise linear functions (Q724224) (← links)
- Antimatroids induced by matchings (Q1730258) (← links)
- The densest subgraph problem with a convex/concave size function (Q1799206) (← links)
- Surrogate optimization for \(p\)-norms (Q2010926) (← links)
- Optimal matroid partitioning problems (Q2032344) (← links)
- Subgame perfect equilibria under the deferred acceptance algorithm (Q2041080) (← links)
- Finding a path with two labels forbidden in group-labeled graphs (Q2173429) (← links)
- A fast algorithm for multiprocessor speed-scaling problem minimizing completion time and energy consumption (Q2203586) (← links)
- Additive approximation algorithms for modularity maximization (Q2221809) (← links)
- Submodular maximization with uncertain knapsack capacity (Q2294723) (← links)
- Unit cost buyback problem (Q2322706) (← links)
- Proportional cost buyback problem with weight bounds (Q2424877) (← links)
- Online removable knapsack problem under convex function (Q2453163) (← links)
- Unit Cost Buyback Problem (Q2872107) (← links)
- Nash Equilibria with Minimum Potential in Undirected Broadcast Games (Q2889916) (← links)
- Online Knapsack Problem with Removal Cost (Q2914312) (← links)
- The Secretary Problem with a Choice Function (Q3459856) (← links)
- Surrogate Optimization for p-Norms (Q4636524) (← links)
- (Q4636525) (← links)
- Additive Approximation Algorithms for Modularity Maximization (Q4636526) (← links)
- The Densest Subgraph Problem with a Convex/Concave Size Function (Q4636527) (← links)
- Tight Approximation for Unconstrained XOS Maximization (Q5026453) (← links)
- Optimal Stopping Rules for Sequential Hypothesis Testing (Q5111719) (← links)
- (Q5136271) (← links)
- Submodular Maximization with Uncertain Knapsack Capacity (Q5232144) (← links)
- Randomized Algorithms for Removable Online Knapsack Problems (Q5405917) (← links)
- Proportional Cost Buyback Problem with Weight Bounds (Q5743550) (← links)
- (Q5875590) (← links)
- Randomized strategies for robust combinatorial optimization with approximate separation (Q6182680) (← links)
- Online scheduling on identical machines with a metric state space (Q6490980) (← links)
- A fair and truthful mechanism with limited subsidy (Q6494252) (← links)
- Efficient matching under general constraints (Q6565039) (← links)
- Fair division with two-sided preferences (Q6634122) (← links)
