default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJana Maxová
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j12]Jan Vrba
, Charlie Maslen, Jana Maxová, Jan Duras, Ivan Rehor, Jan Mares:
An automated platform for assembling light-powered hydrogel microrobots and their subsequent chemical binding. J. Comput. Sci. 55: 101446 (2021)
2010 – 2019
- 2019
- [j11]Jan Bok, Jana Maxová:
Characterizing Subclasses of Cover-Incomparability Graphs by Forbidden Subposets. Order 36(2): 349-358 (2019) - [i2]Jan Bok, Nikola Jedlicková, Jana Maxová:
A relaxed version of Šoltés's problem and cactus graphs. CoRR abs/1911.10502 (2019) - 2018
- [i1]Jan Bok, Jana Maxová:
Characterizing subclasses of cover-incomparability graphs by forbidden subposets. CoRR abs/1801.03413 (2018) - 2014
- [j10]Jana Maxová, Miroslava Dubcová, Pavla Pavlíková, Daniel Turzík:
Which k-trees are cover-incomparability graphs? Discret. Appl. Math. 167: 222-227 (2014) - 2013
- [j9]Jana Maxová, Daniel Turzík:
Which distance-hereditary graphs are cover-incomparability graphs? Discret. Appl. Math. 161(13-14): 2095-2100 (2013)
2000 – 2009
- 2009
- [j8]Jana Maxová, Pavla Pavlíková, Daniel Turzík:
On the Complexity of Cover-Incomparability Graphs of Posets. Order 26(3): 229-236 (2009) - 2006
- [j7]Jirí Fiala, Jana Maxová:
Cantor-Bernstein type theorem for locally constrained graph homomorphisms. Eur. J. Comb. 27(7): 1111-1116 (2006) - 2005
- [j6]Daniel Král, Jana Maxová, Robert Sámal, Pavel Podbrdský:
Hamilton cycles in strong products of graphs. J. Graph Theory 48(4): 299-321 (2005) - 2004
- [j5]Jana Maxová, Jaroslav Nesetril:
On covers of graphs. Discret. Math. 276(1-3): 287-294 (2004) - [j4]Daniel Král, Jana Maxová, Pavel Podbrdský, Robert Sámal:
Pancyclicity of Strong Products of Graphs. Graphs Comb. 20(1): 91-104 (2004) - 2003
- [j3]Robert Babilon, Jirí Matousek, Jana Maxová, Pavel Valtr:
Low-Distortion Embeddings of Trees. J. Graph Algorithms Appl. 7(4): 399-409 (2003) - 2002
- [c2]Jana Maxová, Jaroslav Nesetril:
Complexity of Compatible Decompositions of Eulerian Graphs and Their Transformations. ESA 2002: 711-722 - 2001
- [j2]Jana Maxová, Jaroslav Nesetril:
On oriented path double covers. Discret. Math. 233(1-3): 371-380 (2001) - [c1]Robert Babilon, Jirí Matousek, Jana Maxová, Pavel Valtr:
Low-Distortion Embeddings of Trees. GD 2001: 343-351 - 2000
- [j1]Jana Maxová, Jaroslav Nesetril:
On covers of graphs. Electron. Notes Discret. Math. 5: 222-224 (2000)
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 2024-06-10 21:26 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 and maintained by:
the dblp computer science bibliography is funded and supported by:
