Jan Bok Personal homepage

I am a PhD student and a part-time researcher at the Computer Science Institute of the Faculty of Mathematics and Physics, Charles University. My advisor is Professor Jaroslav Nešetřil. My main research interests are graph theory and cooperative game theory.

For more information, see my curriculum vitae and list of publications.

Research interests

Contact

My email address is bok@iuuk.mff.cuni.cz.

Teaching in summer semester 2021/2022

Publications

The publications are ordered from newest to oldest. Further preprints are available on arXiv.

  1. Jan Bok, Jiří Fiala, Nikola Jedličková, Jan Kratochvíl, and Michaela Seifrtová:
    Computational Complexity of Covering Disconnected Multigraphs.
    In Fundamentals of Computation Theory, FCT 2021, volume 12867 of Lecture Notes in Computer Science, pages 85--89, 2021.
    [proceedings link]
  2. Jan Bok, Jiří Fiala, Petr Hliněný, Nikola Jedličková, and Jan Kratochvíl:
    Computational Complexity of Covering Multigraphs with Semi-Edges: Small Cases.
    In 46th International Symposium on Mathematical Foundations of Computer Science, MFCS 2021, volume 202 of Leibniz International Proceedings in Informatics (LIPIcs), pages 21:1--21:15, 2021.
    [proceedings link], [arXiv]
  3. Jan Bok:
    Cooperative Interval Games and Selections Revisited.
    Accepted to SOR'21, 2021.
  4. Jan Bok, and Martin Černý:
    1-convex extensions of partially defined cooperative games and the average value.
    Submitted, 2021.
    [arXiv]
  5. Jan Bok, Martin Černý, David Hartman, and Milan Hladík:
    Convexity and positivity in partially defined cooperative games.
    Submitted, 2021.
    [arXiv]
  6. Jan Bok, Richard B. Brewster, Tom\'{a}s Feder, Nikola Jedličková, and Pavol Hell:
    List Homomorphism Problems for Signed Graphs.
    Submitted, 2021.
    [arXiv]
  7. Jan Bok, and Nikola Jedličková:
    Edge-sum distinguishing labeling.
    Commentationes Mathematicae Universitatis Carolinae 62(2):135--149, 2021.
    [arXiv]
  8. Jan Bok, Nikola Jedličková, Barnaby Martin, Daniël Paulusma, and Siani Smith:
    Injective Colouring for H-Free Graphs.
    In Computer Science – Theory and Applications, CSR 2021, volume 12730 of Lecture Notes in Computer Science, pages 18--30, 2021.
    [proceedings link]
  9. Jan Bok, Nikola Jedličková, Barnaby Martin, Pascal Ochem, Daniël Paulusma, and Siani Smith:
    Acyclic, Star and Injective Colouring: A Complexity Picture for H-Free Graphs.
    Submitted, 2021.
    [arXiv]
  10. Jan Bok, Nikola Jedličková, and Jana Maxová:
    A Relaxed Version of Šoltés’s Problem and Cactus Graphs.
    Bulletin of the Malaysian Mathematical Sciences Society, online first, 2021.
    [journal link], [arXiv]
  11. Jan Bok, Richard B. Brewster, Tomás Feder, Nikola Jedličková, and Pavol Hell:
    List Homomorphism Problems for Signed Graphs.
    In 45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020, volume 170 of Leibniz International Proceedings in Informatics (LIPIcs), pages 170:20:1--20:14, 2020.
    [proceedings link]
  12. Jan Bok, Nikola Jedličková, Barnaby Martin, Daniël Paulusma, and Siani Smith:
    Acyclic, Star and Injective Colouring: A Complexity Picture for H-Free Graphs.
    In 28th Annual European Symposium on Algorithms, ESA 2020, volume 173 of Leibniz International Proceedings in Informatics (LIPIcs), pages 173:22:1--22:22, 2020.
    [proceedings link], [arXiv]
  13. Jan Bok, Nikola Jedličková, and Jana Maxová:
    On relaxed Šoltés's problem.
    Acta Mathematica Universitatis Comenianae 88(3):475--480, 2019.
  14. Jan Bok, and Jana Maxová:
    Characterizing subclasses of cover-incomparability graphs by forbidden subposets.
    Order 36(2):349--358, 2019.
    [journal link], [arXiv]
  15. Jan Bok, Boris Furtula, Nikola Jedličková, and Riste Škrekovski:
    On Extremal Graphs of Weighted Szeged Index.
    MATCH 82(1):93--109, 2019.
    [arXiv]
  16. Jan Bok, and Jaroslav Nešetřil:
    Graph-indexed random walks on pseudotrees.
    Electronic Notes in Discrete Mathematics 68:263--268, 2018.
    [journal link]
  17. Jan Bok, and Milan Hladík:
    Selection-Based Approach to Cooperative Interval Games.
    In Operations Research and Enterprise Systems, ICORES 2015, volume 577 of Communications in Computer and Information Science, pages 40-53, 2015.
    [proceedings link], [arXiv]