46 results on '"Subramani, K"'
Search Results
2. Differentiable Discrete Optimization Using Dataless Neural Networks
3. New Results in Priority-Based Bin Packing
4. Optimal Length Cutting Plane Refutations of Integer Programs
5. The Octatope Abstract Domain for Verification of Neural Networks
6. On the Approximability of Path and Cycle Problems in Arc-Dependent Networks
7. Analyzing the Reachability Problem in Choice Networks
8. Exact and Parameterized Algorithms for Read-Once Refutations in Horn Constraint Systems
9. Tree-Like Unit Refutations in Horn Constraint Systems
10. On the Copy Complexity of Width 3 Horn Constraint Systems
11. Algorithmic Analysis of Priority-Based Bin Packing
12. Analyzing Unit Read-Once Refutations in Difference Constraint Systems
13. On Unit Read-Once Resolutions and Copy Complexity
14. Security-Aware Database Migration Planning
15. Restricted Cutting Plane Proofs in Horn Constraint Systems
16. Read-Once Resolutions in Horn Formulas
17. Minimization of Testing Costs in Capacity-Constrained Database Migration
18. A Fully Polynomial Time Approximation Scheme for Refutations in Weighted Difference Constraint Systems
19. An Empirical Analysis of Feasibility Checking Algorithms for UTVPI Constraints
20. Optimal Length Tree-Like Refutations of Linear Feasibility in UTVPI Constraints
21. The Approximability of Partial Vertex Covers in Trees
22. On a Generalization of Horn Constraint Systems
23. The Complexity of Finding Read-Once NAE-Resolution Refutations
24. An Optimal Algorithm for Computing the Integer Closure of UTVPI Constraints
25. Compositional Bisimulation Minimization for Interval Markov Decision Processes
26. On Clustering Without Replication in Combinatorial Circuits
27. A Graphical Theorem of the Alternative for UTVPI Constraints
28. On Partial Vertex Cover and Budgeted Maximum Coverage Problems in Bipartite Graphs
29. Algorithmic Aspects of Risk Management
30. A New Algorithm for Linear and Integer Feasibility in Horn Constraints
31. Two-Level Heaps: A New Priority Queue Structure with Applications to the Single Source Shortest Path Problem
32. Improved Algorithms for Detecting Negative Cost Cycles in Undirected Graphs
33. A Combinatorial Algorithm for Horn Programs
34. Stressing is Better Than Relaxing for Negative Cost Cycle Detection in Networks
35. Resource-Optimal Scheduling Using Priced Timed Automata
36. Analyzing Selected Quantified Integer Programs
37. On Boolean Models for Quantified Boolean Horn Formulas
38. Zero-Clairvoyant Scheduling with Inter-period Constraints
39. An Analysis of Quantified Linear Programs
40. A Specification Framework for Real-Time Scheduling
41. On Determining the Minimum Length, Tree-Like Resolution Refutation of 2SAT, and Extended 2SAT Formulas
42. An Analysis of Zero-Clairvoyant Scheduling
43. Parametric Scheduling — Algorithms and Complexity
44. A Randomized Algorithm for BBCSPs in the Prover-Verifier Model
45. Accomplishing Approximate FCFS Fairness Without Queues
46. Absorbing Random Walks and the NAE2SAT Problem
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.