A. Weißl

发表

RANDOM PLANAR GRAPHS WITH GIVEN AVERAGE DEGREE

C. McDiarmid, A. Steger, S. Gerke, 2007 .

Properties of Random Graphs via Boltzmann Samplers

K. Panagiotou, A. Weißl, 2007 .

On the number of K3,3-minor-free and maximal K3,3-minor-free graphs

Marc Noy, Stefanie Gerke, Omer Giménez, 2006 .

Multiplexing molecular tension sensors reveals piconewton force gradient across talin-1

M. Rief, A. Weißl, M. Tramier, 2017, Nature Methods.

Random planar graphs with n nodes and a fixed number of edges

Colin McDiarmid, Stefanie Gerke, Angelika Steger, 2005, SODA '05.

Unraveling the Mechanics of a Repeat-Protein Nanospring: From Folding of Individual Repeats to Fluctuations of the Superhelix

M. Rief, L. Itzhaki, A. Weißl, 2022, ACS nano.

Fast Algorithms for Weighted Bipartite Matching

Angelika Steger, Justus Schwartz, Andreas Weißl, 2005, WEA.

An Active, Ligand-Responsive Pulling Geometry Reports on Internal Signaling between Subdomains of the DnaK Nucleotide-Binding Domain in Single-Molecule Mechanical Experiments.

M. Rief, A. Weißl, Ulrich Merkel, 2019, Biochemistry.

Consensus tetratricopeptide repeat proteins are complex superhelical nanosprings

M. Rief, L. Itzhaki, A. Weißl, 2021, bioRxiv.

The Number of Graphs Not Containing K3, 3 as a Minor

Marc Noy, Stefanie Gerke, Andreas Weißl, 2008, Electron. J. Comb..

On the number of graphs not containing $K_{3,3}$ as a minor

Marc Noy, Stefanie Gerke, Omer Giménez, 2008 .

On Euclidean vehicle routing with allocation

Jan Remy, Reto Spöhel, Andreas Weißl, 2007, Comput. Geom..