Ana Paula Tomás

Algebra
Computational Mathematics

Faculdade de Ciências da Universidade do Porto

.
ORCID Authenticus ID

Publications

Add new publicationAdd Preprint

2018

House allocation problems with existing tenants and priorities for teacher recruitment

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Locators: DOI

2015

On the enumeration of permutominoes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Locators: DOI

2013

Automatic generation and delivery of multiple-choice math quizzes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Locators: DOI

J.P. Leal

Guarding thin orthogonal polygons is hard

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Locators: DOI

2008

A Web application for mathematics education

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Locators: DOI

J.P. Leal

M.A. Domingues

2006

Designing a solver for arithmetic constraints to support education in mathematics

IFIP International Federation for Information Processing

Locators: DOI

N. Moreira

N. Pereira

Mechanically proving termination using polynomial interpretations

Journal of Automated Reasoning

Locators: DOI

E. Contejean

C. Marché

X. Urbain

On visibility problems in the plane - Solving minimum vertex guard problems by successive approximations

9th International Symposium on Artificial Intelligence and Mathematics, ISAIM 2006

A.L. Bajuelos

F. Marques

2004

Generating random orthogonal polygons

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Locators: DOI

A.L. Bajuelos

Partitioning orthogonal polygons by extension of all edges incident to reflex vertices: Lower and upper bounds on the number of pieces

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Locators: DOI

A.L. Bajuelos

F. Marques

Quadratic-time linear-space algorithms for generating orthogonal polygons with a given number of vertices

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Locators: DOI

A.L. Bajuelos

2003

A CLP-based tool for computer aided generation and solving of maths exercises

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Locators: DOI

J.P. Leal

Approximation algorithms to minimum vertex cover problems on polygons and terrains

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Locators: DOI

A.L. Bajuelos

F. Marques

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)

Locators: DOI

1997

An algorithm for solving systems of linear diophantine equations in naturals

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Locators: DOI

M. Filgueiras

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)

Locators: DOI

M. Filgueiras

1995

A fast method for finding the basis of non-negative solutions to a linear diophantine equation

Journal of Symbolic Computation

Locators: DOI

M. Filgueiras

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)

Locators: DOI

E. Domenjoud

1993

Fast methods for solving linear diophantine equations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Locators: DOI

M. Filgueiras

1991

A new method for solving linear constraints on the natural numbers

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Locators: DOI

M. Filgueiras