Edit distance between two RNA structures
RECOMB '01 Proceedings of the fifth annual international conference on Computational biology
On approximating the maximum diameter ratio of graphs
Discrete Mathematics - Algebraic and topological methods in graph theory
ICDT '03 Proceedings of the 9th International Conference on Database Theory
On the Complexity of Train Assignment Problems
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
On the Approximability of Multiprocessor Task Scheduling Problems
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
On the Hardness of Approximating Minimum Monopoly Problems
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
The Problem of Context Sensitive String Matching
CPM '02 Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching
Greedy Algorithms for Minimisation Problems in Random Regular Graphs
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
On the power assignment problem in radio networks
Mobile Networks and Applications - Discrete algorithms and methods for mobile computing and communications
A Hard Dial-a-Ride Problem that is Easy on Average
Journal of Scheduling
On profit-maximizing envy-free pricing
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Combination can be hard: approximability of the unique coverage problem
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Multiple Sequence Alignment as a Facility-Location Problem
INFORMS Journal on Computing
Minimization of decision trees is hard to approximate
Journal of Computer and System Sciences
Computing Phylogenetic Diversity for Split Systems
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
The Minimum Substring Cover problem
Information and Computation
Polynomial flow-cut gaps and hardness of directed cut problems
Journal of the ACM (JACM)
Paintshop, odd cycles and necklace splitting
Discrete Applied Mathematics
The optimal statistical median of a convex set of arrays
Journal of Global Optimization
Maximal Strip Recovery Problem with Gaps: Hardness and Approximation Algorithms
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
The minimum substring cover problem
WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs
Discrete Applied Mathematics
On the hardness and inapproximability of optimization problems on power law graphs
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I
WABI'06 Proceedings of the 6th international conference on Algorithms in Bioinformatics
Reconfigurations in graphs and grids
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Journal of Discrete Algorithms
On the approximability of some degree-constrained subgraph problems
Discrete Applied Mathematics
The Traveling Salesman Problem with flexible coloring
Discrete Applied Mathematics
New techniques for approximating optimal substructure problems in power-law graphs
Theoretical Computer Science
Algorithmic aspects of k-tuple total domination in graphs
Information Processing Letters
Maximal strip recovery problem with gaps: Hardness and approximation algorithms
Journal of Discrete Algorithms
Revisiting the Minimum Breakpoint Linearization Problem
Theoretical Computer Science
| Hi-index | 0.00 |