A Dual Interpretation of "Standard Constraints" in Parametric Scheduling. - K. Subramani 001; Ashok K. Agrawala (FTRTFT, 2000)

Parametric Scheduling for Network Constraints. - K. Subramani 001 (COCOON, 2001)

Parametric Scheduling - Algorithms and Complexity. - K. Subramani 001 (HiPC, 2001)

A polyhedral projection procedure for Q2SAT. - K. Subramani 001 (Electron. Notes Discret. Math., 2001)

On Identifying Simple and Quantified Lattice Points in the 2SAT Polytope. - K. Subramani 001 (AISC, 2002)

On Determining the Minimum Length, Tree-Like Resolution Refutation of 2SAT, and Extended 2SAT Formulas. - K. Subramani 001 (ASIAN, 2002)

A Specification Framework for Real-Time Scheduling. - K. Subramani 001 (SOFSEM, 2002)

An Analysis of Zero-Clairvoyant Scheduling. - K. Subramani 001 (TACAS, 2002)

An Analysis of Quantified Linear Programs. - K. Subramani 001 (DMTCS, 2003)

Contraction versus Relaxation: A Comparison of Two Approaches for the Negative Cost Cycle Detection Problem. - K. Subramani 001; Lisa Kovalchick (International Conference on Computational Science, 2003)

On Clausal Equivalence and Hull Inclusion. - K. Subramani 001 (ICTCS, 2003)

On Boolean Models for Quantified Boolean Horn Formulas. - Hans Kleine Büning; K. Subramani 001; Xishun Zhao (SAT, 2003)

An Analysis of Partially Clairvoyant Scheduling. - K. Subramani 001 (J. Math. Model. Algorithms, 2003)

Zero-Clairvoyant Scheduling with Inter-period Constraints. - K. Subramani 001 (ASIAN, 2004)

Analyzing Selected Quantified Integer Programs. - K. Subramani 001 (IJCAR, 2004)

A Shared Memory Dispatching Approach for Partially Clairvoyant Schedulers. - K. Subramani 001; Kiran Yellajyosula (HiPC, 2004)

Distributed Algorithms for Partially Clairvoyant Dispatchers. - K. Subramani 001; Kiran Yellajyosula; Ashraf M. Osman (IPDPS, 2004)

Resource-Optimal Scheduling Using Priced Timed Automata. - Jacob Illum Rasmussen; Kim Guldstrand Larsen; K. Subramani 001 (TACAS, 2004)

On deciding the non-emptiness of 2SAT polytopes with respect to First Order Queries. - K. Subramani 001 (Math. Log. Q., 2004)

Optimal length tree-like resolution refutations for 2SAT formulas. - K. Subramani 001 (ACM Trans. Comput. Log., 2004)

Stressing is Better Than Relaxing for Negative Cost Cycle Detection in Networks. - K. Subramani 001 (ADHOC-NOW, 2005)

A New Verification Procedure for Partially Clairvoyant Scheduling. - K. Subramani 001; Dejan Desovski (FORMATS, 2005)

On the Empirical Efficiency of the Vertex Contraction Algorithm for Detecting Negative Cost Cyles in Networks. - K. Subramani 001; Dejan Desovski (International Conference on Computational Science (1), 2005)

A Comprehensive Framework for Specifying Clairvoyance, Constraints and Periodicity in Real-Time Scheduling. - K. Subramani 001 (Comput. J., 2005)

A greedy strategy for detecting negative cost cycles in networks. - K. Subramani 001; Lisa Kovalchick (Future Gener. Comput. Syst., 2005)

Cascading random walks. - K. Subramani 001 (Int. J. Found. Comput. Sci., 2005)

Partially clairvoyant scheduling for aggregate constraints. - K. Subramani 001 (Adv. Decis. Sci., 2005)

Out of order quantifier elimination for Standard Quantified Linear Programs. - K. Subramani 001; Dejan Desovski (J. Symb. Comput., 2005)

Periodic Linear Programming with applications to real-time scheduling. - K. Subramani 001 (Math. Struct. Comput. Sci., 2005)

