default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJan Bok
Person information
- affiliation: Department of Algebra, Faculty of Mathematics and Physics, Charles University, Czech Republic
- affiliation: LIMOS, University of Clermont Auvergne, Aubière, France
- affiliation: Computer Science Institute, Faculty of Mathematics and Physics, Charles University, Czech Republic
Other persons with a similar name
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
2020 – today
- 2026
[j10]Jan Bok
, Jirí Fiala, Petr Hlinený, Nikola Jedlicková, Jan Kratochvíl:
Computational complexity of covering multigraphs with semi-edges: Small cases. J. Comput. Syst. Sci. 156: 103714 (2026)- [c14]Jan Bok, Avinandan Das, Anna Gujgiczer, Nikola Jedlicková:
Generalizing Brooks' Theorem via Partial Coloring Is Hard Classically and Locally. WALCOM 2026: 247-262 - 2025
- [j9]Jan Bok, Nikola Jedlicková, Barnaby Martin, Pascal Ochem, Daniël Paulusma, Siani Smith:
Acyclic, star and injective colouring: A complexity picture for H-free graphs. J. Comput. Syst. Sci. 154: 103662 (2025) - [c13]Jan Bok, Jirí Fiala, Nikola Jedlicková, Jan Kratochvíl:
Computational Complexity of Covering Regular Trees. MFCS 2025: 26:1-26:19 - [i24]Laurent Beaudou, Jan Bok, Florent Foucaud, Daniel A. Quiroz, Jean-Florent Raymond:
Profile and neighbourhood complexity of graphs with excluded minors and tree-structured graphs. CoRR abs/2501.08895 (2025) - [i23]Jan Bok, Jirí Fiala, Nikola Jedlicková, Jan Kratochvíl, Michaela Seifrtová:
Computational Complexity of Covering Colored Mixed Multigraphs with Simple Degree Partitions. CoRR abs/2502.20151 (2025) - [i22]Jan Bok, Santiago Guzmán-Pro, Nikola Jedlicková, César Hernández-Cruz:
On the expressive power of 2-edge-colourings of graphs. CoRR abs/2503.07409 (2025) - [i21]Jan Bok, Jirí Fiala, Nikola Jedlicková, Jan Kratochvíl:
Computational complexity of covering regular trees. CoRR abs/2507.00564 (2025) - [i20]Jan Bok, Avinandan Das, Anna Gujgiczer, Nikola Jedlicková:
Generalizing Brooks' theorem via Partial Coloring is Hard Classically and Locally. CoRR abs/2508.16308 (2025) - 2024
- [j8]Jan Bok, Jirí Fiala, Nikola Jedlicková, Jan Kratochvíl, Pawel Rzazewski:
List Covering of Regular Multigraphs with Semi-edges. Algorithmica 86(3): 782-807 (2024) - [j7]Jan Bok, Richard C. Brewster, Pavol Hell, Nikola Jedlicková, Arash Rafiey:
Min Orderings and List Homomorphism Dichotomies for Graphs and Signed Graphs. Algorithmica 86(7): 2289-2316 (2024) - [j6]Martin Cerný, Jan Bok, David Hartman, Milan Hladík:
Positivity and convexity in incomplete cooperative games. Ann. Oper. Res. 340(2): 785-809 (2024) - [j5]Jan Bok, Jirí Fiala, Nikola Jedlicková, Jan Kratochvíl, Michaela Seifrtová:
Computational complexity of covering disconnected multigraphs. Discret. Appl. Math. 359: 229-243 (2024) - [j4]Jan Bok, Richard C. Brewster, Tomás Feder, Pavol Hell, Nikola Jedlicková:
List homomorphisms to separable signed graphs. Theor. Comput. Sci. 1001: 114580 (2024) - [c12]Jan Bok, Antoine Dailly, Tuomo Lehtilä:
Resolving Sets in Temporal Graphs. IWOCA 2024: 287-300 - [i19]Jan Bok, Antoine Dailly, Tuomo Lehtilä:
Resolving Sets in Temporal Graphs. CoRR abs/2403.13183 (2024) - 2023
- [j3]Jan Bok, Richard C. Brewster, Tomás Feder, Pavol Hell, Nikola Jedlicková:
List homomorphism problems for signed trees. Discret. Math. 346(3): 113257 (2023) - [c11]Jan Bok, Jirí Fiala, Nikola Jedlicková, Jan Kratochvíl, Michaela Seifrtová:
Computational Complexity of Covering Colored Mixed Multigraphs with Degree Partition Equivalence Classes of Size at Most Two (Extended Abstract). WG 2023: 101-115 - [i18]Jan Bok, Jirí Fiala, Nikola Jedlicková, Jan Kratochvíl, Michaela Seifrtová:
Computational Complexity of Covering Disconnected Multigraphs. CoRR abs/2306.06431 (2023) - [i17]Jan Bok, Richard C. Brewster, Tomás Feder, Pavol Hell, Nikola Jedlicková:
List homomorphisms to separable signed graphs. CoRR abs/2306.06449 (2023) - 2022
- [c10]Jan Bok, Richard C. Brewster, Tomás Feder, Pavol Hell, Nikola Jedlicková:
List Homomorphisms to Separable Signed Graphs. CALDAM 2022: 22-35 - [c9]Jan Bok, Jirí Fiala, Nikola Jedlicková, Jan Kratochvíl, Pawel Rzazewski:
List Covering of Regular Multigraphs. IWOCA 2022: 228-242 - [c8]Jan Bok, Richard C. Brewster, Pavol Hell, Nikola Jedlicková, Arash Rafiey:
Min Orderings and List Homomorphism Dichotomies for Signed and Unsigned Graphs. LATIN 2022: 510-526 - [i16]Jan Bok, Jirí Fiala, Nikola Jedlicková, Jan Kratochvíl, Pawel Rzazewski:
List covering of regular multigraphs. CoRR abs/2204.04280 (2022) - [i15]Jan Bok, Richard C. Brewster, Pavol Hell, Nikola Jedlicková, Arash Rafiey:
Min orderings and list homomorphism dichotomies for signed and unsigned graphs. CoRR abs/2206.01068 (2022) - 2021
- [c7]Jan Bok, Nikola Jedlicková, Barnaby Martin, Daniël Paulusma, Siani Smith:
Injective Colouring for H-Free Graphs. CSR 2021: 18-30 - [c6]Jan Bok, Jirí Fiala, Nikola Jedlicková, Jan Kratochvíl, Michaela Seifrtová:
Computational Complexity of Covering Disconnected Multigraphs. FCT 2021: 85-99 - [c5]Jan Bok, Jirí Fiala, Petr Hlinený, Nikola Jedlicková, Jan Kratochvíl:
Computational Complexity of Covering Multigraphs with Semi-Edges: Small Cases. MFCS 2021: 21:1-21:15 - [i14]Jan Bok, Jirí Fiala, Petr Hlinený, Nikola Jedlicková, Jan Kratochvíl:
Computational Complexity of Covering Two-vertex Multigraphs with Semi-edges. CoRR abs/2103.15214 (2021) - [i13]Jan Bok, Martin Cerný:
1-convex extensions of partially defined cooperative games and the average value. CoRR abs/2107.04679 (2021) - 2020
- [c4]Jan Bok, Nikola Jedlicková, Barnaby Martin, Daniël Paulusma, Siani Smith:
Acyclic, Star and Injective Colouring: A Complexity Picture for H-Free Graphs. ESA 2020: 22:1-22:22 - [c3]Jan Bok, Richard C. Brewster, Tomás Feder, Pavol Hell, Nikola Jedlicková:
List Homomorphism Problems for Signed Graphs. MFCS 2020: 20:1-20:14 - [i12]Jan Bok, Richard C. Brewster, Tomás Feder, Pavol Hell, Nikola Jedlicková:
List homomorphism problems for signed graphs. CoRR abs/2005.05547 (2020) - [i11]Jan Bok, Nikola Jedlicková, Barnaby Martin, Daniël Paulusma, Siani Smith:
Acyclic, Star and Injective Colouring: A Complexity Picture for H-Free Graphs. CoRR abs/2008.09415 (2020) - [i10]Jan Bok, Martin Cerný, David Hartman, Milan Hladík:
Convexity and positivity in partially defined cooperative games. CoRR abs/2010.08578 (2020)
2010 – 2019
- 2019
- [j2]Jan Bok, Jana Maxová:
Characterizing Subclasses of Cover-Incomparability Graphs by Forbidden Subposets. Order 36(2): 349-358 (2019) - [i9]Jan Bok, Boris Furtula, Nikola Jedlicková, Riste Skrekovski:
On Extremal Graphs of Weighted Szeged Index. CoRR abs/1901.04764 (2019) - [i8]Jan Bok, Nikola Jedlicková, Jana Maxová:
A relaxed version of Šoltés's problem and cactus graphs. CoRR abs/1911.10502 (2019) - 2018
- [j1]Jan Bok, Jaroslav Nesetril:
Graph-indexed random walks on pseudotrees. Electron. Notes Discret. Math. 68: 263-268 (2018) - [i7]Jan Bok, Jana Maxová:
Characterizing subclasses of cover-incomparability graphs by forbidden subposets. CoRR abs/1801.03413 (2018) - [i6]Jan Bok:
Algorithmic aspects of graph-indexed random walks. CoRR abs/1801.05496 (2018) - [i5]Jan Bok:
Graph-indexed random walks on special classes of graphs. CoRR abs/1801.05498 (2018) - [i4]Jan Bok, Nikola Jedlicková:
Edge-sum distinguishing labeling. CoRR abs/1804.05411 (2018) - [i3]Jan Bok, Nikola Jedlicková:
A note on simultaneous representation problem for interval and circular-arc graphs. CoRR abs/1811.04062 (2018) - [i2]Jan Bok:
On convexity and solution concepts in cooperative interval games. CoRR abs/1811.04063 (2018) - 2015
- [c2]Jan Bok, Milan Hladík:
Selection-based Approach to Cooperative Interval Games. ICORES 2015: 34-41 - [c1]Jan Bok, Milan Hladík:
Selection-Based Approach to Cooperative Interval Games. ICORES (Selected Papers) 2015: 40-53 - 2014
- [i1]Jan Bok, Milan Hladík:
Selection-based approach to cooperative interval games. CoRR abs/1410.3877 (2014)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2026-06-27 04:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
