The following pages link to Mira Gonen (Q511714):
Displaying 15 items.
- On nonlinear multi-covering problems (Q511715) (← links)
- On the benefits of adaptivity in property testing of dense graphs (Q603911) (← links)
- Bounding the bias of tree-like sampling in IP topologies (Q934211) (← links)
- A \(\Theta (\log n)\)-approximation for the set cover problem with set ownership (Q976067) (← links)
- A geographic directed preferential internet topology model (Q995548) (← links)
- On interval and circular-arc covering problems (Q2327673) (← links)
- Finding a dense-core in jellyfish graphs (Q2377899) (← links)
- Coded Cooperative Data Exchange Problem for General Topologies (Q2977246) (← links)
- Counting Stars and Other Small Subgraphs in Sublinear-Time (Q3225127) (← links)
- Approximating the Number of Network Motifs (Q3601164) (← links)
- On the Benefits of Adaptivity in Property Testing of Dense Graphs (Q3603491) (← links)
- Latency and Alphabet Size in the Context of Multicast Network Coding (Q5088554) (← links)
- Approximating the Number of Network Motifs (Q5388291) (← links)
- (Q5417610) (← links)
- Finding a Dense-Core in Jellyfish Graphs (Q5458298) (← links)
