Selected Publications

• Ana Paula Tomás, José Paulo Leal, Marcos Aurélio Domingues. A Web Application for Mathematics Education. In Advances in Web Based Learning -- ICWL 2007 (Revised Papers). Lecture Notes in Computer Science 4823, ©Springer-Verlag, 380-391, 2007. [pdf]
• Ana Paula Tomás, António Leslie Bajuelos, Fábio Marques. On Visibility Problems in the Plane -- Solving Minimum Vertex Guard Problems by Sucessive Approximations. Presented at the International Symposium on Artificial Intelligence and Mathematics, AI & MATH 2006, Florida, USA.
• Ana Paula Tomás. Emparelhamentos, Casamentos Estáveis e Algoritmos de Colocação de Professores. Technical Report DCC-2005-02, DCC - FC & LIACC, Universidade do Porto, March 2005 (rev. May 2005). (in Portuguese)
• Ana Paula Tomás. Weak Stable Matchings with Tenants and Ties. Presented at the CSCLP 2006: Annual ERCIM Workshop on Constraint Solving and Constraint Logic Programming, Lisbon, Portugal. June 2006. ([pdf] extended revised version)
• Evelyne Contejean, Claude Marché, Ana Paula Tomás, and Xavier Urbain. Mechanically proving termination using polynomial interpretations. Journal on Automated Reasoning, 34:4 (May 2005), 325--363
• Ana Paula Tomás, Nelma Moreira, Nuno Pereira. Designing a Solver for Arithmetic Constraints to Support Education in Mathematics. In Artificial Intelligence Applications and Innovations (AIAI 2006), IFIP Series, Vol 204, 433-441, 2006. ©Springer and IFIP. [pdf]
  Based on working paper, DCC - FC & LIACC, Universidade do Porto, August 2005.
• A.P.Tomás, A.L.Bajuelos. Quadratic-Time Linear-Space Algorithms for Generating Orthogonal Polygons with a Given Number of Vertices. In Proc. Workshop on Computational Geometry and Applications (CGA'04/ICCSA 2004), Lecture Notes in Computer Science 3045, ©Springer-Verlag, 117-126, 2004. [pdf]
  Also as Extended Abstract in J. M. Diaz-Báñez, A. Márquez, J. R. Portillo (Eds), Proc. 20th European Workshop on Computational Geometry (EuroCG'04) 189--192, 2004.
  
• A.L.Bajuelos, A.P.Tomás, F.Marques. Partitioning Orthogonal Polygons by Extension of All Edges Incident to Reflex Vertices: lower and upper bounds on the number of pieces. In Proc. Workshop on Computational Geometry and Applications (CGA'04/ICCSA 2004), Lecture Notes in Computer Science 3045, ©Springer-Verlag, 127--136, 2004. [pdf]
  Also as Extended Abstract in J. M. Diaz-Báñez, A. Márquez, J. R. Portillo (Eds), Proc. 20th European Workshop on Computational Geometry (EuroCG'04) 193--196, 2004.
  
• Ana Paula Tomás and António Leslie Bajuelos, Generating Random Orthogonal Polygons. In R.Conejo, M.Urretavizcaya, J.-L. Pérez-de-la-Cruz (Eds), Current Topics in Artificial Intelligence (CAEPIA 2003/ TTIA 2003). Revised Selected Papers, Lecture Notes in Computer Science 3040, ©Springer-Verlag, 364--373, 2004. (Preliminary version in Actas de CAEPIA-TTIA'2003, Vol I, 459-468, ISBN 84-8373-564-4, Universidad del País Vasco, 2003.) [pdf]
• Ana Paula Tomás, António Leslie Bajuelos, Fábio Marques, Approximation Algorithms to Minimum Vertex Cover Problems on Polygons and Terrains. In P.M.A Sloot et al. (eds.), Proc. of the International Conf. on Computational Science (ICCS 2003) -- Technical Session on Computer Graphics and Geometric Modeling, Lecture Notes in Computer Science 2657, 869-878, ©Springer-Verlag, 2003. [pdf]
• Ana Paula Tomás, José Paulo Leal, A CLP-Based Tool for Computer Aided Generation and Solving of Maths Exercises. In V. Dahl, P. Wadler (eds.), Proceedings of the Fifth International Symposium on Practical Aspects of Declarative Languages (PADL'2003), Lecture Notes in Computer Science 2562, 223-240, ©Springer-Verlag, 2003. [pdf]
• Ana Paula Tomás, Solving Optimal Location of Traffic Counting Points at Urban Intersections in CLP(FD). In C. A. Coello Coello et al (eds.), In Proceedings of MICAI'2002: Advances in Artificial Intelligence, Lecture Notes in Artificial Intelligence 2313, 242-251, ©Springer-Verlag, 2002. (Based on Technical Report DCC-2001-4) [pdf]
• Ana Paula Tomás and M. Filgueiras, An algorithm for solving systems of linear Diophantine equations in naturals. In E. Costa, A. Cardoso (eds.) Progress in Artificial Intelligence -- EPIA'97, Lecture Notes in Artificial Intelligence 1323, 73-84, ©Springer-Verlag, 1997. Reviewed in Zentralblatt für Mathematik, 884.11020; (Reviewer J. Piehler) 11D04, 90C10. [pdf]
• Ana Paula Tomás and Miguel Filgueiras, Solving linear Diophantine equations using the geometric structure of the solution space. In H. Comon (ed.), Proceedings of 8th Conference on Rewriting Techniques and Applications -- RTA'97, Lecture Notes in Computer Science 1232, 269-283, ©Springer-Verlag,1997. Reviewed in Math Reviews, 98j:11124; 11Y50 (68Q40). [pdf]
• Ana Paula Tomás, On Solving Linear Diophantine Constraints, PhD Thesis, Universidade do Porto, 1997. Abstract Resumo

• Eric Domenjoud and A. P. Tomás, From Elliott-MacMahon to an algorithm for general linear constraints on naturals. In U. Montanari, F. Rossi (eds.), Principles and Practice of Constraint Programming -- CP'95, Lecture Notes in Computer Science 976, 18-35, ©Springer-Verlag, 1995. [pdf]
• Miguel Filgueiras and Ana Paula Tomás, A fast method for finding the basis of nonnegative solutions to a linear Diophantine equation. Journal of Symbolic Computation, 19, 507-526, 1995. Reviewed in Math Reviews, 97a:11206; 11Y50 (68Q42).

More ...