Curriculum Vitae


Contact Information

picture

Domingos Dellamonica Jr., PhD

Rua Prof. Carlo Bruneti, 317
São Paulo, SP, Brasil    02339-100
+55 11 8448-0600
domingos.junior@gmail.com


Education

  • Emory University, Ph.D. in Mathematics (2007-2012)

  • University of São Paulo, Master in Computer Science (2005-2007)

  • University of São Paulo, BSc. (with honors) in Computer Science (2001-2004)

Peer-reviewed Publications

15) Dellamonica, Penny Haxell, Tomasz Łuczak, Dhruv Mubayi, Brendan Nagle, Yuri Person, Vojtěch Rödl, Mathias Schacht, Tree-minimal graphs are almost regular, to appear in Journal of Combinatorics.

14) Dellamonica, Daniel M. Martin, Vojtěch Rödl, Asaf Shapira, Subrahmanyam Kalyanasundaram, A Deterministic Algorithm for the Frieze-Kannan Regularity Lemma, SIAM J. on Discrete Math (SIDMA), vol. 26, issue 1, pages 15-19 (2012).

13) Dellamonica, Yoshiharu Kohayakawa, Vojtěch Rödl, Andrzej Ruciński, Universality of random graphs, SIAM J. on Discrete Math (SIDMA), vol. 26, issue 1, pages 353-374 (2012).

12) Dellamonica, Penny Haxell, Tomasz Łuczak, Dhruv Mubayi, Brendan Nagle, Yuri Person, Vojtěch Rödl, Mathias Schacht, Jacques Verstraëte, On even-degree subgraphs of linear hypergraphs, Combinatorics Probability and Computing, vol. 21, issue 1-2, pages 113-127 (2012).

11) Dellamonica and Vojtěch Rödl, Distance preserving Ramsey graphs, Combinatorics Probability and Computing, vol. 21, issue 4, pages 554-581 (2012).

10) Dellamonica and Vojtěch Rödl, A note on Thomassen's conjecture, Journal of Combinatorial Theory, Series B., vol. 101, issue 6, pages 509-515 (2011).

9) Dellamonica, The size-Ramsey number of trees, Random Structures & Algorithms, vol. 40, issue 1, pages 49-73 (2012).

8) Dellamonica, Václav Koubek, Daniel M. Martin, and Vojtěch Rödl, On a conjecture of Thomassen concerning subgraphs of large girth, Journal of Graph Theory, vol. 67, issue 4, pages 316–331 (2011).

7) Dellamonica, Peter Frankl, and Vojtěch Rödl, A theorem on incidence matrices and quasirandom hypergraphs, Contemporary Mathematics, pages 201-207 (2010).

6) Dellamonica and Vojtěch Rödl, Hereditary quasirandom properties of hypergraphs, Combinatorica, vol. 31, issue 2, pages 165-182 (2011).

5) Dellamonica, Colton Magnant, and Daniel M. Martin, Rainbow paths, Discrete Mathematics, vol. 310, issue 4, pages 774-781 (2010).

4) Dellamonica, An asymmetric condenser, Lecture Notes on Computer Science, vol. 4957, pp. 664-675, Springer (2008).

3) Dellamonica and Yoshiharu Kohayakawa, An algorithmic Friedman-Pippenger theorem on tree embeddings, The Electronic Journal of Combinatorics, vol 15(1), R127 (2008).

2) Dellamonica, Martin Marciniszyn, Yoshiharu Kohayakawa, and Angelika Steger, The resilience of long cycles in random graphs, The Electronic Journal of Combinatorics, vol 15(1), R32 (2008).

1) Dellamonica, Paulo J. S. Silva, Carlos Humes Jr, Nina S. T. Hirata, and Junior Barrera, An Exact Algorithm for Optimal MAE Stack Filter Design, IEEE Transactions on Image Processing, vol. 16, issue 2, pages 453-462 (2007).


Conference Participation (as speaker)

  • RSA (Random Structures and Algorithms), Atlanta - GA (2011)

  • BIRS Workshop (Sparse Pseudorandom Objects), Banff - Canada (2010)

  • Eurocomb (European Conference on Combinatorics, Graph Theory and Applications), Bordeaux - France (2009)

  • Latin (Latin American Theoretical Informatics Symposium), Búzios - Brazil (2008)

  • SODA (Symposium on Discrete Algorithms), San Francisco - CA (2008)

  • RSA (Random Structures and Algorithms), Tel Aviv - Israel (2007)

  • ISMP (International Symposium on Mathematical Programming), Rio de Janeiro - Brazil (2006)

  • SODA (Symposium on Discrete Algorithms), Miami - FL (2006)

Scholarships and Fellowships

  • PRISM/NSF GK-12, training, development and implementation of PBL cases in Tri-Cities (Atlanta) Public High School, 2009-2010

  • Fulbright-CAPES Ph.D. Scholarship, Emory University, 2007-2011

  • FAPESP Master Program Scholarship, University of São Paulo, 2005-2007

Awards

  • Bronze medal, National Mathematics Olympiad (University Level), 2004 - Brazilian Mathematical Society

  • Silver medal, Jornadas de Iniciação Científica (REU monograph), 2004 - IMPA

Teaching Experience

  • Emory University, Calculus with Business Application, Fall 2010

  • PRISM - Tri-Cities High School, 11th grade Physical Science, 2009-2010

  • Emory University, Calculus I, Fall 2008

Software Development

Languages: C, C++, C#, Java, VB, PHP

Frameworks and Technologies: .NET, LINQ, WPF, Zend, MapReduce

IDEs: Visual Studio, Eclipse, Netbeans

Web: HTML + CSS

Methodologies: Extreme Programming, Unit Testing, Code Reviews

Relational database with MySQL: modelling, SQL queries

Experience:

  • Software engineer intern at Google (Summer 2011). Developed tools for statistical compilation and (historical) analysis of AdSense accounts to improve the automated detection of spam accounts.

  • Software engineer on the African Origins (http://www.african-origins.org) website at Emory University (Spring + Fall 2011). Tools: MySQL, PHP + Zend Framework, Java Servlets. A component of this project which I developed is an approximate search algorithm that matches modern African names with their historical counterparts.

  • Coded a custom implementation of the Network Simplex algorithm to solve a large scale optimization problem (see Publication 1 above). Solution involved programming network data structures supporting on-the-fly generation of nodes and links (this required customized memory management). Tools: C++ (on linux).

    Source code and samples available at http://www.vision.ime.usp.br/nonlinear/stackfd/

  • Programmed and deployed custom software for specialized business applications (inventory control, customer management etc). Tools: MySQL and C# (Visual Studio).
  • Team member in a project of the University of São Paulo which employed eXtreme Programming (XP) to develop a library application. Tools: Java (Eclipse).

The newest version of this CV is available at http://mathcs.emory.edu/~ddellam/cv.html