default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndreas Dress
Andreas W. M. Dress
Person information
- affiliation: University of Bielefeld, Germany
- affiliation: CAS-MPG Partner Institute for Computational Biology (PICB), Shanghai, China
- affiliation: Max Planck Institute for Mathematics in the Sciences, Leipzig, Germany
- affiliation (PhD 1962): University of Kiel, Germany
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
showing all ?? records
2020 – today
- 2026
[i7]Hans-Jürgen Bandelt, Victor Chepoi, Andreas Dress, Jack H. Koolen:
Geometry of ample/lopsided sets. CoRR abs/2603.27835 (2026)
2010 – 2019
- 2019
- [c11]Andreas W. M. Dress, Hiroshi Maehara, Sabrina Xing Mei Pang, Zhenbing Zeng
:
On the Structure of Discrete Metric Spaces Isometric to Circles. AAIM 2019: 83-94 - 2016
- [j64]Andreas 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) - 2014
- [j63]Andreas Dress, Michal Linial, Olga G. Troyanskaya, Martin Vingron:
ISCB/SPRINGER series in computational biology. Bioinform. 30(1): 146-147 (2014) - [j62]Andreas Dress, Katharina T. Huber, Mike A. Steel:
A matroid associated with a phylogenetic tree. Discret. Math. Theor. Comput. Sci. 16(2): 41-56 (2014) - [j61]Walter Schubert, Andreas Dress, Mika Ruonala, Andreas Krusche, Reyk Hillert, Anne Gieseler, Peter Walden:
Imaging cycler microscopy. Proc. Natl. Acad. Sci. USA 111(2): E215 (2014) - [p1]William Y. C. Chen, Andreas Dress, Winking Q. Yu:
Detecting Community Structures in Networks Using a Linear-Programming Based Approach: a Review. Social Networks: A Framework of Computational Intelligence 2014: 1-19 - 2013
- [j60]Alberto Apostolico, Matteo Comin, Andreas Dress, Laxmi Parida:
Ultrametric networks: a new tool for phylogenetic analysis. Algorithms Mol. Biol. 8: 7 (2013) - [j59]Jonas S. Almeida, Andreas Dress, Titus Kühne, Laxmi Parida:
ICT for Bridging Biology and Medicine (Dagstuhl Perspectives Workshop 13342). Dagstuhl Manifestos 3(1): 31-50 (2013) - [j58]Andreas Dress, Vincent Moulton, Andreas Spillner, Taoyang Wu:
Obtaining splits from cut sets of tight spans. Discret. Appl. Math. 161(10-11): 1409-1420 (2013) - [i6]Jonas S. Almeida, Andreas Dress, Titus Kühne, Laxmi Parida:
ICT Strategies for Bridging Biology and Precision Medicine (Dagstuhl Perspectives Workshop 13342). Dagstuhl Reports 3(8): 87-135 (2013) - 2012
- [b1]Andreas 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 - [c10]Bernhard Balkenhol, Andreas Dress, Anna Falkenhain:
Translationale und personalisierte Medizin -ein Einsatzfeld für SOA, Grid und Cloud. GI-Jahrestagung 2012: 1146-1153 - [i5]Alberto Apostolico, Andreas Dress, Laxmi Parida:
Structure Discovery in Biology: Motifs, Networks & Phylogenies (Dagstuhl Seminar 12291). Dagstuhl Reports 2(7): 92-117 (2012) - 2011
- [j57]Andreas W. M. Dress, Wei Lin:
Dynamics of a Discrete-Time Model of an "Ideal-Storage" System Describing Hetero-Catalytic Processes on metal Surfaces. Int. J. Bifurc. Chaos 21(5): 1331-1339 (2011) - [j56]Jeffrey Q. Jiang, Andreas W. M. Dress, Ming Chen:
Retraction: Towards Prediction and Prioritization of disease genes by the modularity of human phenome-genome assembled network. J. Integr. Bioinform. 8(1) (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) - [i4]Andreas W. M. Dress, Katharina T. Huber, Michael Anthony Steel:
'Lassoing' a phylogenetic tree I: Basic properties, shellings, and covers. CoRR abs/1102.0309 (2011) - 2010
- [j54]Andreas W. M. Dress, Taoyang Wu, XiaoMing Xu:
A note on single-linkage equivalence. Appl. Math. Lett. 23(4): 432-435 (2010) - [j53]Andreas 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) - [e2]Alberto Apostolico, Andreas Dress, Laxmi Parida:
Structure Discovery in Biology: Motifs, Networks & Phylogenies, 06.06. - 11.06.2010. Dagstuhl Seminar Proceedings 10231, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2010 [contents] - [i3]Alberto Apostolico, Andreas Dress, Laxmi Parida:
10231 Abstracts Collection - Structure Discovery in Biology: Motifs, Networks & Phylogenies. Structure Discovery in Biology: Motifs, Networks & Phylogenies 2010 - [i2]Andreas Dress, Wim Hordijk, Lin Wei, Peter Serocka:
The Ideal Storage Cellular Automaton Model. Structure Discovery in Biology: Motifs, Networks & Phylogenies 2010
2000 – 2009
- 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) - [j51]Andreas W. M. Dress, Vincent Moulton, Andreas Spillner, Taoyang Wu:
Barriers in metric spaces. Appl. Math. Lett. 22(8): 1150-1153 (2009) - [j50]Jeffrey Q. Jiang, Andreas W. M. Dress, Genke Yang:
A spectral clustering-based framework for detecting community structures in complex networks. Appl. Math. Lett. 22(9): 1479-1482 (2009) - [j49]Andreas Dress, Mike A. Steel:
A Hall-type theorem for triplet set systems based on medians in trees. Appl. Math. Lett. 22(12): 1789-1792 (2009) - [j48]Andreas Dress, Bülent Karasözen, Peter F. Stadler, Gerhard-Wilhelm Weber:
Preface. Discret. Appl. Math. 157(10): 2217-2220 (2009) - [j47]Andreas Dress:
Split decomposition over an abelian group, Part 2: Group-valued split systems with weakly compatible support. Discret. Appl. Math. 157(10): 2349-2360 (2009) - [c9]Jeffrey Q. Jiang, Andreas W. M. Dress, Ming Chen:
Towards Identification of Human Disease Phenotype-Genotype Association via a Network-Module Based Method. BIBM 2009: 222-227 - [i1]Andreas 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
- [j46]Andreas W. M. Dress, Christoph Flamm, Guido Fritzsch, Stefan Grünewald, Matthias Kruspe, Sonja J. Prohaska, Peter F. Stadler:
Noisy: Identification of problematic columns in multiple sequence alignments. Algorithms Mol. Biol. 3 (2008) - [j45]Holger Wagner, Burkhard Morgenstern, Andreas Dress:
Stability of multiple alignments and phylogenetic trees: an analysis of ABC-transporter proteins family. Algorithms Mol. Biol. 3 (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) - [j41]Andreas Dress, Yinfeng Xu, Binhai Zhu:
Preface. J. Comb. Optim. 16(2): 97-98 (2008) - [j40]William Y. C. Chen, Andreas W. M. Dress, Winking Q. Yu:
Community Structures of Networks. Math. Comput. Sci. 1(3): 441-457 (2008) - [c8]Andreas Dress:
Recent Progress in Phylogenetic Combinatorics. APBC 2008: 1-4 - 2007
- [j39]Jianguo Qian, Andreas Dress, Yan Wang:
On the dependence polynomial of a graph. Eur. J. Comb. 28(1): 337-346 (2007) - [j38]David Bryant, Andreas Dress:
Linearly independent split systems. Eur. J. Comb. 28(6): 1814-1831 (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 - [e1]Andreas Dress, Yinfeng Xu, Binhai Zhu:
Combinatorial Optimization and Applications, First International Conference, COCOA 2007, Xi'an, China, August 14-16, 2007, Proceedings. Lecture Notes in Computer Science 4616, Springer 2007, ISBN 978-3-540-73555-7 [contents] - 2006
- [j37]Hans-Jürgen Bandelt, Victor Chepoi, Andreas Dress, Jack H. Koolen:
Combinatorics of lopsided sets. Eur. J. Comb. 27(5): 669-689 (2006) - 2005
- [j36]Andreas 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) - 2004
- [j35]Andreas Dress, Stefan Grünewald, Dragan Stevanovic:
Semiharmonic graphs with fixed cyclomatic number. Appl. Math. Lett. 17(6): 623-629 (2004) - [j34]Andreas Dress, Tatiana Lokot, L. D. Pustyl'nikov:
A new scale-invariant geometry on L1 spaces. Appl. Math. Lett. 17(7): 815-820 (2004) - [j33]Andreas W. M. Dress, Daniel H. Huson:
Constructing Splits Graphs. IEEE ACM Trans. Comput. Biol. Bioinform. 1(3): 109-115 (2004) - 2003
- [j32]Andreas Dress, Dragan Stevanovic:
Hoffman-type identities. Appl. Math. Lett. 16(3): 297-302 (2003) - [j31]Andreas Dress, Ivan Gutman:
Asymptotic results regarding the number of walks in a graph. Appl. Math. Lett. 16(3): 388-393 (2003) - [j30]Dietmar Cieslik, Andreas Dress, Katharina T. Huber, Vincent Moulton:
Connectivity calculus. Appl. Math. Lett. 16(3): 395-399 (2003) - [j29]Andreas Dress, Ivan Gutman:
The number of walks in a grap. Appl. Math. Lett. 16(5): 797-801 (2003) - [j28]Andreas Dress, Tatiana Lokot:
A simple proof of the triangle inequality for the NTV metric. Appl. Math. Lett. 16(6): 809-813 (2003) - [j27]Andreas Dress, Stefan Grünewald:
Semiharmonic trees and monocyclic graphs. Appl. Math. Lett. 16(8): 1329-1332 (2003) - [j26]Burkhard Morgenstern, Sachin Goel, Alexander Sczyrba, Andreas Dress:
AltAVisT: Comparing alternative multiple sequence alignments. Bioinform. 19(3): 425-426 (2003) - [j25]Andreas 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
- [j24]Dietmar Cieslik, Andreas Dress, Walter M. Fitch:
Steiner's problem in double trees. Appl. Math. Lett. 15(7): 855-860 (2002) - [j23]Andreas Dress:
Proper gromov transforms of metrics are metrics. Appl. Math. Lett. 15(8): 995-999 (2002) - [j22]Burkhard Morgenstern, Oliver Rinner, Saïd Abdeddaïm, Dirk Haase, Klaus F. X. Mayer, Andreas W. M. Dress, Hans-Werner Mewes:
Exon discovery by genomic sequence alignment. Bioinform. 18(6): 777-787 (2002) - [j21]Andreas Dress, Katharina T. Huber, Vincent Moulton:
Antipodal Metrics and Split Systems. Eur. J. Comb. 23(2): 187-200 (2002) - [j20]Andreas Dress, Jack H. Koolen, Vincent Moulton:
On Line Arrangements in the Hyperbolic Plane. Eur. J. Comb. 23(5): 549-557 (2002) - 2001
- [j19]Andreas 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) - 2000
- [j18]Andreas Dress, Katharina T. Huber, Vincent Moulton:
Affine Maps That Induce Polyhedral Complex Isomorphisms. Discret. Comput. Geom. 24(1): 49-60 (2000) - [j17]Sebastian Böcker, David Bryant, Andreas W. M. Dress, Mike A. Steel:
Algorithmic Aspects of Tree Amalgamation. J. Algorithms 37(2): 522-537 (2000)
1990 – 1999
- 1999
- [j16]Andreas Dress, Katharina T. Huber, Vincent Moulton:
Some new perspectives regarding sparse continuous models for discrete data structures. Electron. Notes Discret. Math. 2: 69-75 (1999) - [c6]Xin Chen, Andreas W. M. Dress, Holger Karas, Ingmar Reuter, Edgar Wingender:
A database framework for mapping expression patterns. German Conference on Bioinformatics 1999: 174-178 - 1998
- [j15]Burkhard Morgenstern, Kornelie Frech, Andreas Dress, Thomas Werner:
DIALIGN: finding local similarities by multiple sequence alignment. Bioinform. 14(3): 290-294 (1998) - [j14]Nikolai P. Dolbilin, Andreas W. M. Dress, Daniel H. Huson:
Two Finiteness Theorems for Periodic Tilings of d-Dimensional Euclidean Space. Discret. Comput. Geom. 20(2): 143-153 (1998) - [c5]Burkhard Morgenstern, William R. Atchley, Klaus Hahn, Andreas Dress:
Segment-Based Scores for Pairwise and Multiple Sequence Alignments. ISMB 1998: 115-121 - 1997
- [j13]Jens Stoye, Vincent Moulton, Andreas W. M. Dress:
DCA: an efficient implementation of the divide-and-conquer approach to simultaneous multiple sequence alignment. Comput. Appl. Biosci. 13(6): 625-626 (1997) - [j12]Gunnar Brinkmann, Andreas W. M. Dress:
A Constructive Enumeration of Fullerenes. J. Algorithms 23(2): 345-358 (1997) - [j11]Darko Babic, Gunnar Brinkmann, Andreas Dress:
Topological Resonance Energy of Fullerenes. J. Chem. Inf. Comput. Sci. 37(5): 920-923 (1997) - [j10]Gunnar Brinkmann, Andreas W. M. Dress, Sören Perrey, Jens Stoye:
Two applications of the Divide&Conquer principle in the molecular sciences. Math. Program. 79: 71-97 (1997) - [c4]Andreas Dress:
Iterative versus simultaneous Multiple Sequence Alignment (Abstract). CPM 1997: 275 - 1996
- [j9]Andreas Dress, Daniel H. Huson, Vincent Moulton:
Analyzing and Visualizing Sequence and Distance Data Using SplitsTree. Discret. Appl. Math. 71(1-3): 95-109 (1996) - [j8]Andreas Dress, Vincent Moulton, Werner F. Terhalle:
T-theory: An Overview. Eur. J. Comb. 17(2-3): 161-175 (1996) - [c3]Andreas Dress:
Towards a theory of holistic clustering. Mathematical Hierarchies and Biology 1996: 271-290 - [c2]C. Stock, B. Volkmer, Udo Tönges, M. Silva, Andreas Dress, Andreas Krämer:
Vergleichende Analyse von HTLV-I-Nukleotidsequenzen mittels Split-Zerlegungsmethode. GMDS 1996: 533-537 - 1995
- [c1]Andreas Dress, Georg Füllen, Sören Perrey:
A Divide and Conquer Approach to Multiple Alignment. ISMB 1995: 107-113 - 1994
- [j7]Hans-Jürgen Bandelt, Andreas W. M. Dress:
An order theoretic framework for overlapping clustering. Discret. Math. 136(1-3): 21-37 (1994) - 1991
- [j6]Andreas W. M. Dress, Timothy F. Havel:
Bound Smoothing under Chirality Constraints. SIAM J. Discret. Math. 4(4): 535-549 (1991) - [j5]Michael Clausen, Andreas Dress, Johannes Grabmeier, Marek Karpinski:
On Zero-Testing and Interpolation of k-Sparse Multivariate Polynomials Over Finite Fields. Theor. Comput. Sci. 84(2): 151-164 (1991)
1980 – 1989
- 1988
- [j4]Andreas W. M. Dress, Timothy F. Havel:
Shortest-path problems and molecular conformation. Discret. Appl. Math. 19(1-3): 129-144 (1988) - [j3]Andreas W. M. Dress:
On Matroids which have Precisely One Basis in Common. Eur. J. Comb. 9(2): 149-151 (1988) - 1987
- [j2]Andreas Dress, László Lovász:
On some combinatorial properties of algebraic matroids. Comb. 7(1): 39-48 (1987) - 1986
- [j1]Andreas W. M. Dress, Rudolf Scharlau:
The 37 combinatorial types of minimal, non-transitive, equivariant tilings of the Euclidean plane. Discret. Math. 60: 121-138 (1986)
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 2026-05-12 23:28 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
