default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDManuela Geiß
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j9]David Schaller
, Manuela Geiß, Marc Hellmuth, Peter F. Stadler:
Best Match Graphs With Binary Trees. IEEE ACM Trans. Comput. Biol. Bioinform. 20(3): 1679-1690 (2023)- [c5]Raphael Wagner, Mario Matuschek, Philipp Knaack, Michael Zwick, Manuela Geiß:
IndustrialEdgeML - End-to-end edge-based computer vision systemfor Industry 5.0. ISM 2023: 594-603 - 2022
- [j8]Dulce I. Valdivia, Maribel Hernández-Rosales, Manuela Geiß, Peter F. Stadler, Marc Hellmuth:
Hierarchical and modularly-minimal vertex colorings. Art Discret. Appl. Math. 6(2): 2 (2022) - [c4]Manuela Geiß, Martin Baresch, Georgios C. Chasparis, Edwin Schweiger, Nico Teringl, Michael Zwick:
Fast and Automatic Object Registration for Human-Robot Collaboration in Industrial Manufacturing. DEXA Workshops 2022: 232-242 - [i15]Manuela Geiß, Martin Baresch, Georgios C. Chasparis, Edwin Schweiger, Nico Teringl, Michael Zwick:
Fast and Automatic Object Registration for Human-Robot Collaboration in Industrial Manufacturing. CoRR abs/2204.00597 (2022) - [i14]Manuela Geiß, Raphael Wagner, Martin Baresch, Josef Steiner, Michael Zwick:
Automatic Bounding Box Annotation with Small Training Data Sets for Industrial Manufacturing. CoRR abs/2206.00280 (2022) - 2021
- [j7]David Schaller, Manuela Geiß, Marc Hellmuth, Peter F. Stadler:
Arc-Completion of 2-Colored Best Match Graphs to Binary-Explainable Best Match Graphs. Algorithms 14(4): 110 (2021) - [j6]David Schaller, Manuela Geiß, Marc Hellmuth, Peter F. Stadler:
Heuristic algorithms for best match graph editing. Algorithms Mol. Biol. 16(1): 19 (2021) - [j5]David Schaller, Manuela Geiß, Marc Hellmuth, Peter F. Stadler:
Least resolved trees for two-colored best match graphs. J. Graph Algorithms Appl. 25(1): 397-416 (2021) - [c3]David Schaller, Manuela Geiß, Marc Hellmuth, Peter F. Stadler:
Best Match Graphs with Binary Trees. AlCoB 2021: 82-93 - [i13]David Schaller, Manuela Geiß, Marc Hellmuth, Peter F. Stadler:
Least resolved trees for two-colored best match graphs. CoRR abs/2101.07000 (2021) - [i12]David Schaller, Manuela Geiß, Marc Hellmuth, Peter F. Stadler:
Arc-Completion of 2-Colored Best Match Graphs to Binary-Explainable Best Match Graphs. CoRR abs/2103.06665 (2021) - [i11]Florian Sobieczky, Salma Mahmoud, Simon Neugebauer, Lukas Rippitsch, Manuela Geiß:
Explainable AI by BAPC - Before and After correction Parameter Comparison. CoRR abs/2103.07155 (2021) - [i10]David Schaller, Manuela Geiß, Marc Hellmuth, Peter F. Stadler:
Heuristic Algorithms for Best Match Graph Editing. CoRR abs/2103.07280 (2021) - 2020
- [j4]Peter F. Stadler, Manuela Geiß, David Schaller, Alitzel López Sánchez, Marcos E. González Laffitte, Dulce I. Valdivia, Marc Hellmuth, Maribel Hernandez-Rosales:
From pairs of most similar sequences to phylogenetic best matches. Algorithms Mol. Biol. 15(1): 5 (2020) - [j3]Marc Hellmuth, Manuela Geiß, Peter F. Stadler:
Complexity of modification problems for reciprocal best match graphs. Theor. Comput. Sci. 809: 384-393 (2020) - [c2]Simon Neugebauer, Lukas Rippitsch, Florian Sobieczky, Manuela Geiß:
Explainability of AI-predictions based on psychological profiling. ISM 2020: 1003-1012 - [i9]Dulce I. Valdivia, Manuela Geiß, Maribel Hernández-Rosales, Peter F. Stadler, Marc Hellmuth:
Hierarchical and Modularly-Minimal Vertex Colorings. CoRR abs/2004.06340 (2020) - [i8]David Schaller, Manuela Geiß, Peter F. Stadler, Marc Hellmuth:
Complete Characterization of Incorrect Orthology Assignments in Best Match Graphs. CoRR abs/2006.02249 (2020) - [i7]David Schaller, Manuela Geiß, Marc Hellmuth, Peter F. Stadler:
Best Match Graphs with Binary Trees. CoRR abs/2011.00511 (2020)
2010 – 2019
- 2019
- [b1]Manuela Geiß:
From Best Match Graphs to Gene Trees: A new perspective on graph-based orthology inference. Leipzig University, Germany, 2019 - [i6]Manuela Geiß, Marcos González, Alitzel López Sánchez, Dulce I. Valdivia, Marc Hellmuth, Maribel Hernández-Rosales, Peter F. Stadler:
Best Match Graphs and Reconciliation of Gene Trees with Species Trees. CoRR abs/1904.12021 (2019) - [i5]Dulce I. Valdivia, Manuela Geiß, Marc Hellmuth, Maribel Hernández-Rosales, Peter F. Stadler:
Hierarchical Colorings of Cographs. CoRR abs/1906.10031 (2019) - [i4]Marc Hellmuth, Manuela Geiß, Peter F. Stadler:
Complexity of Modification Problems for Reciprocal Best Match Graphs. CoRR abs/1907.08865 (2019) - 2018
- [j2]Marc Hellmuth, Yangjing Long, Manuela Geiß, Peter F. Stadler:
A short note on undirected Fitch graphs. Art Discret. Appl. Math. 1(1): #P1.08 (2018) - [j1]Nikolai Nøjgaard, Manuela Geiß, Daniel Merkle, Peter F. Stadler, Nicolas Wieseke, Marc Hellmuth:
Time-consistent reconciliation maps and forbidden time travel. Algorithms Mol. Biol. 13(1): 2:1-2:17 (2018) - 2017
- [c1]Nikolai Nøjgaard, Manuela Geiß, Daniel Merkle, Peter F. Stadler, Nicolas Wieseke, Marc Hellmuth:
Forbidden Time Travel: Characterization of Time-Consistent Tree Reconciliation Maps. WABI 2017: 17:1-17:12 - [i3]Nikolai Nøjgaard, Manuela Geiß, Peter F. Stadler, Daniel Merkle, Nicolas Wieseke, Marc Hellmuth:
Forbidden Time Travel: Characterization of Time-Consistent Tree Reconciliation Maps. CoRR abs/1705.02179 (2017) - [i2]Manuela Geiß, John Anders, Peter F. Stadler, Nicolas Wieseke, Marc Hellmuth:
Reconstructing Gene Trees From Fitch's Xenology Relation. CoRR abs/1711.02152 (2017) - [i1]Manuela Geiß, Marc Hellmuth, Yangjing Long, Peter F. Stadler:
A Short Note on Undirected Fitch Graphs. CoRR abs/1712.01544 (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 2024-09-09 01:16 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:
