Jana Maxová

16 papers A 2Journal 14
YearRankTypeTitle / Venue / Authors
2021 J jnl
An automated platform for assembling light-powered hydrogel microrobots and their subsequent chemical binding.
J. Comput. Sci.
Jan Vrba, Charlie Maslen, Jana Maxová, Jan Duras, Ivan Rehor, Jan Mares
2019 J jnl
A relaxed version of Šoltés's problem and cactus graphs.
CoRR
Jan Bok, Nikola Jedlicková, Jana Maxová
2019 J jnl
Characterizing Subclasses of Cover-Incomparability Graphs by Forbidden Subposets.
Order
Jan Bok, Jana Maxová
2018 J jnl
Characterizing subclasses of cover-incomparability graphs by forbidden subposets.
CoRR
Jan Bok, Jana Maxová
2014 J jnl
Which k-trees are cover-incomparability graphs?
Discret. Appl. Math.
Jana Maxová, Miroslava Dubcová, Pavla Pavlíková, Daniel Turzík
2013 J jnl
Which distance-hereditary graphs are cover-incomparability graphs?
Discret. Appl. Math.
Jana Maxová, Daniel Turzík
2009 J jnl
On the Complexity of Cover-Incomparability Graphs of Posets.
Order
Jana Maxová, Pavla Pavlíková, Daniel Turzík
2006 J jnl
Cantor-Bernstein type theorem for locally constrained graph homomorphisms.
Eur. J. Comb.
Jirí Fiala, Jana Maxová
2005 J jnl
Hamilton cycles in strong products of graphs.
J. Graph Theory
Daniel Král, Jana Maxová, Robert Sámal, Pavel Podbrdský
2004 J jnl
On covers of graphs.
Discret. Math.
Jana Maxová, Jaroslav Nesetril
2004 J jnl
Pancyclicity of Strong Products of Graphs.
Graphs Comb.
Daniel Král, Jana Maxová, Pavel Podbrdský, Robert Sámal
2003 J jnl
Low-Distortion Embeddings of Trees.
J. Graph Algorithms Appl.
Robert Babilon, Jirí Matousek, Jana Maxová, Pavel Valtr
2002 A conf
Complexity of Compatible Decompositions of Eulerian Graphs and Their Transformations.
ESA
Jana Maxová, Jaroslav Nesetril
2001 A conf
Low-Distortion Embeddings of Trees.
GD
Robert Babilon, Jirí Matousek, Jana Maxová, Pavel Valtr
2001 J jnl
On oriented path double covers.
Discret. Math.
Jana Maxová, Jaroslav Nesetril
2000 J jnl
On covers of graphs.
Electron. Notes Discret. Math.
Jana Maxová, Jaroslav Nesetril