PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Subramani, K."

Author of the publication

copydeleteadd this publication to your clipboard
Space-time tradeoffs in negative cycle detection - An empirical analysis of the Stressing Algorithm.

, , and . Applied Mathematics and Computation, 215 (10): 3563-3575 (2010)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

K. Stahl

K. Gaiser

K. Lindow

Grzegorz K. Karch

Dipl.-Ing. Thomas Kuestner

Scan time reduction in DWI of the pancreas using simultaneous multislice technique with different acceleration factors: how fast can we go?, , , , , , , and . Proceedings of the International Society for Magnetic Resonance in Medicine (ISMRM), Honolulu, Hawaii, USA, (April 2017)
 

Other publications of authors with the same name

Computational complexity of inclusion queries over polyhedral sets., , , and . ISAIM, (2012)A faster algorithm for the single source shortest path problem with few distinct positive lengths., , , and . J. Discrete Algorithms, 8 (2): 189-198 (2010)Space-time tradeoffs in negative cycle detection - An empirical analysis of the Stressing Algorithm., , and . Applied Mathematics and Computation, 215 (10): 3563-3575 (2010)A Polynomial Time Algorithm for Read-Once Certification of Linear Infeasibility in UTVPI Constraints., and . Algorithmica, 81 (7): 2765-2794 (2019)On Partial Vertex Cover on Bipartite Graphs and Trees, and . CoRR, (2013)On the Computational Complexity of Read once Resolution Decidability in 2CNF Formulas., , and . TAMC, volume 10185 of Lecture Notes in Computer Science, page 362-372. (2017)Analyzing Chain Programs over Difference Constraints., and . TAMC, volume 3959 of Lecture Notes in Computer Science, page 171-180. Springer, (2006)On Determining the Minimum Length, Tree-Like Resolution Refutation of 2SAT, and Extended 2SAT Formulas.. ASIAN, volume 2550 of Lecture Notes in Computer Science, page 57-65. Springer, (2002)Resource-Optimal Scheduling Using Priced Timed Automata., , and . TACAS, volume 2988 of Lecture Notes in Computer Science, page 220-235. Springer, (2004)On the Empirical Efficiency of the Vertex Contraction Algorithm for Detecting Negative Cost Cyles in Networks., and . International Conference on Computational Science (1), volume 3514 of Lecture Notes in Computer Science, page 180-187. Springer, (2005)