Alexander K. Hartmann

29 papers A 3Journal 22
YearRankTypeTitle / Venue / Authors
2025 J jnl
Distribution of the Number of Paths in Two-Dimensional Directed Percolation.
Entropy
Leon Seeger, Alexander K. Hartmann
2019 J jnl
From Spin Glasses to Negative-Weight Percolation.
Entropy
Alexander K. Hartmann, Oliver Melchert, Christoph Norrenbrock
2018 J jnl
Large-deviation Properties of Linear-programming Computational Hardness of the Vertex Cover Problem.
CoRR
Satoshi Takabe, Koji Hukushima, Alexander K. Hartmann
2018 J jnl
Large-deviation properties of the largest biconnected component for random graphs.
CoRR
Hendrik Schawe, Alexander K. Hartmann
2018 J jnl
Replica Symmetry and Replica Symmetry Breaking for the Traveling Salesperson Problem.
CoRR
Hendrik Schawe, Jitesh Kumar Jha, Alexander K. Hartmann
2017 J jnl
Phase Transitions of the Typical Algorithmic Complexity of the Random Satisfiability Problem Studied with Linear Programming.
CoRR
Hendrik Schawe, Roman Bleim, Alexander K. Hartmann
2016 J jnl
Practical Introduction to Clustering Data.
CoRR
Alexander K. Hartmann
2015 — book
Big Practical Guide to Computer Simulations, 2
Big Practical Guide to Computer Simulations (2nd Ed.)
Alexander K. Hartmann
2015 J jnl
Matrix-power energy-landscape transformation for finding NP-hard spin-glass ground states.
J. Glob. Optim.
Markus Manssen, Alexander K. Hartmann
2015 J jnl
Phase Transitions of Traveling Salesperson Problems solved with Linear Programming and Cutting Planes.
CoRR
Hendrik Schawe, Alexander K. Hartmann
2014 J jnl
Large-deviation properties of resilience of transportation networks.
CoRR
Alexander K. Hartmann
2012 J jnl
Phase transition for cutting-plane approach to vertex-cover problem
CoRR
Timo Dewenter, Alexander K. Hartmann
2011 J jnl
A dedicated algorithm for calculating ground states for the triangular random bond Ising model.
Comput. Phys. Commun.
Oliver Melchert, Alexander K. Hartmann
2011 J jnl
Accurate statistics for local sequence alignment with position-dependent scoring by rare-event sampling.
BMC Bioinform.
Stefan Wolfsheimer, Inke Herms, Sven Rahmann, Alexander K. Hartmann
2010 J jnl
Large-deviation properties of largest component for random graphs
CoRR
Alexander K. Hartmann
2007 A conf
Hybrid evolutionary algorithms on minimum vertex cover for random graphs.
GECCO
Martin Pelikan, Rajiv Kalapala, Alexander K. Hartmann
2007 J jnl
Local sequence alignments statistics: deviations from Gumbel statistics in the rare-event tail.
Algorithms Mol. Biol.
Stefan Wolfsheimer, Bernd Burghardt, Alexander K. Hartmann
2007 A conf
Obtaining ground states of ising spin glasses via optimizing bonds instead of spins.
GECCO
Martin Pelikan, Alexander K. Hartmann
2007 — ch.
Parameter-less Hierarchical Bayesian Optimization Algorithm.
Parameter Setting in Evolutionary Algorithms
Martin Pelikan, Alexander K. Hartmann, Tz-Kai Lin
2006 A conf
Hierarchical BOA, Cluster Exact Approximation, and Ising Spin Glasses.
PPSN
Martin Pelikan, Alexander K. Hartmann, Kumara Sastry
2006 — ch.
Searching for Ground States of Ising Spin Glasses with Hierarchical BOA and Cluster Exact Approximation.
Scalable Optimization via Probabilistic Modeling
Martin Pelikan, Alexander K. Hartmann
2005 J jnl
Phase transition and finite-size scaling in the vertex-cover problem.
Comput. Phys. Commun.
Alexander K. Hartmann, Wolfgang Barthel, Martin Weigt
2003 J jnl
Solving satisfiability problems by fluctuations: The dynamics of stochastic local search algorithms
CoRR
Wolfgang Barthel, Alexander K. Hartmann, Martin Weigt
2002 — book
Optimization algorithms in physics.
Alexander K. Hartmann, Heiko Rieger
2001 J jnl
Hiding solutions in random satisfiability problems: A statistical mechanics approach
CoRR
Wolfgang Barthel, Alexander K. Hartmann, Michele Leone, Federico Ricci-Tersenghi, Martin Weigt, Riccardo Zecchina
2001 J jnl
Statistical mechanics perspective on the phase transition in vertex covering of finite-connectivity random graphs.
Theor. Comput. Sci.
Alexander K. Hartmann, Martin Weigt
2000 J jnl
Statistical mechanics perspective on the phase transition in vertex covering finite-connectivity random graphs
CoRR
Alexander K. Hartmann, Martin Weigt
2000 J jnl
The number of guards needed by a museum: A phase transition in vertex covering of random graphs
CoRR
Martin Weigt, Alexander K. Hartmann
2000 J jnl
Typical solution time for a vertex-covering algorithm on finite-connectivity random graphs
CoRR
Martin Weigt, Alexander K. Hartmann