CUFinder

Oren Weimann

About Oren Weimann

Oren Weimann, With an exceptional h-index of 27 and a recent h-index of 18 (since 2020), a distinguished researcher at University of Haifa, specializes in the field of Algorithms and data structures, Combinatorial pattern matching, Combinatorial optimizations, Planar graph algorithms.

His recent articles reflect a diverse array of research interests and contributions to the field:

\~ Optimal Fault-Tolerant Reachability Labeling in Planar Graphs

What Else Can Voronoi Diagrams Do for Diameter in Planar Graphs?

Almost optimal exact distance oracles for planar graphs

Near-optimal dynamic time warping on run-length encoded strings

On the hardness of computing the edit distance of shallow trees

The Fine-Grained Complexity of Episode Matching

Fault-tolerant distance labeling for planar graphs

Improved Compression of the Okamura-Seymour Metric

Oren Weimann Information

University

Position

___

Citations(all)

2326

Citations(since 2020)

985

Cited By

1827

hIndex(all)

27

hIndex(since 2020)

18

i10Index(all)

47

i10Index(since 2020)

26

Email

University Profile Page

Google Scholar

Oren Weimann Skills & Research Interests

Algorithms and data structures

Combinatorial pattern matching

Combinatorial optimizations

Planar graph algorithms

Top articles of Oren Weimann

\~ Optimal Fault-Tolerant Reachability Labeling in Planar Graphs

arXiv preprint arXiv:2307.07222

2023/7/14

Shiri Chechik
Shiri Chechik

H-Index: 19

Oren Weimann
Oren Weimann

H-Index: 16

What Else Can Voronoi Diagrams Do for Diameter in Planar Graphs?

arXiv preprint arXiv:2305.02946

2023/5/4

Amir Abboud
Amir Abboud

H-Index: 23

Oren Weimann
Oren Weimann

H-Index: 16

Almost optimal exact distance oracles for planar graphs

Journal of the ACM

2023/3/25

Paweł Gawrychowski
Paweł Gawrychowski

H-Index: 19

Seth Pettie
Seth Pettie

H-Index: 26

Oren Weimann
Oren Weimann

H-Index: 16

Christian Wulff-Nilsen
Christian Wulff-Nilsen

H-Index: 16

Near-optimal dynamic time warping on run-length encoded strings

arXiv preprint arXiv:2302.06252

2023/2/13

Shay Golan
Shay Golan

H-Index: 5

Oren Weimann
Oren Weimann

H-Index: 16

On the hardness of computing the edit distance of shallow trees

2022/11/1

Paweł Gawrychowski
Paweł Gawrychowski

H-Index: 19

Oren Weimann
Oren Weimann

H-Index: 16

The Fine-Grained Complexity of Episode Matching

2022/6/1

Philip Bille
Philip Bille

H-Index: 16

Inge Li Gørtz
Inge Li Gørtz

H-Index: 14

Teresa Anna Steiner
Teresa Anna Steiner

H-Index: 1

Oren Weimann
Oren Weimann

H-Index: 16

Fault-tolerant distance labeling for planar graphs

Theoretical Computer Science

2022/5/29

Paweł Gawrychowski
Paweł Gawrychowski

H-Index: 19

Oren Weimann
Oren Weimann

H-Index: 16

Improved Compression of the Okamura-Seymour Metric

arXiv preprint arXiv:2202.05127

2022/2/10

Oren Weimann
Oren Weimann

H-Index: 16

Top tree compression of tries

Algorithmica

2021/12

Philip Bille
Philip Bille

H-Index: 16

Paweł Gawrychowski
Paweł Gawrychowski

H-Index: 19

Inge Li Gørtz
Inge Li Gørtz

H-Index: 14

Oren Weimann
Oren Weimann

H-Index: 16

A conditional lower bound for episode matching

arXiv preprint arXiv:2108.08613

2021/8/19

Philip Bille
Philip Bille

H-Index: 16

Inge Li Gørtz
Inge Li Gørtz

H-Index: 14

Teresa Anna Steiner
Teresa Anna Steiner

H-Index: 1

Oren Weimann
Oren Weimann

H-Index: 16

An almost optimal edit distance oracle

arXiv preprint arXiv:2103.03294

2021/3/4

Paweł Gawrychowski
Paweł Gawrychowski

H-Index: 19

Oren Weimann
Oren Weimann

H-Index: 16

Planar Negative k-Cycle

2021

Paweł Gawrychowski
Paweł Gawrychowski

H-Index: 19

Oren Weimann
Oren Weimann

H-Index: 16

A note on a recent algorithm for minimum cut

2021

Paweł Gawrychowski
Paweł Gawrychowski

H-Index: 19

Oren Weimann
Oren Weimann

H-Index: 16

Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic Time

SIAM Journal on Computing

2021

Paweł Gawrychowski
Paweł Gawrychowski

H-Index: 19

Haim Kaplan
Haim Kaplan

H-Index: 30

Micha Sharir
Micha Sharir

H-Index: 38

Oren Weimann
Oren Weimann

H-Index: 16

Incremental distance products via faulty shortest paths

Information Processing Letters

2020/9/1

Oren Weimann
Oren Weimann

H-Index: 16

Raphael Yuster
Raphael Yuster

H-Index: 22

Tree edit distance cannot be computed in strongly subcubic time (unless APSP can)

ACM Transactions on Algorithms (TALG)

2020/7/6

Karl Bringmann
Karl Bringmann

H-Index: 24

Paweł Gawrychowski
Paweł Gawrychowski

H-Index: 19

Oren Weimann
Oren Weimann

H-Index: 16

Compressed range minimum queries

Theoretical Computer Science

2020/4/6

Paweł Gawrychowski
Paweł Gawrychowski

H-Index: 19

Oren Weimann
Oren Weimann

H-Index: 16

Submatrix maximum queries in Monge and partial Monge matrices are equivalent to predecessor search

ACM Transactions on Algorithms (TALG)

2020/3/5

Paweł Gawrychowski
Paweł Gawrychowski

H-Index: 19

Oren Weimann
Oren Weimann

H-Index: 16

On the fine-grained complexity of parity problems

arXiv preprint arXiv:2002.07415

2020/2/18

Amir Abboud
Amir Abboud

H-Index: 23

Oren Weimann
Oren Weimann

H-Index: 16

31st Annual Symposium on Combinatorial Pattern Matching

2020

Inge Li Gørtz
Inge Li Gørtz

H-Index: 14

Oren Weimann
Oren Weimann

H-Index: 16

See List of Professors in Oren Weimann University(University of Haifa)