Остановите войну!
for scientists:
default search action
Andreas W. M. Dress
- > Home > Persons > Andreas W. M. Dress
Publications
- 2016
- [j63]Andreas W. M. Dress, Katharina T. Huber, Jacobus H. Koolen, Vincent Moulton, Andreas Spillner:
Characterizing block graphs in terms of their vertex-induced partitions. Australas. J Comb. 66: 1-9 (2016) - 2012
- [b1]Andreas W. M. Dress, Katharina T. Huber, Jacobus H. Koolen, Vincent Moulton, Andreas Spillner:
Basic Phylogenetic Combinatorics. Cambridge University Press 2012, ISBN 978-0-521-76832-0, pp. I-XII, 1-264 - 2011
- [j55]Andreas W. M. Dress, Katharina T. Huber, Jacobus H. Koolen, Vincent Moulton:
Blocks and Cut Vertices of the Buneman Graph. SIAM J. Discret. Math. 25(4): 1902-1919 (2011) - 2010
- [j53]Andreas W. M. Dress, Katharina T. Huber, Jacobus H. Koolen, Vincent Moulton, Andreas Spillner:
An Algorithm for Computing Cutpoints in Finite Metric Spaces. J. Classif. 27(2): 158-172 (2010) - 2009
- [j52]Andreas W. M. Dress, Katharina T. Huber, Jacobus H. Koolen, Vincent Moulton:
A graph-theoretical invariant of topological spaces. Appl. Math. Lett. 22(2): 159-162 (2009) - [i1]Andreas W. M. Dress, Katharina T. Huber, Jacobus H. Koolen, Vincent Moulton, Andreas Spillner:
An algorithm for computing cutpoints in finite metric spaces. CoRR abs/0910.2317 (2009) - 2008
- [j44]Andreas W. M. Dress, Katharina T. Huber, Jacobus H. Koolen, Vincent Moulton:
Cut points in metric spaces. Appl. Math. Lett. 21(6): 545-548 (2008) - [j43]Andreas W. M. Dress, Katharina T. Huber, Jacobus H. Koolen, Vincent Moulton:
Block realizations of finite metrics and the tight-span construction I: The embedding theorem. Appl. Math. Lett. 21(12): 1306-1309 (2008) - [j42]Andreas W. M. Dress, Katharina T. Huber, Jacobus H. Koolen, Vincent Moulton:
Compatible decompositions and block realizations of finite metrics. Eur. J. Comb. 29(7): 1617-1633 (2008) - 2007
- [c7]Andreas W. M. Dress, Katharina T. Huber, Jacobus H. Koolen, Vincent Moulton:
An Algorithm for Computing Virtual Cut Points in Finite Metric Spaces. COCOA 2007: 4-10 - 2006
- [j37]Hans-Jürgen Bandelt, Victor Chepoi, Andreas W. M. Dress, Jack H. Koolen:
Combinatorics of lopsided sets. Eur. J. Comb. 27(5): 669-689 (2006) - 2005
- [j36]Andreas W. M. Dress, Barbara R. Holland, Katharina T. Huber, Jack H. Koolen, Vincent Moulton, Jan Weyer-Menkhoff:
Delta additive and Delta ultra-additive maps, Gromov's trees, and the Farris transform. Discret. Appl. Math. 146(1): 51-73 (2005) - 2003
- [j25]Andreas W. M. Dress, Jack H. Koolen, Vincent Moulton:
Addendum to "on line arrangements in the hyperbolic plane" [European J. Combin.23 (2002) 549-557]. Eur. J. Comb. 24(3): 347 (2003) - 2002
- [j20]Andreas W. M. Dress, Jack H. Koolen, Vincent Moulton:
On Line Arrangements in the Hyperbolic Plane. Eur. J. Comb. 23(5): 549-557 (2002) - 2001
- [j19]Andreas W. M. Dress, Katharina T. Huber, Jacobus H. Koolen, Vincent Moulton:
Six Points Suffice: How to Check for Metric Consistency. Eur. J. Comb. 22(4): 465-474 (2001)
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 2023-10-01 22:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint