Improved string matching with k mismatches
ACM SIGACT News
Introducing efficient parallelism into approximate string matching and a new serial algorithm
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
A linear algorithm for finding dominators in flow graphs and related problems
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
The power of parallel pointer manipulation
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
The cell probe complexity of dynamic data structures
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Fully dynamic algorithms for edge connectivity problems
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Offline maintenance of planar configurations
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Alphabet independent two dimensional matching
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Two-dimensional periodicity and its applications
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Pattern matching in a digitized image
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Journal of the ACM (JACM)
Moving a disc between polygons
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
A theory of parameterized pattern matching: algorithms and applications
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
A robust model for finding optimal evolutionary trees
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Matrix searching with the shortest path metric
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Finding level-ancestors in trees
Journal of Computer and System Sciences
ACM SIGACT News
Large-scale assembly of DNA strings and space-efficient construction of suffix trees
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Yet another efficient algorithm for replacing the edges of a minimum spanning tree
CSC '96 Proceedings of the 1996 ACM 24th annual conference on Computer science
A framework for generalized control dependence
PLDI '96 Proceedings of the ACM SIGPLAN 1996 conference on Programming language design and implementation
Finding minimum spanning forests in logarithmic time and linear work using random sampling
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Efficient detection of determinacy races in Cilk programs
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
Linear-time pointer-machine algorithms for least common ancestors, MST verification, and dominators
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Computing the local consensus of trees
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
On the all-pairs Euclidean short path problem
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
The P-range tree: a new data structure for range searching in secondary memory
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
The Suffix of a square matrix, with applications
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Time and space efficient method-lookup for object-oriented programs
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Nonplanar topological inference and political-map graphs
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Fast comparison of evolutionary trees
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
The subtree max gap problem with application to parallel string covering
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
An efficient algorithm for dynamic text indexing
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Output-sensitive generation of random events
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A provably efficient computational model for approximate spatiotemporal retrieval
Proceedings of the 7th ACM international symposium on Advances in geographic information systems
Compact interval trees: a data structure for convex hulls
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Suffix arrays: a new method for on-line string searches
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Efficient pattern matching with scaling
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Efficient algorithms for generalized cut trees
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Data structures for weighted matching and nearest common ancestors with linking
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Distance problems in computational geometry with fixed orientations
SCG '85 Proceedings of the first annual symposium on Computational geometry
Maintaining hierarchical graph views
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Faster algorithms for string matching with k mismatches
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
On the sorting-complexity of suffix tree construction
Journal of the ACM (JACM)
Compact labeling schemes for ancestor queries
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Finding least common ancestors in directed acyclic graphs
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
A guided tour to approximate string matching
ACM Computing Surveys (CSUR)
Optimal static range reporting in one dimension
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Efficient algorithms for document retrieval problems
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Preprocessing an undirected planar network to enable fast approximate distance queries
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Approximate distance oracles for geometric graphs
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Nearest common ancestors: a survey and a new distributed algorithm
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Discrete Applied Mathematics - Special issue: Special issue devoted to the fifth annual international computing and combinatories conference (COCOON'99) Tokyo, Japan 26-28 July 1999
Linear-time recognition of bipartite graphs plus two edges
Discrete Mathematics
Computing a threaded quadtree from the Delaunay triangulation in linear time
Nordic Journal of Computing
Parallel dynamic lowest common ancestors
Nordic Journal of Computing
The level-ancestor problem on pure pointer machines
Information Processing Letters
Labeling schemes for small distances in trees
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Orthogonal Range Queries in OLAP
ICDT '01 Proceedings of the 8th International Conference on Database Theory
Generalization of a Suffix Tree for RNA Structural Pattern Matching
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
An Optimal Algorithm for Finding NCA on Pure Pointer Machines
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Computing Linking Numbers of a Filtration
WABI '01 Proceedings of the First International Workshop on Algorithms in Bioinformatics
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
2-D Spatial Indexing Scheme in Optimal Time
ADBIS-DASFAA '00 Proceedings of the East-European Conference on Advances in Databases and Information Systems Held Jointly with International Conference on Database Systems for Advanced Applications: Current Issues in Databases and Information Systems
Linear-Time Construction of Two-Dimensional Suffix Trees
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Improved Algorithms for Finding Level Ancestors in Dynamic Trees
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Constructing the Suffix Tree of a Tree with a Large Alphabet
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
A Faster Approximation Algorithm for 2-Edge-Connectivity Augmentation
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Approximate Distance Oracles Revisited
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
An Improved Algorithm for Sequence Comparison with Block Reversals
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
The Level Ancestor Problem Simplified
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Ancestor Problems on Pure Pointer Machines
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
Range Searching Over Tree Cross Products
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
General framework for removal of clock network pessimism
Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design
Dynamic orthogonal range queries in OLAP
Theoretical Computer Science - Database theory
Scaling and related techniques for geometry problems
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
A linear-time algorithm for a special case of disjoint set union
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
XRANK: ranked keyword search over XML documents
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
A Presentation Scheduling Scheme for Multimedia Databases
COMPSAC '96 Proceedings of the 20th Conference on Computer Software and Applications
TreeJuxtaposer: scalable tree comparison using Focus+Context with guaranteed visibility
ACM SIGGRAPH 2003 Papers
The complexity of the locally connected spanning tree problem
Discrete Applied Mathematics - Special issue: The second international colloquium, "journées de l'informatique messine"
An efficient range search algorithm for visualizing extrema of volume data
VIS '92 Proceedings of the 3rd conference on Visualization '92
Compact and localized distributed data structures
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Journal of Functional Programming
Reconstructing reticulate evolution in species: theory and practice
RECOMB '04 Proceedings of the eighth annual international conference on Resaerch in computational molecular biology
Unordered Tree Mining with Applications to Phylogeny
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Finding dominators revisited: extended abstract
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Faster algorithms for string matching with k mismatches
Journal of Algorithms - Special issue: SODA 2000
Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width
Journal of Algorithms
Dictionary matching and indexing with errors and don't cares
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
A fully dynamic reachability algorithm for directed graphs with an almost linear update time
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
An efficient algorithm for sequence comparison with block reversals
Theoretical Computer Science - Latin American theorotical informatics
Non-shared edges and nearest neighbor interchanges revisited
Information Processing Letters
Computational Geometry: Theory and Applications - Special issue on the 10th fall workshop on computational geometry
Constructing Suffix Tree for Gigabyte Sequences with Megabyte Memory
IEEE Transactions on Knowledge and Data Engineering
Approximating geometric bottleneck shortest paths
Computational Geometry: Theory and Applications
Compact oracles for reachability and approximate distances in planar digraphs
Journal of the ACM (JACM)
Quasi-Linear Algorithms for the Topological Watershed
Journal of Mathematical Imaging and Vision
Information Processing Letters
Dominance analysis of irreducible CFGs by reduction
ACM SIGPLAN Notices
A survey on tree edit distance and related problems
Theoretical Computer Science
Design of data structures for mergeable trees
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Oblivious string embeddings and edit distance approximations
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Lowest common ancestors in trees and directed acyclic graphs
Journal of Algorithms
Keyword Proximity Search in XML Trees
IEEE Transactions on Knowledge and Data Engineering
Two flow network simplification algorithms
Information Processing Letters
Sequential and parallel algorithms for the NCA problem on pure pointer machines
Theoretical Computer Science
A new framework for addressing temporal range queries and some preliminary results
Theoretical Computer Science
Approximating a Shortest Watchman Route
Fundamenta Informaticae
Distance and routing labeling schemes for non-positively curved plane graphs
Journal of Algorithms
Theoretical Computer Science
Efficient techniques for realizing geo-spatial access control
ASIACCS '07 Proceedings of the 2nd ACM symposium on Information, computer and communications security
Dynamic text and static pattern matching
ACM Transactions on Algorithms (TALG)
Drawing c-planar biconnected clustered graphs
Discrete Applied Mathematics
Linear time algorithm for the longest common repeat problem
Journal of Discrete Algorithms
Multiway SLCA-based keyword search in XML data
Proceedings of the 16th international conference on World Wide Web
Faster algorithms for finding lowest common ancestors in directed acyclic graphs
Theoretical Computer Science
Maximum agreement and compatible supertrees
Journal of Discrete Algorithms
Interactive Tuples Extraction from Semi-Structured Data
WI '06 Proceedings of the 2006 IEEE/WIC/ACM International Conference on Web Intelligence
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Constructing pairwise disjoint paths with few links
ACM Transactions on Algorithms (TALG)
Approximate parameterized matching
ACM Transactions on Algorithms (TALG)
Compressed indexes for approximate string matching
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
On the range maximum-sum segment query problem
Discrete Applied Mathematics
Swapping a failing edge of a shortest paths tree by minimizing the average stretch factor
Theoretical Computer Science
Effective keyword search for valuable lcas over xml documents
Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
Query-point visibility constrained shortest paths in simple polygons
Theoretical Computer Science
Constructing customized process views
Data & Knowledge Engineering
Rectangular layouts and contact graphs
ACM Transactions on Algorithms (TALG)
Approximate distance oracles for geometric spanners
ACM Transactions on Algorithms (TALG)
Improved distance sensitivity oracles via random sampling
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Enabling Schema-Free XQuery with meaningful query focus
The VLDB Journal — The International Journal on Very Large Data Bases
All-pairs disjoint paths from a common ancestor in Õ(nω) time
Theoretical Computer Science
A heuristic algorithm for clustering rooted ordered trees
Intelligent Data Analysis
A Simple and Compact Algorithm for the RMQ and Its Application to the Longest Common Repeat Problem
ICANNGA '07 Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part I
Fast Algorithms for Computing Tree LCS
CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
Efficient Algorithms for SNP Haplotype Block Selection Problems
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
A Path Cover Technique for LCAs in Dags
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
On the Evaluation of Large and Sparse Graph Reachability Queries
DEXA '08 Proceedings of the 19th international conference on Database and Expert Systems Applications
Superimposed Code-Based Indexing Method for Extracting MCTs from XML Documents
DEXA '08 Proceedings of the 19th international conference on Database and Expert Systems Applications
Fitting a Step Function to a Point Set
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Faster Swap Edge Computation in Minimum Diameter Spanning Trees
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Information Processing Letters
Center location problems on tree graphs with subtree-shaped customers
Discrete Applied Mathematics
The 2-radius and 2-radiian problems on trees
Theoretical Computer Science
Theoretical Computer Science
Range mode and range median queries in constant time and sub-quadratic space
Information Processing Letters
An Ω(n^2/ log n) Speed-Up of TBR Heuristics for the Gene-Duplication Problem
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Linear time 3-approximation for the MAST problem
ACM Transactions on Algorithms (TALG)
Data Compression for Proof Replay
Journal of Automated Reasoning
Efficient algorithms for two generalized 2-median problems and the group median problem on trees
Theoretical Computer Science
Efficient data structures for range-aggregate queries on trees
Proceedings of the 12th International Conference on Database Theory
Retrieving meaningful relaxed tightest fragments for XML keyword search
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Hash-Search: An Efficient SLCA-Based Keyword Search Algorithm on XML Documents
DASFAA '09 Proceedings of the 14th International Conference on Database Systems for Advanced Applications
An Efficient Algorithm for Solving the Dyck-CFL Reachability Problem on Trees
ESOP '09 Proceedings of the 18th European Symposium on Programming Languages and Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
From Gene Trees to Species Trees through a Supertree Approach
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
A nearly optimal oracle for avoiding failed vertices and edges
Proceedings of the forty-first annual ACM symposium on Theory of computing
Matching subsequences in trees
Journal of Discrete Algorithms
XPath evaluation in linear time with polynomial combined complexity
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Generalized Substring Compression
CPM '09 Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching
On Cartesian Trees and Range Minimum Queries
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
SAIL: Structure-aware indexing for effective and progressive top-k keyword search over XML documents
Information Sciences: an International Journal
Fast algorithms for computing tree LCS
Theoretical Computer Science
A Compressed Enhanced Suffix Array Supporting Fast String Matching
SPIRE '09 Proceedings of the 16th International Symposium on String Processing and Information Retrieval
Practical Algorithms for the Longest Common Extension Problem
SPIRE '09 Proceedings of the 16th International Symposium on String Processing and Information Retrieval
An optimal decomposition algorithm for tree edit distance
ACM Transactions on Algorithms (TALG)
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Dynamic 3-Sided Planar Range Queries with Expected Doubly Logarithmic Time
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Approximating Points by a Piecewise Linear Function: I
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Fast Arc-Annotated Subsequence Matching in Linear Space
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Flavors of KWQL, a Keyword Query Language for a Semantic Wiki
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
The complexity of the locally connected spanning tree problem
Discrete Applied Mathematics
A scalable parallelization of the gene duplication problem
Journal of Parallel and Distributed Computing
Information Processing Letters
Two flow network simplification algorithms
Information Processing Letters
Lowest common ancestors in trees and directed acyclic graphs
Journal of Algorithms
New common ancestor problems in trees and directed acyclic graphs
Information Processing Letters
Linear-time construction of suffix arrays
CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
Heuristics for the gene-duplication problem: a Θ(n) speed-up for the local search
RECOMB'07 Proceedings of the 11th annual international conference on Research in computational molecular biology
Simple linear work suffix array construction
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
A new elimination-based data flow analysis framework using annotated decomposition trees
CC'07 Proceedings of the 16th international conference on Compiler construction
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
Testing convexity properties of tree colorings
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
How to swap a failing edge of a single source shortest paths tree
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Efficient keyword search over data-centric XML documents
APWeb/WAIM'07 Proceedings of the joint 9th Asia-Pacific web and 8th international conference on web-age information management conference on Advances in data and web management
Unique lowest common ancestors in dags are almost as easy as matrix multiplication
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Compact oracles for approximate distances around obstacles in the plane
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Fast lowest common ancestor computations in dags
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Indexing a dictionary for subset matching queries
SPIRE'07 Proceedings of the 14th international conference on String processing and information retrieval
Improved bounds for range mode and range median queries
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
CPAIOR'08 Proceedings of the 5th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
Combinatorial queries and updates on partial words
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
Performance guarantees for B-trees with different-sized atomic keys
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Exploit keyword query semantics and structure of data for effective XML keyword search
ADC '10 Proceedings of the Twenty-First Australasian Conference on Database Technologies - Volume 104
Dynamic one-sided boundary labeling
Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
Data structures for range minimum queries in multidimensional arrays
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
A minimal periods algorithm with applications
CPM'10 Proceedings of the 21st annual conference on Combinatorial pattern matching
The longest common extension problem revisited and applications to approximate string searching
Journal of Discrete Algorithms
Cell probe lower bounds and approximations for range mode
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
On space efficient two dimensional range minimum data structures
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part II
Finding Patterns In Given Intervals
Fundamenta Informaticae
Finding best swap edges minimizing the routing cost of a spanning tree
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
DISC'10 Proceedings of the 24th international conference on Distributed computing
Constructing the R* consensus tree of two trees in subcubic time
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Exact algorithms for computing the tree edit distance between unordered trees
Theoretical Computer Science
Information and Computation
Building species trees from larger parts of phylogenomic databases
Information and Computation
TAGs: scalable threshold-based algorithms for proximity computation in graphs
Proceedings of the 14th International Conference on Extending Database Technology
Drawing trees with perfect angular resolution and polynomial area
GD'10 Proceedings of the 18th international conference on Graph drawing
The tree inclusion problem: In linear space and faster
ACM Transactions on Algorithms (TALG)
Faster query algorithms for the text fingerprinting problem
Information and Computation
Cache-oblivious index for approximate string matching
Theoretical Computer Science
Nearest keyword search in XML documents
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
XPath evaluation in linear time
Journal of the ACM (JACM)
Indexing Network Structure with Shortest-Path Trees
ACM Transactions on Knowledge Discovery from Data (TKDD)
Secure authenticated comparisons
ACNS'11 Proceedings of the 9th international conference on Applied cryptography and network security
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Succinct 2D dictionary matching with no slowdown
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
SPIRE'11 Proceedings of the 18th international conference on String processing and information retrieval
Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays
SIAM Journal on Computing
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
Single source distance oracle for planar digraphs avoiding a failed node or link
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
A linear time algorithm for seeds computation
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Theoretical and practical improvements on the RMQ-Problem, with applications to LCA and LCE
CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
The tree inclusion problem: in optimal space and faster
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Efficient algorithms for simplifying flow networks
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Locally consistent parsing and applications to approximate string comparisons
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
Random access to grammar-compressed strings
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Ordered and unordered top-K range reporting in large data sets
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Range selection and median: tight cell probe lower bounds and adaptive data structures
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Approximate matching in the L1 metric
CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
Matching subsequences in trees
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
A query expression and processing technique for an XML search engine
ISMIS'05 Proceedings of the 15th international conference on Foundations of Intelligent Systems
Approximate distance oracles for graphs with dense clusters
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
On the range maximum-sum segment query problem
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Indexing a dictionary for subset matching queries
Algorithms and Applications
Efficient enumeration of phylogenetically informative substrings
RECOMB'06 Proceedings of the 10th annual international conference on Research in Computational Molecular Biology
Efficient retrieval of approximate palindromes in a run-length encoded string
Theoretical Computer Science
Contraction-based steiner tree approximations in practice
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Efficient algorithms for the weighted k-center problem on a real line
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Improved algorithms for the range next value problem and applications
Theoretical Computer Science
Efficient algorithms for local ranking
Information Processing Letters
Deterministic regular expressions in linear time
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
Journal of Discrete Algorithms
Longest common extensions via fingerprinting
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
A bibliography on computational molecular biology and genetics
Mathematical and Computer Modelling: An International Journal
An optimal data structure to handle dynamic environments in non-deterministic computations
Computer Languages, Systems and Structures
Research paper: The saga of minimum spanning trees
Computer Science Review
One-way and round-trip center location problems
Discrete Optimization
Shortest path problem in rectangular complexes of global nonpositive curvature
Computational Geometry: Theory and Applications
Time-Space trade-offs for longest common extensions
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
Computing the rooted triplet distance between galled trees by counting triangles
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
String indexing for patterns with wildcards
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Connectivity oracles for planar graphs
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Approximating a Shortest Watchman Route
Fundamenta Informaticae
An Ω(n2/ log n) speed-up of TBR heuristics for the gene-duplication problem
WABI'07 Proceedings of the 7th international conference on Algorithms in Bioinformatics
Cache-oblivious index for approximate string matching
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
Two-dimensional range minimum queries
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
A simple construction of two-dimensional suffix trees in linear time
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
An optimal decomposition algorithm for tree edit distance
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Linear time algorithms for two disjoint paths problems on directed acyclic graphs
Theoretical Computer Science
All-pairs ancestor problems inweighted dags
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
Data structures for detecting rare variations in time series
ECML PKDD'12 Proceedings of the 2012 European conference on Machine Learning and Knowledge Discovery in Databases - Volume Part II
Feedback vertex set on graphs of low clique-width
European Journal of Combinatorics
Approximate period detection and correction
SPIRE'12 Proceedings of the 19th international conference on String Processing and Information Retrieval
Succinct representations of weighted trees supporting path queries
Journal of Discrete Algorithms
Efficient seed computation revisited
Theoretical Computer Science
Fingerprints in compressed strings
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
Spaces, Trees, and Colors: The algorithmic landscape of document retrieval on sequences
ACM Computing Surveys (CSUR)
A scalable approach to computing representative lowest common ancestor in directed acyclic graphs
Theoretical Computer Science
Fast layout computation of clustered networks: Algorithmic advances and experimental analysis
Information Sciences: an International Journal
Extracting powers and periods in a word from its runs structure
Theoretical Computer Science
Computing the rooted triplet distance between galled trees by counting triangles
Journal of Discrete Algorithms
Time-space trade-offs for longest common extensions
Journal of Discrete Algorithms
Journal of Combinatorial Optimization
| Hi-index | 0.02 |