Tractable Fragments of Presburger Arithmetic. - K. Subramani 001 (Theory Comput. Syst., 2005)

An Analysis of Totally Clairvoyant Scheduling. - K. Subramani 001 (J. Sched., 2005)

Erratum: An Analysis of Totally Clairvoyant Scheduling. - K. Subramani 001 (J. Sched., 2005)

Analyzing Chain Programs over Difference Constraints. - K. Subramani 001; John Argentieri (TAMC, 2006)

Totally Clairvoyant Scheduling with Relative Timing Constraints. - K. Subramani 001 (VMCAI, 2006)

On contrasting vertex contraction with relaxation-based approaches for negative cost cycle detection. - K. Subramani 001; Dejan Desovski (Appl. Math. Comput., 2006)

An approximation algorithm for state minimization in 2-MDFAs. - K. Subramani 001; C. Tauras (Formal Aspects Comput., 2006)

On using priced timed automata to achieve optimal scheduling. - Jacob Illum Rasmussen; Kim Guldstrand Larsen; K. Subramani 001 (Formal Methods Syst. Des., 2006)

Chain Programming over Difference Constraints. - K. Subramani 001; John Argentieri (Nord. J. Comput., 2006)

Accomplishing Approximate FCFS Fairness Without Queues. - K. Subramani 001; Kamesh Madduri (HiPC, 2007)

A Randomized Algorithm for BBCSPs in the Prover-Verifier Model. - K. Subramani 001 (ICTAC, 2007)

On a decision procedure for quantified linear programs. - K. Subramani 001 (Ann. Math. Artif. Intell., 2007)

A polynomial time algorithm for Zero-Clairvoyant scheduling. - K. Subramani 001 (J. Appl. Log., 2007)

Boolean Functions as Models for Quantified Boolean Formulas. - Hans Kleine Büning; K. Subramani 001; Xishun Zhao (J. Autom. Reason., 2007)

A Zero-Space algorithm for Negative Cost Cycle Detection in networks. - K. Subramani 001 (J. Discrete Algorithms, 2007)

On Solving Boolean Combinations of UTVPI Constraints. - Sanjit A. Seshia; K. Subramani 001; Randal E. Bryant (J. Satisf. Boolean Model. Comput., 2007)

An empirical analysis of algorithms for partially Clairvoyant scheduling. - K. Subramani 001; Dejan Desovski (Int. J. Parallel Emergent Distributed Syst., 2007)

Absorbing Random Walks and the NAE2SAT Problem. - K. Subramani 001 (FAW, 2008)

Computing inversion pair cardinality through partition-based sorting. - K. Subramani 001 (Computing, 2008)

On the Design and Implementation of a Shared Memory Dispatcher for Partially Clairvoyant Schedulers. - K. Subramani 001; Kiran Yellajyosula (Int. J. Parallel Program., 2008)

A Randomized Queueless Algorithm for Breadth-First Search. - K. Subramani 001; Kamesh Madduri (Int. J. Comput. Their Appl., 2008)

Fault Tolerant Sorting - Theoretical and Empirical Analyses of the Randomized QuickMergesort Algorithm. - K. Subramani 001; C. Tauras; David Owen 002 (J. Math. Model. Algorithms, 2008)

Two-Level Heaps: A New Priority Queue Structure with Applications to the Single Source Shortest Path Problem. - K. Subramani 001; Kamesh Madduri (COCOA, 2009)

Improved Algorithms for Detecting Negative Cost Cycles in Undirected Graphs. - Xiaofeng Gu 002; Kamesh Madduri; K. Subramani 001; Hong-Jian Lai (FAW, 2009)

A Combinatorial Algorithm for Horn Programs. - R. Chandrasekaran; K. Subramani 001 (ISAAC, 2009)

Random walks for selected boolean implication and equivalence problems. - K. Subramani 001; Hong-Jian Lai; Xiaofeng Gu 002 (Acta Informatica, 2009)

