default search action
Guillaume E. Scholz
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j13]Marc Hellmuth, Bruno J. Schmidt, Guillaume E. Scholz
, Sandhya Thekkumpadan Puthiyaveedu:
The complement of the Djoković-Winkler relation. Discret. Math. 348(3): 114328 (2025) - [j12]Katharina T. Huber, Leo van Iersel, Vincent Moulton, Guillaume E. Scholz:
Is this network proper forest-based? Inf. Process. Lett. 187: 106500 (2025) - 2024
- [j11]Marc Hellmuth
Resolving prime modules: The structure of pseudo-cographs and galled-tree explainable graphs. Discret. Appl. Math. 343: 25-43 (2024) - [j10]Anahy Santiago Arguello, Guillaume E. Scholz, Peter F. Stadler:
Core Potentials: The Consensus Segmentation Conjecture. Math. Comput. Sci. 18(4): 19 (2024) - [j9]Katharina T. Huber, Vincent Moulton, Guillaume E. Scholz:
Shared Ancestry Graphs and Symbolic Arboreal Maps. SIAM J. Discret. Math. 38(4): 2553-2577 (2024) - [i7]Anna Lindeberg, Guillaume E. Scholz, Marc Hellmuth:
Network Representation and Modular Decomposition of Combinatorial Structures: A Galled-Tree Perspective. CoRR abs/2406.18713 (2024) - 2023
- [j8]Richard A. Schäfer
RNA interaction format: a general data format for RNA interactions. Bioinform. 39(10) (2023) - [j7]Marc Hellmuth
Injective Split Systems. Graphs Comb. 39(4): 65 (2023) - [c1]Marc Hellmuth
Linear Time Algorithms for NP-Hard Problems Restricted to GaTEx Graphs. COCOON (1) 2023: 115-126 - [i6]Marc Hellmuth, Guillaume E. Scholz:
Linear Time Algorithms for NP-hard Problems restricted to GaTEx Graphs. CoRR abs/2306.04367 (2023) - [i5]Katharina T. Huber, Vincent Moulton, Guillaume E. Scholz:
Shared ancestry graphs and symbolic arboreal maps. CoRR abs/2308.06139 (2023) - [i4]Marc Hellmuth, Bruno J. Schmidt, Guillaume E. Scholz, Sandhya Thekkumpadan Puthiyaveedu:
The Complement of the Djokovic-Winkler Relation. CoRR abs/2311.18284 (2023) - 2022
- [j6]Katharina T. Huber
Overlaid species forests. Discret. Appl. Math. 309: 110-122 (2022) - [j5]Marc Hellmuth
From modular decomposition trees to level-1 networks: Pseudo-cographs, polar-cats and prime polar-cats. Discret. Appl. Math. 321: 179-219 (2022) - [i3]Marc Hellmuth, Guillaume E. Scholz:
Resolving Prime Modules: The Structure of Pseudo-cographs and Galled-Tree Explainable Graphs. CoRR abs/2211.16854 (2022) - 2021
- [j4]Guillaume E. Scholz, Benjamin Linard
Rapid screening and detection of inter-type viral recombinants using phylo-k-mers. Bioinform. 36(22-23): 5351-5360 (2021) - [i2]Marc Hellmuth, Guillaume E. Scholz:
Pseudo-Cographs, Polar-Cats and Level-1 Network Explainable Graphs. CoRR abs/2112.05537 (2021) - 2020
- [j3]Katharina T. Huber, Guillaume E. Scholz:
Phylogenetic networks that are their own fold-ups. Adv. Appl. Math. 113 (2020)
2010 – 2019
- 2019
- [j2]Katharina T. Huber, Vincent Moulton
Three-Way Symbolic Tree-Maps and Ultrametrics. J. Classif. 36(3): 513-540 (2019) - 2018
- [b1]Guillaume E. Scholz:
New algorithms and mathematical tools for phylogenetics beyond trees. University of East Anglia, Norwich, UK, 2018 - [j1]Katharina T. Huber, Guillaume E. Scholz:
Beyond Representing Orthology Relations by Trees. Algorithmica 80(1): 73-103 (2018) - 2016
- [i1]Katharina T. Huber, Guillaume E. Scholz:
Beyond representing orthology relations by trees. CoRR abs/1603.04632 (2016)
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-12-10 20:46 CET 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: