On the public citation graph
Fast Algorithms for Finding Nearest Common Ancestors
0 signed · 1001 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1016/0022-0000(79)90042-4openalex-snapshot
A class of algorithms which require nonlinear time to maintain disjoint sets
inferredcites →https://doi.org/10.1016/0022-0000(83)90006-5openalex-snapshot
A data structure for dynamic trees
inferredcites →https://doi.org/10.1016/0022-0000(85)90014-5openalex-snapshot
A linear-time algorithm for a special case of disjoint set union
inferredcites →https://doi.org/10.1137/0205011openalex-snapshot
On Finding Lowest Common Ancestors in Trees
inferredcites →https://doi.org/10.1137/0208048openalex-snapshot
An Efficient Method for Storing Ancestor Information in Trees
inferredcites →https://doi.org/10.1145/321879.321884openalex-snapshot
Efficiency of a Good But Not Linear Set Union Algorithm
inferredcites →https://doi.org/10.1145/322154.322161openalex-snapshot
Applications of Path Compression on Balanced Trees
inferredcites →https://doi.org/10.1145/62.2160openalex-snapshot
Worst-case Analysis of Set Union Algorithms
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.3217/jucs-013-10-1411openalex-extracted
Efficient Access Methods for Temporal Interval Queries of Video Metadata.
inferred← citeshttps://doi.org/10.1002/j.1538-7305.1984.tb00089.xopenalex-snapshot
Papers by AT&T Bell Laboratories Authors
inferred← citeshttps://doi.org/10.1002/net.20012openalex-snapshot
An improved algorithm for the distance constrained p‐center location problem with mutual communication on tree networks
inferred← citeshttps://doi.org/10.1002/net.20275openalex-snapshot
A linear‐time algorithm for broadcast domination in a tree
inferred← citeshttps://doi.org/10.1002/net.3230210503openalex-snapshot
Efficient algorithms for generalized cut‐trees
inferred← citeshttps://doi.org/10.1002/net.3230240705openalex-snapshot
Efficient algorithms for minimum range cut problems
inferred← citeshttps://doi.org/10.1002/scj.4690230501openalex-snapshot
Simple parallel algorithms to compute interval maxima
inferred← citeshttps://doi.org/10.1002/spe.2481openalex-snapshot
Sampled suffix array with minimizers
inferred← citeshttps://doi.org/10.1006/inco.1996.0087openalex-snapshot
On the Construction of Classes of Suffix Trees for Square Matrices: Algorithms and Applications
inferred← citeshttps://doi.org/10.1006/inco.1999.2814openalex-snapshot
Parallel Preprocessing for Path Queries without Concurrent Reading
inferred← citeshttps://doi.org/10.1006/jagm.1993.1010openalex-snapshot
Approximation Algorithms for Graph Augmentation
inferred← citeshttps://doi.org/10.1006/jagm.1996.0054openalex-snapshot
Off-Line Maintenance of Planar Configurations
inferred← citeshttps://doi.org/10.1006/jagm.1996.0829openalex-snapshot
Parallel Shortcutting of Rooted Trees
inferred← citeshttps://doi.org/10.1006/jagm.1996.0839openalex-snapshot
Tighter Bounds on the Solution of a Divide-and-Conquer Maximin Recurrence
inferred← citeshttps://doi.org/10.1006/jagm.1997.0905openalex-snapshot
Triply-Logarithmic Parallel Upper and Lower Bounds for Minimum and Range Minima over Small Domains
inferred← citeshttps://doi.org/10.1006/jagm.1998.0962openalex-snapshot
Distance Approximating Trees for Chordal and Dually Chordal Graphs
inferred← citeshttps://doi.org/10.1006/jagm.2000.1079openalex-snapshot
Optimal Pointer Algorithms for Finding Nearest Common Ancestors in Dynamic Trees
inferred← citeshttps://doi.org/10.1006/jagm.2000.1081openalex-snapshot
Alphabet-Independent and Scaled Dictionary Matching
inferred← citeshttps://doi.org/10.1006/jagm.2001.1185openalex-snapshot
Efficient and Practical Algorithms for Sequential Modular Decomposition
inferred← citeshttps://doi.org/10.1006/jcss.1996.0003openalex-snapshot
Parameterized Pattern Matching: Algorithms and Applications
inferred← citeshttps://doi.org/10.1006/jcss.1996.0063openalex-snapshot
Pointers versus Arithmetic in PRAMs
inferred← citeshttps://doi.org/10.1006/jcss.1997.1496openalex-snapshot
Optimal Parallel Suffix Tree Construction
inferred← citeshttps://doi.org/10.1007/11425274_28openalex-snapshot
A Query Expression and Processing Technique for an XML Search Engine
inferred← citeshttps://doi.org/10.1007/11496656_23openalex-snapshot
Two Dimensional Parameterized Matching
inferred← citeshttps://doi.org/10.1007/11496656_9openalex-snapshot
Approximate Matching in the L 1 Metric
inferred← citeshttps://doi.org/10.1007/11505877_3openalex-snapshot
Locally Consistent Parsing and Applications to Approximate String Comparisons
inferred← citeshttps://doi.org/10.1007/11523468_6openalex-snapshot
The Tree Inclusion Problem: In Optimal Space and Faster
inferred← citeshttps://doi.org/10.1007/11533719_75openalex-snapshot
Efficient Algorithms for Simplifying Flow Networks
inferred← citeshttps://doi.org/10.1007/11561071_65openalex-snapshot
Workload-Optimal Histograms on Streams
inferred← citeshttps://doi.org/10.1007/11602613_41openalex-snapshot
Fast Algorithms for Computing the Tripartition-Based Distance Between Phylogenetic Networks
inferred← citeshttps://doi.org/10.1007/11732990_22openalex-snapshot
Efficient Enumeration of Phylogenetically Informative Substrings
inferred← citeshttps://doi.org/10.1007/11780441_5openalex-snapshot
Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE
inferred← citeshttps://doi.org/10.1007/11809678_26openalex-snapshot
Reconciling Gene Trees with Apparent Polytomies
inferred← citeshttps://doi.org/10.1007/11841036_21openalex-snapshot
Compressed Indexes for Approximate String Matching
inferred← citeshttps://doi.org/10.1007/11944836_17openalex-snapshot
Linear-Time Algorithms for Two Subtree-Comparison Problems on Phylogenetic Trees with Different Species
inferred← citeshttps://doi.org/10.1007/3-540-16078-7_73openalex-snapshot
Efficient algorithms for finding minimum spanning forests of hierarchically defined graphs
inferred← citeshttps://doi.org/10.1007/3-540-16761-7_89openalex-snapshot
A very fast, practical algorithm for finding a negative cycle in a digraph
inferred← citeshttps://doi.org/10.1007/3-540-18088-5_42openalex-snapshot
The nearest common ancestor in a dynamic tree
inferred← citeshttps://doi.org/10.1007/3-540-19488-6_137openalex-snapshot
Moving discs between polygons
inferred← citeshttps://doi.org/10.1007/3-540-36136-7_14openalex-snapshot
A Faster Approximation Algorithm for 2-Edge-Connectivity Augmentation
inferred← citeshttps://doi.org/10.1007/3-540-36136-7_32openalex-snapshot
Approximate Distance Oracles Revisited
inferred← citeshttps://doi.org/10.1007/3-540-36494-3_5openalex-snapshot
Approximating Geometric Bottleneck Shortest Paths
inferred← citeshttps://doi.org/10.1007/3-540-40996-3_45openalex-snapshot
Improved Phylogeny Comparisons: Non-shared Edges, Nearest Neighbor Interchanges, and Subtree Transfers
inferred← citeshttps://doi.org/10.1007/3-540-44472-6_9openalex-snapshot
2-D Spatial Indexing Scheme in Optimal Time
inferred← citeshttps://doi.org/10.1007/3-540-44503-x_23openalex-snapshot
Orthogonal Range Queries in OLAP
inferred← citeshttps://doi.org/10.1007/3-540-44696-6_9openalex-snapshot
Computing Linking Numbers of a Filtration
inferred← citeshttps://doi.org/10.1007/3-540-44888-8_14openalex-snapshot
Linear-Time Construction of Suffix Arrays
inferred← citeshttps://doi.org/10.1007/3-540-44985-x_34openalex-snapshot
Generalization of a Suffix Tree for RNA Structural Pattern Matching
inferred← citeshttps://doi.org/10.1007/3-540-45022-x_8openalex-snapshot
Improved Algorithms for Finding Level Ancestors in Dynamic Trees
inferred← citeshttps://doi.org/10.1007/3-540-45061-0_73openalex-snapshot
Simple Linear Work Suffix Array Construction
inferred← citeshttps://doi.org/10.1007/3-540-45253-2_12openalex-snapshot
Range Searching over Tree Cross Products
inferred← citeshttps://doi.org/10.1007/3-540-45471-3_44openalex-snapshot
An Optimal Algorithm for Finding NCA on Pure Pointer Machines
inferred← citeshttps://doi.org/10.1007/3-540-45995-2_26openalex-snapshot
Ancestor Problems on Pure Pointer Machines
inferred← citeshttps://doi.org/10.1007/3-540-45995-2_30openalex-snapshot
An Improved Algorithm for Sequence Comparison with Block Reversals
inferred← citeshttps://doi.org/10.1007/3-540-45995-2_43openalex-snapshot
In-Place Planar Convex Hull Algorithms
inferred← citeshttps://doi.org/10.1007/3-540-45995-2_44openalex-snapshot
The Level Ancestor Problem Simplified
inferred← citeshttps://doi.org/10.1007/3-540-46632-0_24openalex-snapshot
Constructing the Suffix Tree of a Tree with a Large Alphabet
inferred← citeshttps://doi.org/10.1007/3-540-48523-6_43openalex-snapshot
Linear-Time Construction of Two-Dimensional Suffix Trees (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/3-540-48686-0_14openalex-snapshot
How to Swap a Failing Edge of a Single Source Shortest Paths Tree
inferred← citeshttps://doi.org/10.1007/3-540-52292-1_18openalex-snapshot
Finding a minimal transitive reduction in a strongly connected digraph within linear time
inferred← citeshttps://doi.org/10.1007/3-540-53982-4_11openalex-snapshot
Simple solutions for approximate tree matching problems
inferred← citeshttps://doi.org/10.1007/3-540-54029-6_194openalex-snapshot
A simple optimal parallel algorithm to solve the lowest common ancestor problem
inferred← citeshttps://doi.org/10.1007/3-540-54233-7_148openalex-snapshot
Structural parallel algorithmics
inferred← citeshttps://doi.org/10.1007/3-540-54233-7_172openalex-snapshot
Ray shooting in polygons using geodesic triangulations
inferred← citeshttps://doi.org/10.1007/3-540-54945-5_77openalex-snapshot
On finding a smallest augmentation to biconnect a graph (Extended abstract)
inferred← citeshttps://doi.org/10.1007/3-540-55719-9_85openalex-snapshot
Approximation algorithms for graph augmentation
inferred← citeshttps://doi.org/10.1007/3-540-55719-9_86openalex-snapshot
Fast incremental planarity testing
inferred← citeshttps://doi.org/10.1007/3-540-56024-6_14openalex-snapshot
Theoretical and empirical comparisons of approximate string matching algorithms
inferred← citeshttps://doi.org/10.1007/3-540-56039-4_56openalex-snapshot
On materializing views and on-line queries
inferred← citeshttps://doi.org/10.1007/3-540-56279-6_66openalex-snapshot
Randomized range-maxima in nearly-constant parallel time
inferred← citeshttps://doi.org/10.1007/3-540-56503-5_29openalex-snapshot
Rectilinear path queries in a simple rectilinear polygon
inferred← citeshttps://doi.org/10.1007/3-540-57155-8_246openalex-snapshot
Triply-logarithmic upper and lower bounds for minimum, range minima, and related problems with integer inputs
inferred← citeshttps://doi.org/10.1007/3-540-57273-2_49openalex-snapshot
Trekking in the Alps without freezing or getting tired
inferred← citeshttps://doi.org/10.1007/3-540-57273-2_57openalex-snapshot
Fully dynamic planarity testing in planar embedded graphs
inferred← citeshttps://doi.org/10.1007/3-540-58078-6_2openalex-snapshot
Optimal parallel verification of minimum spanning trees in logarithmic time
inferred← citeshttps://doi.org/10.1007/3-540-58218-5_28openalex-snapshot
Parallel dynamic lowest common ancestors
inferred← citeshttps://doi.org/10.1007/3-540-60044-2_51openalex-snapshot
String matching in hypertext
inferred← citeshttps://doi.org/10.1007/3-540-60084-1_67openalex-snapshot
On the construction of classes of suffix trees for square matrices: Algorithms and applications
inferred← citeshttps://doi.org/10.1007/3-540-60220-8_82openalex-snapshot
Faster enumeration of all spanning trees of a directed graph
inferred← citeshttps://doi.org/10.1007/3-540-60220-8_83openalex-snapshot
A simpler minimum spanning tree verification algorithm
inferred← citeshttps://doi.org/10.1007/3-540-61258-0_10openalex-snapshot
The suffix tree of a tree and minimizing sequential transducers
inferred← citeshttps://doi.org/10.1007/3-540-61258-0_23openalex-snapshot
Alphabet independent and dictionary scaled matching
inferred← citeshttps://doi.org/10.1007/3-540-61422-2_133openalex-snapshot
Optimal pointer algorithms for finding nearest common ancestors in dynamic trees
inferred← citeshttps://doi.org/10.1007/3-540-61422-2_138openalex-snapshot
Linear-time heuristics for minimum weight rectangulation
inferred← citeshttps://doi.org/10.1007/3-540-62495-3_42openalex-snapshot
Straight-line drawing algorithms for hierarchical graphs and clustered graphs
inferred← citeshttps://doi.org/10.1007/3-540-62592-5_81openalex-snapshot
Tree contractions and evolutionary trees
inferred← citeshttps://doi.org/10.1007/3-540-63165-8_186openalex-snapshot
Dynamic algorithms for graphs of bounded treewidth
inferred← citeshttps://doi.org/10.1007/3-540-63220-4_53openalex-snapshot
External inverse pattern matching
inferred← citeshttps://doi.org/10.1007/3-540-63307-3_47openalex-snapshot
Finding cores of limited length
inferred← citeshttps://doi.org/10.1007/3-540-63397-9_7openalex-snapshot
Distance approximating trees for chordal and dually chordal graphs
inferred← citeshttps://doi.org/10.1007/3-540-63938-1_58openalex-snapshot
Drawing clustered graphs on an orthogonal grid
inferred← citeshttps://doi.org/10.1007/978-0-387-09680-3_10openalex-snapshot
On the Longest Common Factor Problem
inferred← citeshttps://doi.org/10.1007/978-0-387-30162-4_220openalex-snapshot
Maximum Agreement Subtree (of 2 Binary Trees)
inferred← citeshttps://doi.org/10.1007/978-0-387-35608-2_14openalex-snapshot
An Efficient Parallel Pointer Machine Algorithm for the NCA Problem
inferred← citeshttps://doi.org/10.1007/978-1-4419-7997-1_47openalex-snapshot
Efficient Algorithms for Geometric Shortest Path Query Problems
inferred← citeshttps://doi.org/10.1007/978-1-4612-3352-7_1openalex-snapshot
Fast Parallel and Serial Multidimensional Approximate Array Matching
inferred← citeshttps://doi.org/10.1007/978-1-4612-3352-7_2openalex-snapshot
Context-Dependent String Matching
inferred← citeshttps://doi.org/10.1007/978-1-4613-0231-5_4openalex-snapshot
Approximate String Matching for Angular String Elements with Applications to On-line and Off-line Handwriting Recognition
inferred← citeshttps://doi.org/10.1007/978-1-4613-0303-9_10openalex-snapshot
Efficient Algorithms for Geometric Shortest Path Query Problems
inferred← citeshttps://doi.org/10.1007/978-1-4613-9323-8_18openalex-snapshot
Coding Trees as Strings for Approximate Tree Matching
inferred← citeshttps://doi.org/10.1007/978-1-4757-3609-0_6openalex-snapshot
Parallel Graph Algorithms for Coarse-Grained Multicomputers
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_220openalex-snapshot
Maximum Agreement Subtree (of 2 Binary Trees)
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_630openalex-snapshot
Lowest Common Ancestors in Trees
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_691openalex-snapshot
Large-Treewidth Graph Decompositions
inferred← citeshttps://doi.org/10.1007/978-3-030-24766-9_34openalex-snapshot
A Linear-Time Algorithm for Radius-Optimally Augmenting Paths in a Metric Space
inferred← citeshttps://doi.org/10.1007/978-3-030-32686-9_18openalex-snapshot
Range Shortest Unique Substring Queries
inferred← citeshttps://doi.org/10.1007/978-3-030-35802-0_39openalex-snapshot
An SPQR-Tree-Like Embedding Representation for Upward Planarity
inferred← citeshttps://doi.org/10.1007/978-3-030-44914-8_5openalex-snapshot
Optimal and Perfectly Parallel Algorithms for On-demand Data-Flow Analysis
inferred← citeshttps://doi.org/10.1007/978-3-030-58150-3_36openalex-snapshot
On the Restricted 1-Steiner Tree Problem
inferred← citeshttps://doi.org/10.1007/978-3-030-69921-5_77openalex-snapshot
Efficient and Interactive Fuzzy Type Ahead Search in XML Data
inferred← citeshttps://doi.org/10.1007/978-3-030-91814-9_5openalex-snapshot
Combining Orthology and Xenology Data in a Common Phylogenetic Tree
inferred← citeshttps://doi.org/10.1007/978-3-031-09574-0_12openalex-snapshot
The Fast Algorithm for Online k-server Problem on Trees
inferred← citeshttps://doi.org/10.1007/978-3-031-20643-6_5openalex-snapshot
Reconstructing Parameterized Strings from Parameterized Suffix and LCP Arrays
inferred← citeshttps://doi.org/10.1007/978-3-031-38906-1_12openalex-snapshot
Finding Diameter-Reducing Shortcuts in Trees
inferred← citeshttps://doi.org/10.1007/978-3-031-38906-1_38openalex-snapshot
Geometric Hitting Set for Line-Constrained Disks
inferred← citeshttps://doi.org/10.1007/978-3-031-38906-1_46openalex-snapshot
Dynamic Convex Hulls Under Window-Sliding Updates
inferred← citeshttps://doi.org/10.1007/978-3-031-63021-7_13openalex-snapshot
Computing Maximal Palindromes in Non-standard Matching Models
inferred← citeshttps://doi.org/10.1007/978-3-031-72200-4_1openalex-snapshot
Linear Time Reconstruction of Parameterized Strings from Parameterized Suffix and LCP Arrays for Constant-Sized Alphabets
inferred← citeshttps://doi.org/10.1007/978-3-031-82670-2_10openalex-snapshot
Dynamic Range Minimum Queries on the Ultra-wide Word RAM
inferred← citeshttps://doi.org/10.1007/978-3-031-92935-9_9openalex-snapshot
Subsequence Matching and LCS with Segment Number Constraints
inferred← citeshttps://doi.org/10.1007/978-3-032-06668-8_46openalex-snapshot
Optimizing Shortest Path Selection in Weighted Graphs: A Hybrid Approach Using BFS and Machine Learning Models
inferred← citeshttps://doi.org/10.1007/978-3-032-22059-2_2openalex-snapshot
Variable Neighborhood Search for the Tree t-Spanner Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-03841-4_20openalex-snapshot
Simultaneous Embedding: Edge Orderings, Relative Positions, Cutvertices
inferred← citeshttps://doi.org/10.1007/978-3-319-07566-2_20openalex-snapshot
Efficient Algorithms for Shortest Partial Seeds in Words
inferred← citeshttps://doi.org/10.1007/978-3-319-07953-0openalex-snapshot
Algorithms for Computational Biology
inferred← citeshttps://doi.org/10.1007/978-3-319-09955-2_26openalex-snapshot
Exact Evaluation of Stochastic Watersheds: From Trees to General Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-09955-2_29openalex-snapshot
Algorithms for Fast Digital Straight Segments Union
inferred← citeshttps://doi.org/10.1007/978-3-319-11918-2_12openalex-snapshot
Alphabet-Independent Algorithms for Finding Context-Sensitive Repeats in Linear Time
inferred← citeshttps://doi.org/10.1007/978-3-319-11918-2_16openalex-snapshot
Shortest Unique Queries on Strings
inferred← citeshttps://doi.org/10.1007/978-3-319-11918-2_26openalex-snapshot
Simple and Efficient String Algorithms for Query Suggestion Metrics Computation
inferred← citeshttps://doi.org/10.1007/978-3-319-13075-0_33openalex-snapshot
Faster Algorithms for Computing the R* Consensus Tree
inferred← citeshttps://doi.org/10.1007/978-3-319-15612-5_9openalex-snapshot
Approximate Distance Oracle in O(n2) Time and O(n) Space for Chordal Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-18173-8_11openalex-snapshot
Planarity of Streamed Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-19929-0_13openalex-snapshot
Range Minimum Query Indexes in Higher Dimensions
inferred← citeshttps://doi.org/10.1007/978-3-319-19929-0_5openalex-snapshot
Longest Common Extensions in Trees
inferred← citeshttps://doi.org/10.1007/978-3-319-19929-0_6openalex-snapshot
Longest Common Extensions in Sublinear Space
inferred← citeshttps://doi.org/10.1007/978-3-319-21398-9_40openalex-snapshot
Optimal Algorithms for Running Max and Min Filters on Random Inputs
inferred← citeshttps://doi.org/10.1007/978-3-319-23826-5_33openalex-snapshot
Range LCP Queries Revisited
inferred← citeshttps://doi.org/10.1007/978-3-319-25258-2_16openalex-snapshot
Path-Fault-Tolerant Approximate Shortest-Path Trees
inferred← citeshttps://doi.org/10.1007/978-3-319-25258-2_17openalex-snapshot
A Faster Computation of All the Best Swap Edges of a Tree Spanner
inferred← citeshttps://doi.org/10.1007/978-3-319-29516-9_5openalex-snapshot
Longest Common Extensions in Partial Words
inferred← citeshttps://doi.org/10.1007/978-3-319-43681-4_4openalex-snapshot
Isometric Gene Tree Reconciliation Revisited
inferred← citeshttps://doi.org/10.1007/978-3-319-53733-7_9openalex-snapshot
Efficient Pattern Matching in Elastic-Degenerate Texts
inferred← citeshttps://doi.org/10.1007/978-3-319-56657-3_3openalex-snapshot
Capacity Constrained Network Voronoi Diagrams
inferred← citeshttps://doi.org/10.1007/978-3-319-62127-2_46openalex-snapshot
An Improved Algorithm for Diameter-Optimally Augmenting Paths in a Metric Space
inferred← citeshttps://doi.org/10.1007/978-3-319-75172-6_8openalex-snapshot
Faster Network Algorithms Based on Graph Decomposition
inferred← citeshttps://doi.org/10.1007/978-3-319-78455-7_4openalex-snapshot
On the Minmax Regret Path Center Problem on Trees
inferred← citeshttps://doi.org/10.1007/978-3-319-78825-8_28openalex-snapshot
How to Answer a Small Batch of RMQs or LCA Queries in Practice
inferred← citeshttps://doi.org/10.1007/978-3-319-94776-1_51openalex-snapshot
A Linear-Space Data Structure for Range-LCP Queries in Poly-Logarithmic Time
inferred← citeshttps://doi.org/10.1007/978-3-322-80043-5_8openalex-snapshot
Bestimmung der Basensequenz
inferred← citeshttps://doi.org/10.1007/978-3-322-80043-5_9openalex-snapshot
Bestimmung von Signalen in DNA-Sequenzen
inferred← citeshttps://doi.org/10.1007/978-3-540-24587-2_36openalex-snapshot
Efficient Algorithms for Descendent Subtrees Comparison of Phylogenetic Trees with Applications to Co-evolutionary Classifications in Bacterial Genome
inferred← citeshttps://doi.org/10.1007/978-3-540-24587-2_58openalex-snapshot
A Dynamic Data Structure for Maintaining Disjoint Paths Information in Digraphs
inferred← citeshttps://doi.org/10.1007/978-3-540-24595-7_34openalex-snapshot
Convex Drawing for c-Planar Biconnected Clustered Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-27796-5_10openalex-snapshot
Swapping a Failing Edge of a Shortest Paths Tree by Minimizing the Average Stretch Factor
inferred← citeshttps://doi.org/10.1007/978-3-540-27801-6_15openalex-snapshot
Maximum Agreement and Compatible Supertrees
inferred← citeshttps://doi.org/10.1007/978-3-540-27801-6_17openalex-snapshot
Small Phylogeny Problem: Character Evolution Trees
inferred← citeshttps://doi.org/10.1007/978-3-540-27836-8_52openalex-snapshot
A General Technique for Managing Strings in Comparison-Driven Data Structures
inferred← citeshttps://doi.org/10.1007/978-3-540-30213-1_2openalex-snapshot
Linear Time Algorithm for the Longest Common Repeat Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-30213-1_42openalex-snapshot
Longest Motifs with a Functionally Equivalent Central Block
inferred← citeshttps://doi.org/10.1007/978-3-540-30219-3_34openalex-snapshot
Genome Identification and Classification by Short Oligo Arrays
inferred← citeshttps://doi.org/10.1007/978-3-540-30551-4_27openalex-snapshot
On the Range Maximum-Sum Segment Query Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-30551-4_68openalex-snapshot
Dynamic Tree Cross Products
inferred← citeshttps://doi.org/10.1007/978-3-540-30551-4_7openalex-snapshot
Approximate Distance Oracles for Graphs with Dense Clusters
inferred← citeshttps://doi.org/10.1007/978-3-540-45078-8_30openalex-snapshot
Dynamic Text and Static Pattern Matching
inferred← citeshttps://doi.org/10.1007/978-3-540-45078-8_9openalex-snapshot
Fast Algorithms for a Class of Temporal Range Queries
inferred← citeshttps://doi.org/10.1007/978-3-540-68155-7_19openalex-snapshot
Simpler and Incremental Consistency Checking and Arc Consistency Filtering Algorithms for the Weighted Spanning Tree Constraint
inferred← citeshttps://doi.org/10.1007/978-3-540-69068-9_22openalex-snapshot
Fast Algorithms for Computing Tree LCS
inferred← citeshttps://doi.org/10.1007/978-3-540-69733-6_31openalex-snapshot
Efficient Algorithms for SNP Haplotype Block Selection Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-69903-3_21openalex-snapshot
A Path Cover Technique for LCAs in Dags
inferred← citeshttps://doi.org/10.1007/978-3-540-70918-3_10openalex-snapshot
Testing Convexity Properties of Tree Colorings
inferred← citeshttps://doi.org/10.1007/978-3-540-71229-9_14openalex-snapshot
A New Elimination-Based Data Flow Analysis Framework Using Annotated Decomposition Trees
inferred← citeshttps://doi.org/10.1007/978-3-540-71618-1_61openalex-snapshot
A Simple and Compact Algorithm for the RMQ and Its Application to the Longest Common Repeat Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-71681-5_17openalex-snapshot
Heuristics for the Gene-Duplication Problem: A Θ(n) Speed-Up for the Local Search
inferred← citeshttps://doi.org/10.1007/978-3-540-71913-7_9openalex-snapshot
Finding Signals in DNA Sequences
inferred← citeshttps://doi.org/10.1007/978-3-540-72524-4_51openalex-snapshot
Efficient Keyword Search over Data-Centric XML Documents
inferred← citeshttps://doi.org/10.1007/978-3-540-72951-8_10openalex-snapshot
Labeling Schemes with Queries
inferred← citeshttps://doi.org/10.1007/978-3-540-73420-8_15openalex-snapshot
An Optimal Decomposition Algorithm for Tree Edit Distance
inferred← citeshttps://doi.org/10.1007/978-3-540-73437-6_29openalex-snapshot
Two-Dimensional Range Minimum Queries
inferred← citeshttps://doi.org/10.1007/978-3-540-73437-6_35openalex-snapshot
A Simple Construction of Two-Dimensional Suffix Trees in Linear Time
inferred← citeshttps://doi.org/10.1007/978-3-540-73437-6_7openalex-snapshot
Cache-Oblivious Index for Approximate String Matching
inferred← citeshttps://doi.org/10.1007/978-3-540-74126-8_12openalex-snapshot
An Ω(n 2/logn) Speed-Up of Heuristics for the Gene-Duplication Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-74450-4_26openalex-snapshot
All-Pairs Ancestor Problems in Weighted Dags
inferred← citeshttps://doi.org/10.1007/978-3-540-75520-3_25openalex-snapshot
Unique Lowest Common Ancestors in Dags Are Almost as Easy as Matrix Multiplication
inferred← citeshttps://doi.org/10.1007/978-3-540-75520-3_35openalex-snapshot
Compact Oracles for Approximate Distances Around Obstacles in the Plane
inferred← citeshttps://doi.org/10.1007/978-3-540-75520-3_62openalex-snapshot
Fast Lowest Common Ancestor Computations in Dags
inferred← citeshttps://doi.org/10.1007/978-3-540-75530-2_18openalex-snapshot
Indexing a Dictionary for Subset Matching Queries
inferred← citeshttps://doi.org/10.1007/978-3-540-77566-9_36openalex-snapshot
Improved Bounds for Range Mode and Range Median Queries
inferred← citeshttps://doi.org/10.1007/978-3-540-85654-2_12openalex-snapshot
On the Evaluation of Large and Sparse Graph Reachability Queries
inferred← citeshttps://doi.org/10.1007/978-3-540-85654-2_44openalex-snapshot
Superimposed Code-Based Indexing Method for Extracting MCTs from XML Documents
inferred← citeshttps://doi.org/10.1007/978-3-540-87744-8_37openalex-snapshot
Fitting a Step Function to a Point Set
showing the first 200 of 992 · page through all 992
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.