On the Complexities of Selected Satisfiability and Equivalence Queries over Boolean Formulas and Inclusion Queries over Hulls. - K. Subramani 001 (Adv. Decis. Sci., 2009)

Optimal Length Resolution Refutations of Difference Constraint Systems. - K. Subramani 001 (J. Autom. Reason., 2009)

On memoryless provers and insincere verifiers. - K. Subramani 001 (J. Exp. Theor. Artif. Intell., 2009)

Space-time tradeoffs in negative cycle detection - An empirical analysis of the Stressing Algorithm. - K. Subramani 001; C. Tauras; Kamesh Madduri (Appl. Math. Comput., 2010)

A faster algorithm for the single source shortest path problem with few distinct positive lengths. - James B. Orlin; Kamesh Madduri; K. Subramani 001; Matthew D. Williamson (J. Discrete Algorithms, 2010)

Algorithmic Aspects of Risk Management. - Ashish Gehani; Lee Zaniewski; K. Subramani 001 (Formal Modeling: Actors, Open Systems, Biological Systems, 2011)

A New Algorithm for Linear and Integer Feasibility in Horn Constraints. - K. Subramani 001; James Worthington (CPAIOR, 2011)

Absorbing random walks and the NAE2SAT problem. - K. Subramani 001; Xiaofeng Gu 002 (Int. J. Comput. Math., 2011)

A mechanical verification of the stressing algorithm for negative cost cycle detection in networks. - Natarajan Shankar; K. Subramani 001 (Sci. Comput. Program., 2011)

Computational complexity of inclusion queries over polyhedral sets. - Pavlos Eirinakis; Salvatore Ruggieri; K. Subramani 001; Piotr Wojciechowski 002 (ISAIM, 2012)

A complexity perspective on entailment of parameterized linear constraints. - Pavlos Eirinakis; Salvatore Ruggieri; K. Subramani 001; Piotr Wojciechowski 002 (Constraints An Int. J., 2012)

Analytical models for risk-based intrusion response. - Bugra Çaskurlu; Ashish Gehani; Cemal Çagatay Bilgin; K. Subramani 001 (Comput. Networks, 2013)

On Partial Vertex Cover on Bipartite Graphs and Trees - Bugra Çaskurlu; K. Subramani 001 (CoRR, 2013)

Improved algorithms for optimal length resolution refutation in difference constraint systems. - K. Subramani 001; Matthew D. Williamson; Xiaofeng Gu 002 (Formal Aspects Comput., 2013)

Polynomial time certifying algorithms for the planar quantified integer programming problem. - Z. Liang; K. Subramani 001; James Worthington (J. Log. Comput., 2013)

On Partial Vertex Cover and Budgeted Maximum Coverage Problems in Bipartite Graphs. - Bugra Çaskurlu; Vahan Mkrtchyan; Ojas Parekh; K. Subramani 001 (IFIP TCS, 2014)

Variants of Quantified Linear Programming and Quantified Linear Implication. - Piotr Wojciechowski 002; Pavlos Eirinakis; K. Subramani 001 (ISAIM, 2014)

On quantified linear implications. - Pavlos Eirinakis; Salvatore Ruggieri; K. Subramani 001; Piotr Wojciechowski 002 (Ann. Math. Artif. Intell., 2014)

On Certifying Instances of Zero-Clairvoyant Scheduling. - K. Subramani 001; James Worthington (Comput. J., 2014)

Clustering without replication: approximation and inapproximability. - Zola Donovan; Vahan Mkrtchyan; K. Subramani 001 (CoRR, 2014)

On the complexity of quantified linear systems. - Salvatore Ruggieri; Pavlos Eirinakis; K. Subramani 001; Piotr Wojciechowski 002 (Theor. Comput. Sci., 2014)

On Clustering Without Replication in Combinatorial Circuits. - Zola Donovan; Vahan Mkrtchyan; K. Subramani 001 (COCOA, 2015)

A Graphical Theorem of the Alternative for UTVPI Constraints. - K. Subramani 001; Piotr Wojciechowski 002 (ICTAC, 2015)

