Jan Bok

Orcid: 0000-0002-7973-1361

Affiliations:

LIMOS, University of Clermont Auvergne, Aubière, France
Computer Science Institute, Faculty of Mathematics and Physics, Charles University, Czech Republic

According to our database¹, Jan Bok authored at least 25 papers between 2015 and 2024.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Bibliography

2024

List Covering of Regular Multigraphs with Semi-edges.

[BibT_eX]

[DOI]

Algorithmica, March, 2024

Resolving Sets in Temporal Graphs.

[BibT_eX]

[DOI]

Jan Bok

Antoine Dailly

Tuomo Lehtilä

CoRR, 2024

2023

List homomorphism problems for signed trees.

[BibT_eX]

[DOI]

Discret. Math., 2023

Computational Complexity of Covering Colored Mixed Multigraphs with Degree Partition Equivalence Classes of Size at Most Two (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2023

2022

Min Orderings and List Homomorphism Dichotomies for Signed and Unsigned Graphs.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2022: Theoretical Informatics, 2022

List Covering of Regular Multigraphs.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 33rd International Workshop, 2022

List Homomorphisms to Separable Signed Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Discrete Applied Mathematics, 2022

2021

1-convex extensions of partially defined cooperative games and the average value.

[BibT_eX]

[DOI]

Jan Bok

Martin Cerný

CoRR, 2021

Computational Complexity of Covering Two-vertex Multigraphs with Semi-edges.

[BibT_eX]

[DOI]

CoRR, 2021

Computational Complexity of Covering Multigraphs with Semi-Edges: Small Cases.

[BibT_eX]

[DOI]

Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

Computational Complexity of Covering Disconnected Multigraphs.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory - 23rd International Symposium, 2021

Injective Colouring for H-Free Graphs.

[BibT_eX]

[DOI]

Proceedings of the Computer Science - Theory and Applications, 2021

2020

Convexity and positivity in partially defined cooperative games.

[BibT_eX]

[DOI]

CoRR, 2020

List Homomorphism Problems for Signed Graphs.

[BibT_eX]

[DOI]

Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

Acyclic, Star and Injective Colouring: A Complexity Picture for H-Free Graphs.

[BibT_eX]

[DOI]

Proceedings of the 28th Annual European Symposium on Algorithms, 2020

2019

Characterizing Subclasses of Cover-Incomparability Graphs by Forbidden Subposets.

[BibT_eX]

[DOI]

Jan Bok

Jana Maxová

Order, 2019

A relaxed version of Šoltés's problem and cactus graphs.

[BibT_eX]

[DOI]

Jan Bok

Nikola Jedlicková

Jana Maxová

CoRR, 2019

On Extremal Graphs of Weighted Szeged Index.

[BibT_eX]

[DOI]

CoRR, 2019

2018

Graph-indexed random walks on pseudotrees.

[BibT_eX]

[DOI]

Jan Bok

Jaroslav Nesetril

Electron. Notes Discret. Math., 2018

On convexity and solution concepts in cooperative interval games.

[BibT_eX]

[DOI]

Jan Bok

CoRR, 2018

A note on simultaneous representation problem for interval and circular-arc graphs.

[BibT_eX]

[DOI]

Jan Bok

Nikola Jedlicková

CoRR, 2018

Edge-sum distinguishing labeling.

[BibT_eX]

[DOI]

Jan Bok

Nikola Jedlicková

CoRR, 2018

Graph-indexed random walks on special classes of graphs.

[BibT_eX]

[DOI]

Jan Bok

CoRR, 2018

Algorithmic aspects of graph-indexed random walks.

[BibT_eX]

[DOI]

Jan Bok

CoRR, 2018

2015

Selection-Based Approach to Cooperative Interval Games.

[BibT_eX]

[DOI]

Jan Bok

Milan Hladík

Proceedings of the Operations Research and Enterprise Systems, 2015

Jan Bok

Timeline

Legend:

Links

Online presence:

On csauthors.net:

Bibliography

Loading...