Pedro Matias

PhD Candidate

UC Irvine

About

I am a PhD candidate in Computer Science at the University of California, Irvine in the Center for Algorithms and Theory of Computation. I am pleased to have Prof. Michael Goodrich as my advisor and to collaborate with Prof. David Eppstein.

Interests

Theoretical Computer Science
Approximation algorithms
Randomized algorithms
Graph algorithms
Computational Geometry
Optimization

Education

PhD in Computer Science

University of California, Irvine
MSc in Computer Science, 2015

Chalmers University of Technology, Sweden
BSc in Computer Science, 2013

University of Coimbra, Portugal

Publications

Ramtin Afshar, Michael T. Goodrich, Pedro Matias (2020). How to Steal a Tree: Efficient Reconstruction of Trees via Queries.

Alon Efrat, David Eppstein, Daniel Frishberg, Michael T. Goodrich, Stephen G. Kobourov, Nil Mamano, Pedro Matias, Valentin Polishchuk (2019). Euclidean TSP, Motorcycle Graphs, and Other New Applications of Nearest-Neighbor Chains. ISAAC.

PDF arXiv

David Eppstein, Michael T. Goodrich, James A. Liu, Pedro Matias (2019). Tracking Paths in Planar Graphs. ISAAC.

PDF arXiv

Luís Paquete, Pedro Matias, Maryam Abbasi, Miguel Pinheiro (2014). MOSAL: Software tools for multiobjective sequence alignment. Source Code for Biology and Medicine.

DOI

Maryam Abbasi, Luís Paquete, Arnaud Liefooghe, Miguel Pinheiro, Pedro Matias (2013). Improvements on bicriteria pairwise sequence alignment: Algorithms and applications. Bioinformatics.

DOI

Talks

In conferences:

December 2019. Euclidean TSP, Motorcycle Graphs, and Other New Applications of Nearest-Neighbor Chains. Shanghai, China. ISAAC 19
December 2019. Tracking Paths in Planar Graphs. Shanghai, China. ISAAC 19

In the theory weekly seminar at UC Irvine (presenting someone else’s work):

May 2019. Near-optimal compression for the planar graph metric. SODA 18.
February 2019. Graph Reconstruction and Verification. TALG 18.
November 2018. Tracking Paths. CIAC 17.
May 2018. A Polynomial Sized Kernel for Tracking Paths Problem. LATIN 18.
January 2018. Approximation Schemes for 0-1 Knapsack. SOSA 18.
November 2017. Algorithms for Speed Scaling. FOCS 95.
December 2017. Greedy Hypervolume Subset Selection in the Three-Objective Case. GECCO 15.
March 2017. Anti-persistence: History Independent Data Structures. STOC 01.
November 2016. Differential Privacy: A Survey of Results. TAMC 08.

Projects

Rainfall Predictor

ML for determining whether it is going to rain

dbms

Database from scratch

MSc Thesis

Scheduling algorithms in variable-speed processors

Neural Network Art

A social network application

MOSAL

MultiObjective Sequence Alignment tool

PeMo

An XMPP Instant Messaging client written in Haskell

qccompiler

A quasi-C compiler from scratch

GL-TicTacToe

Tic-Tac-Toe in a 3D environment.

Coimbra TechScene

Online directory of technology companies situated in Coimbra, Portugal.

SocNet

A social network application

Deflate

Data compression algorithm implementation

Past

I received my MSc degree from Chalmers University of Technology, where I worked on scheduling algorithms, under Prof. Chien-Chung Huang‘s supervision.

Previously, I attended the University of Coimbra in Portugal, where I worked with Prof. Luís Paquete on Multiobjective optimization and helped develop an online sequence alignment tool. I also worked on computational art applications of Machine Learning and Evolutionary Algorithms, under the supervision of Prof. Penousal Machado.