A new algorithm for the minimum spanning tree verification problem. - Matthew D. Williamson; K. Subramani 001 (Comput. Optim. Appl., 2015)

A Parallel Implementation for the Negative Cost Girth Problem. - Matthew D. Williamson; K. Subramani 001 (Int. J. Parallel Program., 2015)

On the approximability of the Largest Sphere Rule Ensemble Classification problem. - Vahan Mkrtchyan; K. Subramani 001 (Inf. Process. Lett., 2015)

On the negative cost girth problem in planar networks. - Matthew D. Williamson; K. Subramani 001 (J. Discrete Algorithms, 2015)

Identifying Negative Cost Cycles in Strongly Polynomial Space. - Natarajan Shankar; K. Subramani 001; Pavlos Eirinakis (Nord. J. Comput., 2015)

Feasibility checking in Horn constraint systems through a reduction based approach. - K. Subramani 001; James Worthington (Theor. Comput. Sci., 2015)

On the computational complexities of Quantified Integer Programming variants. - Piotr Wojciechowski 002; K. Subramani 001; Pavlos Eirinakis (ISAIM, 2016)

A Bit-Scaling Algorithm for Integer Feasibility in UTVPI Constraints. - K. Subramani 001; Piotr Wojciechowski 002 (IWOCA, 2016)

Compositional Bisimulation Minimization for Interval Markov Decision Processes. - Vahid Hashemi; Holger Hermanns; Lei Song 001; K. Subramani 001; Andrea Turrini; Piotr Wojciechowski 002 (LATA, 2016)

The cardinality-constrained paths problem: Multicast data routing in heterogeneous communication networks. - Alvaro Velasquez; Piotr Wojciechowski 002; K. Subramani 001; Steven L. Drager 001; Sumit Kumar Jha 001 (NCA, 2016)

An Optimal Algorithm for Computing the Integer Closure of UTVPI Constraints. - K. Subramani 001; Piotr Wojciechowski 002 (WALCOM, 2016)

Fast Algorithms for the Undirected Negative Cost Cycle Detection Problem. - Matthew D. Williamson; Pavlos Eirinakis; K. Subramani 001 (Algorithmica, 2016)

Corrigendum to "On the negative cost girth problem in planar networks" [Journal of Discrete Algorithms 35 (2015) 40-50]. - Matthew D. Williamson; K. Subramani 001 (J. Discrete Algorithms, 2016)

Analyzing Lattice Point Feasibility in UTVPI Constraints. - K. Subramani 001; Piotr Wojciechowski 002 (CP, 2017)

On a Generalization of Horn Constraint Systems. - Piotr Wojciechowski 002; Ramaswamy Chandrasekaran; K. Subramani 001 (CSR, 2017)

The Complexity of Finding Read-Once NAE-Resolution Refutations. - Hans Kleine Büning; Piotr Wojciechowski 002; K. Subramani 001 (ICLA, 2017)

The Approximability of Partial Vertex Covers in Trees. - Vahan Mkrtchyan; Ojas Parekh; Danny Segev; K. Subramani 001 (SOFSEM, 2017)

On the Computational Complexity of Read once Resolution Decidability in 2CNF Formulas. - Hans Kleine Büning; Piotr Wojciechowski 002; K. Subramani 001 (TAMC, 2017)

A Combinatorial Certifying Algorithm for Linear Feasibility in UTVPI Constraints. - K. Subramani 001; Piotr Wojciechowski 002 (Algorithmica, 2017)

Analyzing restricted fragments of the theory of linear arithmetic. - Piotr Wojciechowski 002; Pavlos Eirinakis; K. Subramani 001 (Ann. Math. Artif. Intell., 2017)

Erratum to: Analyzing restricted fragments of the theory of linear arithmetic. - Piotr Wojciechowski 002; Pavlos Eirinakis; K. Subramani 001 (Ann. Math. Artif. Intell., 2017)

On the Shoshan-Zwick Algorithm for the All-Pairs Shortest Path Problem. - Pavlos Eirinakis; Matthew D. Williamson; K. Subramani 001 (J. Graph Algorithms Appl., 2017)

