Department Mathematics and Information Technology

Organisational unit: Departments and Institutes

Research output

  1. E-pub ahead of print

    On Newman and Littlewood polynomials with prescribed number of zeros inside the unit disk

    Jankauskas, J. & Hare, K., 27 Oct 2019, (E-pub ahead of print) In: Mathematics of computation. 90.2021, March, p. 831-870 40 p.

    Research output: Contribution to journalArticleResearchpeer-review

  2. Published

    A hybrid result related to Waring´s Problem, squarefree numbers, and digital restrictions.

    Jancevskis, M., 2010, In: Mathematica Pannonica. 21, p. 37-58

    Research output: Contribution to journalArticleResearchpeer-review

  3. Published

    Near-optimal Regret Bounds for Reinforcement Learning

    Jaksch, T., Ortner, R. & Auer, P., 2010, In: Journal of machine learning research (JMLR). 11, p. 1563-1600

    Research output: Contribution to journalArticleResearchpeer-review

  4. Published

    Embedding Graphs into Cartesian Products

    IMRICH, W., Dec 1989, In: Annals of the New York Academy of Sciences. 576, 1, p. 266-274 9 p.

    Research output: Contribution to journalArticleResearchpeer-review

  5. Published

    On graphical regular representations of cyclic extensions of groups

    Imrich, W. & Watkins, M. E., Dec 1974, In: Pacific journal of mathematics. 55, 2, p. 461-477 17 p.

    Research output: Contribution to journalArticleResearchpeer-review

  6. Published

    Factoring directed graphs with respect to the cardinal product in polynomial time II

    Imrich, W. & Klöckl, W., 2010, In: Discussiones mathematicae / Graph theory. 30, p. 461-474

    Research output: Contribution to journalArticleResearchpeer-review

  7. Published

    Two-ended regular median graphs

    Imrich, W. & Klavzar, S., 2011, In: Discrete mathematics. 311, p. 1418-1422

    Research output: Contribution to journalArticleResearchpeer-review

  8. Published

    Topics in Graph Theory: Graphs and their Cartesian Product

    Imrich, W., Klavzar, S. & Rall, D., 2008, Wellesley, Massachusetts USA. 205 p.

    Research output: Book/ReportBookEducationpeer-review

  9. Published

    Approximate graph products

    Imrich, W., Hellmuth, M., Stadler, P. F. & Klöckl, W., 2009, In: European journal of combinatorics. 30, p. 1119-1133

    Research output: Contribution to journalArticleResearchpeer-review

  10. Published

    Fast recognition of classes of almost-median grapphs

    Imrich, W., Lipovec, A., Peterin, I. & Zigert, P., 2007, In: Discrete mathematics. 307, p. 464-471

    Research output: Contribution to journalArticleResearchpeer-review