If you made any changes in Pure these will be visible here soon.

Fingerprint Fingerprint is based on mining the text of the person's scientific documents to create an index of weighted terms, which defines the key subjects of each individual researcher.

  • 1 Similar Profiles
Polynomials Engineering & Materials Science
Coloring Engineering & Materials Science
Tile Engineering & Materials Science
Hamiltonians Engineering & Materials Science
Parameterization Engineering & Materials Science
Compressibility Engineering & Materials Science
Computer science Engineering & Materials Science
Computational complexity Engineering & Materials Science

Research Output 2015 2019

Tight parameterized preprocessing bounds: sparsification via low-degree polynomials

Pieterse, A., 4 Sep 2019, (Accepted/In press) Eindhoven: Technische Universiteit Eindhoven.

Research output: ThesisPhd Thesis 1 (Research TU/e / Graduation TU/e)Academic

Optimal data reduction for graph coloring using low-degree polynomials

Jansen, B. M. P. & Pieterse, A., 1 Feb 2018, 12th International Symposium on Parameterized and Exact Computation, IPEC 2017. Dagstuhl: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 12 p. 22. (Leibniz International Proceedings in Informatics (LIPIcs); vol. 89)

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

Open Access
File
Coloring
Data reduction
Polynomials
Parameterization
Structural properties

Polynomial Kernels for hitting forbidden minors under structural parameterizations

Jansen, B. M. P. & Pieterse, A., 1 Aug 2018, 26th European Symposium on Algorithms, ESA 2018. Waldern: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Vol. 112, 15 p. 48

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

Open Access
File
Parameterization
Modulators
Polynomials
3 Citations (Scopus)

Sparsification upper and lower bounds for graph problems and not-all-equal SAT

Jansen, B. M. P. & Pieterse, A., 2017, In : Algorithmica. 79, 1, p. 3-28 26 p.

Research output: Contribution to journalArticleAcademicpeer-review

Open Access
File
Upper and Lower Bounds
Graph in graph theory
Polynomials
Connected Dominating Set
Hamiltonians

The subset sum game revisited

Pieterse, A. & Woeginger, G. J., 2017, Algorithmic Decision Theory: 5th International Conference, ADT 2017, Luxembourg, Luxembourg, October 25–27, 2017, Proceedings. Rothe, J. (ed.). Dordrecht: Springer, p. 228-240 12 p. (Lecture Notes in Computer Science; vol. 10576)

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

NP-complete
Resources
Factors

Prizes

Best Paper Award MFCS 2016

Bart Jansen (Recipient) & Astrid Pieterse (Recipient), 2016

Recognition: OtherCareer, activity or publication related prizes (lifetime, best paper, poster etc.)Scientific

Computer science
Polynomials

Courses

Algorithms

1/09/13 → …

Course

Student theses

Een moeilijke instantie voor farthest insertion

Author: Pieterse, A., 2013

Supervisor: Hurkens, C. (Supervisor 1)

Student thesis: Bachelor

File

Sparsification upper and lower bounds for graph problems and not-all-equal SAT

Author: Pieterse, A., 31 Aug 2015

Supervisor: Jansen, B. (Supervisor 1)

Student thesis: Master

File