An incremental linear-time algorithm for recognizing interval graphs
SIAM Journal on Computing
Approximation algorithms for the shortest common superstring problem
Information and Computation
Reconstructing sets from interpoint distances (extended abstract)
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Linear approximation of shortest superstrings
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Multiple solutions of DNA restriction mapping problems
Advances in Applied Mathematics
Exact and approximation algorithms for DNA sequence reconstruction
Exact and approximation algorithms for DNA sequence reconstruction
Regular Article: A Lower Bound on the Number of Solutions to the Probed Partial Digest Problem
Advances in Applied Mathematics
Physical mapping of chromosomes: a combinatorial problem in molecular biology
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Aligning sequences via an evolutionary tree: complexity and approximation
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Database metatheory: asking the big queries
ACM SIGACT News
Database metatheory: asking the big queries
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Strategic directions in research in theory of computing
ACM Computing Surveys (CSUR) - Special ACM 50th-anniversary issue: strategic directions in computing research
RECOMB '97 Proceedings of the first annual international conference on Computational molecular biology
Mapping clones with a given ordering or interleaving
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
A survey of graph layout problems
ACM Computing Surveys (CSUR)
Refining Restriction Enzyme Genome Maps
Constraints
The Enhanced Double Digest Problem for DNA Physical Mapping
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
The Complexity of Constraints on Intervals and Lengths
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Physical Mapping with Repeated Probes: The Hypergraph Superstring Problem
CPM '99 Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching
Non-approximability of weighted multiple sequence alignment
Theoretical Computer Science - Computing and combinatorics
Reasoning about temporal relations: The tractable subalgebras of Allen's interval algebra
Journal of the ACM (JACM)
The consensus string problem for a metric is NP-complete
Journal of Discrete Algorithms
Convergence Theorems for Some Layout Measures on Random Lattice and Random Geometric Graphs
Combinatorics, Probability and Computing
On the interval completion of chordal graphs
Discrete Applied Mathematics
Consensus Optimizing Both Distance Sum and Radius
SPIRE '09 Proceedings of the 16th International Symposium on String Processing and Information Retrieval
On the interval completion of chordal graphs
Discrete Applied Mathematics
On the cost of persistence and authentication in skip lists
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Solving Talent Scheduling with Dynamic Programming
INFORMS Journal on Computing
Fixed-parameter complexity of minimum profile problems
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Spectral sequencing based on graph distance
GMP'06 Proceedings of the 4th international conference on Geometric Modeling and Processing
The complexity of string partitioning
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
On the L(h, k)-labeling of co-comparability graphs
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
An O( n2)-time algorithm for the minimal interval completion problem
Theoretical Computer Science
| Hi-index | 0.00 |