Approximation Algorithms for Maximum Coverage and Max Cut with Given Sizes of Parts
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
On Approximating Minimum Vertex Cover for Graphs with Perfect Matching
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
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
Budgeted Maximum Graph Coverage
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
On 2-Coverings and 2-Packings of Laminar Families
ESA '99 Proceedings of the 7th 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
Partially-Ordered Knapsack and Applications to Scheduling
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Scalar aggregation in inconsistent databases
Theoretical Computer Science - Database theory
Approximating covering integer programs with multiplicity constraints
Discrete Applied Mathematics
Hereditary systems and greedy-type algorithms
Discrete Applied Mathematics - Special issue on stability in graphs and related topics
Indexing text data under space constraints
Proceedings of the thirteenth ACM international conference on Information and knowledge management
On approximating minimum vertex cover for graphs with perfect matching
Theoretical Computer Science
Combination can be hard: approximability of the unique coverage problem
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Approximation algorithms for covering/packing integer programs
Journal of Computer and System Sciences
Bounded-hops power assignment in ad hoc wireless networks
Discrete Applied Mathematics - Special issue: 2nd cologne/twente workshop on graphs and combinatorial optimization (CTW 2003)
A formal model for information selection in multi-sentence text extraction
COLING '04 Proceedings of the 20th international conference on Computational Linguistics
Partially ordered knapsack and applications to scheduling
Discrete Applied Mathematics
A unified approach to approximating partial covering problems
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
On complexity of optimal recombination for binary representations of solutions
Evolutionary Computation
Computing Phylogenetic Diversity for Split Systems
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Nature Reserve Selection Problem: A Tight Approximation Algorithm
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Message-efficient dissemination for loop-free centralized routing
ACM SIGCOMM Computer Communication Review
Convex Combination Approximation for the Min-Cost WSN Point Coverage Problem
WASA '08 Proceedings of the Third International Conference on Wireless Algorithms, Systems, and Applications
A note on the Greedy algorithm for finding independent sets of Ck-free graphs
Information Processing Letters
A framework for identifying textual redundancy
COLING '08 Proceedings of the 22nd International Conference on Computational Linguistics - Volume 1
A scalable global model for summarization
ILP '09 Proceedings of the Workshop on Integer Linear Programming for Natural Langauge Processing
Sniffer Channel Selection for Monitoring Wireless LANs
WASA '09 Proceedings of the 4th International Conference on Wireless Algorithms, Systems, and Applications
Multi-document summarisation using generic relation extraction
EMNLP '09 Proceedings of the 2009 Conference on Empirical Methods in Natural Language Processing: Volume 1 - Volume 1
Bounded-hops power assignment in ad hoc wireless networks
Discrete Applied Mathematics - Special issue: 2nd cologne/twente workshop on graphs and combinatorial optimization (CTW 2003)
Robust Detection of Unauthorized Wireless Access Points
Mobile Networks and Applications
Dynamic programming based algorithms for set multicover and multiset multicover problems
Theoretical Computer Science
Detecting disease-specific dysregulated pathways via analysis of clinical expression profiles
RECOMB'08 Proceedings of the 12th annual international conference on Research in computational molecular biology
Partial information spreading with application to distributed maximum coverage
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Scalable target coverage in smart camera networks
Proceedings of the Fourth ACM/IEEE International Conference on Distributed Smart Cameras
Memory-efficient A*-search using sparse embeddings
Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
On the approximability of the vertex cover and related problems
AAIM'10 Proceedings of the 6th international conference on Algorithmic aspects in information and management
PTAS for weighted set cover on unit squares
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
A Partial Set Covering Model for Protein Mixture Identification Using Mass Spectrometry Data
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
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
On coverage issues in directional sensor networks: A survey
Ad Hoc Networks
Near approximation of maximum weight matching through efficient weight reduction
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Efficient methods for finding influential locations with adaptive grids
Proceedings of the 20th ACM international conference on Information and knowledge management
Strong and weak edges of a graph and linkages with the vertex cover problem
Discrete Applied Mathematics
Weighted capacitated, priority, and geometric set cover via improved quasi-uniform sampling
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
How to place efficiently guards and paintings in an art gallery
PCI'05 Proceedings of the 10th Panhellenic conference on Advances in Informatics
Comment spam detection by sequence mining
Proceedings of the fifth ACM international conference on Web search and data mining
On the computational complexity of minimal-change integrity maintenance in relational databases
Inconsistency Tolerance
Optimal base station placement: a stochastic method using interference gradient in downlink case
Proceedings of the 5th International ICST Conference on Performance Evaluation Methodologies and Tools
Edge-Connectivity augmentation and network matrices
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Covering analysis of the greedy algorithm for partial cover
Algorithms and Applications
Towards benefit-based RDF source selection for SPARQL queries
SWIM '12 Proceedings of the 4th International Workshop on Semantic Web Information Management
Improved approximation of maximum vertex cover
Operations Research Letters
An edge-reduction algorithm for the vertex cover problem
Operations Research Letters
Sniffer channel selection for monitoring wireless LANs
Computer Communications
Multiple aspect summarization using integer linear programming
EMNLP-CoNLL '12 Proceedings of the 2012 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning
Winding roads: routing edges into bundles
EuroVis'10 Proceedings of the 12th Eurographics / IEEE - VGTC conference on Visualization
ACM Transactions on Algorithms (TALG)
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
Coverage algorithms for visual sensor networks
ACM Transactions on Sensor Networks (TOSN)
On the k-edge-incident subgraph problem and its variants
Discrete Applied Mathematics
The maximum vertex coverage problem on bipartite graphs
Discrete Applied Mathematics
| Hi-index | 0.00 |