Improving the performance guarantee for approximate graph coloring
Journal of the ACM (JACM)
Optimization, approximation, and complexity classes
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
On the complexity of approximating the independent set problem
Proceedings of the 6th Annual Symposium on Theoretical Aspects of Computer Science on STACS 89
Approximating clique is almost NP-complete (preliminary version)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Fully parallelized multi prover protocols for NEXP-time (extended abstract)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Two-prover one-round proof systems: their power and their problems (extended abstract)
STOC '92 Proceedings of the twenty-fourth 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
The Complexity of Near-Optimal Graph Coloring
Journal of the ACM (JACM)
The Effect of a Connectivity Requirement on the Complexity of Maximum Subgraph Problems
Journal of the ACM (JACM)
Covering edges by cliques with regard to keyword conflicts and intersection graphs
Communications of the ACM
The Approximation of Maximum Subgraph Problems
ICALP '93 Proceedings of the 20th International Colloquium on Automata, Languages and Programming
Proof verification and hardness of approximation problems
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
Improved approximations of packing and covering problems
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)
A threshold of ln n for approximating set cover (preliminary version)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
A tight analysis of the greedy algorithm for set cover
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Strategic directions in research in theory of computing
ACM Computing Surveys (CSUR) - Special ACM 50th-anniversary issue: strategic directions in computing research
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)
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)
A threshold of ln n for approximating set cover
Journal of the ACM (JACM)
Static and dynamic information organization with star clusters
Proceedings of the seventh international conference on Information and knowledge management
PCP characterizations of NP: towards a polynomially-small error-probability
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
On the complexity of the view-selection problem
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Selecting training inputs via greedy rank covering
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
A practical clustering algorithm for static and dynamic information organization
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Greedy strikes back: improved facility location algorithms
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the eighth international conference on Information and knowledge management
Approximating the domatic number
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Using star clusters for filtering
Proceedings of the ninth international conference on Information and knowledge management
On the cost of virtual private networks
IEEE/ACM Transactions on Networking (TON)
On approximating the achromatic number
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Non-approximability results for optimization problems on bounded degree instances
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Hardness and methods to solve CLIQUE
Journal of Computer Science and Technology
Converter Placement Supporting Broadcast in WDM Optical Networks
IEEE Transactions on Computers
Combinatorial logarithmic approximation algorithm for directed telephone broadcast problem
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Information and Computation
Spine routing in ad hoc networks
Cluster Computing
Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Improved Approximation Algorithms for Capacitated Facility Location Problems
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
On Preemptive Resource Constrained Scheduling: Polynomial-Time Approximation Schemes
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
The Complexity of the Extended GCD Problem
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Preemptive Scheduling on Dedicated Processors: Applications of Fractional Graph Coloring
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
The Buffer Minimization Problem for Multiprocessor Scheduling with Conflicts
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Preemptive Parallel Task Scheduling in O(n)+Poly(m) Time
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Graph Colouring by Maximal Evidence Edge Adding
PATAT '00 Selected papers from the Third International Conference on Practice and Theory of Automated Timetabling III
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
On the Hardness of Approximating Minimum Monopoly Problems
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
Hardness Results for Neural Network Approximation Problems
EuroCOLT '99 Proceedings of the 4th European Conference on Computational Learning Theory
A Fast and Simple Local Search for Graph Coloring
WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Generating, Visualizing, and Evaluating High-Quality Clusters for Information Organization
PODDP '98 Proceedings of the 4th International Workshop on Principles of Digital Document Processing
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
On Approximate Learning by Multi-layered Feedforward Circuits
ALT '00 Proceedings of the 11th International Conference on Algorithmic Learning Theory
On Classification and Regression
DS '98 Proceedings of the First International Conference on Discovery Science
On the Approximability of the Minimum Test Collection Problem
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Designing overlay multicast networks for streaming
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Polylogarithmic inapproximability
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Towards optimal lower bounds for clique and chromatic number
Theoretical Computer Science
A Short Guide To Approximation Preserving Reductions
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Constraint Satisfaction: The Approximability of Minimization Problems
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Hardness of Approximating Minimization Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Dynamic Global Packet Routing in Wireless Networks
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
On the domination search number
Discrete Applied Mathematics
Theoretical Computer Science
Approximating covering integer programs with multiplicity constraints
Discrete Applied Mathematics
On good algorithms for determining unsatisfiability of propositional formulas
Discrete Applied Mathematics - The renesse issue on satisfiability
Approximation Algorithms for the Class Cover Problem
Annals of Mathematics and Artificial Intelligence
On the hardness of approximating label-cover
Information Processing Letters
Scheduling with conflicts on bipartite and interval graphs
Journal of Scheduling - Special issue: On-line scheduling
Logarithmic inapproximability of the radio broadcast problem
Journal of Algorithms
UAI '04 Proceedings of the 20th conference on Uncertainty in artificial intelligence
Maximizing the Lifetime of Dominating Sets
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 12 - Volume 13
Improved approximation algorithms for geometric set cover
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Partial covering of hypergraphs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
On the approximability of some network design problems
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Facility location: distributed approximation
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Conversion of coloring algorithms into maximum weight independent set algorithms
Discrete Applied Mathematics
Minimizing interference in ad hoc and sensor networks
DIALM-POMC '05 Proceedings of the 2005 joint workshop on Foundations of mobile computing
Combination can be hard: approximability of the unique coverage problem
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Approximate Minimum-Energy Multicasting in Wireless Ad Hoc Networks
IEEE Transactions on Mobile Computing
Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons
Journal of Computer and System Sciences
On the complexity of approximating tsp with neighborhoods and related problems
Computational Complexity
Hardness of approximate two-level logic minimization and PAC learning with membership queries
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Linear degree extractors and the inapproximability of max clique and chromatic number
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Efficiently computing succinct trade-off curves
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
Wavelength assignment for multicast in all-optical WDM networks with splitting constraints
IEEE/ACM Transactions on Networking (TON)
Non-cooperative multicast and facility location games
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
Algorithmic construction of sets for k-restrictions
ACM Transactions on Algorithms (TALG)
On approximate learning by multi-layered feedforward circuits
Theoretical Computer Science - Algorithmic learning theory (ALT 2000)
Data streams: algorithms and applications
Foundations and Trends® in Theoretical Computer Science
Approximately dominating representatives
Theoretical Computer Science
Approximability of identifying codes and locating--dominating codes
Information Processing Letters
Sharing aggregate computation for distributed queries
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
IEEE Transactions on Parallel and Distributed Systems
Online vertex colorings of random graphs without monochromatic subgraphs
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Approximating the spanning star forest problem and its applications to genomic sequence alignment
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Fractionally total colouring Gn,p
Discrete Applied Mathematics
On the approximability of some network design problems
ACM Transactions on Algorithms (TALG)
Helly-type theorems for approximate covering
Proceedings of the twenty-fourth annual symposium on Computational geometry
Fast exact and heuristic methods for role minimization problems
Proceedings of the 13th ACM symposium on Access control models and technologies
Efficient sensor network design for continuous monitoring of moving objects
Theoretical Computer Science
Computer Networks: The International Journal of Computer and Telecommunications Networking
Approximation algorithm for coloring of dotted interval graphs
Information Processing Letters
Consecutive block minimization is 1.5-approximable
Information Processing Letters
PCPs with small soundness error
ACM SIGACT News
Robust Combinatorial Optimization with Exponential Scenarios
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
Approximation Algorithms and Hardness for Domination with Propagation
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
Improved Approximation Algorithms for the Spanning Star Forest Problem
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
Hardness of approximate two-level logic minimization and PAC learning with membership queries
Journal of Computer and System Sciences
Probabilistically checkable proofs
Communications of the ACM - Being Human in the Digital Age
Note: Approximation of the k-batch consolidation problem
Theoretical Computer Science
Local Construction and Coloring of Spanners of Location Aware Unit Disk Graphs
Graph-Theoretic Concepts in Computer Science
Ricochet: A Family of Unconstrained Algorithms for Graph Clustering
DASFAA '09 Proceedings of the 14th International Conference on Database Systems for Advanced Applications
Clustering with Lower Bound on Similarity
PAKDD '09 Proceedings of the 13th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining
On the complexity of communication complexity
Proceedings of the forty-first annual ACM symposium on Theory of computing
Journal of Discrete Algorithms
On the set multi-cover problem in geometric settings
Proceedings of the twenty-fifth annual symposium on Computational geometry
On the Approximability of Some Haplotyping Problems
AAIM '09 Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management
Small-Bias Spaces for Group Products
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Purely epistemic markov decision processes
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Multiagent graph coloring: Pareto efficiency, fairness and individual rationality
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Learning first-order definitions of functions
Journal of Artificial Intelligence Research
Covering arrays avoiding forbidden edges
Theoretical Computer Science
IEEE Journal on Selected Areas in Communications - Special issue on body area networking: Technology and applications
Conversion of coloring algorithms into maximum weight independent set algorithms
Discrete Applied Mathematics
Weakly-private secret sharing schemes
TCC'07 Proceedings of the 4th conference on Theory of cryptography
ADHOC-NOW'07 Proceedings of the 6th international conference on Ad-hoc, mobile and wireless networks
Online multicasting in WDM networks with shared light splitter bank
NETWORKING'07 Proceedings of the 6th international IFIP-TC6 conference on Ad Hoc and sensor networks, wireless networks, next generation internet
Efficient sensor network design for continuous monitoring of moving objects
ALGOSENSORS'07 Proceedings of the 3rd international conference on Algorithmic aspects of wireless sensor networks
Local approximation algorithms for scheduling problems in sensor networks
ALGOSENSORS'07 Proceedings of the 3rd international conference on Algorithmic aspects of wireless sensor networks
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
An investigation on the nature of wireless scheduling
INFOCOM'10 Proceedings of the 29th conference on Information communications
MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
Heuristic algorithms in computational molecular biology
Journal of Computer and System Sciences
Scheduling large-scale micro/nano biochemical testing: Exact and heuristic algorithms
Computers and Operations Research
Baaz: a system for detecting access control misconfigurations
USENIX Security'10 Proceedings of the 19th USENIX conference on Security
Approximation and hardness results for label cut and related problems
Journal of Combinatorial Optimization
The complexity of equilibria in cost sharing games
WINE'10 Proceedings of the 6th international conference on Internet and network economics
Approximation algorithm for the minimum directed tree cover
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
Approximation Algorithms for Nonuniform Buy-at-Bulk Network Design
SIAM Journal on Computing
Approximation algorithms for minimum chain vertex deletion
WALCOM'11 Proceedings of the 5th international conference on WALCOM: algorithms and computation
Multi cover of a polygon minimizing the sum of areas
WALCOM'11 Proceedings of the 5th international conference on WALCOM: algorithms and computation
Safe lower bounds for graph coloring
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
GAPs: Geospatial Abduction Problems
ACM Transactions on Intelligent Systems and Technology (TIST)
Hardness results for covering arrays avoiding forbidden edges and error-locating arrays
Theoretical Computer Science
On the complexity of the regenerator placement problem in optical networks
IEEE/ACM Transactions on Networking (TON)
Cross-layer survivability in WDM-based networks
IEEE/ACM Transactions on Networking (TON)
Minimum latency data aggregation in the physical interference model
Proceedings of the 14th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
On the complexity of SNP block partitioning under the perfect phylogeny model
WABI'06 Proceedings of the 6th international conference on Algorithms in Bioinformatics
Controlling size when aligning multiple genomic sequences with duplications
WABI'06 Proceedings of the 6th international conference on Algorithms in Bioinformatics
Complexity and approximation of fixing numerical attributes in databases under integrity constraints
DBPL'05 Proceedings of the 10th international conference on Database Programming Languages
The generalized deadlock resolution problem
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Interference in cellular networks: the minimum membership set cover problem
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Inapproximability results for combinatorial auctions with submodular utility functions
WINE'05 Proceedings of the First international conference on Internet and Network Economics
Distributed spatial clustering in sensor networks
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
Finding the best CAFE is NP-hard
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Computational challenges with cliques, quasi-cliques and clique partitions in graphs
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
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
Approximately dominating representatives
ICDT'05 Proceedings of the 10th international conference on Database Theory
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Linear kernels in linear time, or how to save k colors in O(n2) steps
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Time complexity of decision trees
Transactions on Rough Sets III
Approximation algorithms for a geometric set cover problem
Discrete Applied Mathematics
Algorithmic aspects of dominator colorings in graphs
IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
Minimum cost source location problems with flow requirements
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
A note on the subadditive network design problem
Operations Research Letters
Survey: A survey on the structure of approximation classes
Computer Science Review
Cyclical scheduling and multi-shift scheduling: Complexity and approximation algorithms
Discrete Optimization
Set covering with almost consecutive ones property
Discrete Optimization
Improving broadcast efficiency in wireless sensor network time synchronization protocols
Proceedings of the International Workshop on System Level Interconnect Prediction
Faster parameterized algorithms for deletion to split graphs
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Minimum latency data aggregation in the physical interference model
Computer Communications
On the set multicover problem in geometric settings
ACM Transactions on Algorithms (TALG)
Journey to the centre of the star: various ways of finding star centers in star clustering
DEXA'07 Proceedings of the 18th international conference on Database and Expert Systems Applications
A randomised approximation algorithm for the partial vertex cover problem in hypergraphs
MedAlg'12 Proceedings of the First Mediterranean conference on Design and Analysis of Algorithms
How to guard a graph against tree movements
CATS '12 Proceedings of the Eighteenth Computing: The Australasian Theory Symposium - Volume 128
How to guard a graph against tree moves
Information Processing Letters
Bitlist: new full-text index for low space cost and efficient keyword search
Proceedings of the VLDB Endowment
An efficient construction and application usefulness of rectangle greedy covers
Pattern Recognition
CHECKCOL: Improved local search for graph coloring
Journal of Discrete Algorithms
The minimum constraint removal problem with three robotics applications
International Journal of Robotics Research
On the connectivity preserving minimum cut problem
Journal of Computer and System Sciences
Selecting queries from sample to crawl deep web data sources
Web Intelligence and Agent Systems
| Hi-index | 0.02 |