Edge-sum distinguishing labeling. - Jan Bok; Nikola Jedlicková (CoRR, 2018)

A note on simultaneous representation problem for interval and circular-arc graphs. - Jan Bok; Nikola Jedlicková (CoRR, 2018)

On Extremal Graphs of Weighted Szeged Index. - Jan Bok; Boris Furtula; Nikola Jedlicková; Riste Skrekovski (CoRR, 2019)

A relaxed version of Šoltés's problem and cactus graphs. - Jan Bok; Nikola Jedlicková; Jana Maxová (CoRR, 2019)

Acyclic, Star and Injective Colouring: A Complexity Picture for H-Free Graphs. - Jan Bok; Nikola Jedlicková; Barnaby Martin; Daniël Paulusma; Siani Smith (ESA, 2020)

List Homomorphism Problems for Signed Graphs. - Jan Bok; Richard C. Brewster; Tomás Feder; Pavol Hell; Nikola Jedlicková (MFCS, 2020)

Injective Colouring for H-Free Graphs. - Jan Bok; Nikola Jedlicková; Barnaby Martin; Daniël Paulusma; Siani Smith (CSR, 2021)

Computational Complexity of Covering Multigraphs with Semi-Edges: Small Cases. - Jan Bok; Jirí Fiala 001; Petr Hlinený; Nikola Jedlicková; Jan Kratochvíl (MFCS, 2021)

Computational Complexity of Covering Two-vertex Multigraphs with Semi-edges. - Jan Bok; Jirí Fiala 001; Petr Hlinený; Nikola Jedlicková; Jan Kratochvíl (CoRR, 2021)

List Covering of Regular Multigraphs. - Jan Bok; Jirí Fiala 001; Nikola Jedlicková; Jan Kratochvíl; Pawel Rzazewski (IWOCA, 2022)

Min Orderings and List Homomorphism Dichotomies for Signed and Unsigned Graphs. - Jan Bok; Richard C. Brewster; Pavol Hell; Nikola Jedlicková; Arash Rafiey (LATIN, 2022)

Computational Complexity of Covering Colored Mixed Multigraphs with Degree Partition Equivalence Classes of Size at Most Two (Extended Abstract). - Jan Bok; Jirí Fiala 001; Nikola Jedlicková; Jan Kratochvíl; Michaela Seifrtová (WG, 2023)

Hamiltonian path and Hamiltonian cycle are solvable in polynomial time in graphs of bounded independence number. - Nikola Jedlicková; Jan Kratochvíl (CoRR, 2023)

List homomorphism problems for signed trees. - Jan Bok; Richard C. Brewster; Tomás Feder; Pavol Hell; Nikola Jedlicková (Discret. Math., 2023)

On the Structure of Hamiltonian Graphs with Small Independence Number. - Nikola Jedlicková; Jan Kratochvíl (IWOCA, 2024)

Computational complexity of covering disconnected multigraphs. - Jan Bok; Jirí Fiala 001; Nikola Jedlicková; Jan Kratochvíl; Michaela Seifrtová (Discret. Appl. Math., 2024)

List homomorphisms to separable signed graphs. - Jan Bok; Richard C. Brewster; Tomás Feder; Pavol Hell; Nikola Jedlicková (Theor. Comput. Sci., 2024)

List Covering of Regular Multigraphs with Semi-edges. - Jan Bok; Jirí Fiala 001; Nikola Jedlicková; Jan Kratochvíl; Pawel Rzazewski (Algorithmica, 2024)

Min Orderings and List Homomorphism Dichotomies for Graphs and Signed Graphs. - Jan Bok; Richard C. Brewster; Pavol Hell; Nikola Jedlicková; Arash Rafiey (Algorithmica, 2024)

Computational Complexity of Covering Regular Trees. - Jan Bok; Jirí Fiala 001; Nikola Jedlicková; Jan Kratochvíl (MFCS, 2025)

Acyclic, star and injective colouring: A complexity picture for H-free graphs. - Jan Bok; Nikola Jedlicková; Barnaby Martin; Pascal Ochem; Daniël Paulusma; Siani Smith (J. Comput. Syst. Sci., 2025)

Computational Complexity of Covering Colored Mixed Multigraphs with Simple Degree Partitions. - Jan Bok; Jirí Fiala 001; Nikola Jedlicková; Jan Kratochvíl; Michaela Seifrtová (CoRR, 2025)

On the expressive power of 2-edge-colourings of graphs. - Jan Bok; Santiago Guzmán-Pro; Nikola Jedlicková; César Hernández-Cruz (CoRR, 2025)