default search action
Marco Morik
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i6]Lorenz Linhardt, Marco Morik, Sidney Bender, Naima Elosegui Borras:
An Analysis of Human Alignment of Latent Diffusion Models. CoRR abs/2403.08469 (2024) - [i5]Marco Morik, Ali Hashemi, Klaus-Robert Müller, Stefan Haufe, Shinichi Nakajima:
Enhancing Brain Source Reconstruction through Physics-Informed 3D Neural Networks. CoRR abs/2411.00143 (2024) - [i4]Laure Ciernik, Lorenz Linhardt, Marco Morik, Jonas Dippel, Simon Kornblith, Lukas Muttenthaler:
Training objective drives the consistency of representational similarity across datasets. CoRR abs/2411.05561 (2024) - 2021
- [c5]Marco Morik, Ashudeep Singh, Jessica Hong, Thorsten Joachims:
Controlling Fairness and Bias in Dynamic Learning-to-Rank (Extended Abstract). IJCAI 2021: 4804-4808 - 2020
- [c4]Marco Morik, Ashudeep Singh, Jessica Hong, Thorsten Joachims:
Controlling Fairness and Bias in Dynamic Learning-to-Rank. SIGIR 2020: 429-438 - [i3]Marco Morik, Ashudeep Singh, Jessica Hong, Thorsten Joachims:
Controlling Fairness and Bias in Dynamic Learning-to-Rank. CoRR abs/2005.14713 (2020)
2010 – 2019
- 2019
- [j2]Till Fluschnik, Marco Morik, Manuel Sorge:
The complexity of routing with collision avoidance. J. Comput. Syst. Sci. 102: 69-86 (2019) - [j1]Matthias Bentert, Anne-Sophie Himmel, Hendrik Molter, Marco Morik, Rolf Niedermeier, René Saitenmacher:
Listing All Maximal k-Plexes in Temporal Graphs. ACM J. Exp. Algorithmics 24(1): 1.13:1-1.13:27 (2019) - [c3]Marco Morik, Divyam Rastogi, Rico Jonschkowski, Oliver Brock:
State Representation Learning with Robotic Priors for Partially Observable Environments. IROS 2019: 6693-6699 - 2018
- [c2]Matthias Bentert, Anne-Sophie Himmel, Hendrik Molter, Marco Morik, Rolf Niedermeier, René Saitenmacher:
Listing All Maximal k-Plexes in Temporal Graphs. ASONAM 2018: 41-46 - [i2]Matthias Bentert, Anne-Sophie Himmel, Hendrik Molter, Marco Morik, Rolf Niedermeier, René Saitenmacher:
Listing All Maximal k-Plexes in Temporal Graphs. CoRR abs/1806.10210 (2018) - 2017
- [c1]Till Fluschnik, Marco Morik, Manuel Sorge:
The Complexity of Routing with Few Collisions. FCT 2017: 257-270 - [i1]Till Fluschnik, Marco Morik, Manuel Sorge:
The Complexity of Routing with Few Collisions. CoRR abs/1705.03673 (2017)
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 2025-01-09 12:49 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint