Search Results - "Amiri, Saeed Akhoondian"

Walking Through Waypoints by Akhoondian Amiri, Saeed, Foerster, Klaus-Tycho, Schmid, Stefan

“…We initiate the study of a fundamental combinatorial problem: Given a capacitated graph  G = ( V , E ) , find a shortest walk (“route”) from a source  s ∈ V to…”
Get full text

A note on the fine-grained complexity of MIS on regular graphs by Akhoondian Amiri, Saeed

“…We show that there is no subexponential time algorithm for computing the exact solution of the maximum independent set problem in d-regular graphs, unless ETH…”
Get full text

Routing with congestion in acyclic digraphs by Akhoondian Amiri, Saeed, Kreutzer, Stephan, Marx, Dániel, Rabinovich, Roman

“…We study the version of the k-disjoint paths problem where k demand pairs (s1,t1), …, (sk,tk) are specified in the input and the paths in the solution are…”
Get full text

Distributed distance-r covering problems on sparse high-girth graphs by Amiri, Saeed Akhoondian, Wiederhake, Ben

“…•Distributed distance-r dominating set can be approximated in constant rounds.•Assuming high-girth graphs of bounded expansion.•Approach generalizes to…”
Get full text

DAG-width is PSPACE-complete by Amiri, Saeed Akhoondian, Kreutzer, Stephan, Rabinovich, Roman

“…Berwanger et al. show in [2] that for every graph G of size n and DAG-width k there is a DAG decomposition of width k and size nO(k). They also establish a…”
Get full text

Homa: Online In-Flight Service Provisioning With Dynamic Bipartite Matching by Varasteh, Amir, Amiri, Saeed Akhoondian, Mas-Machuca, Carmen

“…Airline companies are currently investigating means to improve in-flight services for passengers. Given emerging Air-to-Ground (A2G) communication technologies…”
Get full text

Deterministic CONGEST Algorithm for MDS on Bounded Arboricity Graphs by Amiri, Saeed Akhoondian

“…We provide a deterministic CONGEST algorithm to constant factor approximate the minimum dominating set on graphs of bounded arboricity in $O(\log n)$ rounds…”
Get full text

Structural Graph Theory Meets Algorithms: Covering and Connectivity Problems in Graphs by Akhoondian Amiri, Saeed

“…Structural graph theory proved itself a valuable tool for designing efficient algorithms for hard problems over recent decades. We exploit structural graph…”
Get full text

On Fine-Grained Exact Computation in Regular Graphs by Amiri, Saeed Akhoondian

“…We show that there is no subexponential time algorithm for computing the exact solution of the maximum independent set problem in d-regular graphs unless ETH…”
Get full text

Disjoint Shortest Paths with Congestion on DAGs by Amiri, Saeed Akhoondian, Wargalla, Julian

“…In the k-Disjoint Shortest Paths problem, a set of terminal pairs of vertices $\{(s_i,t_i)\mid 1\le i\le k\}$ is given and we are asked to find paths…”
Get full text

Distributed Distance-$r$ Dominating Set on Sparse High-Girth Graphs by Amiri, Saeed Akhoondian, Wiederhake, Ben

“…The dominating set problem and its generalization, the distance-$r$ dominating set problem, are among the well-studied problems in the sequential settings. In…”
Get full text

Distributed Dominating Set Approximations beyond Planar Graphs by Amiri, Saeed Akhoondian, Schmid, Stefan, Siebertz, Sebastian

“…The Minimum Dominating Set (MDS) problem is one of the most fundamental and challenging problems in distributed computing. While it is well-known that minimum…”
Get full text

Waypoint Routing in Special Networks by Amiri, Saeed Akhoondian, Foerster, Klaus-Tycho, Jacob, Riko, Parham, Mahmoud, Schmid, Stefan

“…Waypoint routing is a novel communication model in which traffic is steered through one or multiple so-called waypoints along the route from source to…”
Get full text

A local constant factor approximation for the minimum dominating set problem on bounded genus graphs by Amiri, Saeed Akhoondian, Schmid, Stefan, Siebertz, Sebastian

“…The Minimum Dominating Set (MDS) problem is not only one of the most fundamental problems in distributed computing, it is also one of the most challenging…”
Get full text

Walking Through Waypoints by Amiri, Saeed Akhoondian, Foerster, Klaus-Tycho, Schmid, Stefan

“…We initiate the study of a fundamental combinatorial problem: Given a capacitated graph $G=(V,E)$, find a shortest walk ("route") from a source $s\in V$ to a…”
Get full text

Charting the Complexity Landscape of Waypoint Routing by Amiri, Saeed Akhoondian, Foerster, Klaus-Tycho, Jacob, Riko, Schmid, Stefan

“…Modern computer networks support interesting new routing models in which traffic flows from a source s to a destination t can be flexibly steered through a…”
Get full text

Complexity of Computing the Anti-Ramsey Numbers for Paths by Amiri, Saeed Akhoondian, Popa, Alexandru, Roghani, Mohammad, Shahkarami, Golnoosh, Soltani, Reza, Vahidi, Hossein

“…The anti-Ramsey numbers are a fundamental notion in graph theory, introduced in 1978, by Erd\" os, Simonovits and S\' os. For given graphs $G$ and $H$ the…”
Get full text

Congestion-Free Rerouting of Flows on DAGs by Amiri, Saeed Akhoondian, Dudycz, Szymon, Schmid, Stefan, Wiederrecht, Sebastian

“…Changing a given configuration in a graph into another one is known as a re- configuration problem. Such problems have recently received much interest in the…”
Get full text

DAG-width is PSPACE-complete by Amiri, Saeed Akhoondian, Kreutzer, Stephan, Rabinovich, Roman

“…Berwanger et al. show that for every graph $G$ of size $n$ and DAG-width $k$ there is a DAG decomposition of width $k$ and size $n^{O(k)}$. This gives a…”
Get full text

Short Schedules for Fast Flow Rerouting by Amiri, Saeed Akhoondian, Dudycz, Szymon, Parham, Mahmoud, Schmid, Stefan, Wiederrecht, Sebastian

“…This paper studies the fundamental problem of how to reroute $k$ unsplittable flows of a certain demand in a capacitated network from their current paths to…”
Get full text