Property testing and its connection to learning and approximation
Journal of the ACM (JACM)
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Approximating the domatic number
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Vertex cover on 4-regular hyper-graphs is hard to approximate within 2 - &egr;
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Hardness results for neural network approximation problems
Theoretical Computer Science
Embeddings and non-approximability of geometric problems
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
All-Norm Approximation Algorithms
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Approximation Algorithms for Partial Covering Problems
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Inapproximability results for set splitting and satisfiability problems with no mixed clauses
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
Hardness of Approximation for Vertex-Connectivity Network-Design Problems
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
Hardness Results for Neural Network Approximation Problems
EuroCOLT '99 Proceedings of the 4th European Conference on Computational Learning Theory
On theoretical and practical considerations of path selection for delay fault testing
Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design
New approximability and inapproximability results for 2-dimensional Bin Packing
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
A new PCP outer verifier with applications to homogeneous linear equations and max-bisection
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
All-norm approximation algorithms
Journal of Algorithms
Approximation algorithms for partial covering problems
Journal of Algorithms
Is constraint satisfaction over two variables always easy?
Random Structures & Algorithms
Islands of Tractability for Parsimony Haplotyping
CSB '05 Proceedings of the 2005 IEEE Computational Systems Bioinformatics Conference
Tight approximation algorithms for maximum general assignment problems
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
On the complexity of approximating tsp with neighborhoods and related problems
Computational Complexity
The minimum-entropy set cover problem
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
On the complexity of approximating k-set packing
Computational Complexity
Islands of Tractability for Parsimony Haplotyping
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes
Mathematics of Operations Research
Approximation of satisfactory bisection problems
Journal of Computer and System Sciences
The Pk Partition Problem and Related Problems in Bipartite Graphs
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Exact algorithms for the matrix bid auction
Computers and Operations Research
On the maximum quadratic assignment problem
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Scheduling with conflicts: online and offline algorithms
Journal of Scheduling
Hardness of approximation for orthogonal rectangle packing and covering problems
Journal of Discrete Algorithms
Hard constraint satisfaction problems have hard gaps at location 1
Theoretical Computer Science
Improved Inapproximability Results for Maximum k-Colorable Subgraph
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
On the Maximum Quadratic Assignment Problem
Mathematics of Operations Research
FUN'07 Proceedings of the 4th international conference on Fun with algorithms
Exact algorithms for the matrix bid auction
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Maximum betweenness centrality: approximability and tractable cases
WALCOM'11 Proceedings of the 5th international conference on WALCOM: algorithms and computation
Maximum bipartite flow in networks with adaptive channel width
Theoretical Computer Science
Complexity of most vital nodes for independent set in graphs related to tree structures
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Improved approximations for hard optimization problems via problem instance classification
Rainbow of computer science
Tight Approximation Algorithms for Maximum Separable Assignment Problems
Mathematics of Operations Research
Using the FGLSS-reduction to prove inapproximability results for minimum vertex cover in hypergraphs
Studies in complexity and cryptography
The most vital nodes with respect to independent set and vertex cover
Discrete Applied Mathematics
On unique games with negativeweights
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
Parallel processing subsystems with redundancy in a distributed environment
PPAM'05 Proceedings of the 6th international conference on Parallel Processing and Applied Mathematics
Complexity and approximation of satisfactory partition problems
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Inapproximability results for orthogonal rectangle packing problems with rotations
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Between a rock and a hard place: the two-to-one assignment problem
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
Minimizing setup and beam-on times in radiation therapy
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Intuitive algorithms and t-vertex cover
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Approximating low-dimensional coverage problems
Proceedings of the twenty-eighth annual symposium on Computational geometry
The path partition problem and related problems in bipartite graphs
Operations Research Letters
Inapproximability results for no-wait job shop scheduling
Operations Research Letters
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Ruling out polynomial-time approximation schemes for hard constraint satisfaction problems
CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications
On approximation of bookmark assignments
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Welfare maximization and the supermodular degree
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Theoretical Computer Science
CATS 2011 Proceedings of the Seventeenth Computing on The Australasian Theory Symposium - Volume 119
New NP-Hardness Results for 3-Coloring and 2-to-1 Label Cover
ACM Transactions on Computation Theory (TOCT)
| Hi-index | 0.00 |