default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLars Prädel
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[c12]Uwe Gruenefeld, Lars Prädel, Jannike Illing, Tim Claudius Stratmann, Sandra Drolshagen, Max Pfingsthorn
:
Mind the ARm: realtime visualization of robot motion intent in head-mounted augmented reality. MuC 2020: 259-266
2010 – 2019
- 2019
- [c11]Uwe Gruenefeld, Lars Prädel, Wilko Heuten:
Improving Search Time Performance for Locating Out-of-View Objects in Augmented Reality. MuC 2019: 481-485 - [c10]Uwe Gruenefeld, Lars Prädel, Wilko Heuten:
Locating nearby physical objects in augmented reality. MUM 2019: 1:1-1:10 - 2018
- [c9]Uwe Gruenefeld, Tim Claudius Stratmann, Lars Prädel, Wilko Heuten:
MonoculAR: a radial light display to point towards out-of-view objects on augmented reality devices. MobileHCI Adjunct 2018: 16-22 - 2017
- [c8]Lars Prädel, Gerlinde Schreiber:
Hochschule als außerschulischer Lernort für Schülerinnen und Schüler: Ein pragmatisches Angebot. INFOS 2017: 221-226 - 2016
- [j4]Klaus Jansen, Lars Prädel:
New Approximability Results for Two-Dimensional Bin Packing. Algorithmica 74(1): 208-269 (2016) - 2014
- [j3]Rolf Harren, Klaus Jansen, Lars Prädel, Rob van Stee:
A (5/3 + ε)-approximation for strip packing. Comput. Geom. 47(2): 248-267 (2014) - [c7]Klaus Jansen, Lars Prädel:
A New Asymptotic Approximation Algorithm for 3-Dimensional Strip Packing. SOFSEM 2014: 327-338 - 2013
- [b1]Lars Prädel:
Approximation Algorithms for Geometric Packing Problems. University of Kiel, 2013 - [j2]Rolf Harren, Klaus Jansen, Lars Prädel, Ulrich M. Schwarz, Rob van Stee:
Two for One: Tight Approximation of 2D Bin Packing. Int. J. Found. Comput. Sci. 24(8): 1299-1328 (2013) - [c6]Klaus Jansen, Lars Prädel:
New Approximability Results for Two-Dimensional Bin Packing. SODA 2013: 919-936 - 2012
- [j1]Florian Diedrich, Klaus Jansen, Lars Prädel, Ulrich M. Schwarz, Ola Svensson:
Tight approximation algorithms for scheduling with fixed jobs and nonavailability. ACM Trans. Algorithms 8(3): 27:1-27:15 (2012) - [c5]Rolf Harren, Klaus Jansen, Lars Prädel, Rob van Stee:
A (5/3 + eps)-Approximation for 2D Strip Packing. CTW 2012: 139-142 - 2011
- [c4]Klaus Jansen, Lars Prädel, Ulrich M. Schwarz, Ola Svensson:
Faster Approximation Algorithms for Scheduling with Fixed Jobs. CATS 2011: 3-10 - [c3]Rolf Harren, Klaus Jansen, Lars Prädel, Rob van Stee:
A (5/3 + ε)-Approximation for Strip Packing. WADS 2011: 475-487
2000 – 2009
- 2009
- [c2]Nikhil Bansal, Alberto Caprara, Klaus Jansen, Lars Prädel, Maxim Sviridenko:
A Structural Lemma in 2-Dimensional Packing, and Its Implications on Approximability. ISAAC 2009: 77-86 - [c1]Klaus Jansen, Lars Prädel, Ulrich M. Schwarz:
Two for One: Tight Approximation of 2D Bin Packing. WADS 2009: 399-410
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:53 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:
