pith. sign in

Ohad Trabelsi

Identifiers

  • name variant Ohad Trabelsi 0.60 · backfill

Papers (7)

  1. A Note on Approximability of Densest At-Least-k-Subgraph cs.DS · 2026 · author #3
  2. New Algorithms and Lower Bounds for All-Pairs Max-Flow in Undirected Graphs cs.DS · 2019 · author #3
  3. Relaxed Voronoi: a Simple Framework for Terminal-Clustering Problems cs.DS · 2018 · author #3
  4. Faster Algorithms for All-Pairs Bounded Min-Cuts cs.DS · 2018 · author #6
  5. Nearly Optimal Time Bounds for kPath in Hypergraphs cs.DS · 2018 · author #2
  6. The Set Cover Conjecture and Subgraph Isomorphism with a Tree Pattern cs.DS · 2017 · author #2
  7. Conditional Lower Bound for Subgraph Isomorphism with a Tree Pattern cs.DS · 2017 · author #2

Mentions

  • 2605.25464 #3 · arxiv_oai · confidence 0.70 Ohad Trabelsi

Frequent Coauthors