( en | de | ru )

 

Disambiguation of "Hertel, Alexander"

Author of the publication

copydeleteadd this publication to your clipboard
An O(pn + 1.151p)-Algorithm for p-Profit Cover and Its Practical Implications for Vertex Cover.

, , , and . ISAAC, volume 2518 of Lecture Notes in Computer Science, page 249-261. Springer, (2002)

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.

Gernot Hertel

Christian Hertel

Fritz Hertel

Günther Hertel

Werner Hertel

 

Other publications of authors with the same name

Algorithms and Complexity Results for Input and Unit Resolution., and . J. Satisf. Boolean Model. Comput., 6 (1-3): 141-164 (2009)Abstract: Multistage Registration of CT and Biopsy CT Images of Lung Tumors., , , , , , , , , and 1 other author(s). Bildverarbeitung für die Medizin, page 202. Springer, (2024)The Resolution Width Problem is EXPTIME-Complete., and . Electron. Colloquium Comput. Complex., (2006)Periaortic adipose radiomics texture features associated with increased coronary calcium score - first results on a photon-counting-CT., , , , , , , , and . BMC Medical Imaging, 23 (1): 97 (December 2023)Applications of Games to Propositional Proof Complexity.. University of Toronto, Canada, (2009)An O(pn + 1.151p)-Algorithm for p-Profit Cover and Its Practical Implications for Vertex Cover., , , and . ISAAC, volume 2518 of Lecture Notes in Computer Science, page 249-261. Springer, (2002)Comments on ECCC Report TR06-133: The Resolution Width Problem is EXPTIME-Complete., and . Electron. Colloquium Comput. Complex., (2009)Game Characterizations and the PSPACE-Completeness of Tree Resolution Space., and . CSL, volume 4646 of Lecture Notes in Computer Science, page 527-541. Springer, (2007)Formalizing Dangerous SAT Encodings., , and . SAT, volume 4501 of Lecture Notes in Computer Science, page 159-172. Springer, (2007)A Sound and Complete Proof Theory for Propositional Logical Contingencies., , and . Notre Dame J. Formal Log., 48 (4): 521-530 (2007)