On covers of graphs. - Jana Maxová; Jaroslav Nesetril (Electron. Notes Discret. Math., 2000)

On oriented path double covers. - Jana Maxová; Jaroslav Nesetril (Discret. Math., 2001)

Complexity of Compatible Decompositions of Eulerian Graphs and Their Transformations. - Jana Maxová; Jaroslav Nesetril (ESA, 2002)

Low-Distortion Embeddings of Trees. - Robert Babilon; Jirí Matousek 001; Jana Maxová; Pavel Valtr 001 (J. Graph Algorithms Appl., 2003)

Pancyclicity of Strong Products of Graphs. - Daniel Král; Jana Maxová; Pavel Podbrdský; Robert Sámal (Graphs Comb., 2004)

Hamilton cycles in strong products of graphs. - Daniel Král; Jana Maxová; Robert Sámal; Pavel Podbrdský (J. Graph Theory, 2005)

Cantor-Bernstein type theorem for locally constrained graph homomorphisms. - Jirí Fiala 001; Jana Maxová (Eur. J. Comb., 2006)

On the Complexity of Cover-Incomparability Graphs of Posets. - Jana Maxová; Pavla Pavlíková; Daniel Turzík (Order, 2009)

Which distance-hereditary graphs are cover-incomparability graphs? - Jana Maxová; Daniel Turzík (Discret. Appl. Math., 2013)

Which k-trees are cover-incomparability graphs? - Jana Maxová; Miroslava Dubcová; Pavla Pavlíková; Daniel Turzík (Discret. Appl. Math., 2014)

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

Characterizing Subclasses of Cover-Incomparability Graphs by Forbidden Subposets. - Jan Bok; Jana Maxová (Order, 2019)

An automated platform for assembling light-powered hydrogel microrobots and their subsequent chemical binding. - Jan Vrba; Charlie Maslen; Jana Maxová; Jan Duras; Ivan Rehor; Jan Mares (J. Comput. Sci., 2021)