Efficient probabilistically checkable proofs and applications to approximations
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Lower bounds for on-line graph problems with application to on-line circuit and optical routing
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
STOC '97 Proceedings of the twenty-ninth 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
Proof verification and the hardness of approximation problems
Journal of the ACM (JACM)
On the hardness of approximating minimization problems
Journal of the ACM (JACM)
Approximating discrete collections via local improvements
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
WABI '02 Proceedings of the Second International Workshop on Algorithms in Bioinformatics
Complexity Classification of Some Edge Modification Problems
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
Domination analysis of combinatorial optimization problems
Discrete Applied Mathematics
A new approach for approximating node deletion problems
Information Processing Letters
Local ratio: A unified framework for approximation algorithms. In Memoriam: Shimon Even 1935-2004
ACM Computing Surveys (CSUR)
Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization
Journal of Computer and System Sciences
Approximating the maximum clique minor and some subgraph homeomorphism problems
Theoretical Computer Science
Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties
Journal of Computer and System Sciences
Note: An improved algorithm for the longest induced path problem on k-chordal graphs
Discrete Applied Mathematics
Approximation algorithms for restless bandit problems
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Degree-Constrained Subgraph Problems: Hardness and Approximation Results
Approximation and Online Algorithms
On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs
Discrete Applied Mathematics
Bandwidth allocation in cellular networks with multiple interferences
Proceedings of the 6th International Workshop on Foundations of Mobile Computing
Approximation algorithms for restless bandit problems
Journal of the ACM (JACM)
Largest induced acyclic tournament in random digraphs: a 2-point concentration
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Improved fixed-parameter algorithms for two feedback set problems
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Reoptimization of the maximum weighted Pk-free subgraph problem under vertex insertion
WALCOM'12 Proceedings of the 6th international conference on Algorithms and computation
On the approximability of some degree-constrained subgraph problems
Discrete Applied Mathematics
Reoptimization of some maximum weight induced hereditary subgraph problems
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Survey: A survey on the structure of approximation classes
Computer Science Review
The maximum k-colorable subgraph problem and orbitopes
Discrete Optimization
Local approximations for maximum partial subgraph problem
Operations Research Letters
Coloring Graphs Using Two Colors While Avoiding Monochromatic Cycles
INFORMS Journal on Computing
Computational Optimization and Applications
Numerical analysis of rational processes beyond Markov chains
Performance Evaluation
Complexity of finding maximum regular induced subgraphs with prescribed degree
FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
Reoptimization of maximum weight induced hereditary subgraph problems
Theoretical Computer Science
| Hi-index | 0.00 |