default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDUdo Hoffmann
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j4]Roman Zeleznik
, Jakob Weiss, Jana Taron, Christian V. Guthier, Danielle S. Bitterman, Cindy Hancox, Benjamin H. Kann, Daniel W. Kim, Rinaa S. Punglia, Jeremy Bredfeldt, Borek Foldyna, Parastou Eslami, Michael T. Lu, Udo Hoffmann, Raymond H. Mak, Hugo J. W. L. Aerts:
Deep-learning system to improve the quality and efficiency of volumetric heart segmentation for breast cancer. npj Digit. Medicine 4 (2021)
2010 – 2019
- 2019
- [i4]Ahmed Hosny, Michael Schwier, Christoph Berger, Evin Pinar Örnek, Mehmet Turan, Phi V. Tran, Leon Weninger, Fabian Isensee, Klaus H. Maier-Hein, Richard McKinley, Michael T. Lu, Udo Hoffmann, Bjoern H. Menze, Spyridon Bakas, Andriy Fedorov, Hugo J. W. L. Aerts:
ModelHub.AI: Dissemination Platform for Deep Learning Models. CoRR abs/1911.13218 (2019) - 2018
- [j3]Steven Chaplick, Stefan Felsner, Udo Hoffmann, Veit Wiechert:
Grid Intersection Graphs and Order Dimension. Order 35(2): 363-391 (2018) - [i3]Udo Hoffmann, Keno Merckx:
A universality theorem for allowable sequences with applications. CoRR abs/1801.05992 (2018) - 2017
- [j2]Jean Cardinal, Udo Hoffmann:
Recognition and Complexity of Point Visibility Graphs. Discret. Comput. Geom. 57(1): 164-178 (2017) - [j1]Udo Hoffmann:
On the Complexity of the Planar Slope Number Problem. J. Graph Algorithms Appl. 21(2): 183-193 (2017) - 2016
- [c4]Udo Hoffmann:
The Planar Slope Number. CCCG 2016: 182-186 - 2015
- [c3]Jean Cardinal, Udo Hoffmann:
Recognition and Complexity of Point Visibility Graphs. SoCG 2015: 171-185 - [c2]Udo Hoffmann, Linda Kleist, Tillmann Miltzow:
Upper and Lower Bounds on Long Dual Paths in Line Arrangements. MFCS (2) 2015: 407-419 - [i2]Jean Cardinal, Udo Hoffmann:
Recognition and Complexity of Point Visibility Graphs. CoRR abs/1503.07082 (2015) - [i1]Udo Hoffmann, Linda Kleist, Tillmann Miltzow:
Upper and Lower Bounds on Long Dual-Paths in Line Arrangements. CoRR abs/1506.03728 (2015)
2000 – 2009
- 2007
- [c1]Zhuangli Liang, W. Clem Karl, Synho Do, Udo Hoffmann, Thomas J. Brady, Homer H. Pien:
Calcium De-blooming in Coronary CT Image. BIBE 2007: 257-262
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:49 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
