 | 2009 |
|---|
| 18 |       | Manuel Bodirsky,
Gustav Nordh,
Timo von Oertzen:
Integer Programming with 2-Variable Equations and 1-Variable Inequalities.
CTW 2009: 261-264 |
| 17 | | Arnaud Durand,
Miki Hermann,
Gustav Nordh:
Trichotomy in the Complexity of Minimal Inference.
LICS 2009: 387-396 |
| 16 | | Manuel Bodirsky,
Gustav Nordh,
Timo von Oertzen:
Integer programming with 2-variable equations and 1-variable inequalities.
Inf. Process. Lett. 109(11): 572-575 (2009) |
| 2008 |
|---|
| 15 | | Peter Jonsson,
Gustav Nordh:
Introduction to the Maximum SolutionProblem.
Complexity of Constraints 2008: 255-282 |
| 14 | | Gustav Nordh,
Bruno Zanuttini:
What makes propositional abduction tractable.
Artif. Intell. 172(10): 1245-1284 (2008) |
| 13 | | Gustav Nordh:
Perfect Skolem sets.
Discrete Mathematics 308(9): 1653-1664 (2008) |
| 12 | | Peter Jonsson,
Fredrik Kuivinen,
Gustav Nordh:
MAX ONES Generalized to Larger Domains.
SIAM J. Comput. 38(1): 329-365 (2008) |
| 2007 |
|---|
| 11 | | Peter Jonsson,
Gustav Nordh,
Johan Thapper:
The Maximum Solution Problem on Graphs.
MFCS 2007: 228-239 |
| 10 | | Gustav Nordh:
NP-completeness of generalized multi-Skolem sequences.
Discrete Applied Mathematics 155(16): 2061-2068 (2007) |
| 2006 |
|---|
| 9 | | Peter Jonsson,
Fredrik Kuivinen,
Gustav Nordh:
Approximability of Integer Programming with Generalised Constraints.
CP 2006: 256-270 |
| 8 | | Peter Jonsson,
Gustav Nordh:
Generalised Integer Programming Based on Logically Defined Relations.
MFCS 2006: 549-560 |
| 7 | | Peter Jonsson,
Fredrik Kuivinen,
Gustav Nordh:
Approximability of Integer Programming with Generalised Constraints
CoRR abs/cs/0602047: (2006) |
| 2005 |
|---|
| 6 | | Gustav Nordh,
Bruno Zanuttini:
Propositional Abduction is Almost Always Hard.
IJCAI 2005: 534-539 |
| 5 | | Gustav Nordh:
The complexity of equivalence and isomorphism of systems of equations over finite groups.
Theor. Comput. Sci. 345(2-3): 406-424 (2005) |
| 2004 |
|---|
| 4 | | Gustav Nordh,
Peter Jonsson:
The Complexity of Counting Solutions to Systems of Equations over Finite Semigroups.
COCOON 2004: 370-379 |
| 3 | | Gustav Nordh,
Peter Jonsson:
An Algebraic Approach to the Complexity of Propositional Circumscription.
LICS 2004: 367-376 |
| 2 | | Gustav Nordh:
A Trichotomy in the Complexity of Propositional Circumscription.
LPAR 2004: 257-269 |
| 1 | | Gustav Nordh:
The Complexity of Equivalence and Isomorphism of Systems of Equations over Finite Groups.
MFCS 2004: 380-391 |
