default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHans-Jürgen Bandelt
Person information
- affiliation: University of Hamburg, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j54]Hans-Jürgen Bandelt, Maurice Pouzet
:
A Syntactic Approach to the MacNeille Completion of Λ∗, the Free Monoid Over an Ordered Alphabet Λ. Order 36(2): 209-224 (2019)- 2018
- [j53]Hans-Jürgen Bandelt, Victor Chepoi, Kolja Knauer:
COMs: Complexes of oriented matroids. J. Comb. Theory A 156: 195-237 (2018) - 2016
- [j52]Hansi Weißensteiner, Dominic Pacher, Anita Kloss-Brandstätter, Lukas Forer, Günther Specht, Hans-Jürgen Bandelt, Florian Kronenberg, Antonio Salas, Sebastian Schönherr:
HaploGrep 2: mitochondrial haplogroup classification in the era of high-throughput sequencing. Nucleic Acids Res. 44(Webserver-Issue): W58-W63 (2016) - 2015
- [j51]Hans-Jürgen Bandelt, Victor Chepoi, David Eppstein:
Ramified Rectilinear Polygons: Coordinatization by Dendrons. Discret. Comput. Geom. 54(4): 771-797 (2015) - [i1]Hans-Jürgen Bandelt, Victor Chepoi, Kolja Knauer:
COMs: Complexes of Oriented Matroids. CoRR abs/1507.06111 (2015) - 2010
- [j50]Hans-Jürgen Bandelt, Victor Chepoi, David Eppstein:
Combinatorics and Geometry of Finite and Infinite Squaregraphs. SIAM J. Discret. Math. 24(4): 1399-1440 (2010)
2000 – 2009
- 2009
- [j49]Hans-Jürgen Bandelt, Arne Röhl:
Quasi-median hulls in Hamming space are Steiner hulls. Discret. Appl. Math. 157(2): 227-233 (2009) - 2008
- [j48]Hans-Jürgen Bandelt, Victor Chepoi:
The algebra of metric betweenness II: Geometry and equational characterization of weakly median graphs. Eur. J. Comb. 29(3): 676-700 (2008) - 2007
- [j47]Hans-Jürgen Bandelt, Victor Chepoi:
The algebra of metric betweenness I: Subdirect representation and retraction. Eur. J. Comb. 28(6): 1640-1661 (2007) - 2006
- [j46]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) - 2004
- [j45]Hans-Jürgen Bandelt, A. J. T. Maas, Frits C. R. Spieksma:
Local search heuristics for multi-index assignment problems with decomposable costs. J. Oper. Res. Soc. 55(7): 694-704 (2004) - 2003
- [j44]Hans-Jürgen Bandelt, Victor Chepoi:
1-Hyperbolic Graphs. SIAM J. Discret. Math. 16(2): 323-334 (2003) - 2002
- [j43]Hans-Jürgen Bandelt, Katharina T. Huber, Vincent Moulton:
Quasi-median graphs from sets of partitions. Discret. Appl. Math. 122(1-3): 23-35 (2002) - [j42]Hans-Jürgen Bandelt, Victor Chepoi:
Graphs with Connected Medians. SIAM J. Discret. Math. 15(2): 268-282 (2002) - 2001
- [c3]Hans-Jürgen Bandelt:
Invited Presentation: Median Hulls as Steiner Hulls in Rectilinear and Molecular Sequence Spaces. WG 2001: 1-7 - 2000
- [j41]Hans-Jürgen Bandelt, Victor Chepoi:
Decomposition andl1-Embedding of Weakly Median Graphs. Eur. J. Comb. 21(6): 701-714 (2000) - [j40]Hans-Jürgen Bandelt, Victor Chepoi, Alexander V. Karzanov:
A Characterization of Minimizable Metrics in the Multifacility Location Problem. Eur. J. Comb. 21(6): 715-725 (2000)
1990 – 1999
- 1999
- [j39]Hans-Jürgen Bandelt, Maarten Oosten, Jeroen H. G. C. Rutten, Frits C. R. Spieksma:
Lifting theorems and facet characterization for a class of clique partitioning inequalities. Oper. Res. Lett. 24(5): 235-243 (1999) - 1998
- [j38]Hans-Jürgen Bandelt, Victor Chepoi, Monique Laurent:
Embedding into Rectilinear Spaces. Discret. Comput. Geom. 19(4): 595-604 (1998) - [j37]Peter Forster, Alfred Toth, Hans-Jürgen Bandelt:
Evolutionary Network Analysis of Word Lists: Visualising the Relationships between Alpine Romance Languages. J. Quant. Linguistics 5(3): 174-187 (1998) - [j36]Hans-Jürgen Bandelt, Victor Chepoi:
Embedding into the rectilinear grid. Networks 32(2): 127-132 (1998) - 1996
- [j35]Hans-Jürgen Bandelt, Victor Chepoi:
Embedding Metric Spaces in the Rectilinear Plane: a Six-Point Criterion. Discret. Comput. Geom. 15(1): 107-117 (1996) - [j34]Hans-Jürgen Bandelt, Victor Chepoi:
A Helly theorem in weakly modular space. Discret. Math. 160(1-3): 25-39 (1996) - [j33]Hans-Jürgen Bandelt, Victor Chepoi:
Graphs of Acyclic Cubical Complexes. Eur. J. Comb. 17(2-3): 113-120 (1996) - [j32]Hans-Jürgen Bandelt, Victor Chepoi:
Cellular Bipartite Graphs. Eur. J. Comb. 17(2-3): 121-134 (1996) - [j31]Hans-Jürgen Bandelt, Gustav Burosch, Jean-Marie Laborde:
Cartesian products of trees and paths. J. Graph Theory 22(4): 347-356 (1996) - [c2]Reinhard Rauscher, Dieter Klawan, Hans-Jürgen Bandelt:
Results Given by a New Evaluation System for Placement and Routing Heuristics. EUROMICRO 1996: 259-266 - 1995
- [j30]Hans-Jürgen Bandelt, Anja Henkmann, Falk Nicolai:
Powers of distance-hereditary graphs. Discret. Math. 145(1-3): 37-60 (1995) - [j29]Thomas Andreae, Hans-Jürgen Bandelt:
Performance Guarantees for Approximation Algorithms Depending on Parametrized Triangle Inequalities. SIAM J. Discret. Math. 8(1): 1-16 (1995) - [j28]Hans-Jürgen Bandelt, Michael Anthony Steel:
Symmetric Matrices Representable by Weighted Trees Over a Cancellative Abelian Monoid. SIAM J. Discret. Math. 8(4): 517-525 (1995) - 1994
- [j27]Hans-Jürgen Bandelt, Yves Crama, Frits C. R. Spieksma:
Approximation Algorithms for Multi-Dimensional Assignment Problems with Decomposable Costs. Discret. Appl. Math. 49(1-3): 25-50 (1994) - [j26]Hans-Jürgen Bandelt, Andreas W. M. Dress:
An order theoretic framework for overlapping clustering. Discret. Math. 136(1-3): 21-37 (1994) - [j25]Hans-Jürgen Bandelt, Henry Martyn Mulder, Elke Wilkeit:
Quasi-median graphs and algebras. J. Graph Theory 18(7): 681-703 (1994) - 1993
- [j24]Hans-Jürgen Bandelt, Martin Farber, Pavol Hell:
Absolute Reflexive Retracts and Absolute Bipartite Retracts. Discret. Appl. Math. 44(1-3): 9-20 (1993) - 1992
- [j23]Hans-Jürgen Bandelt:
Graphs with edge-preserving majority functions. Discret. Math. 103(1): 1-5 (1992) - [j22]Hans-Jürgen Bandelt, Henry Martyn Mulder:
Pseudo-median graphs are join spaces. Discret. Math. 109(1-3): 13-26 (1992) - [j21]Hans-Jürgen Bandelt:
Centroids and medians of finite metric spaces. J. Graph Theory 16(4): 305-317 (1992) - 1991
- [j20]Hans-Jürgen Bandelt, Henry Martyn Mulder:
Pseudo-median graphs: decomposition via amalgamation and Cartesian multiplication. Discret. Math. 94(3): 161-180 (1991) - [j19]Hans-Jürgen Bandelt, Erich Prisner:
Clique graphs and Helly graphs. J. Comb. Theory B 51(1): 34-45 (1991) - [j18]Hans-Jürgen Bandelt, Erwin Pesch:
Efficient characterizations of n-chromatic absolute retracts. J. Comb. Theory B 53(1): 5-31 (1991) - [j17]Hans-Jürgen Bandelt, Marcel van de Vel:
Superextensions and the depth of median graphs. J. Comb. Theory A 57(2): 187-202 (1991) - 1990
- [j16]Hans-Jürgen Bandelt, Henry Martyn Mulder:
Metric characterization of parity graphs. Discret. Math. 91(3): 221-230 (1990) - [j15]Hans-Jürgen Bandelt:
Recognition of Tree Metrics. SIAM J. Discret. Math. 3(1): 1-6 (1990) - [c1]Nico L. J. Ulder, Emile H. L. Aarts, Hans-Jürgen Bandelt, Peter J. M. van Laarhoven, Erwin Pesch:
Genetic Local Search Algorithms for the Travelling Salesman Problem. PPSN 1990: 109-116
1980 – 1989
- 1989
- [j14]Hans-Jürgen Bandelt, Erwin Pesch:
DismantlinG Absolute Retracts of Reflexive Graphs. Eur. J. Comb. 10(3): 211-220 (1989) - [j13]Hans-Jürgen Bandelt:
Graphs with intrinsic s3 convexities. J. Graph Theory 13(2): 215-228 (1989) - 1988
- [j12]Hans-Jürgen Bandelt:
Hereditary modular graphs. Comb. 8(2): 149-157 (1988) - [j11]Hans-Jürgen Bandelt, Henry Martyn Mulder:
Regular pseudo-median graphs. J. Graph Theory 12(4): 533-549 (1988) - 1987
- [j10]Hans-Jürgen Bandelt, A. Dählmann, H. Schütte:
Absolute retracts of bipartite graphs. Discret. Appl. Math. 16(3): 191-215 (1987) - [j9]Hans-Jürgen Bandelt, Elke Wilkeit:
Dwarf, brick, and triangulation of the torus. Discret. Math. 67(1): 1-14 (1987) - [j8]Hans-Jürgen Bandelt, Marcel van de Vel:
A fixed cube theorem for median graphs. Discret. Math. 67(2): 129-137 (1987) - 1986
- [j7]Hans-Jürgen Bandelt, Henry Martyn Mulder:
Pseudo-modular graphs. Discret. Math. 62(3): 245-260 (1986) - [j6]Hans-Jürgen Bandelt, Henry Martyn Mulder:
Distance-hereditary graphs. J. Comb. Theory B 41(2): 182-208 (1986) - 1984
- [j5]Hans-Jürgen Bandelt, Jean-Pierre Barthélemy:
Medians in median graphs. Discret. Appl. Math. 8(2): 131-142 (1984) - [j4]Hans-Jürgen Bandelt, Henry Martyn Mulder:
Interval-regular graphs of diameter two. Discret. Math. 50: 117-134 (1984) - [j3]Hans-Jürgen Bandelt:
Retracts of hypercubes. J. Graph Theory 8(4): 501-510 (1984) - 1983
- [j2]Hans-Jürgen Bandelt, Jarmila Hedlíková:
Median algebras. Discret. Math. 45(1): 1-30 (1983) - [j1]Hans-Jürgen Bandelt, Henry Martyn Mulder:
Infinite median graphs, (0, 2)-graphs, and hypercubes. J. Graph Theory 7(4): 487-497 (1983)
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-06-10 21:22 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:
