64 results on '"Subramani, K"'
Search Results
2. On Partial Vertex Cover and Budgeted Maximum Coverage Problems in Bipartite Graphs
3. A Polynomial-Time Algorithm for the Planar Quantified Integer Programming Problem
4. Algorithmic Aspects of Risk Management
5. A New Algorithm for Linear and Integer Feasibility in Horn Constraints
6. A Combinatorial Algorithm for Horn Programs
7. Improved Algorithms for Detecting Negative Cost Cycles in Undirected Graphs
8. Two-Level Heaps: A New Priority Queue Structure with Applications to the Single Source Shortest Path Problem
9. Absorbing Random Walks and the NAE2SAT Problem
10. Accomplishing Approximate FCFS Fairness Without Queues
11. A Randomized Algorithm for BBCSPs in the Prover-Verifier Model
12. Analyzing Chain Programs over Difference Constraints
13. Totally Clairvoyant Scheduling with Relative Timing Constraints
14. In vitro evaluation of osteoblast responses to carbon nanotube-coated titanium surfaces
15. On the Empirical Efficiency of the Vertex Contraction Algorithm for Detecting Negative Cost Cyles in Networks
16. Stressing is Better Than Relaxing for Negative Cost Cycle Detection in Networks
17. A New Verification Procedure for Partially Clairvoyant Scheduling
18. Zero-Clairvoyant Scheduling with Inter-period Constraints
19. A Shared Memory Dispatching Approach for Partially Clairvoyant Schedulers
20. Analyzing Selected Quantified Integer Programs
21. Resource-Optimal Scheduling Using Priced Timed Automata
22. On Boolean Models for Quantified Boolean Horn Formulas
23. On Clausal Equivalence and Hull Inclusion
24. An Analysis of Quantified Linear Programs
25. Contraction versus Relaxation: A Comparison of Two Approaches for the Negative Cost Cycle Detection Problem
26. An Analysis of Zero-Clairvoyant Scheduling
27. On Identifying Simple and Quantified Lattice Points in the 2SAT Polytope
28. On Determining the Minimum Length, Tree-Like Resolution Refutation of 2SAT, and Extended 2SAT Formulas
29. A Specification Framework for Real-Time Scheduling
30. Parametric Scheduling — Algorithms and Complexity
31. Parametric Scheduling for Network Constraints
32. A Dual Interpretation of 'Standard Constraints' in Parametric Scheduling
33. The Complexity of Finding Read-Once NAE-Resolution Refutations
34. On Partial Vertex Cover and Budgeted Maximum Coverage Problems in Bipartite Graphs
35. Algorithmic Aspects of Risk Management
36. A New Algorithm for Linear and Integer Feasibility in Horn Constraints
37. Ab initio Molecular orbital and density functional studies on the ring-opening reaction of oxetene
38. Two-Level Heaps: A New Priority Queue Structure with Applications to the Single Source Shortest Path Problem
39. Improved Algorithms for Detecting Negative Cost Cycles in Undirected Graphs
40. A Combinatorial Algorithm for Horn Programs
41. Stressing is Better Than Relaxing for Negative Cost Cycle Detection in Networks
42. Totally Clairvoyant Scheduling with Relative Timing Constraints
43. Resource-Optimal Scheduling Using Priced Timed Automata
44. Analyzing Selected Quantified Integer Programs
45. A Shared Memory Dispatching Approach for Partially Clairvoyant Schedulers
46. On Boolean Models for Quantified Boolean Horn Formulas
47. Zero-Clairvoyant Scheduling with Inter-period Constraints
48. An Analysis of Quantified Linear Programs
49. A Specification Framework for Real-Time Scheduling
50. On Determining the Minimum Length, Tree-Like Resolution Refutation of 2SAT, and Extended 2SAT Formulas
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.