Partial Vertex Cover and Budgeted Maximum Coverage in Bipartite Graphs. - Bugra Çaskurlu; Vahan Mkrtchyan; Ojas Parekh; K. Subramani 001 (SIAM J. Discret. Math., 2017)

An Empirical Analysis of Feasibility Checking Algorithms for UTVPI Constraints. - K. Subramani 001; Piotr Wojciechowski 002; Zachary Santer; Matthew Anderson (AAIM, 2018)

Minimization of Testing Costs in Capacity-Constrained Database Migration. - K. Subramani 001; Bugra Çaskurlu; Alvaro Velasquez (ALGOCLOUD, 2018)

A Fully Polynomial Time Approximation Scheme for Refutations in Weighted Difference Constraint Systems. - Bugra Çaskurlu; Matthew D. Williamson; K. Subramani 001; Vahan Mkrtchyan; Piotr Wojciechowski 002 (CALDAM, 2018)

Optimal Length Tree-Like Refutations of Linear Feasibility in UTVPI Constraints. - Piotr Wojciechowski 002; K. Subramani 001; Matthew D. Williamson (FAW, 2018)

Finding Minimum Stopping and Trapping Sets: An Integer Linear Programming Approach. - Alvaro Velasquez; K. Subramani 001; Steven L. Drager 001 (ISCO, 2018)

Randomized algorithms for finding the shortest negative cost cycle in networks. - James B. Orlin; K. Subramani 001; Piotr Wojciechowski 002 (Discret. Appl. Math., 2018)

On approximating optimal weight "no"-certificates in weighted difference constraint systems. - Bugra Çaskurlu; Matthew D. Williamson; K. Subramani 001; Vahan Mkrtchyan (J. Comb. Optim., 2018)

A certifying algorithm for lattice point feasibility in a system of UTVPI constraints. - K. Subramani 001; Piotr Wojciechowski 002 (J. Comb. Optim., 2018)

Finding read-once resolution refutations in systems of 2CNF clauses. - Hans Kleine Büning; Piotr Wojciechowski 002; K. Subramani 001 (Theor. Comput. Sci., 2018)

A Graphical Analysis of Integer Infeasibility in UTVPI Constraints. - K. Subramani 001; Piotr Wojciechowski 002 (AI*IA, 2019)

Security-Aware Database Migration Planning. - K. Subramani 001; Bugra Çaskurlu; Utku Umur Acikalin (ALGOCLOUD, 2019)

Read-Once Resolutions in Horn Formulas. - Hans Kleine Büning; Piotr Wojciechowski 002; K. Subramani 001 (FAW, 2019)

Restricted Cutting Plane Proofs in Horn Constraint Systems. - Hans Kleine Büning; Piotr Wojciechowski 002; R. Chandrasekaran; K. Subramani 001 (FroCos, 2019)

New Results on Cutting Plane Proofs for Horn Constraint Systems. - Hans Kleine Büning; Piotr Wojciechowski 002; K. Subramani 001 (FSTTCS, 2019)

Disjoint Clustering in Combinatorial Circuits. - Zola Donovan; K. Subramani 001; Vahan Mkrtchyan (IWOCA, 2019)

Read-Once Certification of Linear Infeasibility in UTVPI Constraints. - K. Subramani 001; Piotr Wojciechowski 002 (TAMC, 2019)

A Polynomial Time Algorithm for Read-Once Certification of Linear Infeasibility in UTVPI Constraints. - K. Subramani 001; Piotr Wojciechowski 002 (Algorithmica, 2019)

Parameterized algorithms for Partial vertex covers in bipartite graphs. - Vahan Mkrtchyan; Garik Petrosyan; K. Subramani 001 (CoRR, 2019)

Empirical analysis of algorithms for the shortest negative cost cycle problem. - Matthew Anderson; Matthew D. Williamson; K. Subramani 001 (Discret. Appl. Math., 2019)

