Multi-prover interactive proofs: how to remove intractability assumptions
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Efficient probabilistically checkable proofs and applications to approximations
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
.879-approximation algorithms for MAX CUT and MAX 2SAT
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Interactive proofs and the hardness of approximating cliques
Journal of the ACM (JACM)
Towards the parallel repetition conjecture
Theoretical Computer Science - Special issue on complexity theory and the theory of algorithms as developed in the CIS
Free bits, PCPs and non-approximability-towards tight results
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Gadgets Approximation, and Linear Programming
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Clique is hard to approximate within n1-
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Approximating the value of two power proof systems, with applications to MAX 2SAT and MAX DICUT
ISTCS '95 Proceedings of the 3rd Israel Symposium on the Theory of Computing Systems (ISTCS'95)
Linearity testing in characteristic two
IEEE Transactions on Information Theory - Part 1
When Hamming meets Euclid: the approximability of geometric TSP and MST (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Probabilistic checking of proofs: a new characterization of NP
Journal of the ACM (JACM)
On the limits of non-approximability of lattice problems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Recycling queries in PCPs and in linearity tests (extended abstract)
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
The approximability of NP-hard problems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Finding almost-satisfying assignments
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Proof verification and the hardness of approximation problems
Journal of the ACM (JACM)
A threshold of ln n for approximating set cover
Journal of the ACM (JACM)
Property testing and its connection to learning and approximation
Journal of the ACM (JACM)
A tractable Walsh analysis of SAT and its implications for genetic algorithms
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
A new way to use semidefinite programming with applications to linear equations mod p
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
On the approximability of the traveling salesman problem (extended abstract)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
A PCP characterization of NP with optimal amortized query complexity
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Improved approximation algorithms for MAX SAT
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Combinatorial approximation algorithms for the maximum directed cut problem
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Constructing worst case instances for semidefinite programming based approximation algorithms
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Polynomial-time approximation schemes for geometric graphs
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
On the integrality ratio of semidefinite relaxations of MAX CUT
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Non-approximability results for optimization problems on bounded degree instances
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Private approximation of NP-hard functions
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
The nonapproximability of OBDD minimization
Information and Computation
The importance of being biased
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Hardness results for approximate hypergraph coloring
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Relations between average case complexity and approximation complexity
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
On the power of unique 2-prover 1-round games
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Computer assisted proof of optimal approximability results
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
On the optimality of the random hyperplane rounding technique for max cut
Random Structures & Algorithms - Probabilistic methods in combinatorial optimization
Improved approximation algorithms for MAX SAT
Journal of Algorithms
MAX3SAT is exponentially hard to approximate if NP has positive dimension
Theoretical Computer Science
Random MAX SAT, random MAX CUT, and their phase transitions
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Exact and approximate testing/correcting of algebraic functions: a survey
Theoretical aspects of computer science
Some Structural and Algorithmic Properties of the Maximum Feasible Subsystem Problem
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
Fences Are Futile: On Relaxations for the Linear Ordering Problem
Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
Improved Rounding Techniques for the MAX 2-SAT and MAX DI-CUT Problems
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
On the Approximability of the Steiner Tree Problem
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Approximability of Dense Instances of NEAREST CODEWORD Problem
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Approximation Hardness of the Steiner Tree Problem on Graphs
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Structural Complexity and Neural Networks
WIRN VIETRI 2002 Proceedings of the 13th Italian Workshop on Neural Nets-Revised Papers
On Some Tighter Inapproximability Results (Extended Abstract)
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Approximation Hardness of TSP with Bounded Metrics
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Security of Blind Discrete Log Signatures against Interactive Attacks
ICICS '01 Proceedings of the Third International Conference on Information and Communications Security
On Approximating Minimum Vertex Cover for Graphs with Perfect Matching
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
On Efficient Fixed Parameter Algorithms for WEIGHTED VERTEX COVER
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Project Scheduling with Irregular Costs: Complexity, Approximability, and Algorithms
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Inapproximability Results on Stable Marriage Problems
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Representing Graph Metrics with Fewest Edges
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Small PCPs with Low Query Complexity
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Non-approximability of Weighted Multiple Sequence Alignment
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Random Instance Generation for MAX 3SAT
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
On the inapproximability of broadcasting time
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
On the hardness of approximating N P witnesses
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
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
Sampling Methods Applied to Dense Instances of Non-Boolean Optimization Problems
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
The Non-approximability of Non-Boolean Predicates
APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization
Algorithms Based on Randomization and Linear and Semidefinite Programming
SOFSEM '98 Proceedings of the 25th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
Some Prospects for Efficient Fixed Parameter Algorithms
SOFSEM '98 Proceedings of the 25th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
Stability of Approximation Algorithms for Hard Optimization Problems
SOFSEM '99 Proceedings of the 26th Conference on Current Trends in Theory and Practice of Informatics on Theory and Practice of Informatics
Secure Human Identification Protocols
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Exact and Approximate Testing/Correcting of Algebraic Functions: A Survey
Theoretical Aspects of Computer Science, Advanced Lectures [First Summer School on Theoretical Aspects of Computer Science, Tehran, Iran, July 2000]
Complexity Classification of Some Edge Modification Problems
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
De Bruijn Graphs and DNA Graphs
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
Maximizing Agreements and CoAgnostic Learning
ALT '02 Proceedings of the 13th International Conference on Algorithmic Learning Theory
Computing Cycle Covers without Short Cycles
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Approximating Bounded Degree Instances of NP-Hard Problems
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
The Hardness of Placing Street Names in a Manhattan Type Map
CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity
CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity
Faster Exact Solutions for MAX2SAT
CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity
Bounds for the Minimum Disagreement Problem with Applications to Learning Theory
COLT '02 Proceedings of the 15th Annual Conference on Computational Learning Theory
Approximation Algorithms for MAX 4-SAT and Rounding Procedures for Semidefinite Programs
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
On the approximability of the Steiner tree problem
Theoretical Computer Science - Mathematical foundations of computer science
A combinatorial algorithm for MAX CSP
Information Processing Letters
Recognizing DNA graphs is difficult
Discrete Applied Mathematics - Special issue: Computational molecular biology series issue IV
Discrete Applied Mathematics
Problems and results on judicious partitions
Random Structures & Algorithms - Special issue: Proceedings of the tenth international conference "Random structures and algorithms"
Wavelength rerouting in optical networks, or the Venetian Routing problem
Journal of Algorithms
Property testing in massive graphs
Handbook of massive data sets
On Counting Independent Sets in Sparse Graphs
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
On the difficulty of approximately maximizing agreements
Journal of Computer and System Sciences
Journal of Algorithms
The bundle method for hard combinatorial optimization problems
Combinatorial optimization - Eureka, you shrink!
Polynomial time approximation schemes for dense instances of minimum constraint satisfaction
Random Structures & Algorithms
Tutorial on computational complexity
Interfaces
Worst-case study of local search for MAX-k-SAT
Discrete Applied Mathematics - The renesse issue on satisfiability
Bipartite Subgraphs and the Smallest Eigenvalue
Combinatorics, Probability and Computing
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Set k-cover algorithms for energy efficient monitoring in wireless sensor networks
Proceedings of the 3rd international symposium on Information processing in sensor networks
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
Max Cut for Random Graphs with a Planted Partition
Combinatorics, Probability and Computing
Index Selection for Databases: A Hardness Study and a Principled Heuristic Solution
IEEE Transactions on Knowledge and Data Engineering
Local ratio: A unified framework for approximation algorithms. In Memoriam: Shimon Even 1935-2004
ACM Computing Surveys (CSUR)
Security Parallels between People and Pervasive Devices
PERCOMW '05 Proceedings of the Third IEEE International Conference on Pervasive Computing and Communications Workshops
Towards strong nonapproximability results in the Lovasz-Schrijver hierarchy
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Approximation algorithms for combinatorial auctions with complement-free bidders
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Shunting Minimal Rail Car Allocation
Computational Optimization and Applications
On approximating minimum vertex cover for graphs with perfect matching
Theoretical Computer Science
A Genetic Model: Analysis and Application to MAXSAT
Evolutionary Computation
Combination can be hard: approximability of the unique coverage problem
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
FPTAS for mixed-integer polynomial optimization with a fixed number of variables
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Locally consistent constraint satisfaction problems
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
An improved analysis of Goemans and Williamson's LP-relaxation for MAX SAT
Theoretical Computer Science - Foundations of computation theory (FCT 2003)
Maximizing agreements and coagnostic learning
Theoretical Computer Science - Algorithmic learning theory(ALT 2002)
The NP-completeness column: The many limits on approximation
ACM Transactions on Algorithms (TALG)
Inoculation strategies for victims of viruses and the sum-of-squares partition problem
Journal of Computer and System Sciences
Tree-edges deletion problems with bounded diameter obstruction sets
Discrete Applied Mathematics
On extracting consistent graphs in wireless sensor networks
International Journal of Sensor Networks
Polynomial-TimeMaximisation Classes: Syntactic Hierarchy
Fundamenta Informaticae - Workshop on Combinatorial Algorithms
Encouraging Cooperation in Sharing Supermodular Costs
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
3-bit dictator testing: 1 vs. 5/8
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Reoptimization of Weighted Graph and Covering Problems
Approximation and Online Algorithms
On approximating four covering and packing problems
Journal of Computer and System Sciences
Parsimony Score of Phylogenetic Networks: Hardness Results and a Linear-Time Heuristic
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Local search starting from an LP solution: Fast and quite good
Journal of Experimental Algorithmics (JEA)
k-SAT Is No Harder Than Decision-Unique-k-SAT
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
Journal of Discrete Algorithms
Finding an unknown acyclic orientation of a given graph
Combinatorics, Probability and Computing
Max k-cut and approximating the chromatic number of random graphs
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
ISBRA'07 Proceedings of the 3rd international conference on Bioinformatics research and applications
An approximation algorithm for max p-section
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
An explicit lower bound for TSP with distances one and two
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Upper bounds for vertex cover further improved
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
On the complexity of approximating colored-graph problems extended abstract
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Decision-theoretic Optimal Sampling in Hidden Markov Random Fields
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Price of anarchy for greedy auctions
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Maximum gap labelings of graphs
Information Processing Letters
Distributing data for secure database services
Proceedings of the 4th International Workshop on Privacy and Anonymity in the Information Society
A new Lagrangian net algorithm for solving max-bisection problems
Journal of Computational and Applied Mathematics
Using the FGLSS-reduction to prove inapproximability results for minimum vertex cover in hypergraphs
Studies in complexity and cryptography
Tight bounds on local search to approximate the maximum satisfiability problems
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
A tight analysis of the maximal matching heuristic
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
On the complexity of global constraint satisfaction
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
On LP-based approximability for strict CSPs
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Better inapproximability results for maxclique, chromatic number and min-3lin-deletion
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Security problems of systems of extremely weak devices
Annales UMCS, Informatica - Security Systems
Authenticating pervasive devices with human protocols
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Inferring AS relationships: dead end or lively beginning?
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
SCN'06 Proceedings of the 5th international conference on Security and Cryptography for Networks
A framework for estimating peak power in gate-level circuits
PATMOS'06 Proceedings of the 16th international conference on Integrated Circuit and System Design: power and Timing Modeling, Optimization and Simulation
A survey of approximation results for local search algorithms
Efficient Approximation and Online Algorithms
Theoretical Computer Science
On barrier resilience of sensor networks
ALGOSENSORS'11 Proceedings of the 7th international conference on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities
Distributing Data for Secure Database Services
Transactions on Data Privacy
A new point of NP-hardness for unique games
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
On local search for the generalized graph coloring problem
Operations Research Letters
Approximating MAX SAT by moderately exponential and parameterized algorithms
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
Polynomial-TimeMaximisation Classes: Syntactic Hierarchy
Fundamenta Informaticae - Workshop on Combinatorial Algorithms
RFIDSec'12 Proceedings of the 8th international conference on Radio Frequency Identification: security and privacy issues
Majority is stablest: discrete and SoS
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |