The following pages link to (Q4508365):
Displaying 50 items.
- Optimal prefix and suffix queries on texts (Q975480) (← links)
- A fast and simple algorithm for computing the longest common subsequence of run-length encoded strings (Q975491) (← links)
- Errata for ``Faster index for property matching'' (Q989567) (← links)
- Ramsey partitions and proximity data structures (Q997827) (← links)
- Improved algorithms for the multicut and multiflow problems in rooted trees (Q1024699) (← links)
- New algorithms for the LCA problem and the binary tree reconstruction problem (Q1328757) (← links)
- Extended suffix array construction using Lyndon factors (Q1615410) (← links)
- Hierarchical segmentations with graphs: quasi-flat zones, minimum spanning trees, and saliency maps (Q1635986) (← links)
- Computing longest common extensions in partial words (Q1647840) (← links)
- An improved approximation algorithm for the discrete Fréchet distance (Q1653046) (← links)
- The range 1 query (R1Q) problem (Q1659997) (← links)
- Period recovery of strings over the Hamming and edit distances (Q1698696) (← links)
- Efficient algorithms for shortest partial seeds in words (Q1698721) (← links)
- Crochemore's partitioning on weighted strings and applications (Q1709578) (← links)
- Algorithms and combinatorial properties on shortest unique palindromic substrings (Q1711666) (← links)
- New heuristics for rooted triplet consistency (Q1736566) (← links)
- On string matching with mismatches (Q1736652) (← links)
- Engineering a combinatorial Laplacian solver: lessons learned (Q1736844) (← links)
- Applying the positional Burrows-Wheeler transform to all-pairs Hamming distance (Q1739212) (← links)
- A simple linear-space data structure for constant-time range minimum query (Q1740692) (← links)
- A new framework for addressing temporal range queries and some preliminary results (Q1770382) (← links)
- An optimal data structure to handle dynamic environments in non-deterministic computations (Q1869983) (← links)
- Approximating geometric bottleneck shortest paths (Q1886239) (← links)
- Linear time algorithms for two disjoint paths problems on directed acyclic graphs (Q1929240) (← links)
- Variations of the parameterized longest previous factor (Q1932360) (← links)
- On the equivalence between hierarchical segmentations and ultrametric watersheds (Q1932859) (← links)
- An introduction to the Ribe program (Q1936714) (← links)
- The indexing for one-dimensional proportionally-scaled strings (Q1944891) (← links)
- Constructing the R* consensus tree of two trees in subcubic time (Q1950390) (← links)
- New space/time tradeoffs for top-\(k\) document retrieval on sequences (Q2015136) (← links)
- On the restricted 1-Steiner tree problem (Q2019490) (← links)
- Fast algorithms for the shortest unique palindromic substring problem on run-length encoded strings (Q2032287) (← links)
- On some efficiently solvable classes of the network facility location problem with constraints on the capacities of communication lines (Q2043623) (← links)
- Range minimum queries in minimal space (Q2078612) (← links)
- On the restricted \(k\)-Steiner tree problem (Q2084651) (← links)
- The fast algorithm for online \(k\)-server problem on trees (Q2097225) (← links)
- The heaviest induced ancestors problem: better data structures and applications (Q2149106) (← links)
- Computing \(k\)-centers of uncertain points on a real line (Q2157899) (← links)
- Self-approaching paths in simple polygons (Q2173458) (← links)
- Dynamic and internal longest common substring (Q2211363) (← links)
- Multidimensional segment trees can do range updates in poly-logarithmic time (Q2220857) (← links)
- Computing longest palindromic substring after single-character or block-wise edits (Q2227497) (← links)
- Minmax regret 1-sink location problems on dynamic flow path networks with parametric weights (Q2232232) (← links)
- Improved distance sensitivity oracles with subcubic preprocessing time (Q2237898) (← links)
- \textit{MinMax}-profiles: a unifying view of common intervals, nested common intervals and conserved intervals of \(K\) permutations (Q2250447) (← links)
- Efficient algorithms for the longest common subsequence in \(k\)-length substrings (Q2252645) (← links)
- Linear-space data structures for range mode query in arrays (Q2254510) (← links)
- Bichromatic 2-center of pairs of points (Q2261579) (← links)
- \(L_{1}\) shortest path queries in simple polygons (Q2272388) (← links)
- Efficient computation of longest single-arm-gapped palindromes in a string (Q2297859) (← links)