Clustering without replication in combinatorial circuits. - Zola Donovan; Gregory Z. Gutin; Vahan Mkrtchyan; K. Subramani 001 (J. Comb. Optim., 2019)

On Unit Read-Once Resolutions and Copy Complexity. - Piotr Wojciechowski 002; K. Subramani 001 (COCOA, 2020)

Finding read-once refutations in 2CNF formulas and variants - a parameterized perspective. - K. Subramani 001; Piotr Wojciechowski 002 (ISAIM, 2020)

On Finding Shortest Paths in Arc-Dependent Networks. - Piotr Wojciechowski 002; Matthew D. Williamson; K. Subramani 001 (ISCO, 2020)

Parameterized Algorithms for Partial Vertex Covers in Bipartite Graphs. - Vahan Mkrtchyan; Garik Petrosyan; K. Subramani 001; Piotr Wojciechowski 002 (IWOCA, 2020)

On integer closure in a system of unit two variable per inequality constraints. - K. Subramani 001; Piotr Wojciechowski 002 (Ann. Math. Artif. Intell., 2020)

NAE-resolution: A new resolution refutation technique to prove not-all-equal unsatisfiability. - Hans Kleine Büning; Piotr Wojciechowski 002; K. Subramani 001 (Math. Struct. Comput. Sci., 2020)

Analyzing Clustering and Partitioning Problems in Selected VLSI Models. - Zola Donovan; K. Subramani 001; Vahan V. Mkrtchyan (Theory Comput. Syst., 2020)

Analyzing fractional Horn constraint systems. - Piotr Wojciechowski 002; R. Chandrasekaran; K. Subramani 001 (Theor. Comput. Sci., 2020)

New Results on Test-Cost Minimization in Database Migration. - Utku Umur Acikalin; Bugra Çaskurlu; Piotr Wojciechowski 002; K. Subramani 001 (ALGOCLOUD, 2021)

Algorithmic Analysis of Priority-Based Bin Packing. - Piotr Wojciechowski 002; K. Subramani 001; Alvaro Velasquez; Bugra Çaskurlu (CALDAM, 2021)

On the Copy Complexity of Width 3 Horn Constraint Systems. - K. Subramani 001; Piotr Wojciechowski 002; Alvaro Velasquez (FroCoS, 2021)

Analyzing Unit Read-Once Refutations in Difference Constraint Systems. - K. Subramani 001; Piotr Wojciechowski 002 (JELIA, 2021)

Tree-Like Unit Refutations in Horn Constraint Systems. - K. Subramani 001; Piotr Wojciechowski 002 (LATA, 2021)

Polynomial time algorithms for optimal length tree-like refutations of linear infeasibility in UTVPI constraints. - Piotr Wojciechowski 002; K. Subramani 001; Matthew D. Williamson (Discret. Appl. Math., 2021)

On the parametrized complexity of read-once refutations in UTVPI+ constraint systems. - K. Subramani 001; Piotr Wojciechowski 002 (Theor. Comput. Sci., 2021)

Copy complexity of Horn formulas with respect to unit read-once resolution. - Piotr Wojciechowski 002; K. Subramani 001 (Theor. Comput. Sci., 2021)

New Results in Priority-Based Bin Packing. - K. Subramani 001; Piotr Wojciechowski 002; Alvaro Velasquez (ALGOCLOUD, 2022)

On the Approximability of Path and Cycle Problems in Arc-Dependent Networks. - Piotr Wojciechowski 002; K. Subramani 001; Alvaro Velasquez; Matthew D. Williamson (CALDAM, 2022)

Analyzing the Reachability Problem in Choice Networks. - Piotr Wojciechowski 002; K. Subramani 001; Alvaro Velasquez (CPAIOR, 2022)

Exact and Parameterized Algorithms for Read-Once Refutations in Horn Constraint Systems. - K. Subramani 001; Piotr Wojciechowski 002 (LFCS, 2022)

Analyzing the 3-path Vertex Cover Problem in Planar Bipartite Graphs. - Sangram Kishor Jena; K. Subramani 001 (TAMC, 2022)

