Ana Paula Tomás
Faculdade de Ciências da Universidade do Porto
.
| 2022 | On r-Guarding SCOTs - a New Family of Orthogonal Polygons |
LATIN 2022: Theoretical Informatics - 15th Latin American Symposium, Guanajuato, Mexico, November 7-11, 2022, Proceedings | 2022 | inproceedings | ||
| 2022 | On r-Guarding SCOTs – A New Family of Orthogonal Polygons |
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2022 | inproceedings | ||
| 2018 | House Allocation Problems with Existing Tenants and Priorities for Teacher Recruitment |
SOFSEM 2018: Theory and Practice of Computer Science - 44th International Conference on Current Trends in Theory and Practice of Computer Science, Krems, Austria, January 29 - February 2, 2018, Proceedings | 2018 | inproceedings | ||
| 2015 | On the enumeration of permutominoes |
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2015 | inproceedings | ||
| 2013 | Automatic Generation and Delivery of Multiple-Choice Math Quizzes |
Principles and Practice of Constraint Programming, Cp 2013 | 2013 | inproceedings | ||
| 2013 | Guarding thin orthogonal polygons is hard |
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2013 | inproceedings | ||
| 2008 | A web application for mathematics education |
Advances in Web Based Learning - Icwl 2007 | 2008 | inproceedings | ||
| 2006 | Designing a solver for arithmetic constraints to support education in mathematics |
Artificial Intelligence Applications and Innovations | 2006 | inproceedings | ||
| 2006 | On visibility problems in the plane - Solving minimum vertex guard problems by successive approximations |
9th International Symposium on Artificial Intelligence and Mathematics, ISAIM 2006 | 2006 | inproceedings | ||
| 2005 | Mechanically proving termination using polynomial interpretations |
Journal of Automated Reasoning | 2005 | article | ||
| 2004 | Partitioning orthogonal polygons by extension of all edges incident to reflex vertices: Lower and upper bounds on the number of pieces |
Computational Science and Its Applications - Iccsa 2004, Pt 3 | 2004 | article | ||
| 2004 | Quadratic-time linear-space algorithms for generating orthogonal polygons with a given number of vertices |
Computational Science and Its Applications - Iccsa 2004, Pt 3 | 2004 | article | ||
| 2003 | A CLP-based tool for computer aided generation and solving of maths exercises |
Practical Aspects of Declarative Languages, Proceedings | 2003 | article | ||
| 2003 | Approximation algorithms to minimum vertex cover problems on polygons and terrains |
Computational Science - Iccs 2003, Pt I, Proceedings | 2003 | article | ||
| 2003 | Generating random orthogonal polygons |
Current Topics in Artificial Intelligence | 2003 | article | ||
| 2002 | Solving Optimal Location of Traffic Count Posts in CLP(FD) |
AGP 2002: Proceedings of the Joint Conference on Declarative Programming, APPIA-GULP-PRODE, Madrid, Spain, September 16-18, 2002. | 2002 | inproceedings | ||
| 2002 | Solving Optimal Location of Traffic Counting Points at Urban Intersections in CLP(FD) |
MICAI 2002: Advances in Artificial Intelligence, Second Mexican International Conference on Artificial Intelligence, Merida, Yucatan, Mexico, April 22-26, 2002, Proceedings | 2002 | inproceedings | ||
| 2002 | Solving optimal location of traffic counting points at urban intersections in CLP(FD) |
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2002 | inproceedings | ||
| 2002 | Using Constraint Logic Programming to Generate Drills in Mathematics |
AGP 2002: Proceedings of the Joint Conference on Declarative Programming, APPIA-GULP-PRODE, Madrid, Spain, September 16-18, 2002. | 2002 | inproceedings | ||
| 1997 | An Algorithm for Solving Systems of Linear Diophantine Equations in Naturals |
Progress in Artificial Intelligence, 8th Portuguese Conference on Artificial Intelligence, EPIA '97, Coimbra, Portugal, October 6-9, 1997, Proceedings | 1997 | inproceedings | ||
| 1997 | Solving linear Diophantine equations using the geometric structure of the solution space |
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 1997 | inproceedings | ||
| 1997 | Solving linear Diophantine equations using the geometric structure of the solution space |
Rewriting Techniques and Applications | 1997 | article | ||
| 1995 | A fast method for finding the basis of non-negative solutions to a linear diophantine equation |
Journal of Symbolic Computation | 1995 | article | ||
| 1995 | From elliott-macmahon to an algorithm for general linear constraints on naturals |
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 1995 | inproceedings | ||
| 1993 | Fast Methods for Solving Linear Diophantine Equations |
Progress in Artificial Intelligence, 6th Portuguese Conference on Artificial Intelligence, EPIA '93, Porto, Portugal, October 6-8, 1993, Proceedings | 1993 | inproceedings |