default search action
Tobias Gerlach
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j7]Gabriele Eichfelder
, Tobias Gerlach
A test instance generator for multiobjective mixed-integer optimization. Math. Methods Oper. Res. 100(1): 385-410 (2024) - 2021
- [c6]Tobias Gerlach
Generative Adversarial Networks for spot weld design. ETFA 2021: 1-8 - [c5]Tihomir Rohlinger, Le Ping Peng, Tobias Gerlach, Paul Pasler, Bo Zhang, Ralf Seepold
Deep Learning-based EEG Detection of Mental Alertness States from Drivers under Ethical Aspects. ICAAI 2021: 54-64 - [i1]Michael Danner, Thomas Weber, Le Ping Peng, Tobias Gerlach, Xueping Su, Matthias Rätsch:
Ethically aligned Deep Learning: Unbiased Facial Aesthetic Prediction. CoRR abs/2111.05149 (2021) - 2020
- [c4]Tobias Gerlach, Michael Danner
Who Loves Virtue as much as He Loves Beauty?: Deep Learning based Estimator for Aesthetics of Portraits. VISIGRAPP (5: VISAPP) 2020: 521-528
2010 – 2019
- 2018
- [c3]Tobias Gerlach, Lukas Rabenstein, Armin Dietz, Andreas Kremser, Dieter Gerling:
Determination of eddy current losses in permanent magnets of SPMSM with concentrated windings: A hybrid loss calculation method and experimental verification. EVER 2018: 1-8 - 2016
- [j6]Gabriele Eichfelder
A modification of the αBB method for box-constrained optimization and an application to inverse kinematics. EURO J. Comput. Optim. 4(1): 93-121 (2016) - 2012
- [c2]Rene Golembewski, Günter Schäfer, Tobias Gerlach
Efficient communication for large-scale robust image processing with smart camera devices. CISDA 2012: 1-8 - 2011
- [c1]Sander Wozniak, Tobias Gerlach, Guenter Schaefer:
Optimization-based Secure Multi-hop Localization in Wireless Ad Hoc Networks. KiVS 2011: 182-187
2000 – 2009
- 2008
- [j5]Thomas Böhme, Tobias Gerlach
Ordered and linked chordal graphs. Discuss. Math. Graph Theory 28(2): 367-373 (2008) - 2007
- [j4]Tobias Gerlach
On a cycle through a specified linear forest of a graph. Discret. Math. 307(7-8): 892-895 (2007) - 2006
- [j3]Tobias Gerlach
On cycles through specified vertices. Discret. Math. 306(8-9): 831-835 (2006) - 2004
- [j2]Tobias Gerlach
Toughness and Hamiltonicity of a class of planar graphs. Discret. Math. 286(1-2): 61-65 (2004) - 2002
- [j1]Tobias Gerlach
A note on domination in bipartite graphs. Discuss. Math. Graph Theory 22(2): 229-231 (2002)
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-09-21 23:40 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: