Home Research-feed Channel Rankings GCT THU AI TR Open Data Must Reading

views: 1

Eden Chlamtác

Sign in to view more

Show Academic Trajectory

Ego Network

D-Core

Research Interests

Author Statistics

Experience

Education

Bio

None

Papers4 papers

Sort

By YearBy Citation

Approximating the Norms of Graph Spanners

Eden Chlamtác,Michael Dinitz,Thomas Robinson

APPROX-RANDOM, (2019)

EIBibtex

The Densest k-Subhypergraph Problem

Eden Chlamtác,Michael Dinitz,Christian Konrad,Guy Kortsarz,George Rabanca

SIAM J. Discrete Math., no. 2 (2018): 1458-1477

Cited by7EIBibtex

Approximating spanners and directed steiner forest: upper and lower bounds

Eden Chlamtáč,Michael Dinitz,Guy Kortsarz,Bundit Laekhanukit

SODA '17: Symposium on Discrete Algorithms Barcelona Spain January, 2017, (2017): 534-553

Cited by14EIBibtex

Lowest Degree k-Spanner: Approximation and Hardness

Eden Chlamtác,Michael Dinitz

Theory of Computing, no. 1 (2016): 1-29

Cited by1EIBibtex

View All

Base Info Papers Patents Projects