Primal-dual schema based approximation algorithms
Theoretical aspects of computer science
Minimum vertex cover in rectangle graphs
Computational Geometry: Theory and Applications
Distributing data for secure database services
Proceedings of the 4th International Workshop on Privacy and Anonymity in the Information Society
Restricted common superstring and restricted common supersequence
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
Complexity of total {k}-domination and related problems
FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
Low-power gated bus synthesis for 3d ic via rectilinear shortest-path steiner graph
Proceedings of the 2012 ACM international symposium on International Symposium on Physical Design
The steiner tree reoptimization problem with sharpened triangle inequality
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
On the complexity of the regenerator cost problem in general networks with traffic grooming
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
Recommending source code for use in rapid software prototypes
Proceedings of the 34th International Conference on Software Engineering
Capacitated team formation problem on social networks
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
Product-state approximations to quantum ground states
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Content coverage maximization on word networks for hierarchical topic summarization
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Optimality Bounds for a Variational Relaxation of the Image Partitioning Problem
Journal of Mathematical Imaging and Vision
| Hi-index | 0.00 |
Covering the basic techniques used in the latest research work, the author consolidates progress made so far, including some very recent and promising results, and conveys the beauty and excitement of work in the field. He gives clear, lucid explanations of key results and ideas, with intuitive proofs, and provides critical examples and numerous illustrations to help elucidate the algorithms. Many of the results presented have been simplified and new insights provided. Of interest to theoretical computer scientists, operations researchers, and discrete mathematicians.