On the Parallel Complexity of Constrained Read-Once Refutations in UTVPI Constraint Systems. - K. Subramani 001; Piotr Wojciechowski 002 (TAMC, 2022)

Parameterized and exact algorithms for finding a read-once resolution refutation in 2CNF formulas. - K. Subramani 001; Piotr Wojciechowski 002 (Ann. Math. Artif. Intell., 2022)

On the lengths of tree-like and Dag-like cutting plane refutations of Horn constraint systems. - Piotr Wojciechowski 002; K. Subramani 001 (Ann. Math. Artif. Intell., 2022)

On the analysis of optimization problems in arc-dependent networks. - Piotr Wojciechowski 002; Matthew D. Williamson; K. Subramani 001 (Discret. Optim., 2022)

Analyzing Read-Once Cutting Plane Proofs in Horn Systems. - Piotr Wojciechowski 002; K. Subramani 001; R. Chandrasekaran (J. Autom. Reason., 2022)

Read-once refutations in Horn constraint systems: an algorithmic approach. - K. Subramani 001; Piotr Wojciechowski 002; Ying Sheng 007 (J. Log. Comput., 2022)

On the complexity of and solutions to the minimum stopping and trapping set problems. - Alvaro Velasquez; K. Subramani 001; Piotr Wojciechowski 002 (Theor. Comput. Sci., 2022)

Optimal Length Cutting Plane Refutations of Integer Programs. - K. Subramani 001; Piotr Wojciechowski 002 (CALDAM, 2023)

Differentiable Discrete Optimization Using Dataless Neural Networks. - Sangram Kishor Jena; K. Subramani 001; Alvaro Velasquez (COCOA (2), 2023)

Parameterized and Exact-Exponential Algorithms for the Read-Once Integer Refutation Problem in UTVPI Constraints. - K. Subramani 001; Piotr Wojciechowski 002 (COCOA (2), 2023)

Unit Refutations of Difference Constraint Systems. - K. Subramani 001; Piotr Wojciechowski 002 (ECAI, 2023)

The Octatope Abstract Domain for Verification of Neural Networks. - Stanley Bak; Taylor Dohmen; K. Subramani 001; Ashutosh Trivedi 001; Alvaro Velasquez; Piotr Wojciechowski 002 (FM, 2023)

A Faster Algorithm for Determining the Linear Feasibility of Systems of BTVPI Constraints. - Piotr Wojciechowski 002; K. Subramani 001 (SOFSEM, 2023)

Integer Feasibility and Refutations in UTVPI Constraints Using Bit-Scaling. - K. Subramani 001; Piotr Wojciechowski 002 (Algorithmica, 2023)

Optimal Deterministic Controller Synthesis from Steady-State Distributions. - Alvaro Velasquez; Ismail Alkhouri; K. Subramani 001; Piotr Wojciechowski 002; George K. Atia (J. Autom. Reason., 2023)

Reachability in choice networks. - Piotr Wojciechowski 002; K. Subramani 001; Alvaro Velasquez (Discret. Optim., 2023)

Reachability problems in interval-constrained and cardinality-constrained graphs. - Alvaro Velasquez; K. Subramani 001; Piotr Wojciechowski 002 (Discret. Math. Algorithms Appl., 2023)

Unit Read-once Refutations for Systems of Difference Constraints. - K. Subramani 001; Piotr Wojciechowski 002 (Theory Comput. Syst., 2023)

Optimizing Cloud-Based Systems Through Resource-Constrained Distance Matching. - Sangram K. Jena 001; K. Subramani 001 (ALGOCLOUD, 2024)

A Differential Approach for Several NP-hard Optimization Problems. - Sangram Kishor Jena; K. Subramani 001; Alvaro Velasquez (ISAIM, 2024)

On the Computational Complexities of Finding Selected Refutations of Linear Programs. - K. Subramani 001; Piotr Wojciechowski 002 (ISAIM, 2024)

A Certifying Algorithm for Linear (and Integer) Feasibility in Horn Constraint Systems. - Piotr Wojciechowski 002; K. Subramani 001 (LOPSTR, 2024)

