default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlexander K. Hartmann
Person information
- affiliation: University of Oldenburg, Institute of Physics, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2015
[b2]Alexander K. Hartmann:
Big Practical Guide to Computer Simulations, 2nd Edition. WorldScientific 2015, ISBN 9789814571760, pp. 1-484- 2002
- [b1]Alexander K. Hartmann, Heiko Rieger:
Optimization algorithms in physics. Wiley-VCH 2002, ISBN 978-3-527-40307-3, pp. I-X, 1-372
Journal Articles
- 2019
- [j7]Alexander K. Hartmann
, Oliver Melchert, Christoph Norrenbrock:
From Spin Glasses to Negative-Weight Percolation. Entropy 21(2): 193 (2019) - 2015
- [j6]Markus Manssen, Alexander K. Hartmann:
Matrix-power energy-landscape transformation for finding NP-hard spin-glass ground states. J. Glob. Optim. 61(1): 183-192 (2015) - 2011
- [j5]Stefan Wolfsheimer, Inke Herms, Sven Rahmann, Alexander K. Hartmann:
Accurate statistics for local sequence alignment with position-dependent scoring by rare-event sampling. BMC Bioinform. 12: 47 (2011) - [j4]Oliver Melchert, Alexander K. Hartmann:
A dedicated algorithm for calculating ground states for the triangular random bond Ising model. Comput. Phys. Commun. 182(9): 1828-1832 (2011) - 2007
- [j3]Stefan Wolfsheimer, Bernd Burghardt, Alexander K. Hartmann:
Local sequence alignments statistics: deviations from Gumbel statistics in the rare-event tail. Algorithms Mol. Biol. 2 (2007) - 2005
- [j2]Alexander K. Hartmann, Wolfgang Barthel, Martin Weigt:
Phase transition and finite-size scaling in the vertex-cover problem. Comput. Phys. Commun. 169(1-3): 234-237 (2005) - 2001
- [j1]Alexander K. Hartmann, Martin Weigt:
Statistical mechanics perspective on the phase transition in vertex covering of finite-connectivity random graphs. Theor. Comput. Sci. 265(1-2): 199-225 (2001)
Conference and Workshop Papers
- 2007
- [c3]Martin Pelikan, Rajiv Kalapala, Alexander K. Hartmann:
Hybrid evolutionary algorithms on minimum vertex cover for random graphs. GECCO 2007: 547-554 - [c2]Martin Pelikan, Alexander K. Hartmann:
Obtaining ground states of ising spin glasses via optimizing bonds instead of spins. GECCO 2007: 628 - 2006
- [c1]Martin Pelikan, Alexander K. Hartmann, Kumara Sastry:
Hierarchical BOA, Cluster Exact Approximation, and Ising Spin Glasses. PPSN 2006: 122-131
Parts in Books or Collections
- 2007
- [p2]Martin Pelikan, Alexander K. Hartmann, Tz-Kai Lin:
Parameter-less Hierarchical Bayesian Optimization Algorithm. Parameter Setting in Evolutionary Algorithms 2007: 225-239 - 2006
- [p1]Martin Pelikan, Alexander K. Hartmann:
Searching for Ground States of Ising Spin Glasses with Hierarchical BOA and Cluster Exact Approximation. Scalable Optimization via Probabilistic Modeling 2006: 333-349
Informal and Other Publications
- 2018
- [i14]Satoshi Takabe, Koji Hukushima, Alexander K. Hartmann:
Large-deviation Properties of Linear-programming Computational Hardness of the Vertex Cover Problem. CoRR abs/1802.02350 (2018) - [i13]Hendrik Schawe, Jitesh Kumar Jha, Alexander K. Hartmann:
Replica Symmetry and Replica Symmetry Breaking for the Traveling Salesperson Problem. CoRR abs/1806.08681 (2018) - [i12]Hendrik Schawe, Alexander K. Hartmann:
Large-deviation properties of the largest biconnected component for random graphs. CoRR abs/1811.04816 (2018) - 2017
- [i11]Hendrik Schawe, Roman Bleim, Alexander K. Hartmann:
Phase Transitions of the Typical Algorithmic Complexity of the Random Satisfiability Problem Studied with Linear Programming. CoRR abs/1702.02821 (2017) - 2016
- [i10]Alexander K. Hartmann:
Practical Introduction to Clustering Data. CoRR abs/1602.05124 (2016) - 2015
- [i9]Hendrik Schawe, Alexander K. Hartmann:
Phase Transitions of Traveling Salesperson Problems solved with Linear Programming and Cutting Planes. CoRR abs/1512.08554 (2015) - 2014
- [i8]Alexander K. Hartmann:
Large-deviation properties of resilience of transportation networks. CoRR abs/1402.0501 (2014) - 2012
- [i7]Timo Dewenter, Alexander K. Hartmann:
Phase transition for cutting-plane approach to vertex-cover problem. CoRR abs/1201.1814 (2012) - 2010
- [i6]Alexander K. Hartmann:
Large-deviation properties of largest component for random graphs. CoRR abs/1011.2996 (2010) - 2003
- [i5]Wolfgang Barthel, Alexander K. Hartmann, Martin Weigt:
Solving satisfiability problems by fluctuations: The dynamics of stochastic local search algorithms. CoRR cond-mat/0301271 (2003) - 2001
- [i4]Wolfgang Barthel, Alexander K. Hartmann, Michele Leone, Federico Ricci-Tersenghi, Martin Weigt, Riccardo Zecchina:
Hiding solutions in random satisfiability problems: A statistical mechanics approach. CoRR cond-mat/0111153 (2001) - 2000
- [i3]Martin Weigt, Alexander K. Hartmann:
The number of guards needed by a museum: A phase transition in vertex covering of random graphs. CoRR cond-mat/0001137 (2000) - [i2]Alexander K. Hartmann, Martin Weigt:
Statistical mechanics perspective on the phase transition in vertex covering finite-connectivity random graphs. CoRR cond-mat/0006316 (2000) - [i1]Martin Weigt, Alexander K. Hartmann:
Typical solution time for a vertex-covering algorithm on finite-connectivity random graphs. CoRR cond-mat/0009417 (2000)
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-09-09 01:19 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:
