K. Subramani

ORCID

Publication Activity (10 Years)

Years Active: 2000-2024
Publications (10 Years): 81

Top Venues

Theor. Comput. Sci.

Ann. Math. Artif. Intell.

CALDAM

Algorithmica

Publications

Piotr Wojciechowski, K. Subramani, Alvaro Velasquez, Bugra Çaskurlu
Priority-based bin packing with subset constraints. Discret. Appl. Math. 342 (2024)
K. Subramani, Piotr Wojciechowski
Unit Read-once Refutations for Systems of Difference Constraints. Theory Comput. Syst. 67 (4) (2023)
Piotr Wojciechowski, K. Subramani
A Faster Algorithm for Determining the Linear Feasibility of Systems of BTVPI Constraints. SOFSEM (2023)
K. Subramani, Piotr Wojciechowski
Unit Refutations of Difference Constraint Systems. ECAI (2023)
K. Subramani, Piotr J. Wojciechowski
Integer Feasibility and Refutations in UTVPI Constraints Using Bit-Scaling. Algorithmica 85 (2) (2023)
Alvaro Velasquez, K. Subramani, Piotr Wojciechowski
Reachability problems in interval-constrained and cardinality-constrained graphs. Discret. Math. Algorithms Appl. 15 (4) (2023)
Sangram K. Jena, K. Subramani, Alvaro Velasquez
Differentiable Discrete Optimization Using Dataless Neural Networks. COCOA (2) (2023)
Utku Umur Acikalin, Bugra Çaskurlu, K. Subramani
Security-Aware Database Migration Planning. Constraints An Int. J. 28 (3) (2023)
K. Subramani, Piotr Wojciechowski
Optimal length cutting plane refutations of integer programs. Discret. Optim. 50 (2023)
Piotr Wojciechowski, K. Subramani, Alvaro Velasquez
Reachability in choice networks. Discret. Optim. 48 (Part 1) (2023)
K. Subramani, Piotr J. Wojciechowski
Parameterized and Exact-Exponential Algorithms for the Read-Once Integer Refutation Problem in UTVPI Constraints. COCOA (2) (2023)
K. Subramani, Piotr Wojciechowski
Optimal Length Cutting Plane Refutations of Integer Programs. CALDAM (2023)
Alvaro Velasquez, Ismail Alkhouri, K. Subramani, Piotr Wojciechowski, George K. Atia
Optimal Deterministic Controller Synthesis from Steady-State Distributions. J. Autom. Reason. 67 (1) (2023)
Stanley Bak, Taylor Dohmen, K. Subramani, Ashutosh Trivedi, Alvaro Velasquez, Piotr Wojciechowski
The Octatope Abstract Domain for Verification of Neural Networks. FM (2023)
Piotr J. Wojciechowski, K. Subramani, Alvaro Velasquez, Matthew D. Williamson
On the Approximability of Path and Cycle Problems in Arc-Dependent Networks. CALDAM (2022)
Piotr Wojciechowski, K. Subramani, Alvaro Velasquez
Analyzing the Reachability Problem in Choice Networks. CPAIOR (2022)
K. Subramani, Piotr Wojciechowski, Ying Sheng
Read-once refutations in Horn constraint systems: an algorithmic approach. J. Log. Comput. 32 (4) (2022)
Alvaro Velasquez, K. Subramani, Piotr Wojciechowski
On the complexity of and solutions to the minimum stopping and trapping set problems. Theor. Comput. Sci. 915 (2022)
K. Subramani, Piotr J. Wojciechowski
On the Parallel Complexity of Constrained Read-Once Refutations in UTVPI Constraint Systems. TAMC (2022)
Piotr Wojciechowski, K. Subramani, R. Chandrasekaran
Analyzing Read-Once Cutting Plane Proofs in Horn Systems. J. Autom. Reason. 66 (2) (2022)
K. Subramani, Piotr Wojciechowski, Alvaro Velasquez
New Results in Priority-Based Bin Packing. ALGOCLOUD (2022)
Piotr Wojciechowski, Matthew D. Williamson, K. Subramani
On the analysis of optimization problems in arc-dependent networks. Discret. Optim. 45 (2022)
Sangram K. Jena, K. Subramani
Analyzing the 3-path Vertex Cover Problem in Planar Bipartite Graphs. TAMC (2022)
K. Subramani, Piotr J. Wojciechowski
Parameterized and exact algorithms for finding a read-once resolution refutation in 2CNF formulas. Ann. Math. Artif. Intell. 90 (1) (2022)
K. Subramani, Piotr J. Wojciechowski
Exact and Parameterized Algorithms for Read-Once Refutations in Horn Constraint Systems. LFCS (2022)
Piotr Wojciechowski, K. Subramani
On the lengths of tree-like and Dag-like cutting plane refutations of Horn constraint systems. Ann. Math. Artif. Intell. 90 (10) (2022)
Piotr J. Wojciechowski, K. Subramani, Matthew D. Williamson
Polynomial time algorithms for optimal length tree-like refutations of linear infeasibility in UTVPI constraints. Discret. Appl. Math. 305 (2021)
Piotr J. Wojciechowski, K. Subramani
Copy complexity of Horn formulas with respect to unit read-once resolution. Theor. Comput. Sci. 890 (2021)
K. Subramani, Piotr J. Wojciechowski
Tree-Like Unit Refutations in Horn Constraint Systems. LATA (2021)
K. Subramani, Piotr J. Wojciechowski
On the parametrized complexity of read-once refutations in UTVPI+ constraint systems. Theor. Comput. Sci. 883 (2021)
Piotr J. Wojciechowski, K. Subramani, Alvaro Velasquez, Bugra Caskurlu
Algorithmic Analysis of Priority-Based Bin Packing. CALDAM (2021)
K. Subramani, Piotr J. Wojciechowski
Analyzing Unit Read-Once Refutations in Difference Constraint Systems. JELIA (2021)
Utku Umur Acikalin, Bugra Caskurlu, Piotr J. Wojciechowski, K. Subramani
New Results on Test-Cost Minimization in Database Migration. ALGOCLOUD (2021)
K. Subramani, Piotr J. Wojciechowski, Alvaro Velasquez
On the Copy Complexity of Width 3 Horn Constraint Systems. FroCoS (2021)
Zola Donovan, K. Subramani, Vahan V. Mkrtchyan
Analyzing Clustering and Partitioning Problems in Selected VLSI Models. Theory Comput. Syst. 64 (7) (2020)
Hans Kleine Büning, Piotr J. Wojciechowski, K. Subramani
NAE-resolution: A new resolution refutation technique to prove not-all-equal unsatisfiability. Math. Struct. Comput. Sci. 30 (7) (2020)
Piotr J. Wojciechowski, R. Chandrasekaran, K. Subramani
Analyzing fractional Horn constraint systems. Theor. Comput. Sci. 844 (2020)
Vahan Mkrtchyan, Garik Petrosyan, K. Subramani, Piotr J. Wojciechowski
Parameterized Algorithms for Partial Vertex Covers in Bipartite Graphs. IWOCA (2020)
K. Subramani, Piotr J. Wojciechowski
On integer closure in a system of unit two variable per inequality constraints. Ann. Math. Artif. Intell. 88 (10) (2020)
K. Subramani, Piotr J. Wojciechowski
Finding read-once refutations in 2CNF formulas and variants - a parameterized perspective. ISAIM (2020)
Piotr J. Wojciechowski, Matthew D. Williamson, K. Subramani
On Finding Shortest Paths in Arc-Dependent Networks. ISCO (2020)
Piotr J. Wojciechowski, K. Subramani
On Unit Read-Once Resolutions and Copy Complexity. COCOA (2020)
K. Subramani, Piotr J. Wojciechowski
A Graphical Analysis of Integer Infeasibility in UTVPI Constraints. AI*IA (2019)
K. Subramani, Piotr J. Wojciechowski
A Polynomial Time Algorithm for Read-Once Certification of Linear Infeasibility in UTVPI Constraints. Algorithmica 81 (7) (2019)
Hans Kleine Büning, Piotr J. Wojciechowski, R. Chandrasekaran, K. Subramani
Restricted Cutting Plane Proofs in Horn Constraint Systems. FroCos (2019)
Matthew Anderson, Matthew D. Williamson, K. Subramani
Empirical analysis of algorithms for the shortest negative cost cycle problem. Discret. Appl. Math. 253 (2019)
K. Subramani, Piotr J. Wojciechowski
Read-Once Certification of Linear Infeasibility in UTVPI Constraints. TAMC (2019)
Hans Kleine Büning, Piotr J. Wojciechowski, K. Subramani
Read-Once Resolutions in Horn Formulas. FAW (2019)
Vahan Mkrtchyan, Garik Petrosyan, K. Subramani
Parameterized algorithms for Partial vertex covers in bipartite graphs. CoRR (2019)
Zola Donovan, K. Subramani, Vahan Mkrtchyan
Disjoint Clustering in Combinatorial Circuits. IWOCA (2019)
Zola Donovan, Gregory Z. Gutin, Vahan Mkrtchyan, K. Subramani
Clustering without replication in combinatorial circuits. J. Comb. Optim. 38 (2) (2019)
K. Subramani, Bugra Caskurlu, Utku Umur Acikalin
Security-Aware Database Migration Planning. ALGOCLOUD (2019)
Hans Kleine Büning, Piotr J. Wojciechowski, K. Subramani
New Results on Cutting Plane Proofs for Horn Constraint Systems. FSTTCS (2019)
Bugra Caskurlu, Matthew D. Williamson, K. Subramani, Vahan Mkrtchyan, Piotr J. Wojciechowski
A Fully Polynomial Time Approximation Scheme for Refutations in Weighted Difference Constraint Systems. CALDAM (2018)
Alvaro Velasquez, K. Subramani, Steven L. Drager
Finding Minimum Stopping and Trapping Sets: An Integer Linear Programming Approach. ISCO (2018)
James B. Orlin, K. Subramani, Piotr J. Wojciechowski
Randomized algorithms for finding the shortest negative cost cycle in networks. Discret. Appl. Math. 236 (2018)
K. Subramani, Piotr J. Wojciechowski
A certifying algorithm for lattice point feasibility in a system of UTVPI constraints. J. Comb. Optim. 35 (2) (2018)
Piotr J. Wojciechowski, K. Subramani, Matthew D. Williamson
Optimal Length Tree-Like Refutations of Linear Feasibility in UTVPI Constraints. FAW (2018)
K. Subramani, Bugra Caskurlu, Alvaro Velasquez
Minimization of Testing Costs in Capacity-Constrained Database Migration. ALGOCLOUD (2018)
Bugra Caskurlu, Matthew D. Williamson, K. Subramani, Vahan Mkrtchyan
On approximating optimal weight "no"-certificates in weighted difference constraint systems. J. Comb. Optim. 36 (2) (2018)
K. Subramani, Piotr J. Wojciechowski, Zachary Santer, Matthew Anderson
An Empirical Analysis of Feasibility Checking Algorithms for UTVPI Constraints. AAIM (2018)
Hans Kleine Büning, Piotr J. Wojciechowski, K. Subramani
Finding read-once resolution refutations in systems of 2CNF clauses. Theor. Comput. Sci. 729 (2018)
Piotr J. Wojciechowski, Pavlos Eirinakis, K. Subramani
Analyzing restricted fragments of the theory of linear arithmetic. Ann. Math. Artif. Intell. 79 (1-3) (2017)
K. Subramani, Piotr J. Wojciechowski
Analyzing Lattice Point Feasibility in UTVPI Constraints. CP (2017)
Hans Kleine Büning, Piotr J. Wojciechowski, K. Subramani
The Complexity of Finding Read-Once NAE-Resolution Refutations. ICLA (2017)
Vahan Mkrtchyan, Ojas Parekh, Danny Segev, K. Subramani
The Approximability of Partial Vertex Covers in Trees. SOFSEM (2017)
Bugra Caskurlu, Vahan Mkrtchyan, Ojas Parekh, K. Subramani
Partial Vertex Cover and Budgeted Maximum Coverage in Bipartite Graphs. SIAM J. Discret. Math. 31 (3) (2017)
Hans Kleine Büning, Piotr J. Wojciechowski, K. Subramani
On the Computational Complexity of Read once Resolution Decidability in 2CNF Formulas. TAMC (2017)
K. Subramani, Piotr J. Wojciechowski
A Combinatorial Certifying Algorithm for Linear Feasibility in UTVPI Constraints. Algorithmica 78 (1) (2017)
Pavlos Eirinakis, Matthew D. Williamson, K. Subramani
On the Shoshan-Zwick Algorithm for the All-Pairs Shortest Path Problem. J. Graph Algorithms Appl. 21 (2) (2017)
Piotr J. Wojciechowski, Pavlos Eirinakis, K. Subramani
Erratum to: Analyzing restricted fragments of the theory of linear arithmetic. Ann. Math. Artif. Intell. 79 (4) (2017)
Piotr J. Wojciechowski, Ramaswamy Chandrasekaran, K. Subramani
On a Generalization of Horn Constraint Systems. CSR (2017)
Piotr J. Wojciechowski, K. Subramani, Pavlos Eirinakis
On the computational complexities of Quantified Integer Programming variants. ISAIM (2016)
Matthew D. Williamson, Pavlos Eirinakis, K. Subramani
Fast Algorithms for the Undirected Negative Cost Cycle Detection Problem. Algorithmica 74 (1) (2016)
K. Subramani, Piotr J. Wojciechowski
A Bit-Scaling Algorithm for Integer Feasibility in UTVPI Constraints. IWOCA (2016)
Matthew D. Williamson, K. Subramani
Corrigendum to "On the negative cost girth problem in planar networks" [Journal of Discrete Algorithms 35 (2015) 40-50]. J. Discrete Algorithms (2016)
Alvaro Velasquez, Piotr J. Wojciechowski, K. Subramani, Steven L. Drager, Sumit Kumar Jha
The cardinality-constrained paths problem: Multicast data routing in heterogeneous communication networks. NCA (2016)
Vahid Hashemi, Holger Hermanns, Lei Song, K. Subramani, Andrea Turrini, Piotr J. Wojciechowski
Compositional Bisimulation Minimization for Interval Markov Decision Processes. LATA (2016)
Hans Kleine Büning, Piotr J. Wojciechowski, K. Subramani
On the computational complexity of read once resolution decidability in 2CNF formulas. CoRR (2016)
Pavlos Eirinakis, Matthew D. Williamson, K. Subramani
On the Shoshan-Zwick Algorithm for the All-Pairs Shortest Path Problem. CoRR (2016)
K. Subramani, Piotr J. Wojciechowski
An Optimal Algorithm for Computing the Integer Closure of UTVPI Constraints. WALCOM (2016)
Matthew D. Williamson, K. Subramani
A new algorithm for the minimum spanning tree verification problem. Comput. Optim. Appl. 61 (1) (2015)
Matthew D. Williamson, K. Subramani
On the negative cost girth problem in planar networks. J. Discrete Algorithms 35 (2015)
K. Subramani, Piotr J. Wojciechowski
A Graphical Theorem of the Alternative for UTVPI Constraints. ICTAC (2015)
Zola Donovan, Vahan Mkrtchyan, K. Subramani
On Clustering Without Replication in Combinatorial Circuits. COCOA (2015)
Matthew D. Williamson, K. Subramani
A Parallel Implementation for the Negative Cost Girth Problem. Int. J. Parallel Program. 43 (2) (2015)
Vahan Mkrtchyan, K. Subramani
On the approximability of the Largest Sphere Rule Ensemble Classification problem. Inf. Process. Lett. 115 (11) (2015)
Natarajan Shankar, K. Subramani, Pavlos Eirinakis
Identifying Negative Cost Cycles in Strongly Polynomial Space. Nord. J. Comput. 15 (2) (2015)
K. Subramani, James Worthington
Feasibility checking in Horn constraint systems through a reduction based approach. Theor. Comput. Sci. 576 (2015)
K. Subramani, James Worthington
On Certifying Instances of Zero-Clairvoyant Scheduling. Comput. J. 57 (1) (2014)
Bugra Caskurlu, Vahan Mkrtchyan, Ojas Parekh, K. Subramani
On Partial Vertex Cover and Budgeted Maximum Coverage Problems in Bipartite Graphs. IFIP TCS (2014)
Pavlos Eirinakis, Salvatore Ruggieri, K. Subramani, Piotr J. Wojciechowski
On quantified linear implications. Ann. Math. Artif. Intell. 71 (4) (2014)
Salvatore Ruggieri, Pavlos Eirinakis, K. Subramani, Piotr J. Wojciechowski
On the complexity of quantified linear systems. Theor. Comput. Sci. 518 (2014)
Zola Donovan, Vahan Mkrtchyan, K. Subramani
Clustering without replication: approximation and inapproximability. CoRR (2014)
Piotr J. Wojciechowski, Pavlos Eirinakis, K. Subramani
Variants of Quantified Linear Programming and Quantified Linear Implication. ISAIM (2014)
Bugra Caskurlu, K. Subramani
On Partial Vertex Cover on Bipartite Graphs and Trees CoRR (2013)
Bugra Caskurlu, Ashish Gehani, Cemal Çagatay Bilgin, K. Subramani
Analytical models for risk-based intrusion response. Comput. Networks 57 (10) (2013)
K. Subramani, Matthew D. Williamson, Xiaofeng Gu
Improved algorithms for optimal length resolution refutation in difference constraint systems. Formal Aspects Comput. 25 (2) (2013)
R. Chandrasekaran, K. Subramani
A combinatorial algorithm for Horn programs. Discret. Optim. 10 (2) (2013)
Z. Liang, K. Subramani, James Worthington
Polynomial time certifying algorithms for the planar quantified integer programming problem. J. Log. Comput. 23 (5) (2013)

K. Subramani.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

K. Subramani