 | 2009 |
|---|
| 10 |       | Peter Jonsson,
Johan Thapper:
Approximability of the Maximum Solution Problem for Certain Families of Algebras.
CSR 2009: 215-226 |
| 9 | | Tommy Färnqvist,
Peter Jonsson,
Johan Thapper:
Approximability Distance in the Space of H-Colourability Problems.
CSR 2009: 92-104 |
| 8 | | Robert Engström,
Tommy Färnqvist,
Peter Jonsson,
Johan Thapper:
Graph Homomorphisms, Circular Colouring, and Fractional Covering by H-cuts
CoRR abs/0904.4600: (2009) |
| 2008 |
|---|
| 7 | | Tommy Färnqvist,
Peter Jonsson,
Johan Thapper:
Approximability Distance in the Space of H-Colourability Problems
CoRR abs/0802.0423: (2008) |
| 2007 |
|---|
| 6 | | Peter Jonsson,
Gustav Nordh,
Johan Thapper:
The Maximum Solution Problem on Graphs.
MFCS 2007: 228-239 |
| 2005 |
|---|
| 5 | | Ola Angelsmark,
Johan Thapper:
Partitioning Based Algorithms for Some Colouring Problems.
CSCLP 2005: 44-58 |
| 4 |  | Ola Angelsmark,
Johan Thapper:
A Microstructure Based Approach to Constraint Satisfaction Optimisation Problems.
FLAIRS Conference 2005: 155-160 |
| 2004 |
|---|
| 3 | | Ola Angelsmark,
Johan Thapper:
Algorithms for the Maximum Hamming Distance Problem.
CSCLP 2004: 128-141 |
| 2002 |
|---|
| 2 | | Ola Angelsmark,
Peter Jonsson,
Svante Linusson,
Johan Thapper:
Determining the Number of Solutions to Binary CSP Instances.
CP 2002: 327-340 |
| 2000 |
|---|
| 1 | | Anneli Dahlström,
Fredrik Heintz,
Martin Jacobsson,
Johan Thapper,
Martin Öberg:
The NOAI Team Description.
RoboCup 2000: 413-416 |
