The following pages link to Dynamic LCA Queries on Trees (Q5317181):
Displaying 23 items.
- Compact separator decompositions in dynamic trees and applications to labeling schemes (Q352249) (← links)
- Recognizing weakly simple polygons (Q1688854) (← links)
- A \(\min\)-\(\max\) relation in flowgraphs and some applications (Q1752483) (← links)
- Leaf trees (Q1916363) (← links)
- Computing longest (common) Lyndon subsequences (Q2169947) (← links)
- Computing longest palindromic substring after single-character or block-wise edits (Q2227497) (← links)
- Faster algorithms for finding lowest common ancestors in directed acyclic graphs (Q2373733) (← links)
- Full-fledged real-time indexing for constant size alphabets (Q2408918) (← links)
- Incremental algorithm for maintaining a DFS tree for undirected graphs (Q2408922) (← links)
- Finding Gapped Palindromes Online (Q2819503) (← links)
- Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing (Q2819506) (← links)
- On Dynamic DFS Tree in Directed Graphs (Q2946380) (← links)
- Time-Optimal Top-$k$ Document Retrieval (Q2963583) (← links)
- Longest Common Subsequence in at Least k Length Order-Isomorphic Substrings (Q2971148) (← links)
- The Online House Numbering Problem: Min-Max Online List Labeling (Q5111720) (← links)
- Dynamic planar orthogonal point location in sublogarithmic time (Q5115793) (← links)
- Longest substring palindrome after edit (Q5140775) (← links)
- Inducing Suffix and LCP Arrays in External Memory (Q5266606) (← links)
- Automata, Languages and Programming (Q5716778) (← links)
- Resilient level ancestor, bottleneck, and lowest common ancestor queries in dynamic trees (Q6103520) (← links)
- Computing longest Lyndon subsequences and longest common Lyndon subsequences (Q6119829) (← links)
- Good \(r\)-divisions imply optimal amortized decremental biconnectivity (Q6614619) (← links)
- Linear-size suffix tries and linear-size CDAWGs simplified and improved (Q6634511) (← links)
