29 results
Search Results
2. Discovering Small Target Sets in Social Networks: A Fast and Effective Algorithm
3. Dispersing Obnoxious Facilities on a Graph
4. Local Embeddings of Metric Spaces
5. Covering Uncertain Points in a Tree
6. Dynamic Averaging Load Balancing on Cycles
7. Restricted and Swap Common Superstring: A Multivariate Algorithmic Perspective
8. Practical and Efficient Circle Graph Recognition
9. Practical and Efficient Split Decomposition via Graph-Labelled Trees
10. FlipCut Supertrees: Towards Matrix Representation Accuracy in Polynomial Time
11. Algorithms for Partition of Some Class of Graphs under Compaction and Vertex-Compaction
12. Fast Compatibility Testing for Rooted Phylogenetic Trees
13. From Discrepancy to Majority
14. A Grouping Approach for Succinct Dynamic Dictionary Matching
15. Computing the Visibility Polygon of an Island in a Polygonal Domain
16. A Simple Algorithm for Higher-Order Delaunay Mosaics and Alpha Shapes
17. Model Counting for CNF Formulas of Bounded Modular Treewidth
18. PTAS for Densest k -Subgraph in Interval Graphs
19. An Improved Approximation Algorithm for the Minimum Cost Subset k-Connected Subgraph Problem
20. Computing H-Joins with Application to 2-Modular Decomposition
21. Better Size Estimation for Sparse Matrix Products
22. Deterministic Discrepancy Minimization
23. Walking Through Waypoints
24. 3 XOR , Triangles
25. A General Method for Estimating Correlated Aggregates Over a Data Stream
26. On the Computational Complexity of Measuring Global Stability of Banking Networks
27. A Model for Minimizing Active Processor Time
28. A Generalization of the Convex Kakeya Problem
29. The Complexity of the Empire Colouring Problem
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.