Improved non-approximability results
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Greed is good: approximating independent sets in sparse and bounded-degree graphs
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Polynomial time approximation schemes for dense instances of NP-hard problems
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Testing of the long code and hardness for clique
STOC '96 Proceedings of the twenty-eighth 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
DAC '96 Proceedings of the 33rd annual Design Automation Conference
A survey of approximately optimal solutions to some covering and packing problems
ACM Computing Surveys (CSUR)
Paul Erdös (1913-996): his influence on the 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)
Approximate graph coloring by semidefinite programming
Journal of the ACM (JACM)
The approximability of NP-hard problems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
On channel segmentation design for row-based FPGAs
ICCAD '92 Proceedings of the 1992 IEEE/ACM international conference on Computer-aided design
The algorithmic aspects of uncrowded hypergraphs
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Approximating maximum independent set in bounded degree graphs
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Finding a large hidden clique in a random graph
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
The value of strong inapproximability results for clique
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Master-Slave Strategy and Polynomial Approximation
Computational Optimization and Applications
Approximating coloring and maximum independent sets in 3-uniform hypergraphs
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
On aggregation issues in spatial data management
ADC '02 Proceedings of the 13th Australasian database conference - Volume 5
The inapproximability of non-NP-hard optimization problems
Theoretical Computer Science
Improved approximations of independent sets in bounded-degree graphs via subgraph removal
Nordic Journal of Computing
Hard graphs for the randomized Boppana-Halldórsson algorithm for MAXCLIQUE
Nordic Journal of Computing
Clique Is Hard to Approximate within n1-o(1)
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Approximating the Independence Number and the Chromatic Number in Expected Polynominal Time
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Go with the Winners Algorithms for Cliques in Random Graphs
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Using Approximation Hardness to Achieve Dependable Computation
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
On-Line Maximum-Order Induces Hereditary Subgraph Problems
SOFSEM '00 Proceedings of the 27th Conference on Current Trends in Theory and Practice of Informatics
Weighted Node Coloring: When Stable Sets Are Expensive
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Approximate Coloring of Uniform Hypergraphs (Extended Abstract)
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Packing Cycles and Cuts in Undirected Graphs
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Towards optimal lower bounds for clique and chromatic number
Theoretical Computer Science
Approximate coloring of uniform hypergraphs
Journal of Algorithms
On the approximability of clique and related maximization problems
Journal of Computer and System Sciences
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)
Payoff-Monotonic Game Dynamics and the Maximum Clique Problem
Neural Computation
Linear degree extractors and the inapproximability of max clique and chromatic number
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
The hardness of cache conscious data placement
Nordic Journal of Computing
The complexity of detecting fixed-density clusters
Discrete Applied Mathematics
On the complexity of approximating k-set packing
Computational Complexity
Longest common subsequence problem for unoriented and cyclic strings
Theoretical Computer Science
Internet resiliency to attacks and failures under BGP policy routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Generation of Primary Input Blocking Pattern for Power Minimization during Scan Testing
Journal of Electronic Testing: Theory and Applications
Stochastic packing-market planning
Proceedings of the 8th ACM conference on Electronic commerce
Computational Linguistics
Improving data quality: consistency and accuracy
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Approximating the maximum vertex/edge weighted clique using local search
Journal of Heuristics
Maximum independent set of rectangles
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Reoptimization of Weighted Graph and Covering Problems
Approximation and Online Algorithms
Towards a theory for securing time synchronization in wireless sensor networks
Proceedings of the second ACM conference on Wireless network security
CSP gaps and reductions in the lasserre hierarchy
Proceedings of the forty-first annual ACM symposium on Theory of computing
Dynamic local search for the maximum clique problem
Journal of Artificial Intelligence Research
Priority algorithms for graph optimization problems
Theoretical Computer Science
Subexponential-time algorithms for maximum independent set and related problems on box graphs
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
The complexity of detecting fixed-density clusters
CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity
Approximations of weighted independent set and hereditary subset problems
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
On the complexity of approximating colored-graph problems extended abstract
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
The greedier the better: an efficient algorithm for approximating maximum independent set
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
CGRASS: a system for transforming constraint satisfaction problems
ERCIM'02/CologNet'02 Proceedings of the 2002 Joint ERCIM/CologNet international conference on Constraint solving and constraint logic programming
Paired approximation problems and incompatible inapproximabilities
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Graph homomorphism revisited for graph matching
Proceedings of the VLDB Endowment
GreedyMAX-type algorithms for the maximum independent set problem
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Cooperating local search for the maximum clique problem
Journal of Heuristics
Priority algorithms for graph optimization problems
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
RIBRA–an error-tolerant algorithm for the NMR backbone assignment problem
RECOMB'05 Proceedings of the 9th Annual international conference on Research in Computational Molecular Biology
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Reoptimization of some maximum weight induced hereditary subgraph problems
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
A decomposition approach for solving critical clique detection problems
SEA'12 Proceedings of the 11th international conference on Experimental Algorithms
Reoptimization of maximum weight induced hereditary subgraph problems
Theoretical Computer Science
| Hi-index | 0.00 |