Travelled to:1 × Denmark
1 × Greece
1 × Japan
1 × Latvia
1 × Poland
1 × Switzerland
Collaborated with:R.Yuster S.Mozes P.Gawrychowski G.M.Landau E.D.Demaine A.Abboud V.V.Williams P.Bille I.L.Gørtz D.Hermelin A.Levy B.Rossman
Talks about:tree (4) queri (3) graph (3) submatrix (2) maximum (2) distanc (2) planar (2) matric (2) time (2) mong (2)
Person: Oren Weimann
DBLP: Weimann:Oren
Contributed to:
201520142013201120092007Wrote 9 papers:
- ICALP-v1-2015-GawrychowskiMW #matrix #query
- Submatrix Maximum Queries in Monge Matrices Are Equivalent to Predecessor Search (PG, SM, OW), pp. 580–592.
- ICALP-v1-2014-AbboudWW #performance #sequence
- Consequences of Faster Alignment of Sequences (AA, VVW, OW), pp. 39–51.
- ICALP-v1-2014-GawrychowskiMW #matrix #query
- Improved Submatrix Maximum Queries in Monge Matrices (PG, SM, OW), pp. 525–537.
- ICALP-v1-2013-BilleGLW
- Tree Compression with Top Trees (PB, ILG, GML, OW), pp. 160–171.
- ICALP-v1-2013-WeimannY #approximate #graph #linear
- Approximating the Diameter of Planar Graphs in Near Linear Time (OW, RY), pp. 828–839.
- ICALP-v2-2011-HermelinLWY #distance #graph
- Distance Oracles for Vertex-Labeled Graphs (DH, AL, OW, RY), pp. 490–501.
- ICALP-v1-2009-DemaineLW #on the #query
- On Cartesian Trees and Range Minimum Queries (EDD, GML, OW), pp. 341–353.
- ICALP-v1-2009-WeimannY #graph
- Computing the Girth of a Planar Graph in O(n logn) Time (OW, RY), pp. 764–773.
- ICALP-2007-DemaineMRW #algorithm #composition #distance #edit distance
- An Optimal Decomposition Algorithm for Tree Edit Distance (EDD, SM, BR, OW), pp. 146–157.