default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEva Jelínková
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[c7]Vít Jelínek
, Eva Jelínková, Jan Kratochvíl:
On the Hardness of Switching to a Small Number of Edges. COCOON 2016: 159-170- [i1]Vít Jelínek, Eva Jelínková, Jan Kratochvíl:
On the hardness of switching to a small number of edges. CoRR abs/1603.00254 (2016) - 2014
- [j7]Eva Jelínková, Jan Kratochvíl:
On Switching to H-Free Graphs. J. Graph Theory 75(4): 387-405 (2014) - 2013
- [j6]Vít Jelínek, Eva Jelínková, Jan Kratochvíl, Bernard Lidický, Marek Tesar, Tomás Vyskocil:
The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree. Graphs Comb. 29(4): 981-1005 (2013) - 2011
- [j5]Anders Claesson, Vít Jelínek, Eva Jelínková, Sergey Kitaev:
Pattern Avoidance in Partial Permutations. Electron. J. Comb. 18(1) (2011) - [j4]Eva Jelínková, Ondrej Suchý, Petr Hlinený, Jan Kratochvíl:
Parameterized Problems Related to Seidel's Switching. Discret. Math. Theor. Comput. Sci. 13(2): 19-44 (2011) - [j3]Katarína Cechlárová, Eva Jelínková:
An efficient implementation of the equilibrium algorithm for housing markets with duplicate houses. Inf. Process. Lett. 111(13): 667-670 (2011) - [j2]Alexander Burstein, Vít Jelínek, Eva Jelínková, Einar Steingrímsson:
The Möbius function of separable and decomposable permutations. J. Comb. Theory A 118(8): 2346-2364 (2011) - [c6]Eva Jelínková:
Switching to Hedgehog-Free Graphs Is NP-Complete. TAMC 2011: 463-470 - [c5]Katarína Cechlárová, Eva Jelínková:
Approximability of Economic Equilibrium for Housing Markets with Duplicate Houses. WG 2011: 95-106
2000 – 2009
- 2009
- [j1]Eva Jelínková, Jan Kára, Jan Kratochvíl, Martin Pergel, Ondrej Suchý, Tomás Vyskocil:
Clustered Planarity: Small Clusters in Cycles and Eulerian Graphs. J. Graph Algorithms Appl. 13(3): 379-422 (2009) - [c4]Vít Jelínek, Eva Jelínková, Jan Kratochvíl, Bernard Lidický, Marek Tesar, Tomás Vyskocil:
The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree. GD 2009: 304-315 - 2008
- [c3]Vít Jelínek, Eva Jelínková, Jan Kratochvíl, Bernard Lidický:
Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters. GD 2008: 121-132 - [c2]Eva Jelínková, Jan Kratochvíl:
On Switching to H-Free Graphs. ICGT 2008: 379-395 - 2007
- [c1]Eva Jelínková, Jan Kára, Jan Kratochvíl, Martin Pergel, Ondrej Suchý, Tomás Vyskocil:
Clustered Planarity: Small Clusters in Eulerian Graphs. GD 2007: 303-314
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:27 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:
