default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLothar Narins
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i2]E. Wes Bethel, Vianna Cramer, Alexander del Rio, Lothar Narins, Chris Pestano, Satvik Verma, Erick Arias, Nicola Bertelli, Talita Perciano, Syun'ichi Shiraiwa, Álvaro Sánchez Villar, Greg Wallace, John C. Wright:
Case Study: Leveraging GenAI to Build AI-based Surrogates and Regressors for Modeling Radio Frequency Heating in Fusion Energy Science. CoRR abs/2409.06122 (2024)- 2023
- [c5]Abigale Stangl
, Shasta Ihorn, Yue-Ting Siu, Aditya Bodi, Mar Castanon, Lothar D. Narins, Ilmi Yoon:
The Potential of a Visual Dialogue Agent In a Tandem Automated Audio Description System for Videos. ASSETS 2023: 32:1-32:17 - [c4]Andrew Taylor Scott, Lothar D. Narins, Anagha Kulkarni, Mar Castanon, Benjamin Kao, Shasta Ihorn, Yue-Ting Siu, Ilmi Yoon:
Improved Image Caption Rating - Datasets, Game, and Model. CHI Extended Abstracts 2023: 172:1-172:7 - [c3]Lothar D. Narins, Andrew T. Scott, Aakash Gautam, Anagha Kulkarni, Mar Castanon, Benjamin Kao, Shasta Ihorn, Yue-Ting Siu, James M. Mason, Alexander Blum, Ilmi Yoon:
Validated Image Caption Rating Dataset. NeurIPS 2023 - 2021
- [c2]Aditya Bodi, Pooyan Fazli, Shasta Ihorn, Yue-Ting Siu, Andrew T. Scott, Lothar Narins, Yash Kant, Abhishek Das, Ilmi Yoon:
Automated Video Description for Blind and Low Vision Users. CHI Extended Abstracts 2021: 230:1-230:7
2010 – 2019
- 2018
- [j5]Penny Haxell, Lothar Narins:
A Stability Theorem for Matchings in Tripartite 3-Graphs. Comb. Probab. Comput. 27(5): 774-793 (2018) - [j4]Penny Haxell, Lothar Narins, Tibor Szabó:
Extremal hypergraphs for Ryser's Conjecture. J. Comb. Theory A 158: 492-547 (2018) - 2017
- [j3]Lothar Narins, Alexey Pokrovskiy, Tibor Szabó:
Graphs without proper subgraphs of minimum degree 3 and short cycles. Comb. 37(3): 495-519 (2017) - [j2]Dan Hefetz, Christopher Kusch, Lothar Narins, Alexey Pokrovskiy, Clément Requilé, Amir Sarid:
Strong Ramsey games: Drawing on an infinite board. J. Comb. Theory A 150: 248-266 (2017) - [j1]Lothar Narins, Tuan Tran:
A Density Turán Theorem. J. Graph Theory 85(2): 496-524 (2017) - 2016
- [c1]Tillmann Miltzow, Lothar Narins, Yoshio Okamoto, Günter Rote, Antonis Thomas, Takeaki Uno:
Approximation and Hardness of Token Swapping. ESA 2016: 66:1-66:15 - [i1]Tillmann Miltzow, Lothar Narins, Yoshio Okamoto, Günter Rote, Antonis Thomas, Takeaki Uno:
Tight Exact and Approximate Algorithmic Results on Token Swapping. CoRR abs/1602.05150 (2016)
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-10-14 23:24 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:
