Ofer Neiman

From MaRDI portal
Person:260268

Available identifiers

zbMath Open neiman.oferMaRDI QIDQ260268

List of research outcomes





PublicationDate of PublicationType
Almost shortest paths with near-additive error in weighted graphs2024-05-27Paper
Centralized, parallel, and distributed multi-source shortest paths via hopsets and rectangular matrix multiplication2024-04-23Paper
https://portal.mardi4nfdi.de/entity/Q60833852023-12-08Paper
Corrigendum: Metric Embedding via Shortest Path Decompositions2023-11-14Paper
Improved weighted additive spanners2023-09-11Paper
Linear-size hopsets with small hopbound, and constant-hopbound hopsets in RNC2022-10-14Paper
Light spanners for high dimensional norms via stochastic decompositions2022-10-06Paper
Covering metric spaces by few trees2022-08-26Paper
Covering Metric Spaces by Few Trees2022-07-21Paper
Lossless prioritized embeddings2022-07-13Paper
Distributed strong diameter network decomposition2022-06-13Paper
Metric Embedding via Shortest Path Decompositions2022-04-20Paper
Near isometric terminal embeddings for doubling metrics2021-11-19Paper
Near-additive spanners and near-exact hopsets, a unified view2021-08-30Paper
https://portal.mardi4nfdi.de/entity/Q50095882021-08-04Paper
Ramsey spanning trees and their applications2021-05-03Paper
Distributed Construction of Light Networks2021-03-15Paper
Lossless Prioritized Embeddings2021-02-02Paper
Near isometric terminal embeddings for doubling metrics2020-08-18Paper
Near-optimal distributed routing with low memory2019-09-19Paper
Hopsets with constant hopbound, and applications to approximate shortest paths2019-09-16Paper
Cops, robbers, and threatening skeletons: padded decomposition for minor-free graphs2019-09-02Paper
Metric embedding via shortest path decompositions2019-08-22Paper
On notions of distortion and an almost minimum spanning tree with constant average distortion2019-08-07Paper
On low dimensional local embeddings2019-05-06Paper
Efficient algorithms for constructing very sparse spanners and emulators2019-03-28Paper
Using petal-decompositions to build a low stretch spanning tree2019-03-22Paper
Simple deterministic algorithms for fully dynamic maximal matching2018-10-30Paper
Snowflake universality of Wasserstein spaces2018-08-30Paper
Efficient algorithms for constructing very sparse spanners and emulators2018-07-16Paper
On notions of distortion and an almost minimum spanning tree with constant average distortion2018-07-16Paper
Prioritized metric structures and embedding2018-07-04Paper
On the impossibility of dimension reduction for doubling subsets of \(\ell_p\)2018-04-23Paper
On efficient distributed construction of near optimal routing schemes2018-04-11Paper
Ramsey spanning trees and their applications2018-03-15Paper
Impossibility of sketching of the 3D transportation metric with quadratic cost2017-12-19Paper
On efficient distributed construction of near optimal routing schemes (extended abstract)2017-09-29Paper
Distributed Strong Diameter Network Decomposition2017-09-29Paper
Terminal embeddings2017-09-28Paper
Terminal embeddings2017-08-31Paper
Space-efficient path-reporting approximate distance oracles2017-03-16Paper
Low dimensional embeddings of doubling metrics2016-03-21Paper
Prioritized metric structures and embedding2015-08-21Paper
On the impossibility of dimension reduction for doubling subsets of \(\ell_{p}\)2015-07-31Paper
Light spanners2015-07-31Paper
Local embeddings of metric spaces2015-07-10Paper
Cops, robbers, and threatening skeletons: padded decomposition for minor-free graphs2015-06-26Paper
Embedding metrics into ultrametrics and graphs into spanning trees with constant average distortion2015-06-02Paper
On vertex rankings of graphs and its relatives2015-04-29Paper
Embedding metrics into ultrametrics and graphs into spanning trees with constant average distortion2014-12-18Paper
Volume in general metric spaces2014-10-29Paper
Low dimensional embeddings of doubling metrics2014-09-02Paper
Simple deterministic algorithms for fully dynamic maximal matching2014-08-07Paper
Light spanners2014-07-01Paper
Using petal-decompositions to build a low stretch spanning tree2014-05-13Paper
Bandwidth and low dimensional embedding2013-12-19Paper
Assouad's theorem with dimension independent of the snowflaking2012-11-22Paper
Advances in metric embedding theory2011-12-02Paper
Dynamic inefficiency: anarchy without stability2011-10-28Paper
Bandwidth and low dimensional embedding2011-08-17Paper
Volume in general metric spaces2010-09-06Paper
https://portal.mardi4nfdi.de/entity/Q35794002010-08-06Paper
Local embeddings of metric spaces2009-01-05Paper

Research outcomes over time

This page was built for person: Ofer Neiman