default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShahin Kamali
Person information
- affiliation: University of Manitoba, Winnipeg, Manitoba, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j19]Spyros Angelopoulos, Christoph Dürr
, Shendan Jin, Shahin Kamali, Marc P. Renault:
Online computation with untrusted advice. J. Comput. Syst. Sci. 144: 103545 (2024)- [c60]Saulo dos Santos, Japjeet Singh, Bakhshish Singh Dhillon, Ruppa K. Thulasiram, Cuneyt Akcora, Shahin Kamali:
On the Impact of the Lightning Network on Bitcoin Transaction Fees and Network Value. Blockchain 2024: 148-156 - [c59]Magnus Berg, Shahin Kamali, Katherine Ling, Cooper Sigrist:
Space-Efficient Data Structures for Polyominoes and Bar Graphs. DCC 2024: 253-262 - [c58]Saulo dos Santos, Japjeet Singh, Bakhshish Singh Dhillon, Ruppa K. Thulasiram, Shahin Kamali:
Second Layer Network Impact on Bitcoin Mining Fees and Network Value. ICBC 2024: 464-466 - [c57]Adam Lechowicz, Rik Sengupta, Bo Sun, Shahin Kamali, Mohammad Hajiesmaili:
Time Fairness in Online Knapsack Problems. ICLR 2024 - [c56]Ali Zeynali, Shahin Kamali, Mohammad Hajiesmaili:
Robust Learning-Augmented Dictionaries. ICML 2024 - [c55]Magnus Berg, Shahin Kamali:
Online Bin Covering with Frequency Predictions. SWAT 2024: 10:1-10:17 - [c54]Joan Boyar, Shahin Kamali, Kim S. Larsen, Ali Mohammad Lavasani, Yaqiao Li, Denis Pankratov:
On the Online Weighted Non-Crossing Matching Problem. SWAT 2024: 16:1-16:19 - [c53]Jeffrey Kam, Shahin Kamali, Avery Miller, Naomi Nishimura:
Reconfiguration of Multisets with Applications to Bin Packing. WALCOM 2024: 212-226 - [i24]Magnus Berg, Shahin Kamali:
Online Bin Covering with Frequency Predictions. CoRR abs/2401.14881 (2024) - [i23]Ali Zeynali, Shahin Kamali, Mohammad Hajiesmaili:
Robust Learning-Augmented Dictionaries. CoRR abs/2402.09687 (2024) - [i22]Jeffrey Kam, Shahin Kamali, Avery Miller, Naomi Nishimura:
Reconfiguration of Multisets with Applications to Bin Packing. CoRR abs/2405.05535 (2024) - 2023
- [j18]Paul Bastide, Marthe Bonamy, Anthony Bonato, Pierre Charbit, Shahin Kamali, Théo Pierron, Mikaël Rabie:
Improved Pyrotechnics: Closer to the Burning Number Conjecture. Electron. J. Comb. 30(4) (2023) - [j17]Spyros Angelopoulos, Shahin Kamali:
Contract Scheduling with Predictions. J. Artif. Intell. Res. 77: 395-426 (2023) - [j16]Spyros Angelopoulos, Shahin Kamali, Kimia Shadkami:
Online Bin Packing with Predictions. J. Artif. Intell. Res. 78: 1111-1141 (2023) - [c52]Stephane Durocher, Shahin Kamali, Pouria Zamani Nezhad:
Online Square Packing with Predictions. CCCG 2023: 9-18 - [c51]Shahin Kamali, Mohammadmasoud Shabanijou:
Improved Algorithms for Burning Planar Point Sets. CCCG 2023: 161-167 - [c50]Stephane Durocher, Shahin Kamali, Myroslav Kryven, Fengyi Liu, Amirhossein Mashghdoust, Avery Miller, Pouria Zamani Nezhad, Ikaro Penha Costa, Timothy Zapp:
Cops and Robbers on 1-Planar Graphs. GD (2) 2023: 3-17 - [c49]Spyros Angelopoulos, Shahin Kamali:
Rényi-Ulam Games and Online Computation with Imperfect Advice. MFCS 2023: 13:1-13:15 - [c48]Joan Boyar, Lene M. Favrholdt, Shahin Kamali, Kim S. Larsen:
Online Interval Scheduling with Predictions. WADS 2023: 193-207 - [i21]Spyros Angelopoulos, Shahin Kamali:
Rényi-Ulam Games and Online Computation with Imperfect Advice. CoRR abs/2301.01631 (2023) - [i20]Joan Boyar, Lene M. Favrholdt, Shahin Kamali, Kim S. Larsen:
Online Interval Scheduling with Predictions. CoRR abs/2302.13701 (2023) - [i19]Adam Lechowicz, Rik Sengupta, Bo Sun, Shahin Kamali, Mohammad H. Hajiesmaili:
Time Fairness in Online Knapsack Problems. CoRR abs/2305.13293 (2023) - [i18]Stephane Durocher, Shahin Kamali, Myroslav Kryven, Fengyi Liu, Amirhossein Mashghdoust, Avery Miller, Pouria Zamani Nezhad, Ikaro Penha Costa, Timothy Zapp:
Cops and Robbers on 1-Planar Graphs. CoRR abs/2309.01001 (2023) - [i17]Magnus Berg, Shahin Kamali, Katherine Ling, Cooper Sigrist:
Space-Efficient Data Structures for Polyominoes and Bar Graphs. CoRR abs/2311.16957 (2023) - 2022
- [j15]Shahin Kamali:
Compact representation of graphs with bounded bandwidth or treedepth. Inf. Comput. 285(Part): 104867 (2022) - [c47]Spyros Angelopoulos, Shahin Kamali, Dehou Zhang:
Online Search with Best-Price and Query-Based Predictions. AAAI 2022: 9652-9660 - [c46]Shahin Kamali, Pooya Nikbakht:
Online Square Packing with Rotation. CCCG 2022: 189-197 - [c45]Shahin Kamali, Pooya Nikbakht, Arezoo Sajadpour:
A Randomized Algorithm for Non-crossing Matching of Online Points. CCCG 2022: 198-204 - [c44]Saulo dos Santos, Japjeet Singh, Ruppa K. Thulasiram, Shahin Kamali, Louis Sirico, Lisa Loud:
A New Era of Blockchain-Powered Decentralized Finance (DeFi) - A Review. COMPSAC 2022: 1286-1292 - [c43]Spyros Angelopoulos, Shahin Kamali, Kimia Shadkami:
Online Bin Packing with Predictions. IJCAI 2022: 4574-4580 - 2021
- [j14]Joan Boyar, Lene M. Favrholdt, Shahin Kamali, Kim S. Larsen:
Online Bin Covering with Advice. Algorithmica 83(3): 795-821 (2021) - [j13]Md Momin Al Aziz, Shahin Kamali, Noman Mohammed, Xiaoqian Jiang:
Online Algorithm for Differentially Private Genome-wide Association Studies. ACM Trans. Comput. Heal. 2(2): 13:1-13:27 (2021) - [j12]Christoph Dürr, Shahin Kamali:
Randomized two-valued bounded delay online buffer management. Oper. Res. Lett. 49(2): 246-249 (2021) - [c42]Spyros Angelopoulos, Shahin Kamali:
Contract Scheduling With Predictions. AAAI 2021: 11726-11733 - [c41]Shahin Kamali, Pooya Nikbakht:
On the Fault-Tolerant Online Bin Packing Problem. ALGOCLOUD 2021: 1-17 - [c40]Shahin Kamali, Helen Xu:
Beyond Worst-case Analysis of Multicore Caching Strategies. APOCS 2021: 1-15 - [c39]Shahin Kamali:
Compact Polyominoes. DCC 2021: 346 - [i16]Spyros Angelopoulos, Shahin Kamali, Kimia Shadkami:
Online Bin Packing with Predictions. CoRR abs/2102.03311 (2021) - [i15]Shahin Kamali, Pooya Nikbakht:
On the Fault-Tolerant Online Bin Packing Problem. CoRR abs/2107.02922 (2021) - [i14]Spyros Angelopoulos, Diogo Arsénio, Shahin Kamali:
Competitive Sequencing with Noisy Advice. CoRR abs/2111.05281 (2021) - [i13]Spyros Angelopoulos, Shahin Kamali, Dehou Zhang:
Online Search With Best-Price and Query-Based Predictions. CoRR abs/2112.01592 (2021) - 2020
- [j11]Stephane Durocher, Shahin Kamali:
Foreword. Comput. Geom. 90: 101652 (2020) - [c38]Saulo dos Santos, Shahin Kamali, Ruppa K. Thulasiram:
Candidate Set Formation Policy for Mining Pools. Blockchain 2020: 415-420 - [c37]Prosenjit Bose, Paz Carmi, Stephane Durocher, Shahin Kamali, Arezoo Sajadpour:
Non-Crossing Matching of Online Points. CCCG 2020: 233-239 - [c36]Shahin Kamali, Pooya Nikbakht:
Cutting Stock with Rotation: Packing Square Items into Square Bins. COCOA 2020: 530-544 - [c35]Shahin Kamali:
Compact Representation of Graphs with Small Bandwidth and Treedepth. DCC 2020: 233-242 - [c34]Spyros Angelopoulos, Christoph Dürr, Shendan Jin, Shahin Kamali, Marc P. Renault:
Online Computation with Untrusted Advice. ITCS 2020: 52:1-52:15 - [c33]Shahin Kamali, Avery Miller, Kenny Zhang:
Burning Two Worlds. SOFSEM 2020: 113-124 - [c32]Shahin Kamali, Helen Xu:
Multicore Paging Algorithms Cannot Be Competitive. SPAA 2020: 547-549 - [i12]Christoph Dürr, Shahin Kamali:
Randomized Two-Valued Bounded Delay Online Buffer Management. CoRR abs/2004.14715 (2020) - [i11]Shahin Kamali, Helen Xu:
Beyond Worst-case Analysis of Multicore Caching Strategies. CoRR abs/2011.02046 (2020) - [i10]Spyros Angelopoulos, Shahin Kamali:
Contract Scheduling With Predictions. CoRR abs/2011.12439 (2020)
2010 – 2019
- 2019
- [j10]Saulo dos Santos, Muskan Vinayak, Ruppa K. Thulasiram, Parimala Thulasiraman, Shahin Kamali:
Validating pairwise transactions on cryptocurrencies: a novel heuristics and network simulation. J. Bank. Financial Technol. 3(1): 71-81 (2019) - [c31]Saulo dos Santos, Chukwuka Chukwuocha, Shahin Kamali, Ruppa K. Thulasiram:
An Efficient Miner Strategy for Selecting Cryptocurrency Transactions. Blockchain 2019: 116-123 - [c30]Arezoo Abdollahi, Neil D. B. Bruce, Shahin Kamali, Rezaul Karim:
Lossless Image Compression Using List Update Algorithms. SPIRE 2019: 16-34 - [c29]Anthony Bonato, Shahin Kamali:
Approximation Algorithms for Graph Burning. TAMC 2019: 74-92 - [c28]Joan Boyar, Lene M. Favrholdt, Shahin Kamali, Kim S. Larsen:
Online Bin Covering with Advice. WADS 2019: 225-238 - [i9]Joan Boyar, Lene M. Favrholdt, Shahin Kamali, Kim S. Larsen:
Online Bin Covering with Advice. CoRR abs/1905.00066 (2019) - [i8]Spyros Angelopoulos, Christoph Dürr, Shendan Jin, Shahin Kamali, Marc P. Renault:
Online Computation with Untrusted Advice. CoRR abs/1905.05655 (2019) - [i7]Shahin Kamali, Avery Miller, Kenny Zhang:
Burning Two Worlds: Algorithms for Burning Dense and Tree-like Graphs. CoRR abs/1909.00530 (2019) - 2018
- [j9]Shahin Kamali:
Compact Representation of Graphs of Small Clique-Width. Algorithmica 80(7): 2106-2131 (2018) - [j8]Spyros Angelopoulos, Christoph Dürr, Shahin Kamali, Marc P. Renault, Adi Rosén:
Online Bin Packing with Advice of Small Size. Theory Comput. Syst. 62(8): 2006-2034 (2018) - [e1]Stephane Durocher, Shahin Kamali:
Proceedings of the 30th Canadian Conference on Computational Geometry, CCCG 2018, August 8-10, 2018, University of Manitoba, Winnipeg, Manitoba, Canada. 2018 [contents] - [i6]Anthony Bonato, Shahin Kamali:
Approximation Algorithms for Graph Burning. CoRR abs/1811.04449 (2018) - 2017
- [j7]Hovhannes A. Harutyunyan, Shahin Kamali:
Efficient broadcast trees for weighted vertices. Discret. Appl. Math. 216: 598-608 (2017) - [j6]Joan Boyar, Shahin Kamali, Kim S. Larsen, Alejandro López-Ortiz:
On the list update problem with advice. Inf. Comput. 253: 411-423 (2017) - [j5]Milad Ghaznavi, Nashid Shahriar, Shahin Kamali, Reaz Ahmed, Raouf Boutaba:
Distributed Service Function Chaining. IEEE J. Sel. Areas Commun. 35(11): 2479-2489 (2017) - [c27]Joseph Mate, Khuzaima Daudjee, Shahin Kamali:
Robust Multi-tenant Server Consolidation in the Cloud for Data Analytics Workloads. ICDCS 2017: 2111-2118 - 2016
- [j4]Joan Boyar, Shahin Kamali, Kim S. Larsen, Alejandro López-Ortiz:
Online Bin Packing with Advice. Algorithmica 74(1): 507-527 (2016) - [j3]Sushmita Gupta, Shahin Kamali, Alejandro López-Ortiz:
On the Advice Complexity of the k-server Problem Under Sparse Metrics. Theory Comput. Syst. 59(3): 476-499 (2016) - [c26]Shahin Kamali:
Compact Navigation Oracles for Graphs with Bounded Clique-Width. DCC 2016: 566-576 - [r1]Shahin Kamali:
Online List Update. Encyclopedia of Algorithms 2016: 1448-1451 - 2015
- [j2]Reza Dorrigiv, Robert Fraser, Meng He, Shahin Kamali, Akitoshi Kawamura, Alejandro López-Ortiz, Diego Seco:
On Minimum- and Maximum-Weight Minimum Spanning Trees with Neighborhoods. Theory Comput. Syst. 56(1): 220-250 (2015) - [c25]Shahin Kamali:
Efficient Bin Packing Algorithms for Resource Provisioning in the Cloud. ALGOCLOUD 2015: 84-98 - [c24]Shahin Kamali, Alejandro López-Ortiz, Zahed Rahmati:
Online Packing of Equilateral Triangles. CCCG 2015 - [c23]Fabio Petroni, Leonardo Querzoni, Khuzaima Daudjee, Shahin Kamali, Giorgio Iacoboni:
HDRF: Stream-Based Partitioning for Power-Law Graphs. CIKM 2015: 243-252 - [c22]Daniel Nicoara, Shahin Kamali, Khuzaima Daudjee, Lei Chen:
Hermes: Dynamic Partitioning for Distributed Social Network Graph Databases. EDBT 2015: 25-36 - [c21]Shahin Kamali, Alejandro López-Ortiz:
All-Around Near-Optimal Solutions for the Online Bin Packing Problem. ISAAC 2015: 727-739 - [c20]Shahin Kamali, Alejandro López-Ortiz:
Efficient Online Strategies for Renting Servers in the Cloud. SOFSEM 2015: 277-288 - [c19]Spyros Angelopoulos, Christoph Dürr, Shahin Kamali, Marc P. Renault, Adi Rosén:
Online Bin Packing with Advice of Small Size. WADS 2015: 40-53 - 2014
- [b1]Shahin Kamali:
Alternative Approaches for Analysis of Bin Packing and List Update Problems. University of Waterloo, Ontario, Canada, 2014 - [j1]Arash Farzan, Shahin Kamali:
Compact Navigation and Distance Oracles for Graphs with Small Treewidth. Algorithmica 69(1): 92-116 (2014) - [c18]Shahin Kamali, Alejandro López-Ortiz:
Almost Online Square Packing. CCCG 2014 - [c17]Shahin Kamali, Alejandro López-Ortiz:
Better Compression through Better List Update Algorithms. DCC 2014: 372-381 - [c16]Joan Boyar, Shahin Kamali, Kim S. Larsen, Alejandro López-Ortiz:
On the List Update Problem with Advice. LATA 2014: 210-221 - [c15]Khuzaima Daudjee, Shahin Kamali, Alejandro López-Ortiz:
On the online fault-tolerant server consolidation problem. SPAA 2014: 12-21 - [c14]Joan Boyar, Shahin Kamali, Kim S. Larsen, Alejandro López-Ortiz:
Online Bin Packing with Advice. STACS 2014: 174-186 - [i5]Shahin Kamali, Alejandro López-Ortiz:
An All-Around Near-Optimal Solution for the Classic Bin Packing Problem. CoRR abs/1404.4526 (2014) - [i4]Shahin Kamali, Alejandro López-Ortiz:
Efficient Online Strategies for Renting Servers in the Cloud. CoRR abs/1408.4156 (2014) - 2013
- [c13]Shahin Kamali, Alejandro López-Ortiz:
A Survey of Algorithms and Models for List Update. Space-Efficient Data Structures, Streams, and Algorithms 2013: 251-266 - [c12]Shahin Kamali, Susana Ladra, Alejandro López-Ortiz, Diego Seco:
Context-Based Algorithms for the List-Update Problem under Alternative Cost Models. DCC 2013: 361-370 - [c11]Bairong Lei, Ivan Surya, Shahin Kamali, Khuzaima Daudjee:
Data Partitioning for Video-on-Demand Services. NCA 2013: 49-54 - [c10]Sushmita Gupta, Shahin Kamali, Alejandro López-Ortiz:
On Advice Complexity of the k-server Problem under Sparse Metrics. SIROCCO 2013: 55-67 - [c9]Francisco Claude, Reza Dorrigiv, Shahin Kamali, Alejandro López-Ortiz, Pawel Pralat, Jazmín Romero, Alejandro Salinger, Diego Seco:
Broadcasting in Conflict-Aware Multi-channel Networks. WALCOM 2013: 158-169 - [i3]Sushmita Gupta, Shahin Kamali, Alejandro López-Ortiz:
On Advice Complexity of the k-server Problem under Sparse Metrics. CoRR abs/1305.2108 (2013) - [i2]Joan Boyar, Shahin Kamali, Kim S. Larsen, Alejandro López-Ortiz:
On the List Update Problem with Advice. CoRR abs/1311.7357 (2013) - 2012
- [c8]Reza Dorrigiv, Robert Fraser, Meng He, Shahin Kamali, Akitoshi Kawamura, Alejandro López-Ortiz, Diego Seco:
On Minimum-and Maximum-Weight Minimum Spanning Trees with Neighborhoods. WAOA 2012: 93-106 - [i1]Joan Boyar, Shahin Kamali, Kim S. Larsen, Alejandro López-Ortiz:
Online Bin Packing with Advice. CoRR abs/1212.4016 (2012) - 2011
- [c7]Arash Farzan, Shahin Kamali:
Compact Navigation and Distance Oracles for Graphs with Small Treewidth. ICALP (1) 2011: 268-280 - [c6]Shahin Kamali, Pedram Ghodsnia, Khuzaima Daudjee:
Dynamic data allocation with replication in distributed systems. IPCCC 2011: 1-8 - 2010
- [c5]Hovhannes A. Harutyunyan, Shahin Kamali:
Optimum Broadcasting in Complete Weighted-Vertex Graphs. SOFSEM 2010: 489-502
2000 – 2009
- 2008
- [c4]Hovhannes A. Harutyunyan, Shahin Kamali:
Efficient Broadcasting in Networks with Weighted Nodes. ICPADS 2008: 879-884 - [c3]Hovhannes A. Harutyunyan, Shahin Kamali:
Broadcasting in Weighted-Vertex Graphs. ISPA 2008: 301-307 - [c2]Hovhannes A. Harutyunyan, Shahin Kamali, Talin Moradian:
Multi-Shared-Trees Based Multicasting in Mesh-Connected Networks. PDPTA 2008: 178-182 - 2005
- [c1]HesamAddin Dashti, Nima Aghaeepour, Sahar Asadi, Meysam Bastani, Zahra Delafkar, Fatemeh Miri Disfani, Serveh Ghaderi, Shahin Kamali, Sepideh Pashami, Alireza Siahpirani:
Dynamic Positioning Based on Voronoi Cells (DPVC). RoboCup 2005: 219-229
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-17 21:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
