Magnus Ågren

15 papers A* 1A 5B 2C 1Journal 3Unranked 2
YearRankTypeTitle / Venue / Authors
2009 J jnl
Dynamic structural symmetry breaking for constraint satisfaction problems.
Constraints An Int. J.
Pierre Flener, Justin Pearson, Meinolf Sellmann, Pascal Van Hentenryck, Magnus Ågren
2009 A conf
Memoisation for Constraint-Based Local Search.
CP
Magnus Ågren
2009 J jnl
Revisiting constraint-directed search.
Inf. Comput.
Magnus Ågren, Pierre Flener, Justin Pearson
2009 B conf
Six Ways of Integrating Symmetries within Non-overlapping Constraints.
CPAIOR
Magnus Ågren, Nicolas Beldiceanu, Mats Carlsson, Mohamed Sbihi, Charlotte Truchet, Stéphane Zampelli
2007 J jnl
Generic Incremental Algorithms for Local Search.
Constraints An Int. J.
Magnus Ågren, Pierre Flener, Justin Pearson
2007 — —
Set Constraints for Local Search.
Magnus Ågren
2006 A conf
Inferring Variable Conflicts for Local Search.
CP
Magnus Ågren, Pierre Flener, Justin Pearson
2005 — conf
Compositional Derivation of Symmetries for Constraint Satisfaction.
SARA
Pascal Van Hentenryck, Pierre Flener, Justin Pearson, Magnus Ågren
2005 A conf
Incremental Algorithms for Local Search from Existential Second-Order Logic.
CP
Magnus Ågren, Pierre Flener, Justin Pearson
2005 B conf
Set Variables and Local Search.
CPAIOR
Magnus Ågren, Pierre Flener, Justin Pearson
2004 A conf
Set Variables and Local Search.
CP
Magnus Ågren
2003 A conf
Introducing ESRA, a Relational Language for Modelling Combinatorial Problems.
CP
Pierre Flener, Justin Pearson, Magnus Ågren
2003 C conf
Introducing esra, a Relational Language for Modelling Combinatorial Problems.
LOPSTR
Pierre Flener, Justin Pearson, Magnus Ågren
2003 A* conf
Tractable Symmetry Breaking for CSPs with Interchangeable Values.
IJCAI
Pascal Van Hentenryck, Pierre Flener, Justin Pearson, Magnus Ågren
2002 — conf
Tracing and Explaining Execution of CLP(FD) Programs.
WLPE
Magnus Ågren, Tamás Szeredi, Nicolas Beldiceanu, Mats Carlsson