| 2025 | CIAC | Unit Refutations in Horn Constraint Systems. | Piotr Wojciechowski, K. Subramani |
| 2025 | FAW | From MAXCUT to MAXNAESAT: Elegant Proofs and Algorithmic Advances. | Sangram K. Jena, K. Subramani |
| 2025 | JELIA | Finding Short Tree-Like Unit Refutations in UTVPI Constraint Systems. | Piotr Wojciechowski, K. Subramani |
| 2025 | WALCOM | Dag-Like Unit Refutations in UTVPI Constraint Systems. | Piotr Wojciechowski, K. Subramani |
| 2024 | ISAIM | A Differential Approach for Several NP-hard Optimization Problems. | Sangram Kishor Jena, K. Subramani, Alvaro Velasquez |
| 2024 | ISAIM | On the Computational Complexities of Finding Selected Refutations of Linear Programs. | K. Subramani, Piotr Wojciechowski |
| 2024 | LOPSTR | A Certifying Algorithm for Linear (and Integer) Feasibility in Horn Constraint Systems. | Piotr Wojciechowski, K. Subramani |
| 2023 | COCOA | Differentiable Discrete Optimization Using Dataless Neural Networks. | Sangram Kishor Jena, K. Subramani, Alvaro Velasquez |
| 2023 | COCOA | Parameterized and Exact-Exponential Algorithms for the Read-Once Integer Refutation Problem in UTVPI Constraints. | K. Subramani, Piotr Wojciechowski |
| 2023 | ECAI | Unit Refutations of Difference Constraint Systems. | K. Subramani, Piotr Wojciechowski |
| 2023 | FM | The Octatope Abstract Domain for Verification of Neural Networks. | Stanley Bak, Taylor Dohmen, K. Subramani, Ashutosh Trivedi, Alvaro Velasquez, Piotr Wojciechowski |
| 2023 | SOFSEM | A Faster Algorithm for Determining the Linear Feasibility of Systems of BTVPI Constraints. | Piotr Wojciechowski, K. Subramani |
| 2022 | CPAIOR | Analyzing the Reachability Problem in Choice Networks. | Piotr Wojciechowski, K. Subramani, Alvaro Velasquez |
| 2022 | LFCS | Exact and Parameterized Algorithms for Read-Once Refutations in Horn Constraint Systems. | K. Subramani, Piotr Wojciechowski |
| 2022 | TAMC | Analyzing the 3-path Vertex Cover Problem in Planar Bipartite Graphs. | Sangram Kishor Jena, K. Subramani |
| 2022 | TAMC | On the Parallel Complexity of Constrained Read-Once Refutations in UTVPI Constraint Systems. | K. Subramani, Piotr Wojciechowski |
| 2021 | JELIA | Analyzing Unit Read-Once Refutations in Difference Constraint Systems. | K. Subramani, Piotr Wojciechowski |
| 2021 | LATA | Tree-Like Unit Refutations in Horn Constraint Systems. | K. Subramani, Piotr Wojciechowski |
| 2020 | COCOA | On Unit Read-Once Resolutions and Copy Complexity. | Piotr Wojciechowski, K. Subramani |
| 2020 | ISAIM | Finding read-once refutations in 2CNF formulas and variants - a parameterized perspective. | K. Subramani, Piotr Wojciechowski |
| 2020 | IWOCA | Parameterized Algorithms for Partial Vertex Covers in Bipartite Graphs. | Vahan Mkrtchyan, Garik Petrosyan, K. Subramani, Piotr Wojciechowski |
| 2019 | FAW | Read-Once Resolutions in Horn Formulas. | Hans Kleine Bning, Piotr Wojciechowski, K. Subramani |
| 2019 | IWOCA | Disjoint Clustering in Combinatorial Circuits. | Zola Donovan, K. Subramani, Vahan Mkrtchyan |
| 2019 | TAMC | Read-Once Certification of Linear Infeasibility in UTVPI Constraints. | K. Subramani, Piotr Wojciechowski |
| 2018 | AAIM | An Empirical Analysis of Feasibility Checking Algorithms for UTVPI Constraints. | K. Subramani, Piotr Wojciechowski, Zachary Santer, Matthew Anderson |
| 2018 | FAW | Optimal Length Tree-Like Refutations of Linear Feasibility in UTVPI Constraints. | Piotr Wojciechowski, K. Subramani, Matthew D. Williamson |
| 2017 | CP | Analyzing Lattice Point Feasibility in UTVPI Constraints. | K. Subramani, Piotr Wojciechowski |
| 2017 | CSR | On a Generalization of Horn Constraint Systems. | Piotr Wojciechowski, Ramaswamy Chandrasekaran, K. Subramani |
| 2017 | SOFSEM | The Approximability of Partial Vertex Covers in Trees. | Vahan Mkrtchyan, Ojas Parekh, Danny Segev, K. Subramani |
| 2017 | TAMC | On the Computational Complexity of Read once Resolution Decidability in 2CNF Formulas. | Hans Kleine Bning, Piotr Wojciechowski, K. Subramani |
| 2016 | ISAIM | On the computational complexities of Quantified Integer Programming variants. | Piotr Wojciechowski, K. Subramani, Pavlos Eirinakis |
| 2016 | IWOCA | A Bit-Scaling Algorithm for Integer Feasibility in UTVPI Constraints. | K. Subramani, Piotr Wojciechowski |
| 2016 | LATA | Compositional Bisimulation Minimization for Interval Markov Decision Processes. | Vahid Hashemi, Holger Hermanns, Lei Song, K. Subramani, Andrea Turrini, Piotr Wojciechowski |
| 2016 | NCA | The cardinality-constrained paths problem: Multicast data routing in heterogeneous communication networks. | Alvaro Velasquez, Piotr Wojciechowski, K. Subramani, Steven L. Drager, Sumit Kumar Jha |
| 2016 | WALCOM | An Optimal Algorithm for Computing the Integer Closure of UTVPI Constraints. | K. Subramani, Piotr Wojciechowski |
| 2015 | COCOA | On Clustering Without Replication in Combinatorial Circuits. | Zola Donovan, Vahan Mkrtchyan, K. Subramani |
| 2015 | ICTAC | A Graphical Theorem of the Alternative for UTVPI Constraints. | K. Subramani, Piotr Wojciechowski |
| 2014 | ISAIM | Variants of Quantified Linear Programming and Quantified Linear Implication. | Piotr Wojciechowski, Pavlos Eirinakis, K. Subramani |
| 2012 | ISAIM | Computational complexity of inclusion queries over polyhedral sets. | Pavlos Eirinakis, Salvatore Ruggieri, K. Subramani, Piotr Wojciechowski |
| 2011 | CPAIOR | A New Algorithm for Linear and Integer Feasibility in Horn Constraints. | K. Subramani, James Worthington |
| 2009 | COCOA | Two-Level Heaps: A New Priority Queue Structure with Applications to the Single Source Shortest Path Problem. | K. Subramani, Kamesh Madduri |
| 2009 | FAW | Improved Algorithms for Detecting Negative Cost Cycles in Undirected Graphs. | Xiaofeng Gu, Kamesh Madduri, K. Subramani, Hong-Jian Lai |
| 2009 | ISAAC | A Combinatorial Algorithm for Horn Programs. | R. Chandrasekaran, K. Subramani |
| 2008 | FAW | Absorbing Random Walks and the NAE2SAT Problem. | K. Subramani |
| 2007 | HiPC | Accomplishing Approximate FCFS Fairness Without Queues. | K. Subramani, Kamesh Madduri |
| 2007 | ICTAC | A Randomized Algorithm for BBCSPs in the Prover-Verifier Model. | K. Subramani |
| 2006 | TAMC | Analyzing Chain Programs over Difference Constraints. | K. Subramani, John Argentieri |
| 2006 | VMCAI | Totally Clairvoyant Scheduling with Relative Timing Constraints. | K. Subramani |
| 2005 | ICCS | On the Empirical Efficiency of the Vertex Contraction Algorithm for Detecting Negative Cost Cyles in Networks. | K. Subramani, Dejan Desovski |
| 2004 | CADE | Analyzing Selected Quantified Integer Programs. | K. Subramani |
| 2004 | HiPC | A Shared Memory Dispatching Approach for Partially Clairvoyant Schedulers. | K. Subramani, Kiran Yellajyosula |
| 2004 | TACAS | Resource-Optimal Scheduling Using Priced Timed Automata. | Jacob Illum Rasmussen, Kim Guldstrand Larsen, K. Subramani |
| 2003 | ICCS | Contraction versus Relaxation: A Comparison of Two Approaches for the Negative Cost Cycle Detection Problem. | K. Subramani, Lisa Kovalchick |
| 2003 | SAT | On Boolean Models for Quantified Boolean Horn Formulas. | Hans Kleine Bning, K. Subramani, Xishun Zhao |
| 2002 | AISC | On Identifying Simple and Quantified Lattice Points in the 2SAT Polytope. | K. Subramani |
| 2002 | SOFSEM | A Specification Framework for Real-Time Scheduling. | K. Subramani |
| 2002 | TACAS | An Analysis of Zero-Clairvoyant Scheduling. | K. Subramani |
| 2001 | COCOON | Parametric Scheduling for Network Constraints. | K. Subramani |
| 2001 | HiPC | Parametric Scheduling - Algorithms and Complexity. | K. Subramani |