![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Ana Paula Tomás
Person information
- affiliation: University of Porto, Portugal
Refine list
![note](https://dblp.org/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [c25]Vasco Cruz
, Ana Paula Tomás
:
On r-Guarding SCOTs - A New Family of Orthogonal Polygons. LATIN 2022: 713-729
2010 – 2019
- 2018
- [c24]Ana Paula Tomás
:
House Allocation Problems with Existing Tenants and Priorities for Teacher Recruitment. SOFSEM 2018: 479-492 - 2015
- [c23]Ana Paula Tomás
:
On the Enumeration of Permutominoes. FCT 2015: 41-52 - 2013
- [c22]Ana Paula Tomás
, José Paulo Leal
:
Automatic Generation and Delivery of Multiple-Choice Math Quizzes. CP 2013: 848-863 - [c21]Ana Paula Tomás
:
Guarding Thin Orthogonal Polygons Is Hard. FCT 2013: 305-316
2000 – 2009
- 2007
- [c20]Ana Paula Tomás
, José Paulo Leal
, Marcos Aurélio Domingues
:
A Web Application for Mathematics Education. ICWL 2007: 380-391 - 2006
- [c19]Ana Paula Tomás
, Nelma Moreira
, Nuno Pereira:
Designing a Solver for Arithmetic Constraints to Support Education in Mathematics. AIAI 2006: 433-441 - [c18]Ana Paula Tomás, António Leslie Bajuelos, Fábio Marques:
On Visibility Problems in the Plane -- Solving Minimum Vertex Guard Problems by Successive Approximations. AI&M 2006 - 2005
- [j2]Evelyne Contejean, Claude Marché
, Ana Paula Tomás
, Xavier Urbain:
Mechanically Proving Termination Using Polynomial Interpretations. J. Autom. Reason. 34(4): 325-363 (2005) - 2004
- [c17]Ana Paula Tomás
, António Leslie Bajuelos:
Quadratic-Time Linear-Space Algorithms for Generating Orthogonal Polygons with a Given Number of Vertices. ICCSA (3) 2004: 117-126 - [c16]António Leslie Bajuelos, Ana Paula Tomás
, Fábio Marques
:
Partitioning Orthogonal Polygons by Extension of All Edges Incident to Reflex Vertices: Lower and Upper Bounds on the Number of Pieces. ICCSA (3) 2004: 127-136 - 2003
- [c15]Ana Paula Tomás
, António Leslie Bajuelos:
Generating Random Orthogonal Polygons. CAEPIA 2003: 364-373 - [c14]Ana Paula Tomás
, António Leslie Bajuelos, Fábio Marques
:
Approximation Algorithms to Minimum Vertex Cover Problems on Polygons and Terrains. International Conference on Computational Science 2003: 869-878 - [c13]Ana Paula Tomás
, José Paulo Leal
:
A CLP-Based Tool for Computer Aided Generation and Solving of Maths Exercises. PADL 2003: 223-240 - 2002
- [c12]Ana Paula Tomás, José Paulo Leal, Pedro Vasconcelos:
Using Constraint Logic Programming to Generate Drills in Mathematics. APPIA-GULP-PRODE 2002: 155-172 - [c11]Ana Paula Tomás:
Solving Optimal Location of Traffic Count Posts in CLP(FD). APPIA-GULP-PRODE 2002: 173-188 - [c10]Ana Paula Tomás
:
Solving Optimal Location of Traffic Counting Points at Urban Intersections in CLP(FD). MICAI 2002: 242-251
1990 – 1999
- 1997
- [c9]Ana Paula Tomás
, Miguel Filgueiras:
An Algorithm for Solving Systems of Linear Diophantine Equations in Naturals. EPIA 1997: 73-84 - [c8]Ana Paula Tomás
, Miguel Filgueiras:
Solving Linear Diophantine Equations Using the Geometric Structure of the Solution Space. RTA 1997: 269-283 - 1995
- [j1]Miguel Filgueiras, Ana Paula Tomás
:
A Fast Method for Finding the Basis of Nonnegative Solutions to a Linear Diophantine Equation. J. Symb. Comput. 19(6): 507-526 (1995) - [c7]Eric Domenjoud, Ana Paula Tomás
:
From Elliott-MacMahon to an Algorithm for General Linear Constraints on Naturals. CP 1995: 18-35 - 1993
- [c6]Miguel Filgueiras, Ana Paula Tomás
:
Fast Methods for Solving Linear Diophantine Equations. EPIA 1993: 297-306 - 1991
- [c5]Miguel Filgueiras, Ana Paula Tomás
:
Solving Linear Constraints on Finite Domains Through Parsing. EPIA 1991: 1-16 - [c4]Ana Paula Tomás
, Miguel Filgueiras:
A New Method for Solving Linear Constraints on the Natural Numbers. EPIA 1991: 30-44 - [e1]Miguel Filgueiras, Luís Damas, Nelma Moreira, Ana Paula Tomás:
Natural Language Processing, EAIA '90, 2nd Advanced School in Artificial Intelligence, Guarda, Portugal, October 8-12, 1990, Proceedings. Lecture Notes in Computer Science 476, Springer 1991, ISBN 3-540-53678-7 [contents] - 1990
- [c3]Miguel Filgueiras, Nelma Moreira
, Ana Paula Tomás
:
General Introduction. EAIA 1990: 1-3 - [c2]Miguel Filgueiras, Ana Paula Tomás, Nelma Moreira, Rogério Reis, José Paulo Leal:
Natural Language and Natural Menus Interfaces. Modelling the Innovation 1990: 299-306
1980 – 1989
- 1989
- [c1]Ana Paula Tomás
, Miguel Filgueiras:
Some Comments on a Logic Programming Approach to Natural Language Semantics. EPIA 1989: 187-197
Coauthor Index
![](https://dblp.org/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:44 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint