Ariel Gabizon

activity

20132016

most citedCryptocurrencies without Proof of Work

16 citations · 28 across the 9 of their papers we have counts for

collaborators

Showing cs.DSShow all

3 papers · 1 filter

cs.DS2014★ 2 cited

Fast Algorithms for Parameterized Problems with Relaxed Disjointness Constraints

Ariel Gabizon, Daniel Lokshtanov, Michal Pilipczuk

In parameterized complexity, it is a natural idea to consider different generalizations of classic problems. Usually, such generalization are obtained by introducing a "relaxation"…

cs.DS2014

Relations between automata and the simple k-path problem

Ran Ben-Basat, Ariel Gabizon

Let $G$ be a directed graph on $n$ vertices. Given an integer $k <= n$ , the SIMPLE $k$ -PATH problem asks whether there exists a simple $k$ -path in $G$ . In case $G$ is weighted, the M…

cs.DS2014

On $r$ -Simple $k$ -Path

Hasan Abasi, Nader H. Bshouty, Ariel Gabizon +1

An $r$ -simple $k$ -path is a {path} in the graph of length $k$ that passes through each vertex at most $r$ times. The $r$ -SIMPLE $k$ -PATH problem, given a graph $G$ as input, asks w…

Fast Algorithms for Parameterized Problems with Relaxed Disjointness Constraints

Relations between automata and the simple k-path problem

On r-Simple k-Path

On $r$ -Simple $k$ -Path