Curriculum Vitae. Jacques Verstraete

Transcription

1 Curriculum Vitae Jacques Verstraete

2 Personal Details Affiliation Department of Mathematics, University of California, San Diego. Webpage jverstra Qualifications B.Sc., B.Sc. (Honours) (University of Natal) M.Sc. (University of Natal) Cert. Advanced Study in Math (Cambridge University) Ph.D. (Cambridge University) Postdoc Fellowship (Theory Group, Microsoft Research) Assistant Professor (University of Waterloo). Assistant Professor (McGill University). Associate Professor (Step II, UCSD). Academic Awards NSF Grant DMS ( ). Alfred P. Sloan Research Fellowship ( ). Hellman Fellowship ( ). Thurgood Marshall College Research Stipend (2009). UCSD Senate Travel Award (2008). Canadian Foundation for Innovation : New Opportunities Grant ( ). Prize for solution to Erdős problem (2006). National Science and Engineering Research Council of Canada : Individual Research Discovery Grant ( ). 1st Prize in Smith-Knight Mathematical competition at Cambridge (2001). Nelson Mandela Scholarship from the Cambridge Commonwealth trust and Corpus Christi College for PhD study (2000). Distinction for Part III essay (supervisor Professor W.T. Gowers) (1999). entitled: density of integer sets without given configurations. College scholar prize for mathematics, Corpus Christi College (1999). Certificate of Advanced Study in Math (Cambridge), graduated with distinction (1999). Master s Thesis : Supervisors: Professor P. Dankelmann and Professor H. Swart. South African Mathematics Society Medal (1998). Research Interests Extremal graph theory. Information and coding theory. Combinatorial number theory. Random graphs and probabilistic methods. Randomized algorithms.

3 Teaching UCSD: Additive and Combinatorial Number Theory (Graduate) (Fall 2010). UCSD: Math 10B: Single Variable Calculus (Fall 2010). UCSD: W. T. Lowell Putnam Training Course (Fall 2010). UCSD: Math 142A: Advanced calculus (Summer 2010). UCSD: Math 154: Discrete Mathematics (Winter 2009). UCSD: Math 20E: Vector Calculus (Spring 2009). UCSD: Math 20E: Vector Calculus (Fall 2008). UCSD: Math 154: Discrete Mathematics (Fall 2008). UCSD: Probabilistic Combinatorics and Algorithms (Graduate) (Fall 2008, Winter 2009). UCSD: Topics Course in Probabilistic Methods (Graduate) (Fall 2007). McGill University: Introduction to Discrete Mathematics II (Winter 2006). Probabilistic Methods (Graduate) (Winter 2006). McGill University: Introduction to Discrete Mathematics (Computer Science Students) (Fall 2006) University of Waterloo: Introduction to Graph Theory, Graduate Course - Probabilistic Methods (2006). University of Waterloo: Calculus for Math Honours, Linear Algebra, Introduction to Graph Theory, Introduction to Combinatorics ( ). University of Waterloo: Graduate Course - Probabilistic Methods, Introduction to Combinatorics (2003). University of Washington: Graduate Course - Probabilistic and Extremal Combinatorics, Advanced Multivariate Calculus (2002). Students Franklin Wu (URA) UCSD (Thesis completed) Alex Eustis (PhD) UCSD (Thesis in Progress) Ameerah Chowdhury (MSc under Chris Godsil) (PhD) UCSD (Thesis in Progress) Nithum Thain (Msc) McGill University. Ararat Harutyunyan (MSc) (PhD under Bojan Mohar) Graduated McGill University. David Azose (URA) McGill University. Undergraduate Research Assistant. David Pritchard (PhD under Jochen Könemann) University of Waterloo. Michael Cavers (MSc) Graduated Master s Essay completed : Clique partitions and clique covers of graphs. Hamed Shirazi (MSc) (PhD under Chris Godsil) Graduated Master s Thesis completed : Regular subgraphs of graphs. Ben Seamone (MSc) Graduated Thesis completed : Hamiltonian cycles in regular graphs, jointly supervised with Professor P. Haxell) Andrew Hoefel (URA) Project 2004 : Invariant Linear Equations. Undergraduate Research Assistant (University of Waterloo).

