Search

Your search keyword '"Subramani, K"' showing total 75 results

Search Constraints

Start Over You searched for: Author "Subramani, K" Remove constraint Author: "Subramani, K" Database Springer Nature eBooks Remove constraint Database: Springer Nature eBooks
75 results on '"Subramani, K"'

Search Results

2. On the Computational Complexities of Finding Selected Refutations of Linear Programs

3. A Differential Approach for Several NP-hard Optimization Problems

5. Differentiable Discrete Optimization Using Dataless Neural Networks

6. New Results in Priority-Based Bin Packing

7. The Octatope Abstract Domain for Verification of Neural Networks

8. Optimal Length Cutting Plane Refutations of Integer Programs

11. Analyzing the 3-path Vertex Cover Problem in Planar Bipartite Graphs

12. Analyzing the Reachability Problem in Choice Networks

13. On the Approximability of Path and Cycle Problems in Arc-Dependent Networks

15. New Results on Test-Cost Minimization in Database Migration

16. On the Copy Complexity of Width 3 Horn Constraint Systems

17. Analyzing Unit Read-Once Refutations in Difference Constraint Systems

18. Tree-Like Unit Refutations in Horn Constraint Systems

19. Algorithmic Analysis of Priority-Based Bin Packing

20. On Unit Read-Once Resolutions and Copy Complexity

21. Security-Aware Database Migration Planning

22. On Finding Shortest Paths in Arc-Dependent Networks

23. Parameterized Algorithms for Partial Vertex Covers in Bipartite Graphs

26. A Graphical Analysis of Integer Infeasibility in UTVPI Constraints

27. Restricted Cutting Plane Proofs in Horn Constraint Systems

28. Disjoint Clustering in Combinatorial Circuits

29. Minimization of Testing Costs in Capacity-Constrained Database Migration

30. Read-Once Resolutions in Horn Formulas

31. Read-Once Certification of Linear Infeasibility in UTVPI Constraints

32. Finding Minimum Stopping and Trapping Sets: An Integer Linear Programming Approach

33. Optimal Length Tree-Like Refutations of Linear Feasibility in UTVPI Constraints

34. A Fully Polynomial Time Approximation Scheme for Refutations in Weighted Difference Constraint Systems

35. An Empirical Analysis of Feasibility Checking Algorithms for UTVPI Constraints

36. The Complexity of Finding Read-Once NAE-Resolution Refutations

37. Analyzing Lattice Point Feasibility in UTVPI Constraints

38. On a Generalization of Horn Constraint Systems

39. On the Computational Complexity of Read once Resolution Decidability in 2CNF Formulas

40. The Approximability of Partial Vertex Covers in Trees

41. A Bit-Scaling Algorithm for Integer Feasibility in UTVPI Constraints

42. An Optimal Algorithm for Computing the Integer Closure of UTVPI Constraints

43. Compositional Bisimulation Minimization for Interval Markov Decision Processes

44. On Clustering Without Replication in Combinatorial Circuits

45. A Graphical Theorem of the Alternative for UTVPI Constraints

46. On Partial Vertex Cover and Budgeted Maximum Coverage Problems in Bipartite Graphs

48. Algorithmic Aspects of Risk Management

49. A New Algorithm for Linear and Integer Feasibility in Horn Constraints

50. A Combinatorial Algorithm for Horn Programs

Catalog

Books, media, physical & digital resources