Reactive search, a history-sensitive heuristic for MAX-SAT
Journal of Experimental Algorithmics (JEA)
When does a dynamic programming formulation guarantee the existence of an FPTAS?
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
On approximation algorithms for local multiple alignment
RECOMB '00 Proceedings of the fourth annual international conference on Computational molecular biology
Comparison of Algorithms for the Degree Constrained Minimum Spanning Tree
Journal of Heuristics
The Complexity of the Extended GCD Problem
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Search and Optimization Problems in Datalog
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part II
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Maximizing Agreement with a Classification by Bounded or Unbounded Number of Associated Words
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
A Short Guide To Approximation Preserving Reductions
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Breaking cycles for minimizing crossings
Journal of Experimental Algorithmics (JEA)
Proceedings of the 2004 ACM symposium on Applied computing
Polynomial transformations and data-independent neighborhood functions
Discrete Applied Mathematics
A Genetic Model: Analysis and Application to MAXSAT
Evolutionary Computation
Theoretical Computer Science
Fundamenta Informaticae
An improved lower bound for approximating minimum GCD multiplier in l∞ norm (GCDM∞)
Theoretical Computer Science
Local Monotonicity in Probabilistic Networks
ECSQARU '07 Proceedings of the 9th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Inapproximability results for equations over infinite groups
Theoretical Computer Science
Constructing datatype-generic fully polynomial-time approximation schemes using generalised thinning
Proceedings of the 6th ACM SIGPLAN workshop on Generic programming
Guarantees for the success frequency of an algorithm for finding dodgson-election winners
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Poly-APX- and PTAS-Completeness in standard and differential approximation
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
A randomized PTAS for the minimum Consensus Clustering with a fixed number of clusters
Theoretical Computer Science
Order preserving reductions and polynomial improving paths
Operations Research Letters
Fundamenta Informaticae
Theoretical Computer Science
Degree constrained minimum spanning tree problem: a learning automata approach
The Journal of Supercomputing
| Hi-index | 5.23 |