Autor der Publikation

Kopieren Löschen Diese Publikation zur Ablage hinzufügen
Community-Eintrag
Versionsverlauf dieses Eintrags
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

A faster algorithm for the single source shortest path problem with few distinct positive lengths.

J. Orlin, K. Madduri, K. Subramani, und M. Williamson. J. Discrete Algorithms, 8 (2): 189-198 (2010)

Bitte wählen Sie eine Person um die Publikation zuzuordnen

Um zwischen Personen mit demselben Namen zu unterscheiden, wird der akademische Grad und der Titel einer wichtigen Publikation angezeigt. Zudem lassen sich über den Button neben dem Namen einige der Person bereits zugeordnete Publikationen anzeigen.

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?J. Taron, P. Martirosian, T. Küstner, M. Notohamiprodjo, J. Weiß, A. Othman, K. Nikolaou, und C. Schraml. Proceedings of the International Society for Magnetic Resonance in Medicine (ISMRM), Honolulu, Hawaii, USA, (April 2017)

Scan time reduction in DWI of the pancreas using simultaneous multislice technique with different acceleration factors: how fast can we go?J. Taron, P. Martirosian, T. Küstner, M. Notohamiprodjo, J. Weiß, A. Othman, K. Nikolaou, und C. Schraml. Proceedings of the International Society for Magnetic Resonance in Medicine (ISMRM), Honolulu, Hawaii, USA, (April 2017)The use of a generalized reconstruction by inversion of coupled systems (GRICS) approach for generic respiratory motion correction in PET/MR imagingH. Fayad, F. Odille, H. Schmidt, C. Würslin, T. Küstner, J. Felblinger, und D. Visvikis. Physics in medicine and biology, 60 (6): 2529-46 (März 2015)In-vivo MR-derived non-rigid motion correction of simultaneously acquired PETT. Küstner, C. Würslin, S. Gatidis, P. Martirosian, N. Schwenzer, B. Yang, und H. Schmidt. Proceedings of the International Society for Magnetic Resonance in Medicine (ISMRM), Toronto, Canada, (Juni 2015)

Weitere Publikationen von Autoren mit dem selben Namen

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