Algorithmic complexity in coding theory and the minimum distance problem
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)
The approximability of NP-hard problems
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)
Partitioning K clones: hardness results and practical algorithms for the K-populations problem
RECOMB '98 Proceedings of the second annual international conference on Computational molecular biology
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
On the complexity of computing short linearly independent vectors and short bases in a lattice
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Spatial codes and the hardness of string folding problems
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
On the red-blue set cover problem
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for constrained for constrained node weighted steiner tree problems
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
The hardness of cache conscious data placement
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
IEEE Transactions on Parallel and Distributed Systems
The inapproximability of non-NP-hard optimization problems
Theoretical Computer Science
Sublogarithmic approximation for telephone multicast: path out of jungle (extended abstract)
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
On Performance Estimates for Two Evolutionary Algorithms
Proceedings of the EvoWorkshops on Applications of Evolutionary Computing
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
The Complexity of the Extended GCD Problem
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Approximability of the Minimum Bisection Problem: An Algorithmic Challenge
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
On Network Design Problems: Fixed Cost Flows and the Covering Steiner Problem
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Optimum Inapproximability Results for Finding Minimum Hidden Guard Sets in Polygons and Terrains
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Many-Valued Logics and Holographic Proofs
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Hardness of Set Cover with Intersection 1
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Subexponential Parameterized Algorithms Collapse the W-Hierarchy
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Approximation Hardness of Bounded Degree MIN-CSP and MIN-BISECTION
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
The Inapproximability of Non NP-hard Optimization Problems
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Inapproximability Results for Guarding Polygons without Holes
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Hardness of Approximating Independent Domination in Circle Graphs
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
How Many People Can Hide in a Terrain?
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Inapproximability Results on Stable Marriage Problems
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Hardness of Approximation for Vertex-Connectivity Network-Design Problems
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
MAXIMUM CLIQUE and MINIMUM CLIQUE PARTITION in Visibility Graphs
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Preemptive Scheduling with Rejection
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
An Approximation Algorithm for MINIMUM CONVEX COVER with Logarithmic Performance Guarantee
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
On the Clique Problem in Intersection Graphs of Ellipses
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Polylogarithmic inapproximability
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
A generalization of Fagin's theorem
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
A Short Guide To Approximation Preserving Reductions
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Hardness of Approximating the Minimum Distance of a Linear Code
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Connection caching: model and algorithms
Journal of Computer and System Sciences
An efficient fixed-parameter algorithm for 3-hitting set
Journal of Discrete Algorithms
Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT
Discrete Applied Mathematics - The renesse issue on satisfiability
Worst-case study of local search for MAX-k-SAT
Discrete Applied Mathematics - The renesse issue on satisfiability
Approximation Algorithms for the Class Cover Problem
Annals of Mathematics and Artificial Intelligence
On approximability of linear ordering and related NP-optimization problems on graphs
Discrete Applied Mathematics - The 1st cologne-twente workshop on graphs and combinatorial optimization (CTW 2001)
Asymmetric k-center is log* n-hard to approximate
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Logarithmic inapproximability of the radio broadcast problem
Journal of Algorithms
Finding the most interesting correlations in a database: how hard can it be?
Information Systems
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
The complexity of base station positioning in cellular networks
Discrete Applied Mathematics
On network design problems: fixed cost flows and the covering steiner problem
ACM Transactions on Algorithms (TALG)
Asymmetric k-center is log* n-hard to approximate
Journal of the ACM (JACM)
Finding minimum hidden guard sets in polygons: tight approximability results
Computational Geometry: Theory and Applications
The hardness of cache conscious data placement
Nordic Journal of Computing
Approximating the minimum number of maximum power users in ad hoc networks
Mobile Networks and Applications
The NP-completeness column: The many limits on approximation
ACM Transactions on Algorithms (TALG)
Maximizing the guarded boundary of an Art Gallery is APX-complete
Computational Geometry: Theory and Applications
Packing element-disjoint steiner trees
ACM Transactions on Algorithms (TALG)
An improved lower bound for approximating minimum GCD multiplier in l∞ norm (GCDM∞)
Theoretical Computer Science
Streaming cache placement problems: complexity and algorithms
International Journal of Computational Science and Engineering
Inapproximability and approximability of minimal tree routing and coloring
Journal of Discrete Algorithms
Approximating Single Machine Scheduling with Scenarios
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Probabilistically checkable proofs
Communications of the ACM - Being Human in the Digital Age
Quantifying inefficiency in cost-sharing mechanisms
Journal of the ACM (JACM)
Approximation and Hardness Results for Label Cut and Related Problems
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
On Approximating an Implicit Cover Problem in Biology
AAIM '09 Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management
Hard constraint satisfaction problems have hard gaps at location 1
Theoretical Computer Science
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Finding minimum hidden guard sets in polygons---tight approximability results
Computational Geometry: Theory and Applications
The complexity of base station positioning in cellular networks
Discrete Applied Mathematics
Double digest revisited: complexity and approximability in the presence of noisy data
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
maximizing the guarded boundary of an art gallery is APX-complete
CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity
Approximability and inapproximability of the minimum certificate dispersal problem
Theoretical Computer Science
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
On the approximability of robust spanning tree problems
Theoretical Computer Science
Approximation and hardness results for label cut and related problems
Journal of Combinatorial Optimization
Improved hardness of approximation for stackelberg shortest-path pricing
WINE'10 Proceedings of the 6th international conference on Internet and network economics
Complexity of determining the most vital elements for the 1-median and 1-center location problems
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I
Approximation algorithms for minimum chain vertex deletion
WALCOM'11 Proceedings of the 5th international conference on WALCOM: algorithms and computation
UAI'99 Proceedings of the Fifteenth conference on Uncertainty in artificial intelligence
Optimization and approximation problems related to polynomial system solving
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Complexity of majority monopoly and signed domination problems
Journal of Discrete Algorithms
Packing element-disjoint steiner trees
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Computational complexity since 1980
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
On some relations between approximation problems and PCPs over the real numbers
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
Semidefinite programming and approximation algorithms: a survey
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
The Traveling Salesman Problem with flexible coloring
Discrete Applied Mathematics
Survey: A survey on the structure of approximation classes
Computer Science Review
On complexity of unconstrained hyperbolic 0-1 programming problems
Operations Research Letters
Label cover instances with large girth and the hardness of approximating basic k-spanner
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
On approximation of bookmark assignments
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Single machine scheduling with scenarios
Theoretical Computer Science
Complexity of determining the most vital elements for the p-median and p-center location problems
Journal of Combinatorial Optimization
CATS '11 Proceedings of the Seventeenth Computing: The Australasian Theory Symposium - Volume 119
CATS 2011 Proceedings of the Seventeenth Computing on The Australasian Theory Symposium - Volume 119
Critical edges/nodes for the minimum spanning tree problem: complexity and approximation
Journal of Combinatorial Optimization
Optimal approximability of bookmark assignments
Discrete Applied Mathematics
Autonomous Agents and Multi-Agent Systems
Annals of Mathematics and Artificial Intelligence
| Hi-index | 0.01 |