Search the dblp DataBase
Jana Maxová: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Jana Maxová, Jaroslav Nesetril
Complexity of Compatible Decompositions of Eulerian Graphs and Their Transformations. [Citation Graph (0, 0)][DBLP]
ESA, 2002, pp:711-722 [Conf] - Robert Babilon, Jirí Matousek, Jana Maxová, Pavel Valtr
Low-Distortion Embeddings of Trees. [Citation Graph (0, 0)][DBLP]
Graph Drawing, 2001, pp:343-351 [Conf] - Jana Maxová, Jaroslav Nesetril
On oriented path double covers. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 2001, v:233, n:1-3, pp:371-380 [Journal] - Jana Maxová, Jaroslav Nesetril
On covers of graphs. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 2004, v:276, n:1-3, pp:287-294 [Journal] - Jirí Fiala, Jana Maxová
Cantor-Bernstein type theorem for locally constrained graph homomorphisms. [Citation Graph (0, 0)][DBLP]
Eur. J. Comb., 2006, v:27, n:7, pp:1111-1116 [Journal] - Daniel Král, Jana Maxová, Pavel Podbrdský, Robert Sámal
Pancyclicity of Strong Products of Graphs. [Citation Graph (0, 0)][DBLP]
Graphs and Combinatorics, 2004, v:20, n:1, pp:91-104 [Journal] - Robert Babilon, Jirí Matousek, Jana Maxová, Pavel Valtr
Low-Distortion Embeddings of Trees. [Citation Graph (0, 0)][DBLP]
J. Graph Algorithms Appl., 2003, v:7, n:4, pp:399-409 [Journal] - Daniel Král, Jana Maxová, Robert Sámal, Pavel Podbrdský
Hamilton cycles in strong products of graphs. [Citation Graph (0, 0)][DBLP]
Journal of Graph Theory, 2005, v:48, n:4, pp:299-321 [Journal]
Search in 0.001secs, Finished in 0.002secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002