Alexander K. Hartmann

Oliver Melchert

Christoph Norrenbrock

Entropy, 2019

2018

Large-deviation properties of the largest biconnected component for random graphs.

[BibT_eX]

[DOI]

CoRR, 2018

Replica Symmetry and Replica Symmetry Breaking for the Traveling Salesperson Problem.

[BibT_eX]

[DOI]

Jitesh Kumar Jha

CoRR, 2018

Large-deviation Properties of Linear-programming Computational Hardness of the Vertex Cover Problem.

[BibT_eX]

[DOI]

Satoshi Takabe

Koji Hukushima

CoRR, 2018

2017

Phase Transitions of the Typical Algorithmic Complexity of the Random Satisfiability Problem Studied with Linear Programming.

[BibT_eX]

[DOI]

Roman Bleim

CoRR, 2017

2016

Practical Introduction to Clustering Data.

[BibT_eX]

[DOI]

CoRR, 2016

2015

Matrix-power energy-landscape transformation for finding NP-hard spin-glass ground states.

[BibT_eX]

[DOI]

Markus Manssen

J. Glob. Optim., 2015

Phase Transitions of Traveling Salesperson Problems solved with Linear Programming and Cutting Planes.

[BibT_eX]

[DOI]

CoRR, 2015

Big Practical Guide to Computer Simulations, 2<sup>nd</sup> Edition

[BibT_eX]

[DOI]

WorldScientific, ISBN: 9789814571791, 2015

2014

Large-deviation properties of resilience of transportation networks.

[BibT_eX]

[DOI]

CoRR, 2014

2012

Phase transition for cutting-plane approach to vertex-cover problem

[BibT_eX]

[DOI]

Timo Dewenter

CoRR, 2012

2011

A dedicated algorithm for calculating ground states for the triangular random bond Ising model.

[BibT_eX]

[DOI]

Oliver Melchert

Comput. Phys. Commun., 2011

Accurate statistics for local sequence alignment with position-dependent scoring by rare-event sampling.

[BibT_eX]

[DOI]

Stefan Wolfsheimer

Inke Herms

Sven Rahmann

BMC Bioinform., 2011

2010

Large-deviation properties of largest component for random graphs

[BibT_eX]

[DOI]

CoRR, 2010

2007

Parameter-less Hierarchical Bayesian Optimization Algorithm.

[BibT_eX]

[DOI]

Tz-Kai Lin

Proceedings of the Parameter Setting in Evolutionary Algorithms, 2007

Local sequence alignments statistics: deviations from Gumbel statistics in the rare-event tail.

[BibT_eX]

[DOI]

Stefan Wolfsheimer

Bernd Burghardt

Algorithms Mol. Biol., 2007

Hybrid evolutionary algorithms on minimum vertex cover for random graphs.

[BibT_eX]

[DOI]

Rajiv Kalapala

Proceedings of the Genetic and Evolutionary Computation Conference, 2007

Obtaining ground states of ising spin glasses via optimizing bonds instead of spins.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2007

2006

Searching for Ground States of Ising Spin Glasses with Hierarchical BOA and Cluster Exact Approximation.

[BibT_eX]

[DOI]

Proceedings of the Scalable Optimization via Probabilistic Modeling, 2006

Hierarchical BOA, Cluster Exact Approximation, and Ising Spin Glasses.

[BibT_eX]

[DOI]

Kumara Sastry

Proceedings of the Parallel Problem Solving from Nature, 2006

2005

Phase transition and finite-size scaling in the vertex-cover problem.

[BibT_eX]

[DOI]

Wolfgang Barthel

Comput. Phys. Commun., 2005

2003

Solving satisfiability problems by fluctuations: The dynamics of stochastic local search algorithms

[BibT_eX]

[DOI]

Wolfgang Barthel

CoRR, 2003

2002

Optimization algorithms in physics.

[BibT_eX]

[DOI]

Heiko Rieger

Wiley-VCH, ISBN: 978-3-527-40307-3, 2002

2001

Statistical mechanics perspective on the phase transition in vertex covering of finite-connectivity random graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2001

Hiding solutions in random satisfiability problems: A statistical mechanics approach

[BibT_eX]

[DOI]

Wolfgang Barthel

Michele Leone

Federico Ricci-Tersenghi

Riccardo Zecchina

CoRR, 2001

2000

Typical solution time for a vertex-covering algorithm on finite-connectivity random graphs

[BibT_eX]

[DOI]

CoRR, 2000

The number of guards needed by a museum: A phase transition in vertex covering of random graphs

[BibT_eX]

[DOI]