1.8k citations
- Tel Aviv UniversityIL47 papers
- Ariel UniversityIL32 papers
- Boston UniversityUS31 papers
- University of Maryland, College ParkUS31 papers
- Technion – Israel Institute of TechnologyIL29 papers
- Ben-Gurion University of the NegevIL28 papers
- Centre National de la Recherche ScientifiqueFR26 papers
- Hebrew University of JerusalemIL23 papers
- University of ChicagoUS22 papers
- Massachusetts Institute of TechnologyUS20 papers
- University of FloridaUS20 papers
- University of MichiganUS20 papers
Showing 2019 · cs.DSShow all
2 papers · 2 filters
cs.DS2019
Graph Realizations: Maximum and Minimum Degree in Vertex Neighborhoods
Amotz Bar-Noy, Keerti Choudhary, David Peleg +1
The classical problem of degree sequence realizability asks whether or not a given sequence of positive integers is equal to the degree sequence of some -vertex undirected s…
cs.DS2019★ 7 cited
Cartesian Tree Matching and Indexing
Sung Gwan Park, Amihood Amir, Gad M. Landau +1
We introduce a new metric of match, called Cartesian tree matching, which means that two strings match if they have the same Cartesian trees. Based on Cartesian tree matching, we d…