Asaf Etgar

About

I'm a fifth year applied mathematics Ph.D candidate at Yale, where I'm fortunate to be advised by Anna Gilbert. Previously, I completed my Ms.C in computer science under the advisement of Nati Linial and my Bs.C in mathematics, both at the Hebrew University of Jerusalem, Israel.

Research

I am interested in the theory and practice of graph algorithms, streaming algorithms, approximation algorithms and fixed-parameter algorithms. I focus on problems where the standard structural assumptions don't hold -- graphs that aren't metric, aren't complete, or whose key statistics cannot be known in advance.

Papers

• Metric repair is two problems: Which edges, and what weights
  Asaf Etgar, Anna Gilbert. Submitted arxiv
• Structural Tractability Frontiers for Metric Repair
  Asaf Etgar, Anna Gilbert, Jamie Tucker-Foltz. Submitted arxiv
• On the Connectivity and Diameter of Geodetic Graphs
  Asaf Etgar, Nati Linial. European Journal of Combinatorics, February 2024, paper 103886. Link, arxiv
• The F2 Rank and Size of Graphs
  Gal Beniamini, Asaf Etgar, Yael Kirkpatrick. Preprint. arxiv

Teaching

Yale

• Modern Combinatorics (MATH 3450), Part-time Teaching Instructor (Fall 2026)
• Intensive Algorithms (CPSC366), Teaching Assistant (Spring 2024, Spring 2026)
• Intensive Algorithms (CPSC366), Teaching Assistant (Spring 2024, Spring 2026)

Hebrew University

• Calculus for Computer Sceince (67559), Teaching Assistant (Spring 2022)
• Game Theory for High School (67128), Instructor (Fall 2021)
• Data Structures (67109), Teaching Assistant (Fall 2020)