2007 |
15 | EE | Michele Leone,
Sumedha,
Martin Weigt:
Clustering by soft-constraint affinity propagation: applications to gene-expression data.
Bioinformatics 23(20): 2708-2715 (2007) |
2006 |
14 | EE | Martin Weigt,
Haijun Zhou:
Message passing for vertex covers
CoRR abs/cond-mat/0605190: (2006) |
2005 |
13 | EE | Alexander K. Hartmann,
Wolfgang Barthel,
Martin Weigt:
Phase transition and finite-size scaling in the vertex-cover problem.
Computer Physics Communications 169(1-3): 234-237 (2005) |
2004 |
12 | EE | Florent Krzakala,
Andrea Pagnani,
Martin Weigt:
Threshold values, stability analysis and high-q asymptotics for the coloring problem on random graphs
CoRR cond-mat/0403725: (2004) |
2003 |
11 | EE | Wolfgang Barthel,
Alexander K. Hartmann,
Martin Weigt:
Solving satisfiability problems by fluctuations: The dynamics of stochastic local search algorithms
CoRR cond-mat/0301271: (2003) |
2002 |
10 | EE | Alexei Vazquez,
Martin Weigt:
Computational complexity arising from degree correlations in networks
CoRR cond-mat/0207035: (2002) |
9 | EE | R. Mulet,
Andrea Pagnani,
Martin Weigt,
Riccardo Zecchina:
Coloring random graphs
CoRR cond-mat/0208460: (2002) |
8 | EE | Alfredo Braunstein,
Marc Mézard,
Martin Weigt,
Riccardo Zecchina:
Constraint Satisfaction by Survey Propagation
CoRR cond-mat/0212451: (2002) |
2001 |
7 | EE | 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) |
6 | EE | 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) |
2000 |
5 | EE | 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) |
4 | EE | Alexander K. Hartmann,
Martin Weigt:
Statistical mechanics perspective on the phase transition in vertex covering finite-connectivity random graphs
CoRR cond-mat/0006316: (2000) |
3 | EE | Martin Weigt,
Alexander K. Hartmann:
Typical solution time for a vertex-covering algorithm on finite-connectivity random graphs
CoRR cond-mat/0009417: (2000) |
2 | EE | Federico Ricci-Tersenghi,
Martin Weigt,
Riccardo Zecchina:
Simplest random K-satisfiability problem
CoRR cond-mat/0011181: (2000) |
1999 |
1 | EE | Giulio Biroli,
Rémi Monasson,
Martin Weigt:
A variational description of the ground state structure in random satisfiability problems
CoRR cond-mat/9907343: (1999) |