Design networks with bounded pairwise distance
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Distinguishing string selection problems
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
A simple iterative approach to parameter optimization
RECOMB '00 Proceedings of the fourth annual international conference on Computational molecular biology
Proceedings of the 2001 international symposium on Symbolic and algebraic computation
Some optimal inapproximability results
Journal of the ACM (JACM)
The MIN PFS problem and piecewise linear model estimation
Discrete Applied Mathematics - Special issue: Third ALIO-EURO meeting on applied combinatorial optimization
Some Structural and Algorithmic Properties of the Maximum Feasible Subsystem Problem
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
Optimization over k-set Polytopes and Efficient k-set Enumeration
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
Structural Complexity and Neural Networks
WIRN VIETRI 2002 Proceedings of the 13th Italian Workshop on Neural Nets-Revised Papers
Towards a Predictive Computational Complexity Theory
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Inferring a Union of Halfspaces from Examples
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
On Approximate Learning by Multi-layered Feedforward Circuits
ALT '00 Proceedings of the 11th International Conference on Algorithmic Learning Theory
Maximizing Agreements and CoAgnostic Learning
ALT '02 Proceedings of the 13th International Conference on Algorithmic Learning Theory
A Short Guide To Approximation Preserving Reductions
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
On the difficulty of approximately maximizing agreements
Journal of Computer and System Sciences
Distinguishing string selection problems
Information and Computation
On the establishment of distinct identities in overlay networks
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Maximizing agreements and coagnostic learning
Theoretical Computer Science - Algorithmic learning theory(ALT 2002)
On approximate learning by multi-layered feedforward circuits
Theoretical Computer Science - Algorithmic learning theory (ALT 2000)
Computing customized page ranks
ACM Transactions on Internet Technology (TOIT)
Adaptive Service Composition in Flexible Processes
IEEE Transactions on Software Engineering
Applications of regularized least squares to pattern classification
Theoretical Computer Science
A two-phase relaxation-based heuristic for the maximum feasible subsystem problem
Computers and Operations Research
Computers and Operations Research
Approximating maximum satisfiable subsystems of linear equations of bounded width
Information Processing Letters
Output-sensitive algorithms for Tukey depth and related problems
Statistics and Computing
Mechanisms for information elicitation
Artificial Intelligence
On the approximability of the maximum feasible subsystem problem with 0/1-coefficients
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Mechanisms for partial information elicitation: the truth, but not the whole truth
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Logical analysis of binary data with missing bits
Artificial Intelligence
On optimal zero-preserving corrections for inconsistent linear systems
Journal of Global Optimization
Inapproximability results for equations over infinite groups
Theoretical Computer Science
Matrix sparsification and the sparse null space problem
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
A relaxable service selection algorithm for QoS-based web service composition
Information and Software Technology
Negative cycle separation in wireless network design
INOC'11 Proceedings of the 5th international conference on Network optimization
Randomized relaxation methods for the maximum feasible subsystem problem
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
The complexity of geometric problems in high dimension
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Integrated classifier hyperplane placement and feature selection
Expert Systems with Applications: An International Journal
Algorithms and complexity for periodic real-time scheduling
ACM Transactions on Algorithms (TALG)
Approximating infeasible 2VPI-systems
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
Absolute approximation of Tukey depth: Theory and experiments
Computational Geometry: Theory and Applications
Column Generation for the Minimum Hyperplanes Clustering Problem
INFORMS Journal on Computing
Adaptive scheduling for parallel tasks with QoS satisfaction for hybrid cloud environments
The Journal of Supercomputing
| Hi-index | 5.23 |