Efficient recovery from power outage (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Algorithms for facility location problems with outliers
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Latency effects on reachability in large-scale peer-to-peer networks
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
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
Approximation algorithms for clustering to minimize the sum of diameters
Nordic Journal of Computing
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
Approximation Algorithms for Clustering to Minimize the Sum of Diameters
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Budgeted Maximum Graph Coverage
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Finding Essential Attributes from Binary Data
Annals of Mathematics and Artificial Intelligence
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Indexing text data under space constraints
Proceedings of the thirteenth ACM international conference on Information and knowledge management
Optimal File-Bundle Caching Algorithms for Data-Grids
Proceedings of the 2004 ACM/IEEE conference on Supercomputing
Approximation algorithms for combinatorial auctions with complement-free bidders
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Combination can be hard: approximability of the unique coverage problem
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
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)
Cut problems in graphs with a budget constraint
Journal of Discrete Algorithms
Cost-effective outbreak detection in networks
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
Maximizing influence in a competitive social network: a follower's perspective
Proceedings of the ninth international conference on Electronic commerce
Approximating geometric coverage problems
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Nature Reserve Selection Problem: A Tight Approximation Algorithm
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Near-optimal dynamic replication in unstructured peer-to-peer networks
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Optimizing query rewrites for keyword-based advertising
Proceedings of the 9th ACM conference on Electronic commerce
Learning diverse rankings with multi-armed bandits
Proceedings of the 25th international conference on Machine learning
Predicting diverse subsets using structural SVMs
Proceedings of the 25th international conference on Machine learning
Automatic synthesis of clock gating logic with controlled netlist perturbation
Proceedings of the 45th annual Design Automation Conference
The Generalized Maximum Coverage Problem
Information Processing Letters
Bicriteria Approximation Tradeoff for the Node-Cost Budget Problem
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Maximizing submodular set functions subject to multiple linear constraints
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Bicriteria approximation tradeoff for the node-cost budget problem
ACM Transactions on Algorithms (TALG)
Information Processing Letters
Enhancing diversity, coverage and balance for summarization through structure learning
Proceedings of the 18th international conference on World wide web
On approximating four covering and packing problems
Journal of Computer and System Sciences
Turning down the noise in the blogosphere
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
Using Context Annotated Mobility Profiles to Recruit Data Collectors in Participatory Sensing
LoCA '09 Proceedings of the 4th International Symposium on Location and Context Awareness
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
Optimal Interdiction of Unreactive Markovian Evaders
CPAIOR '09 Proceedings of the 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Predicting structured objects with support vector machines
Communications of the ACM - Scratch Programming for All
Text summarization model based on maximum coverage problem and its variant
EACL '09 Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics
The Budgeted Unique Coverage Problem and Color-Coding
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
Locating network monitors: Complexity, heuristics, and coverage
Computer Communications
Approximate nonmyopic sensor selection via submodularity and partitioning
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
A hybrid grouping genetic algorithm for citywide ubiquitous WiFi access deployment
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
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)
Real-time scheduling with a budget
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Proceedings of the 19th international conference on World wide web
New Optimization Model and Algorithm for Sibling Reconstruction from Genetic Markers
INFORMS Journal on Computing
Approximating minimum-power degree and connectivity problems
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Computational analysis and efficient algorithms for micro and macro OFDMA downlink scheduling
IEEE/ACM Transactions on Networking (TON)
Partial information spreading with application to distributed maximum coverage
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Inferring networks of diffusion and influence
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
Multi-document summarization via budgeted maximization of submodular functions
HLT '10 Human Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics
Efficient temporal keyword search over versioned text
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
Learning to generate summary as structured output
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
Citation summarization through keyphrase extraction
COLING '10 Proceedings of the 23rd International Conference on Computational Linguistics
Submodular secretary problem and extensions
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
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
Information Processing Letters
Approximation and hardness results for label cut and related problems
Journal of Combinatorial Optimization
Constrained non-monotone submodular maximization: offline and secretary algorithms
WINE'10 Proceedings of the 6th international conference on Internet and network economics
Data integration with dependent sources
Proceedings of the 14th International Conference on Extending Database Technology
Video summarization via transferrable structured learning
Proceedings of the 20th international conference on World wide web
Maximum betweenness centrality: approximability and tractable cases
WALCOM'11 Proceedings of the 5th international conference on WALCOM: algorithms and computation
Video distribution under multiple constraints
Theoretical Computer Science
Application-specific signatures for transactional memory in soft processors
ACM Transactions on Reconfigurable Technology and Systems (TRETS)
A class of submodular functions for document summarization
HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies - Volume 1
HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies: short papers - Volume 2
SCENE: a scalable two-stage personalized news recommendation system
Proceedings of the 34th international ACM SIGIR conference on Research and development in Information Retrieval
MSSF: a multi-document summarization framework based on submodularity
Proceedings of the 34th international ACM SIGIR conference on Research and development in Information Retrieval
Socially-aware gateway-based content sharing and backup
Proceedings of the 2nd ACM SIGCOMM workshop on Home networks
Predictive client-side profiles for personalized advertising
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
Beyond keyword search: discovering relevant scientific literature
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
An information theoretic framework for data mining
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
Querying shortest path distance with bounded errors in large graphs
SSDBM'11 Proceedings of the 23rd international conference on Scientific and statistical database management
Maximum entropy models and subjective interestingness: an application to tiles in binary databases
Data Mining and Knowledge Discovery
Aggregated search result diversification
ICTIR'11 Proceedings of the Third international conference on Advances in information retrieval theory
Selection of the most suitable measurement path for router abnormality detection
CSCS '11 Proceedings of the 2nd international conference on Circuits, systems, control, signals
Inferring Networks of Diffusion and Influence
ACM Transactions on Knowledge Discovery from Data (TKDD)
Connecting Two (or Less) Dots: Discovering Structure in News Articles
ACM Transactions on Knowledge Discovery from Data (TKDD)
A maximum profit coverage algorithm with application to small molecules cluster identification
WEA'06 Proceedings of the 5th international conference on Experimental Algorithms
FUSE: a system for data-driven multi-level functional summarization of protein interaction networks
Proceedings of the 2nd ACM SIGHIT International Health Informatics Symposium
Query planning in the presence of overlapping sources
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
Proceedings of the fifth ACM international conference on Web search and data mining
Application-specific signatures for transactional memory in soft processors
ARC'10 Proceedings of the 6th international conference on Reconfigurable Computing: architectures, Tools and Applications
Randomized rounding for routing and covering problems: experiments and improvements
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
On the approximability of budget feasible mechanisms
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Approximation algorithms and hardness results for labeled connectivity problems
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Fuse: towards multi-level functional summarization of protein interaction networks
Proceedings of the 2nd ACM Conference on Bioinformatics, Computational Biology and Biomedicine
Recruitment framework for participatory sensing data collections
Pervasive'10 Proceedings of the 8th international conference on Pervasive Computing
Coping with interference: from maximum coverage to planning cellular networks
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
The 1-neighbour knapsack problem
IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
Cut problems in graphs with a budget constraint
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Collaborative calibration and sensor placement for mobile sensor networks
Proceedings of the 11th international conference on Information Processing in Sensor Networks
Using concept-level random walk model and global inference algorithm for answer summarization
AIRS'11 Proceedings of the 7th Asia conference on Information Retrieval Technology
Optimization with demand oracles
Proceedings of the 13th ACM Conference on Electronic Commerce
Learning on a budget: posted price mechanisms for online procurement
Proceedings of the 13th ACM Conference on Electronic Commerce
TreeMatrix: A Hybrid Visualization of Compound Graphs
Computer Graphics Forum
A two-phase greedy algorithm to locate and allocate hubs for fixed-wireless broadband access
Operations Research Letters
A note on maximizing a submodular set function subject to a knapsack constraint
Operations Research Letters
Personalized news recommendation: a review and an experimental investigation
Journal of Computer Science and Technology - Special issue on Community Analysis and Information Recommendation
On the inapproximability of maximum intersection problems
Information Processing Letters
Sensor allocation in diverse environments
Wireless Networks
Maximizing a Monotone Submodular Function Subject to a Matroid Constraint
SIAM Journal on Computing
Distributed content backup and sharing using social information
IFIP'12 Proceedings of the 11th international IFIP TC 6 conference on Networking - Volume Part I
Efficient submodular function maximization under linear packing constraints
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
The knapsack problem with neighbour constraints
Journal of Discrete Algorithms
Large-margin learning of submodular summarization models
EACL '12 Proceedings of the 13th Conference of the European Chapter of the Association for Computational Linguistics
Multi-document summarization via submodularity
Applied Intelligence
Coverage-based search result diversification
Information Retrieval
On approximation of bookmark assignments
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Temporal corpus summarization using submodular word coverage
Proceedings of the 21st ACM international conference on Information and knowledge management
Ontology-enriched multi-document summarization in disaster management using submodular function
Information Sciences: an International Journal
IDA'12 Proceedings of the 11th international conference on Advances in Intelligent Data Analysis
Efficient location-based decision-supporting content distribution to mobile groups
IEEE/ACM Transactions on Networking (TON)
PENETRATE: Personalized news recommendation using ensemble hierarchical clustering
Expert Systems with Applications: An International Journal
Document selection for tiered indexing in commerce search
Proceedings of the sixth ACM international conference on Web search and data mining
Towards more efficient infection and fire fighting
CATS '11 Proceedings of the Seventeenth Computing: The Australasian Theory Symposium - Volume 119
Towards more efficient infection and fire fighting
CATS 2011 Proceedings of the Seventeenth Computing on The Australasian Theory Symposium - Volume 119
iHR: an online recruiting system for Xiamen Talent Service Center
Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining
MINT: maximizing information propagation in predictable delay-tolerant network
Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing
Submodular secretary problem and extensions
ACM Transactions on Algorithms (TALG)
Fast image/video collection summarization with local clustering
Proceedings of the 21st ACM international conference on Multimedia
Using micro-reviews to select an efficient set of reviews
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Topic diversity in tag recommendation
Proceedings of the 7th ACM conference on Recommender systems
Reducing uncertainty of schema matching via crowdsourcing
Proceedings of the VLDB Endowment
A note on the Clustered Set Covering Problem
Discrete Applied Mathematics
An iterated-tabu-search heuristic for a variant of the partial set covering problem
Journal of Heuristics
| Hi-index | 0.89 |