Shahin Kamali

According to our database1, Shahin Kamali authored at least 40 papers between 2005 and 2020.

Collaborative distances:



In proceedings 
PhD thesis 





Burning Two Worlds.
Proceedings of the SOFSEM 2020: Theory and Practice of Computer Science, 2020

Online Computation with Untrusted Advice.
Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020

Burning Two Worlds: Algorithms for Burning Dense and Tree-like Graphs.
CoRR, 2019

Online Bin Covering with Advice.
Proceedings of the Algorithms and Data Structures - 16th International Symposium, 2019

Approximation Algorithms for Graph Burning.
Proceedings of the Theory and Applications of Models of Computation, 2019

Lossless Image Compression Using List Update Algorithms.
Proceedings of the String Processing and Information Retrieval, 2019

An Efficient Miner Strategy for Selecting Cryptocurrency Transactions.
Proceedings of the IEEE International Conference on Blockchain, 2019

Online Bin Packing with Advice of Small Size.
Theory Comput. Syst., 2018

Compact Representation of Graphs of Small Clique-Width.
Algorithmica, 2018

Distributed Service Function Chaining.
IEEE Journal on Selected Areas in Communications, 2017

On the list update problem with advice.
Inf. Comput., 2017

Efficient broadcast trees for weighted vertices.
Discret. Appl. Math., 2017

Robust Multi-tenant Server Consolidation in the Cloud for Data Analytics Workloads.
Proceedings of the 37th IEEE International Conference on Distributed Computing Systems, 2017

Online List Update.
Encyclopedia of Algorithms, 2016

On the Advice Complexity of the k-server Problem Under Sparse Metrics.
Theory Comput. Syst., 2016

Online Bin Packing with Advice.
Algorithmica, 2016

Compact Navigation Oracles for Graphs with Bounded Clique-Width.
Proceedings of the 2016 Data Compression Conference, 2016

On Minimum- and Maximum-Weight Minimum Spanning Trees with Neighborhoods.
Theory Comput. Syst., 2015

Efficient Online Strategies for Renting Servers in the Cloud.
Proceedings of the SOFSEM 2015: Theory and Practice of Computer Science, 2015

All-Around Near-Optimal Solutions for the Online Bin Packing Problem.
Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

Hermes: Dynamic Partitioning for Distributed Social Network Graph Databases.
Proceedings of the 18th International Conference on Extending Database Technology, 2015

HDRF: Stream-Based Partitioning for Power-Law Graphs.
Proceedings of the 24th ACM International Conference on Information and Knowledge Management, 2015

Online Packing of Equilateral Triangles.
Proceedings of the 27th Canadian Conference on Computational Geometry, 2015

Efficient Bin Packing Algorithms for Resource Provisioning in the Cloud.
Proceedings of the Algorithmic Aspects of Cloud Computing - First International Workshop, 2015

Alternative Approaches for Analysis of Bin Packing and List Update Problems.
PhD thesis, 2014

An All-Around Near-Optimal Solution for the Classic Bin Packing Problem.
CoRR, 2014

Compact Navigation and Distance Oracles for Graphs with Small Treewidth.
Algorithmica, 2014

On the online fault-tolerant server consolidation problem.
Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures, 2014

Better Compression through Better List Update Algorithms.
Proceedings of the Data Compression Conference, 2014

Almost Online Square Packing.
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

Broadcasting in Conflict-Aware Multi-channel Networks.
Proceedings of the WALCOM: Algorithms and Computation, 7th International Workshop, 2013

Data Partitioning for Video-on-Demand Services.
Proceedings of the 2013 IEEE 12th International Symposium on Network Computing and Applications, 2013

Context-Based Algorithms for the List-Update Problem under Alternative Cost Models.
Proceedings of the 2013 Data Compression Conference, 2013

A Survey of Algorithms and Models for List Update.
Proceedings of the Space-Efficient Data Structures, 2013

Dynamic data allocation with replication in distributed systems.
Proceedings of the 30th IEEE International Performance Computing and Communications Conference, 2011

Optimum Broadcasting in Complete Weighted-Vertex Graphs.
Proceedings of the SOFSEM 2010: Theory and Practice of Computer Science, 2010

Multi-Shared-Trees Based Multicasting in Mesh-Connected Networks.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2008

Broadcasting in Weighted-Vertex Graphs.
Proceedings of the IEEE International Symposium on Parallel and Distributed Processing with Applications, 2008

Efficient Broadcasting in Networks with Weighted Nodes.
Proceedings of the 14th International Conference on Parallel and Distributed Systems, 2008

Dynamic Positioning Based on Voronoi Cells (DPVC).
Proceedings of the RoboCup 2005: Robot Soccer World Cup IX, 2005