Hans-Jürgen Bandelt

Affiliations:
  • University of Hamburg, Germany


According to our database1, Hans-Jürgen Bandelt authored at least 57 papers between 1983 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2019
A Syntactic Approach to the MacNeille Completion of Λ∗, the Free Monoid Over an Ordered Alphabet Λ.
Order, 2019

2018
COMs: Complexes of oriented matroids.
J. Comb. Theory A, 2018

2016
HaploGrep 2: mitochondrial haplogroup classification in the era of high-throughput sequencing.
Nucleic Acids Res., 2016

2015
Ramified Rectilinear Polygons: Coordinatization by Dendrons.
Discret. Comput. Geom., 2015

2010
Combinatorics and Geometry of Finite and Infinite Squaregraphs.
SIAM J. Discret. Math., 2010

2009
Quasi-median hulls in Hamming space are Steiner hulls.
Discret. Appl. Math., 2009

2008
The algebra of metric betweenness II: Geometry and equational characterization of weakly median graphs.
Eur. J. Comb., 2008

2007
The algebra of metric betweenness I: Subdirect representation and retraction.
Eur. J. Comb., 2007

2006
Combinatorics of lopsided sets.
Eur. J. Comb., 2006

2004
Local search heuristics for multi-index assignment problems with decomposable costs.
J. Oper. Res. Soc., 2004

2003
1-Hyperbolic Graphs.
SIAM J. Discret. Math., 2003

2002
Graphs with Connected Medians.
SIAM J. Discret. Math., 2002

Quasi-median graphs from sets of partitions.
Discret. Appl. Math., 2002

2001
Invited Presentation: Median Hulls as Steiner Hulls in Rectilinear and Molecular Sequence Spaces.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2001

2000
A Characterization of Minimizable Metrics in the Multifacility Location Problem.
Eur. J. Comb., 2000

Decomposition and<i>l</i><sub>1</sub>-Embedding of Weakly Median Graphs.
Eur. J. Comb., 2000

1999
Lifting theorems and facet characterization for a class of clique partitioning inequalities.
Oper. Res. Lett., 1999

1998
Embedding into the rectilinear grid.
Networks, 1998

Evolutionary Network Analysis of Word Lists: Visualising the Relationships between Alpine Romance Languages.
J. Quant. Linguistics, 1998

Embedding into Rectilinear Spaces.
Discret. Comput. Geom., 1998

1996
Cartesian products of trees and paths.
J. Graph Theory, 1996

Cellular Bipartite Graphs.
Eur. J. Comb., 1996

Graphs of Acyclic Cubical Complexes.
Eur. J. Comb., 1996

A Helly theorem in weakly modular space.
Discret. Math., 1996

Embedding Metric Spaces in the Rectilinear Plane: a Six-Point Criterion.
Discret. Comput. Geom., 1996

Results Given by a New Evaluation System for Placement and Routing Heuristics.
Proceedings of the 22rd EUROMICRO Conference '96, 1996

1995
Symmetric Matrices Representable by Weighted Trees Over a Cancellative Abelian Monoid.
SIAM J. Discret. Math., 1995

Performance Guarantees for Approximation Algorithms Depending on Parametrized Triangle Inequalities.
SIAM J. Discret. Math., 1995

Powers of distance-hereditary graphs.
Discret. Math., 1995

1994
Quasi-median graphs and algebras.
J. Graph Theory, 1994

An order theoretic framework for overlapping clustering.
Discret. Math., 1994

Approximation Algorithms for Multi-Dimensional Assignment Problems with Decomposable Costs.
Discret. Appl. Math., 1994

1993
Absolute Reflexive Retracts and Absolute Bipartite Retracts.
Discret. Appl. Math., 1993

1992
Centroids and medians of finite metric spaces.
J. Graph Theory, 1992

Pseudo-median graphs are join spaces.
Discret. Math., 1992

Graphs with edge-preserving majority functions.
Discret. Math., 1992

1991
Superextensions and the depth of median graphs.
J. Comb. Theory A, 1991

Clique graphs and Helly graphs.
J. Comb. Theory B, 1991

Efficient characterizations of <i>n</i>-chromatic absolute retracts.
J. Comb. Theory B, 1991

Pseudo-median graphs: decomposition via amalgamation and Cartesian multiplication.
Discret. Math., 1991

1990
Recognition of Tree Metrics.
SIAM J. Discret. Math., 1990

Metric characterization of parity graphs.
Discret. Math., 1990

Genetic Local Search Algorithms for the Travelling Salesman Problem.
Proceedings of the Parallel Problem Solving from Nature, 1st Workshop, 1990

1989
Graphs with intrinsic s<sub>3</sub> convexities.
J. Graph Theory, 1989

DismantlinG Absolute Retracts of Reflexive Graphs.
Eur. J. Comb., 1989

1988
Regular pseudo-median graphs.
J. Graph Theory, 1988

Hereditary modular graphs.
Comb., 1988

1987
Dwarf, brick, and triangulation of the torus.
Discret. Math., 1987

A fixed cube theorem for median graphs.
Discret. Math., 1987

Absolute retracts of bipartite graphs.
Discret. Appl. Math., 1987

1986
Distance-hereditary graphs.
J. Comb. Theory B, 1986

Pseudo-modular graphs.
Discret. Math., 1986

1984
Retracts of hypercubes.
J. Graph Theory, 1984

Interval-regular graphs of diameter two.
Discret. Math., 1984

Medians in median graphs.
Discret. Appl. Math., 1984

1983
Infinite median graphs, (0, 2)-graphs, and hypercubes.
J. Graph Theory, 1983

Median algebras.
Discret. Math., 1983


  Loading...