default search action
Lukas Faber
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [b1]Lukas Faber:
Explaining and Improving Communication in Graph Neural Networks. ETH Zurich, Zürich, Switzerland, 2024 - [c9]Peter Müller, Lukas Faber, Karolis Martinkus, Roger Wattenhofer:
GraphChef: Decision-Tree Recipes to Explain Graph Neural Networks. ICLR 2024 - 2023
- [c8]Lukas Faber, Roger Wattenhofer:
Neural Status Registers. ICML 2023: 9508-9522 - [c7]Lukas Faber, Roger Wattenhofer:
GwAC: GNNs With Asynchronous Communication. LoG 2023: 8 - 2022
- [i8]Lukas Faber, Roger Wattenhofer:
Asynchronous Neural Networks for Learning in Graphs. CoRR abs/2205.12245 (2022) - [i7]Peter Müller, Lukas Faber, Karolis Martinkus, Roger Wattenhofer:
DT+GNN: A Fully Explainable Graph Neural Network using Decision Trees. CoRR abs/2205.13234 (2022) - 2021
- [c6]Lukas Faber, Amin K. Moghaddam, Roger Wattenhofer:
When Comparing to Ground Truth is Wrong: On Evaluating GNN Explanation Methods. KDD 2021: 332-341 - [c5]Pál András Papp, Karolis Martinkus, Lukas Faber, Roger Wattenhofer:
DropGNN: Random Dropouts Increase the Expressiveness of Graph Neural Networks. NeurIPS 2021: 21997-22009 - [i6]Nikola Jovanovic, Zhao Meng, Lukas Faber, Roger Wattenhofer:
Towards Robust Graph Contrastive Learning. CoRR abs/2102.13085 (2021) - [i5]Lukas Faber, Yifan Lu, Roger Wattenhofer:
Should Graph Neural Networks Use Features, Edges, Or Both? CoRR abs/2103.06857 (2021) - [i4]Pál András Papp, Karolis Martinkus, Lukas Faber, Roger Wattenhofer:
DropGNN: Random Dropouts Increase the Expressiveness of Graph Neural Networks. CoRR abs/2111.06283 (2021) - 2020
- [i3]Lukas Faber, Roger Wattenhofer:
Neural Status Registers. CoRR abs/2004.07085 (2020) - [i2]Lukas Faber, Sandro Luck, Damian Pascual, Andreas Roth, Gino Brunner, Roger Wattenhofer:
Medley2K: A Dataset of Medley Transitions. CoRR abs/2008.11159 (2020) - [i1]Lukas Faber, Amin K. Moghaddam, Roger Wattenhofer:
Contrastive Graph Neural Network Explanation. CoRR abs/2010.13663 (2020)
2010 – 2019
- 2019
- [c4]Tara Safavi, Caleb Belth, Lukas Faber, Davide Mottin
, Emmanuel Müller, Danai Koutra:
Personalized Knowledge Graph Summarization: From the Cloud to Your Pocket. ICDM 2019: 528-537 - 2018
- [c3]Cindy Perscheid, Lukas Faber, Milena Kraus, Paul Arndt, Michael Janke, Sebastian Rehfeldt, Antje Schubotz, Tamara Slosarek, Matthias Uflacker:
A Tissue-aware Gene Selection Approach for Analyzing Multi-tissue Gene Expression Data. BIBM 2018: 2159-2166 - [c2]Erik Scharwächter, Fabian Geier, Lukas Faber, Emmanuel Müller:
Low Redundancy Estimation of Correlation Matrices for Time Series Using Triangular Bounds. PAKDD (2) 2018: 458-470 - 2017
- [c1]Sebastian Serth
Serving Live Multimedia for the Linked Open Data Cloud. GI-Jahrestagung 2017: 2487-2498
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-08-08 19:19 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: