Search Results - "Kamali, Shahin"

Compact representation of graphs with bounded bandwidth or treedepth by Kamali, Shahin

“…We study the problem of compact representation of graphs that have small bandwidth as well as graphs that have small treedepth. We present navigation oracles…”
Get full text

Contract Scheduling with Predictions by Angelopoulos, Spyros, Kamali, Shahin

“…Contract scheduling is a general technique that allows the design of systems with interruptible capabilities, given an algorithm that is not necessarily…”
Get full text

Compact Representation of Graphs of Small Clique-Width by Kamali, Shahin

“…The notion of clique-width for graphs offers many research topics and has received considerable attention in the past decade. A graph has clique-width k if it…”
Get full text

Online Bin Packing with Predictions by Angelopoulos, Spyros, Kamali, Shahin, Shadkami, Kimia

“…Bin packing is a classic optimization problem with a wide range of applications, from load balancing to supply chain management. In this work, we study the…”
Get full text

Distributed Service Function Chaining by Ghaznavi, Milad, Shahriar, Nashid, Kamali, Shahin, Ahmed, Reaz, Boutaba, Raouf

“…A service-function chain, or simply a chain, is an ordered sequence of service functions, e.g., firewalls and load balancers, composing a service. A chain…”
Get full text

Online computation with untrusted advice by Angelopoulos, Spyros, Dürr, Christoph, Jin, Shendan, Kamali, Shahin, Renault, Marc

Get full text

Randomized two-valued bounded delay online buffer management by Dürr, Christoph, Kamali, Shahin

“…In the bounded delay buffer management problem unit size packets arrive online to be sent over a network link. The objective is to maximize the total weight of…”
Get full text

Compact Navigation and Distance Oracles for Graphs with Small Treewidth by Farzan, Arash, Kamali, Shahin

“…Given an unlabeled, unweighted, and undirected graph with n vertices and small (but not necessarily constant) treewidth k , we consider the problem of…”
Get full text

Online computation with untrusted advice by Angelopoulos, Spyros, Dürr, Christoph, Jin, Shendan, Kamali, Shahin, Renault, Marc

“…We study a generalization of the advice complexity model of online computation in which the advice is provided by an untrusted source. Our objective is to…”
Get full text

Online Bin Covering with Advice by Boyar, Joan, Favrholdt, Lene M., Kamali, Shahin, Larsen, Kim S.

“…The bin covering problem asks for covering a maximum number of bins with an online sequence of n items of different sizes in the range (0, 1]; a bin is said to…”
Get full text

Improved Pyrotechnics: Closer to the Burning Number Conjecture by Bastide, Paul, Bonamy, Marthe, Bonato, Anthony, Charbit, Pierre, Kamali, Shahin, Pierron, Théo, Rabie, Mikaël

“…The Burning Number Conjecture claims that for every connected graph $G$ of order $n,$ its burning number satisfies $b(G) \le \lceil \sqrt{n}\, \rceil.$ While…”
Get full text

Online Bin Packing with Advice by Boyar, Joan, Kamali, Shahin, Larsen, Kim S., López-Ortiz, Alejandro

“…We consider the online bin packing problem under the advice complexity model where the “online constraint” is relaxed and an algorithm receives partial…”
Get full text

Efficient broadcast trees for weighted vertices by Harutyunyan, Hovhannes A., Kamali, Shahin

“…In this paper, we consider a weighted-vertex model for information dissemination in communication networks. Each node of the network (e.g., a processing…”
Get full text

Robust Multi-tenant Server Consolidation in the Cloud for Data Analytics Workloads by Mate, Joseph, Daudjee, Khuzaima, Kamali, Shahin

“…Server consolidation is the hosting of multiple tenants on a server machine. Given a sequence of data analytics tenant loads defined by the amount of resources…”
Get full text

On the Advice Complexity of the k-server Problem Under Sparse Metrics by Gupta, Sushmita, Kamali, Shahin, López-Ortiz, Alejandro

“…We consider the k -S erver problem under the advice model of computation when the underlying metric space is sparse. On one side, we introduce Θ(1)-competitive…”
Get full text

Online Bin Packing with Advice of Small Size by Angelopoulos, Spyros, Dürr, Christoph, Kamali, Shahin, Renault, Marc P., Rosén, Adi

“…In this paper, we study the advice complexity of the online bin packing problem. In this well-studied setting, the online algorithm is supplemented with some…”
Get full text

On the list update problem with advice by Boyar, Joan, Kamali, Shahin, Larsen, Kim S., López-Ortiz, Alejandro

“…We study the online list update problem under the advice model of computation. Under this model, an online algorithm receives partial information about the…”
Get full text

Compact Polyominoes by Kamali, Shahin

“…We provide a compact representation of polyominoes with n cells that supports navigation and visibility queries in constant time. Our oracle takes 3n +o(n)…”
Get full text

Online Bin Covering with Frequency Predictions by Berg, Magnus, Kamali, Shahin

“…We study the discrete bin covering problem where a multiset of items from a fixed set $S \subseteq (0,1]$ must be split into disjoint subsets while maximizing…”
Get full text

Compact Representation of Graphs with Small Bandwidth and Treedepth by Kamali, Shahin

“…We consider the problem of compact representation of graphs with small bandwidth as well as graphs with small treedepth. These parameters capture structural…”
Get full text