Umberto Bertelè & Francesco Brioschi (1973):
On Non-serial Dynamic Programming.
J. Comb. Theory, Ser. A 14(2),
pp. 137–148,
doi:10.1016/0097-3165(73)90016-2.
Stefano Bistarelli, Ugo Montanari & Francesca Rossi (1997):
Semiring-based constraint satisfaction and optimization.
J. ACM 44(2),
pp. 201–236,
doi:10.1145/256303.256306.
Christoph Blume, H. J. Sander Bruggink, Martin Friedrich & Barbara König (2013):
Treewidth, pathwidth and cospan decompositions with applications to graph-accepting tree automata.
J. Vis. Lang. Comput. 24(3),
pp. 192–206,
doi:10.1016/j.jvlc.2012.10.002.
Hans L. Bodlaender & Arie M. C. A. Koster (2008):
Combinatorial Optimization on Graphs of Bounded Treewidth.
Comput. J. 51(3),
pp. 255–269,
doi:10.1093/comjnl/bxm037.
Tomás Bures, Rocco De Nicola, Ilias Gerostathopoulos, Nicklas Hoch, Michal Kit, Nora Koch, Giacoma Valentina Monreale, Ugo Montanari, Rosario Pugliese, Nikola B. Serbedzija, Martin Wirsing & Franco Zambonelli (2013):
A Life Cycle for the Development of Autonomic Systems: The E-mobility Showcase.
In: SASOW,
pp. 71–76,
doi:10.1109/SASOW.2013.23.
Maria Grazia Buscemi & Ugo Montanari (2007):
CC-Pi: A Constraint-Based Language for Specifying Service Level Agreements.
In: ESOP,
pp. 18–32,
doi:10.1007/978-3-540-71316-6_3.
Andrea Corradini, Ugo Montanari & Francesca Rossi (1994):
An Abstract Machine for Concurrent Modular Systems: CHARM.
Theor. Comput. Sci. 122(1&2),
pp. 165–200,
doi:10.1016/0304-3975(94)90206-2.
Bruno Courcelle & Mohamed Mosbah (1993):
Monadic Second-Order Evaluations on Tree-Decomposable Graphs.
Theor. Comput. Sci. 109(1&2),
pp. 49–82,
doi:10.1016/0304-3975(93)90064-Z.
Elias Dahlhaus (2002):
Minimal elimination ordering for graphs of bounded degree.
Discrete Applied Mathematics 116(1-2),
pp. 127–143,
doi:10.1016/S0166-218X(00)00331-0.
Rina Dechter (1999):
Bucket Elimination: A Unifying Framework for Reasoning.
Artif. Intell. 113(1-2),
pp. 41–85,
doi:10.1016/S0004-3702(99)00059-4.
Fabio Gadducci, Marino Miculan & Ugo Montanari (2006):
About permutation algebras, (pre)sheaves and named sets.
Higher-Order and Symbolic Computation 19(2-3),
pp. 283–304,
doi:10.1007/s10990-006-8749-3.
Nicklas Hoch, Kevin Zemmer, Bernd Werther & Roland Siegwart (2012):
Electric vehicle travel optimization-customer satisfaction despite resource constraints.
In: IEEE IVS,
pp. 172–177,
doi:10.1109/IVS.2012.6232240.
Ton Kloks (1994):
Treewidth, Computations and Approximations.
Lecture Notes in Computer Science 842.
Springer,
doi:10.1007/BFb0045375.
Jürg Kohlas & Marc Pouly (2011):
Generic Inference: A Unifying Theory for Automated Reasoning.
John Wiley & Sons, Inc.,
doi:10.1002/9781118010877.ch2.
Alberto Martelli & Ugo Montanari (1972):
Nonserial Dynamic Programming: On the Optimal Strategy of Variable Elimination for the Rectangular Lattice.
J. Math. Anal. Appl. 40,
pp. 226–242,
doi:10.1016/0022-247X(72)90046-7.
Ugo Montanari (1971):
On the Optimal Approximation of Discrete Functions with Low-dimensional Tables.
In: IFIP Congress (2),
pp. 1363–1368.
Ugo Montanari & Francesca Rossi (1991):
Constraint Relaxation may be Perfect.
Artif. Intell. 48(2),
pp. 143–170,
doi:10.1016/0004-3702(91)90059-S.
A. M. Pitts (2013):
Nominal Sets: Names and Symmetry in Computer Science.
Cambridge Tracts in Theoretical Computer Science 57.
Cambridge University Press,
doi:10.1017/CBO9781139084673.
Neil Robertson & Paul D. Seymour (1984):
Graph minors. III. Planar tree-width.
J. Comb. Theory, Ser. B 36(1),
pp. 49–64,
doi:10.1016/0095-8956(84)90013-3.
Mihalis Yannakakis (1981):
Computing the Minimum Fill-In is NP-Complete.
SIAM Journal on Algebraic Discrete Methods 2(1),
pp. 77–79,
doi:10.1137/0602010.
eptcs@eptcs.org