Contact info:

Institut teoretické informatiky
Univerzita Karlova v Praze
Malostranské náměstí 2/25, 118 00 Praha 1
E-mail: ida@kam.mff.cuni.cz

Education:

University of Illinois, Urbana, Illinois USA

  • Ph.D., Mathematics, December 2010. Advisor: Zoltán Furedi
  • M.Sc., Applied Mathematics, August 2009.
  • Charles University, Prague, Czech Republic

  • B.Sc., Mathematics, May 2003.
  • Publications:

    Book:

  • Kantor, Ida; Matouąek, Jiří; ©ámal, Robert
    Mathematics++. Selected topics beyond the basic courses.
    Student Mathematical Library, 75. American Mathematical Society, Providence, RI, 2015. xii+343 pp. ISBN: 978-1-4704-2261-5

  • Journal papers:

  • Füredi, Zoltán; Kantor, Ida
    List colorings with distinct list sizes, the case of complete bipartite graphs.
    J. Graph Theory 82 (2016), no. 2, 218?227.

  • Bollobás, Béla; Füredi, Zoltán; Kantor, Ida; Katona, Gyula O. H.; Leader, Imre
    A coding problem for pairs of subsets.
    Geometry, structure and randomness in combinatorics, 47?59, CRM Series, 18 (2015), Ed. Norm., Pisa.

  • Kantor, Ida; Patkós, Balázs
    Towards a de Bruijn-Erdős theorem in the L1-metric.
    Discrete Comput. Geom. , 49 (2013), no. 3, 659?670.

  • Barát, János; Füredi, Zoltán; Kantor, Ida; Kim, Younjin; Patkós, Balázs
    Large Bd-free and union-free subfamilies.
    SIAM J. Discrete Math. 26 (2012), no. 1, 71?76.

  • Füredi, Zoltan; Kantor, Ida; Monti, Angelo; Sinaimeri, Blerina
    On reverse-free codes and permutations.
    SIAM J. Discrete Math. 24 (2010), no. 3, 964?978.

  • Neąetřil, Jaroslav; ©vejdarová, Ida
    Small diameters of duals.
    SIAM J. Discrete Math. 21 (2007), no. 2, 374?384.

  • Conference publications:

  • Füredi, Zoltán; Kantor, Ida
    Kneser ranks of random graphs and minimum difference representations.
    European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2017),
    Electron. Notes Discrete Math., 61,499-503, Elsevier Sci. B. V., Amsterdam, 2017.

  • János Barát, Zoltán Füredi, Ida Kantor, Younjin Kim, Balázs Patkós
    Large Bd-free and union-free subfamilies.
    European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2011),
    Electron. Notes Discrete Math., 38,101-104, Elsevier Sci. B. V., Amsterdam, 2011.

  • Zoltán Füredi, Ida Kantor, Angelo Monti, Blerina Sinaimeri
    Reverse-free codes and permutations.
    European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2011),
    Electron. Notes Discrete Math., 38,383-387, Elsevier Sci. B. V., Amsterdam, 2011.

  • Füredi, Zoltán; Kantor, Ida
    List colorings with distinct list sizes, the case of complete bipartite graphs.
    European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2009),
    Electron. Notes Discrete Math., 34,323?327, Elsevier Sci. B. V., Amsterdam, 2009.