The following pages link to Shahin Kamali (Q261386):
Displayed 32 items.
- Online bin packing with advice (Q261387) (← links)
- Compact navigation and distance oracles for graphs with small treewidth (Q472468) (← links)
- On the advice complexity of the \(k\)-server problem under sparse metrics (Q503460) (← links)
- On the list update problem with advice (Q515679) (← links)
- Efficient broadcast trees for weighted vertices (Q516786) (← links)
- Compact representation of graphs of small clique-width (Q724221) (← links)
- Online bin packing with advice of small size (Q2322702) (← links)
- Approximation algorithms for graph burning (Q2327458) (← links)
- On minimum- and maximum-weight minimum spanning trees with neighborhoods (Q2344217) (← links)
- Randomized two-valued bounded delay online buffer management (Q2661627) (← links)
- Compact representation of graphs with bounded bandwidth or treedepth (Q2672250) (← links)
- Cutting stock with rotation: packing square items into square bins (Q2692238) (← links)
- On Minimum-and Maximum-Weight Minimum Spanning Trees with Neighborhoods (Q2848917) (← links)
- A Survey of Algorithms and Models for List Update (Q2848979) (← links)
- On Advice Complexity of the k-server Problem under Sparse Metrics (Q2868631) (← links)
- (Q2965482) (← links)
- Compact Navigation and Distance Oracles for Graphs with Small Treewidth (Q3012812) (← links)
- Burning Two Worlds (Q3297761) (← links)
- Optimum Broadcasting in Complete Weighted-Vertex Graphs (Q3401112) (← links)
- Online Bin Packing with Advice of Small Size (Q3449804) (← links)
- All-Around Near-Optimal Solutions for the Online Bin Packing Problem (Q3459910) (← links)
- Broadcasting in Conflict-Aware Multi-channel Networks (Q4914444) (← links)
- Efficient Online Strategies for Renting Servers in the Cloud (Q5175114) (← links)
- (Q5875754) (← links)
- Online bin covering with advice (Q5919311) (← links)
- Online bin covering with advice (Q5925507) (← links)
- Online interval scheduling with predictions (Q6179410) (← links)
- Improved pyrotechnics: closer to the burning number conjecture (Q6197306) (← links)
- Approximation Algorithms for Graph Burning (Q6309522) (← links)
- Burning Two Worlds: Algorithms for Burning Dense and Tree-like Graphs (Q6324528) (← links)
- An improved bound on the burning number of graphs (Q6379266) (← links)
- Cops and Robbers on 1-Planar Graphs (Q6449668) (← links)