The following pages link to Mohammad Ghodsi (Q306072):
Displaying 50 items.
- Optimal space coverage with white convex polygons (Q306074) (← links)
- Euclidean movement minimization (Q306076) (← links)
- \(\alpha\)-visibility (Q390160) (← links)
- On non-progressive spread of influence through social networks (Q401306) (← links)
- Optimal online pricing with network externalities (Q413256) (← links)
- Permutation betting markets: singleton betting with extra information (Q547299) (← links)
- Incremental labeling in closed-2PM model (Q605701) (← links)
- Scheduling tasks with exponential duration on unrelated parallel machines (Q714038) (← links)
- Label updating to avoid point-shaped obstacles in fixed model (Q861261) (← links)
- Near optimal line segment queries in simple polygons (Q891822) (← links)
- Pipelined operator tree scheduling in heterogeneous environments. (Q1398809) (← links)
- Randomized approximation algorithms for planar visibility counting problem (Q1685962) (← links)
- Expand the shares together: envy-free mechanisms with a small number of cuts (Q1739119) (← links)
- Geometric spanners in the MapReduce model (Q1791036) (← links)
- Space/query-time tradeoff for computing the visibility polygon (Q1931284) (← links)
- Equilibrium pricing with positive externalities (Q1945927) (← links)
- Clearing an orthogonal polygon to find the evaders (Q2210525) (← links)
- Maximin share guarantee for goods with positive externalities (Q2244422) (← links)
- Visibility extension via mirror-edges to cover invisible segments (Q2272374) (← links)
- Covering orthogonal polygons with sliding \(k\)-transmitters (Q2310756) (← links)
- Rent division among groups (Q2327142) (← links)
- Visibility testing and counting (Q2346552) (← links)
- Weak visibility counting in simple polygons (Q2351072) (← links)
- Walking in streets with minimal sensing (Q2355994) (← links)
- Spanning trees with minimum weighted degrees (Q2380008) (← links)
- Optimal point removal in closed-2PM labeling (Q2380053) (← links)
- Shortest paths in simple polygons with polygon-meet constraints (Q2390305) (← links)
- Approximate minimum diameter (Q2412413) (← links)
- Visibility testing and counting for uncertain segments (Q2420576) (← links)
- Efficient observer-dependent simplification in polygonal domains (Q2428687) (← links)
- An efficient universal addition scheme for all hybrid-redundant representations with weighted bit-set encoding (Q2432112) (← links)
- Scheduling to minimize gaps and power consumption (Q2434309) (← links)
- Pricing in population games with semi-rational agents (Q2450608) (← links)
- Query point visibility computation in polygons with holes (Q2462733) (← links)
- Query-point visibility constrained shortest paths in simple polygons (Q2465622) (← links)
- Fair allocation of indivisible goods: beyond additive valuations (Q2667816) (← links)
- Robots’ Cooperation for Finding a Target in Streets (Q2798018) (← links)
- An Improved Constant-Factor Approximation Algorithm for Planar Visibility Counting Problem (Q2817863) (← links)
- Walking in Streets with Minimal Sensing (Q2867134) (← links)
- On the Non-progressive Spread of Influence through Social Networks (Q2894476) (← links)
- α-Visibility (Q2904538) (← links)
- Optimal Strategy for Walking in Streets with Minimum Number of Turns for a Simple Robot (Q2942385) (← links)
- How to Extend Visibility Polygons by Mirrors to Cover Invisible Segments (Q2980897) (← links)
- White Space Regions (Q3075521) (← links)
- Length-constrained path-matchings in graphs (Q3150130) (← links)
- (Q3401225) (← links)
- An approximation algorithm for<i>d</i><sub>1</sub>-optimal motion of a rod robot with fixed rotations (Q3423757) (← links)
- Visiting a Polygon on the Optimal Way to a Query Point (Q3507339) (← links)
- (Q3535949) (← links)
- An Approximation Algorithm for the k-Level Uncapacitated Facility Location Problem with Penalties (Q3628452) (← links)