4 Authored course notes A course in the probabilistic method (McGill University and UCSD) Introduction to Combinatorics. (McGill University and UCSD) Additive and combinatorial number theory (University of Cambridge) Joint with Professor W. T. Gowers Descriptive set theory and Borel complexity (University of Cambridge) based on the course by Tim Gowers Commutative algebra and functional analysis (University of Cambridge) Introduction to Graph Theory (University of Waterloo) Recent Invited Lectures Oberwolfach Combinatorics Conference (2011) SIAM Annual Meeting: session on probabilistic combinatorics (2010) IPAM Long program in combinatorics (UCLA): Workshop on graphs and hypergraphs (2009) Department of Mathematics, UCLA (2008, 2009, 2010) Extremal combinatorics meeting, Rényi Institute, Budapest (2007). Lectures at Oberwolfach Combinatorics Meeting (2002, 2004, 2006, 2008). SIAM Discrete Mathematics 2006 Meeting, Victoria, BC (2006) [Turán problems for cycles in hypergraphs]. California Institute of Technology, Discrete Mathematics Seminar Fields Institute. Ontario Combinatorics Workshop (2006). Princeton Discrete Math seminar (2005) [Intersecting Families]. IEEE ISIT in Adelaide, Australia (2005) [Improved bounds on the size of sparse parity check matrices]. IPCO XI TU in Berlin (2005) [Approximation algorithms and hardness results for cycle packing]. CMS Meeting, Waterloo (2005) [Regular subgraphs of random graphs]. Carnegie Mellon (2005) [Factoring and polynomials]. University of Natal Discrete Mathematics Seminar. [Cycles in planar graphs] (2005). Fields Institute (2004) [Martingale inequalities with combinatorial applications]. Number Theory Seminar, Waterloo (2005) [Invariant linear equations]. Tutte Seminar and Algebraic combinatorics seminar, Waterloo (2005) [Counting Homomorphisms]. Tutte Seminar Lectures (2003 and 2004). AMS Sectional Meeting in extremal combinatorics at Bard College, New York (2005) and Bloomington Indiana (2004). List of Publications Penny Haxell, Jacques Verstraete. List colouring hypergraphs. Electron. J. Combin. Volume 17 no 1. (2010) 12 pages (electronic)

