The following pages link to Chen-Hao Wang (Q493493):
Displayed 32 items.
- A lattice Boltzmann model for electromagnetic waves propagating in a one-dimensional dispersive medium (Q493495) (← links)
- A lattice Boltzmann approach for the non-Newtonian effect in the blood flow (Q651453) (← links)
- (Q1617664) (redirect page) (← links)
- The equilibrium existence of a robust routing game under interval uncertainty (Q1617665) (← links)
- Mechanism design for two-opposite-facility location games with penalties on distance (Q1617675) (← links)
- Algorithms for the ring star problem (Q1708589) (← links)
- Algorithms for the metric ring star problem with fixed edge-cost ratio (Q2051906) (← links)
- Discrete load balancing on complete bipartite graphs (Q2059905) (← links)
- Monotone \(k\)-submodular secretary problems: cardinality and knapsack constraints (Q2140573) (← links)
- Mechanisms for dual-role-facility location games: truthfulness and approximability (Q2172605) (← links)
- Cake cutting with single-peaked valuations (Q2180180) (← links)
- The efficiency of Nash equilibria in the load balancing game with a randomizing scheduler (Q2197545) (← links)
- A fast approach to deformable surface 3D tracking (Q2276030) (← links)
- Tight efficiency lower bounds for strategy-proof mechanisms in two-opposite-facility location game (Q2656357) (← links)
- Assortment optimization with repeated exposures and product-dependent patience cost (Q2670462) (← links)
- On maximizing a monotone \(k\)-submodular function under a knapsack constraint (Q2670465) (← links)
- A note on the online interval scheduling secretary problem (Q2670476) (← links)
- Mechanism design for facility location games with candidate locations (Q2692230) (← links)
- Price of fairness in budget division for egalitarian social welfare (Q2692242) (← links)
- Mechanism design for facility location with fractional preferences and minimum distance (Q2695319) (← links)
- (Q2726044) (← links)
- (Q2991009) (← links)
- (Q3437666) (← links)
- Strategyproof facility location with limited locations (Q6047582) (← links)
- Discrete facility location games with different preferences (Q6053969) (← links)
- Facility location games with ordinal preferences (Q6057849) (← links)
- Facility location games with ordinal preferences (Q6113836) (← links)
- Two-facility-location games with mixed types of agents (Q6128681) (← links)
- Obnoxious facility location games with candidate locations (Q6167010) (← links)
- Monotone \(k\)-submodular knapsack maximization: an analysis of the Greedy+Singleton algorithm (Q6167014) (← links)
- \textsc{Greedy+Singleton}: an efficient approximation algorithm for \(k\)-submodular knapsack maximization (Q6180752) (← links)
- On maximizing a monotone $k$-submodular function under a knapsack constraint (Q6369037) (← links)