Julia Böttcher Departamento de Ciência da Computação Instituto de Matemática e Estatística Universidade de São Paulo Rua do Matão, 1010 Cidade Universitária SP, 05508-090 São Paulo T +55 11 628 900 32 F +55 11 3091-6134 julia@ime.usp.br Personal Data born nationality on September 8, 1979 in Erfurt German Education September 1994 July 1998 Albert-Schweizer-Gymnasium, Erfurt, Germany (Abitur with final grade 1.0) October 1998 January 2005 student of computer science with a minor in physics, Department of Computer Science, Humboldt-Universität zu Berlin, Germany, diploma thesis on Coloring sparse random k-colorable graphs in polynomial expected time (Diplom with final grade 1.1) September 2001 May 2002 exchange student at the University of Toronto, Canada January 2005 March 2005 participant of the Doccourse Prague 2005 on Ramsey Theory, Univerzita Karlova v Praze, Czech Republic April 2005 June 2009 PhD student at the Department of Mathematics, Technische Universität München (supervised by A. Taraz), PhD thesis on Embedding large graphs - The Bollobás-Komlós conjecture and beyond (summa cum laude) September 2006 June 2007 research visit at the Einstein Institute of Mathematics, Hebrew University, Jerusalem, Israel April 2008 research visit at the Departamento de Ciência da Computação, Instituto de Matemática e Estatística, Universidade de São Paulo, Brazil Academic Work Experience November 1999 August 2001 assistant in the research group Databases and Information Systems, Department of Computer Science, Humboldt-Universität zu Berlin January 2002 May 2002 teaching assistant for the course Statistical Natural Language Processing, Department of Computer Science, University of Toronto, Canada October 2002 October 2004 assistant in the research group Algorithms and Complexity, Department of Computer Science, Humboldt-Universität zu Berlin, Germany page 1
April 2005 September 2009 research assistant in the research group Applied Geometry and Discrete Mathematics, Technische Univertität München, Germany since October 2009 Postdoc at the Departamento de Ciência da Computação, Instituto de Matemática e Estatística, Universidade de São Paulo, Brazil Grants and awards 2005 scholarship of the EU-network COMBSTRU for participation in the Doccourse Prague 2006 Minerva Fellowship of the Minerva Foundation for a 9-months research visit to Israel 2007 IBM Research travel award for the 18th SODA conference 2008 Women for Math Science Award, Technische Universität München, for a 1-month research visit to Brazil 2009 EUBRANEX Postdoc grant of the European Union 2010 and 2011 Postdoc grant of the brazilian research foundation FAPESP Journal publications Spanning 3-colourable subgraphs of small bandwidth in dense graphs. (with M. Schacht and A. Taraz) Journal of Combinatorial Theory Series B, 98(4), 752 777, 2008. Bandwidth, treewidth, separators, expansion, and universality. Extended Abstract. (with K. Pruessmann, A. Taraz, and A. Würfl) Electronic Notes on Discrete Mathematics, 31, 91 96, 2008. On the tractability of coloring semirandom graphs. (with D. Vilenchik ) Information Processing Letters 108 (3), 143 149, 2008. Proof of the bandwidth conjecture of Bollobás and Komlós. (with M. Schacht and A. Taraz) Mathematische Annalen 343(1), 75 205, 2009. Bandwidth, expansion, treewidth, separators, and universality. (with K. Pruessmann, A. Taraz and A. Würfl) European Journal of Combinatorics 31, 1217 1227, 2010. Embedding into bipartite graphs. (with P. Heinig and A. Taraz) SIAM Journal of Discrete Mathematics, 1215 1233, 2010. The tripartite Ramsey number of trees. (with J. Hladký and D. Piguet) Journal of Graph Theory, accepted for publication, 37 pages. Filling the gap between Turán s theorem and Pósa s conjecture. (with P. Allen and J. Hladký) Journal of the London Mathematical Society, accepted for publication, 33 pages. Almost spanning subgraphs of random graphs after adversarial edge removal (with Y. Kohayakawa and A. Taraz) submitted, 43 pages. Properly coloured copies and rainbow copies of large graphs with small maximum degree. (with Y. Kohayakawa and A. Procacci) submitted, 9 pages. Turánnical hypergraphs. (with P. Allen, J. Hladký and D. Piguet) submitted, 30 pages. Perfect graphs of fixed density: counting and homogenous sets. (with A. Taraz and A. Würfl) submitted, 20 pages. page 2
Forcing spanning subgraphs via Ore-type conditions. (with S. Müller) manuscript, in preparation, 22 pages. A density Corrádi-Hajnal theorem. (with P. Allen, J. Hladký and D. Piguet) manuscript, in preparation, 31 pages. Finding Tight Hamilton cycles in random hypergraphs. (with P. Allen, Y. Kohayakawa and Y. Person) manuscript, in preparation, 13 pages. The chromatic threshold of graphs. (with P. Allen, S. Griffiths, Y. Kohayakawa and R. Morris) manuscript, in preparation, 23 pages. Publications in conference proceedings (refereed) Coloring sparse random k-colorable graphs in polynomial expected time. In Proceedings of the 30th International Symposium on Mathematical Foundations of Computer Science (MFCS),156 167, 2005. On the bandwidth conjecture for 3-colourable graphs. Extended Abstract. (with M. Schacht and A. Taraz) In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA), 618 626, 2007. Embedding spanning subgraphs of small bandwidth. Extended Abstract. (with M. Schacht and A. Taraz) Electronic Notes on Discrete Mathematics 29 (EuroComb, Sevilla), 485 489, 2007. Bandwidth, treewidth, separators, expansion, and universality. Extended Abstract. (K. Pruessmann, A. Taraz, and A. Würfl) Electronic Notes on Discrete Mathematics 31(CGGT, Paris), 91 96, 2008. Minimum degree conditions for large subgraphs. Extended Abstract. (with P. Allen, O. Cooley and J. Hladký) Electronic Notes on Discrete Mathematics 34 (EuroComb, Bordeaux), 75 79, 2009. Forcing spanning subgraphs via Ore type conditions. Extended Abstract. (with S. Müller) Electronic Notes on Discrete Mathematics 34 (EuroComb, Bordeaux), 255 259, 2009. The tripartite Ramsey number for trees. Extended Abstract. (with J. Hladký and D. Piguet) In Electronic Notes on Discrete Mathematics 34 (EuroComb, Bordeaux), 597 601, 2009. Almost spanning subgraphs of random graphs after adversarial edge removal. Extended Abstract. (with Y. Kohayakawa and A. Taraz) Electronic Notes on Discrete Mathematics 35 (LAGOS, Gramado), 35, 335 340, 2009. Conferences and Workshops July 2002 August 2002 "AARMS Summer School in Mathematics, Department of Mathematics, Memorial University, St. John s, New Foundland, Canada September 2002 summer school "Informatica Feminale, Universität Bremen, Germany May 2004 KAM spring school on Combinatorics in Vysoka Lipa, Czech Republic, talk on "3-colouring graphs without long induced paths in polynomial time May 2005 KAM spring school on "Combinatorics in Borová Lada,Czech Republic, talk on "3-colouring in expected polynomial time and semidefinite programming June 2005 CGC spring school "Enumerative Combinatorics in Netzeband near Berlin, Germany, and IPCO summer school "Randomised Methods in Combinatorics and Optimisation in Berlin July 2005 "XII Midsummer Combinatorial Workshop in Prague, Czech Republic August 2005 "30th International Symposium on Mathematical Foundations of Computer Science, Gdansk, Poland, talk on "Coloring sparse random k-colorable graphs in polynomial expected time September 2005 "Advanced Course on Recent Trends on Combinatorics in the Mathematical Context, Centre de Recerca Matemàtica, Universitat Autònoma de Barcelona, Spain page 3
July 2006 "Sixth Czech-Slovak International Symposium on Combinatorics, Graph Theory, Algorithms and Applications in Prague, Czech Republic, talk on "Embedding spanning graphs of bounded bandwidth into dense graphs August 2006 ASZ summer school "Extremal Graph Theory and Random Graphs in Chorin near Berlin, Germany January 2007 ACM-SIAM Symposium on Discrete Algorithms (SODA) in New Orleans, Louisiana, U.S.A., talk "On the bandwidth conjecture for 3-colourable graphs" May 2007 "11th Midrasha Mathematicae on Polytopes, Graphs, and Convexity, Institute for Advanced Studies, Hebrew University, Jerusalem, Israel June 2007 "13th International Conference on Random Structures and Algorithms in Tel Aviv, Israel, talk on "Bounded degree subgraphs of dense graphs" July 2007 "Berlin-Poznan Seminar, Humboldt Universität zu Berlin, Germany August 2007 "XIII Midsummer Combinatorial Workshop in Prague, Czech Republic, talk on "Bounded degree graphs of sublinear bandwidth" September 2007 "European Conference on Combinatorics, Graph Theory and Applications in Sevilla, Spain, talk on "Embedding spanning subgraphs of small bandwidth" April 2008 "8th Latin American Theoretical Informatics Symposium in Búzios, Rio de Janeiro, Brazil May 2008 "Topological & Geometric Graph Theory in Paris, France, talk on "Bandwidth, treewidth, separators, expansion, and universality" June 2008 "Berlin Poznan Seminar, Humboldt Universität zu Berlin, Germany, talk on "(Not) separating between sublinear and linear bandwidth and treewidth July 2008 "XIV Midsummer Combinatorial Workshop in Prague, Czech Republic, talk on "Forbidden induced subgraphs" November 2008 "Colloquium on Combinatorics, Otto-von-Guericke-Universität Magdeburg, Germany, talk on "Colouring semirandom graphs July 2009 "XV Midsummer Combinatorial Workshop in Prague, Czech Republic August 2009 "14th International Conference on Random Structures and Algorithms in Poznan, Poland, talk on "Local resilience of random graphs with respect to universality for almost spanning subgraphs" September 2009 "European Conference on Combinatorics, Graph Theory and Applications in Bordeaux, France, talk on "Forcing spanning subgraphs via Ore type conditions November 2009 "V Latin-American Algorithms, Graphs, and Optimization Symposium in Gramado, Brazil, talk on "Almost spanning subgraphs of random graphs after adversarial edge removal May 2010 "Symposium Diskrete Mathematik, in Wien, Austria invited talk on Random restrictions May 2010 Oberwolfach Seminar on "Semidefinite Programming, talk on "Colouring k-colourable graphs and semidefinite programming" page 4
August 2010 "Szemerédi is 70, in Budapest, Hungary August 2010 Workshop "Extremal and Probabilistic Combinatorics, Frauenchiemsee, Germany January 2011 Oberwolfach Workshop "Combinatorics, Oberwolfach, Germany talk on "The chromatic threshold of graphs Other Activities 2000 2004 member of the student union of the department of computer science, Humboldt-Universität zu Berlin (co-coordination of infomation days for high school students and trips for first year students) 2002 2003 member of the program committee of the Informatica Feminale 2002 2004 student counsellor for women in computer science, Humboldt-Universität zu Berlin June 2004 public talk on The travelling salesman problem, long night of sciences, Berlin September 2004 co-coordination of a seminar on graph theory and java programming for high school students, Berlin Mai 2006 and 2008 co-coordination of the MatBoj mathematics contest, Technische Universität München 2008 2009 assistant women s representative, department of mathematics, TU München, 2009: coordination of the award Women for Math Science April 2010 member of the PhD committee for Pavlos Bahia Konstadinidis at the Universidade de São Paulo October 2010 member of the committee for the student symposium V Simpósio de Iniciação Científica e Pós-Graduação do IME-USP at the Universidade de São Paulo 2011 organisation (together with Robert Morris) of the Sessão Temática de Combinatória, as part of the 28th Brazilian Colloquium of Mathematics refereeing for journals Algorithmica, Discrete Applied Mathematics, Discrete and Computational Geometry, Discrete Mathematics, Electronical Journal of Combinatorics, Journal of Combinatorial Theory (B), Journal of Graph Theory, Random Structures and Algorithms, SIAM Journal of Discrete Mathematics, Theoretical Computer Science refereeing for conferences "APPROX/RANDOM 2008, MFCS 2010 page 5