5 Sebastian Cioabă, André Kündgen, Jacques Verstraete. On decompositions of complete hypergraphs. J. Combin. Theory Ser. A 116 (2009), no. 7, Stefaan De Winter, Felix Lazebnik, Jacques Verstraete. An extremal characterization of projective planes. Electron. J. Combin. 15 (2008), no. 1, Research Paper 143, 13 pp. Michael Cavers, Jacques Verstraete. Clique partitions of complements of forests and bounded degree graphs. Discrete Math 308 (2008) no. 10, Benny Sudakov, Jacques Verstraete. Cycle lengths in sparse graphs. Combinatorica 28 (2008) no. 3, Assaf Naor, Jacques Verstraete. Parity check matrices and product representations of squares. Combinatorica 28 (2008) no. 2, Also published in Proceedings ISIT Conference, Adelaide, Australia, September Ivan Rapaport, Karol Suchan, Ioan Todinka, Jacques Verstraete. On Dissemination thresholds in regular and irregular graph classes 8th LATIN American Informatics Journal version to appear in a special Issue of Algorithmica. Hamed Shirazi, Jacques Verstraete. A note on polynomials and f-factors in graphs. Electronic J. Combinatorics 15 (2008) no 1, Note 22, 5 pages. Oleg Pikhurko, Jacques Verstraete. The maximum size of hypergraphs without generalized 4-cycles. J. Combinatorial Theory (Series A) 116 (2009), no. 3, Dhruv Mubayi, Jacques Verstraete. Two-regular subgraphs of hypergraphs. J. Combinatorial Theory (Series B) 99 (2009), no. 3, Dhruv Mubayi, Jacques Verstraete. Minimal paths and cycles in set systems. European J. Combin. 28 (2007), no. 6, Penny Haxell, Ben Seamone, Jacques Verstraete. Independent dominating sets and Hamiltonian cycles. J. Graph Theory 54 (2007), no. 3, Peter Keevash, Dhruv Mubayi, Benny Sudakov, Jacques Verstraete. Rainbow Turn Problems. Combin, Prob. Comput. 16 (2007), no. 1, Michael Krivelevich, Zeev Nutov, Mohammad Salavatipour, Jacques Verstraete, Raphael Yuster. Approximation algorithms and hardness results for cycle packing problems. ACM Trans. Algorithms 3 (2007), no. 4, Art. 48, 21 pp. Jacques Verstraete. Product Representations of Polynomials. European J. Combin Volume 27, Issue 8, November 2006, Pages Zoltan Füredi, Assaf Naor, Jacques Verstraete. On the Turán number of the hexagon. Advances in Mathematics, 203 (2006), (2), Jacques Verstraete. Cycle lengths in planar graphs. Special issue of Utilitas Mathematica in honour of Professor Henda Swart, 69 (2006), Alexandr Kostochka, Jacques Verstraete. Even cycles in hypergraphs. J. Journal of Combinatorial Theory Series B, 94 (2005), no. 1, Dhruv Mubayi, Jacques Verstraete. Proof of a conjecture of Erdos on triangles in setsystems. Combinatorica, 25 (2005), no. 5, Jeong Han Kim, Bela Bollobas, Jacques Verstraete. Regular subgraphs of random graphs. Random Structures Algorithms 29 (2006), no. 1, Mohammad Salavatipour, Jacques Verstraete. Disjoint cycles: integrality gap, hardness, and approximation. Integer programming and combinatorial optimization (IPCO) Lecture Notes in Comput. Sci, 3509, Springer, Berlin, (2005),

6 Assaf Naor, Jacques Verstraete. Bipartite graphs without 2k-cycles. Combinatorics, Probability and Computing, 14 (2005), (5-6) Thomas Lam, Jacques Verstraete. A Note on graphs without short even cycles. Electronic Journal of Combinatorics, Volume 12 (2005). Jacques Verstraete. Unavoidable cycle lengths in graphs. Journal of Graph Theory, 49 (2005), no. 2, Jacques Verstraete. On the number of sets of cycle lengths. Combinatorica, 24 (2004), no. 4, Peter Keevash, Mike Saks, Benny Sudakov, Jacques Verstraete. Multicolour Turan problems. Advances in Applied Mathematics, 33 (2004), no. 2, Dhruv Mubayi, Jacques Versraete. A hypergraph extension of the bipartite Turan problem. Journal of Combinatorial Theory Series A, 106 (2004), no. 2, Felix Lazebnik, Jacques Verstraete. On hypergraphs of girth five. Electronic Journal of Combinatorics, 10 (2003), Research Paper 25, 15 pp. (electronic). Jacques Verstraete. Vertex-disjoint cycles of the same length. Journal of Combinatorial Theory Series B, 88 (2003), no. 1, Jacques Verstraete. Note on vertex-disjoint cycles. Combinatorics, Probability and Computing, 11 (2002), no. 1, Jacques Verstraete. On arithmetic progressions of cycle lengths in graphs. Combinatorics, Probability and Computing, 9 (2000), no. 4, Recent Committees and Service AMS Western Sectional Meeting Organizer, UCLA (2010) W. Lowell Putnam Exam Advisor (2010) Minisymposium organizer, SIAM Discrete Math Conference (2010) NSF Grant Panels, NSF, Washginton (2008, 2009) Math Circles Prize Ceremony, Invited Speaker (2009) Math Circles Training Sessions, Invited Lectures (2009) Topics in graphs and hypergraphs workshop organizer, IPAM (UCLA) (2009) Senate Representative for Thurgood Marshall College (2010-Present) Thurgood Marshall College Executive Committee (2009-Present) Graduate Admissions Committee (2009-Present) Graduate Advising Committee ( ) Editorial Board of Siam Journal of Discrete Mathematics (2009-Present) Marshall Mentor Program (2008-Present)