ACM SIGACT News
Exploiting structure in quantified formulas
Journal of Algorithms
On the Euclidean 3-matching problem
Nordic Journal of Computing
Some geometric clustering problems
Nordic Journal of Computing
Complexity of domination-type problems in graphs
Nordic Journal of Computing
A 27/26-Approximation Algorithm for the Chromatic Sum Coloring of Bipartite Graphs
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
Perfect edge domination and efficient edge domination in graphs
Discrete Applied Mathematics
The complexity of non-hierarchical clustering with instance and cluster level constraints
Data Mining and Knowledge Discovery
Cooperative mobile guards in grids
Computational Geometry: Theory and Applications
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
Local search study of honeycomb clustering problem for cellular planning
International Journal of Mobile Network Design and Innovation
The Pk Partition Problem and Related Problems in Bipartite Graphs
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
On Protein Structure Alignment under Distance Constraint
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Covering a Graph with a Constrained Forest (Extended Abstract)
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Planarity, Determinants, Permanents, and (Unique) Matchings
ACM Transactions on Computation Theory (TOCT)
Optimal placement of ad-hoc devices under a VCG-style routing protocol
ALGOSENSORS'07 Proceedings of the 3rd international conference on Algorithmic aspects of wireless sensor networks
On protein structure alignment under distance constraint
Theoretical Computer Science
Complexity and approximation of the Constrained Forest problem
Theoretical Computer Science
Weakly cooperative guards in grids
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and its Applications - Volume Part I
Parallel processing subsystems with redundancy in a distributed environment
PPAM'05 Proceedings of the 6th international conference on Parallel Processing and Applied Mathematics
On weighted efficient total domination
Journal of Discrete Algorithms
Fault tolerant guarding of grids
ICCSA'06 Proceedings of the 6th international conference on Computational Science and Its Applications - Volume Part I
Efficient total domination in digraphs
Journal of Discrete Algorithms
The path partition problem and related problems in bipartite graphs
Operations Research Letters
Approximability results for the maximum and minimum maximal induced matching problems
Discrete Optimization
Information Processing Letters
Planarity, determinants, permanents, and (unique) matchings
CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications
| Hi-index | 0.01 |