scientific article; zbMATH DE number 1512678

Recommendations

Revisiting Lambert's problem
Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE
scientific article; zbMATH DE number 436450
The Lüroth Problem
The Ljunggren equation revisited
On a new approach to the Lamb-problem solution
Revisiting the Lagrange multiplier rule
The Guderley problem revisited
The Lepskii principle revisited
scientific article; zbMATH DE number 1078079

Cited in

(only showing first 100 items - show all)

Improved algorithms for the multicut and multiflow problems in rooted trees
New algorithms for the LCA problem and the binary tree reconstruction problem
Extended suffix array construction using Lyndon factors
Hierarchical segmentations with graphs: quasi-flat zones, minimum spanning trees, and saliency maps
Computing longest common extensions in partial words
An improved approximation algorithm for the discrete Fréchet distance
The range 1 query (R1Q) problem
Period recovery of strings over the Hamming and edit distances
Efficient algorithms for shortest partial seeds in words
Crochemore's partitioning on weighted strings and applications
Algorithms and combinatorial properties on shortest unique palindromic substrings
New heuristics for rooted triplet consistency
On string matching with mismatches
Engineering a combinatorial Laplacian solver: lessons learned
Applying the positional Burrows-Wheeler transform to all-pairs Hamming distance
A new framework for addressing temporal range queries and some preliminary results
An optimal data structure to handle dynamic environments in non-deterministic computations
Approximating geometric bottleneck shortest paths
Linear time algorithms for two disjoint paths problems on directed acyclic graphs
Variations of the parameterized longest previous factor
On the equivalence between hierarchical segmentations and ultrametric watersheds
An introduction to the Ribe program
The indexing for one-dimensional proportionally-scaled strings
Constructing the R* consensus tree of two trees in subcubic time
New space/time tradeoffs for top-\(k\) document retrieval on sequences
On the restricted 1-Steiner tree problem
Fast algorithms for the shortest unique palindromic substring problem on run-length encoded strings
On some efficiently solvable classes of the network facility location problem with constraints on the capacities of communication lines
Range minimum queries in minimal space
On the restricted k-Steiner tree problem
The fast algorithm for online \(k\)-server problem on trees
The heaviest induced ancestors problem: better data structures and applications
Computing \(k\)-centers of uncertain points on a real line
Self-approaching paths in simple polygons
Dynamic and internal longest common substring
Multidimensional segment trees can do range updates in poly-logarithmic time
Computing longest palindromic substring after single-character or block-wise edits
Minmax regret 1-sink location problems on dynamic flow path networks with parametric weights
Improved distance sensitivity oracles with subcubic preprocessing time
\textit{MinMax}-profiles: a unifying view of common intervals, nested common intervals and conserved intervals of \(K\) permutations
Efficient algorithms for the longest common subsequence in \(k\)-length substrings
Linear-space data structures for range mode query in arrays
Bichromatic 2-center of pairs of points
\(L_{1}\) shortest path queries in simple polygons
Efficient computation of longest single-arm-gapped palindromes in a string
Space-efficient fully dynamic DFS in undirected graphs
Quickest visibility queries in polygonal domains
Bicriteria rectilinear shortest paths among rectilinear obstacles in the plane
Closest-pair queries in fat rectangles
Average stretch factor: how low does it go?
Geometric biplane graphs. II: Graph augmentation
A note on the longest common substring with k-mismatches problem
Longest common substrings with k mismatches
Computing the \(K\)-terminal reliability of directed path graphs
Disconnectivity and relative positions in simultaneous embeddings
Fast algorithms for approximate Fréchet matching queries in geometric trees
Faster algorithms for finding lowest common ancestors in directed acyclic graphs
OntCheck: an ontology-driven static correctness checking tool for component-based models
Approximating points by a piecewise linear function
Faster index for property matching
Succinct 2D dictionary matching
Improved range minimum queries
On finding the Adams consensus tree
On the generalized multiway cut in trees problem
Wavelet trees for all
Simple and efficient LZW-compressed multiple pattern matching
Building Cartesian trees from free trees with \(k\) leaves
Linear time algorithm for the longest common repeat problem
Character sets of strings
Opportunistic data structures for range queries
Constructing suffix arrays in linear time
Quasi-linear algorithms for the topological watershed
Linear-space data structures for range frequency queries on arrays and trees
Internal shortest absent word queries in constant time and linear space
A duality based 2-approximation algorithm for maximum agreement forest
Fully functional static and dynamic succinct trees
A fully dynamic reachability algorithm for directed graphs with an almost linear update time
Finding gapped palindromes online
Bootstrapping algorithms for gene duplication and speciation events
General document retrieval in compact space
Linear algorithms for chordal graphs of bounded directed vertex leafage
Array range queries
A fast algorithm for finding the lowest common ancestor of two neighboring nodes in a complete binary tree
Longest common extensions in trees
Encodings of range maximum-sum segment queries and applications
New characterizations of minimum spanning trees and of saliency maps based on quasi-flat zones
Viscous-hyperconnected attribute filters: a first algorithm
Longest common extensions in trees
Computing minimal and maximal suffixes of a substring
Order-preserving indexing
Order-preserving pattern matching with \(k\) mismatches
On prefix/suffix-square free words
A faster algorithm for computing maximal -gapped repeats in a string
Time-optimal top-k document retrieval
The longest common substring problem
Longest common subsequence in at least k length order-isomorphic substrings
Computing longest single-arm-gapped palindromes in a string
A Space-Efficient Algorithm for the Dynamic DFS Problem in Undirected Graphs
Line-Constrained k-Median, k-Means, and k-Center Problems in the Plane
Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4508365)