An Empirical Evaluation of Algorithms for Simple Stochastic Games. - Cody Klingler; K. Subramani 001 (MIWAI (1), 2024)

Proving the infeasibility of Horn formulas through read-once resolution. - Piotr Wojciechowski 002; K. Subramani 001 (Discret. Appl. Math., 2024)

Constrained read-once refutations in UTVPI constraint systems: A parallel perspective. - K. Subramani 001; Piotr Wojciechowski 002 (Math. Struct. Comput. Sci., 2024)

Priority-based bin packing with subset constraints. - Piotr Wojciechowski 002; K. Subramani 001; Alvaro Velasquez; Bugra Çaskurlu (Discret. Appl. Math., 2024)

On the Partial Vertex Cover Problem in Bipartite Graphs - a Parameterized Perspective. - Vahan Mkrtchyan; Garik Petrosyan; K. Subramani 001; Piotr Wojciechowski 002 (Theory Comput. Syst., 2024)

Farkas Bounds on Horn Constraint Systems. - K. Subramani 001; Piotr Wojciechowski 002; Alvaro Velasquez (Theory Comput. Syst., 2024)

Approximation Algorithms for Partial Vertex Covers in Trees. - Vahan Mkrtchyan; Ojas Parekh; K. Subramani 001 (Int. J. Found. Comput. Sci., 2024)

Arc-dependent networks: theoretical insights and a computational study. - Alvaro Velasquez; Piotr Wojciechowski 002; K. Subramani 001; Matthew D. Williamson (Ann. Oper. Res., 2024)

The hexatope and octatope abstract domains for neural network verification. - Stanley Bak; Taylor Dohmen; K. Subramani 001; Ashutosh Trivedi 001; Alvaro Velasquez; Piotr Wojciechowski 002 (Formal Methods Syst. Des., 2024)

Designing dataless neural networks for kidney exchange variants. - Sangram K. Jena 001; K. Subramani 001; Alvaro Velasquez (Neural Comput. Appl., 2024)

The MASEMPR Problem and Its Applications in Logistics. - A. Subramani; K. Subramani 001; Piotr Wojciechowski 002; Sangram K. Jena 001 (CALDAM, 2025)

Unit Refutations in Horn Constraint Systems. - Piotr Wojciechowski 002; K. Subramani 001 (CIAC (1), 2025)

From MAXCUT to MAXNAESAT: Elegant Proofs and Algorithmic Advances. - Sangram K. Jena 001; K. Subramani 001 (IJTCS-FAW, 2025)

Finding Short Tree-Like Unit Refutations in UTVPI Constraint Systems. - Piotr Wojciechowski 002; K. Subramani 001 (JELIA (1), 2025)

Dag-Like Unit Refutations in UTVPI Constraint Systems. - Piotr Wojciechowski 002; K. Subramani 001 (WALCOM, 2025)

Exploring cycle cover variants: A dataless neural networks approach. - Sangram K. Jena 001; K. Subramani 001; Alvaro Velasquez (Neurocomputing, 2025)

Models for Test Cost Minimization in Database Migration. - Bugra Çaskurlu; K. Subramani 001; Utku Umur Acikalin; Alvaro Velasquez; Piotr Wojciechowski 002 (INFORMS J. Comput., 2025)

Unit refutability of horn constraint systems - certification and parallel complexity. - Piotr Wojciechowski 002; K. Subramani 001 (Theor. Comput. Sci., 2025)

Analyzing the 3-path vertex cover problem in selected graph classes. - Sangram K. Jena 001; K. Subramani 001 (J. Comb. Optim., 2025)

Correction to: Farkas Bounds on Horn Constraint Systems. - K. Subramani 001; Piotr Wojciechowski 002; Alvaro Velasquez (Theory Comput. Syst., 2025)

Parameterized lower bounds for the weighted vertex cover problem in trees. - Piotr Wojciechowski 002; K. Subramani 001 (Acta Informatica, 2025)