default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNikola Jedlicková
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j5]Jan Bok
, Jirí Fiala, Nikola Jedlicková, Jan Kratochvíl, Pawel Rzazewski:
List Covering of Regular Multigraphs with Semi-edges. Algorithmica 86(3): 782-807 (2024)- [j4]Jan Bok, Richard C. Brewster, Pavol Hell, Nikola Jedlicková, Arash Rafiey:
Min Orderings and List Homomorphism Dichotomies for Graphs and Signed Graphs. Algorithmica 86(7): 2289-2316 (2024) - [j3]Jan Bok, Jirí Fiala, Nikola Jedlicková, Jan Kratochvíl, Michaela Seifrtová:
Computational complexity of covering disconnected multigraphs. Discret. Appl. Math. 359: 229-243 (2024) - [j2]Jan Bok, Richard C. Brewster, Tomás Feder, Pavol Hell, Nikola Jedlicková:
List homomorphisms to separable signed graphs. Theor. Comput. Sci. 1001: 114580 (2024) - [c10]Nikola Jedlicková, Jan Kratochvíl:
On the Structure of Hamiltonian Graphs with Small Independence Number. IWOCA 2024: 180-192 - [i13]Nikola Jedlicková, Jan Kratochvíl:
On the Structure of Hamiltonian Graphs with Small Independence Number. CoRR abs/2403.03668 (2024) - 2023
- [j1]Jan Bok, Richard C. Brewster, Tomás Feder, Pavol Hell, Nikola Jedlicková:
List homomorphism problems for signed trees. Discret. Math. 346(3): 113257 (2023) - [c9]Jan Bok, Jirí Fiala, Nikola Jedlicková, Jan Kratochvíl, Michaela Seifrtová:
Computational Complexity of Covering Colored Mixed Multigraphs with Degree Partition Equivalence Classes of Size at Most Two (Extended Abstract). WG 2023: 101-115 - [i12]Jan Bok, Jirí Fiala, Nikola Jedlicková, Jan Kratochvíl, Michaela Seifrtová:
Computational Complexity of Covering Disconnected Multigraphs. CoRR abs/2306.06431 (2023) - [i11]Jan Bok, Richard C. Brewster, Tomás Feder, Pavol Hell, Nikola Jedlicková:
List homomorphisms to separable signed graphs. CoRR abs/2306.06449 (2023) - [i10]Nikola Jedlicková, Jan Kratochvíl:
Hamiltonian path and Hamiltonian cycle are solvable in polynomial time in graphs of bounded independence number. CoRR abs/2309.09228 (2023) - 2022
- [c8]Jan Bok, Richard C. Brewster, Tomás Feder, Pavol Hell, Nikola Jedlicková:
List Homomorphisms to Separable Signed Graphs. CALDAM 2022: 22-35 - [c7]Jan Bok, Jirí Fiala, Nikola Jedlicková, Jan Kratochvíl, Pawel Rzazewski:
List Covering of Regular Multigraphs. IWOCA 2022: 228-242 - [c6]Jan Bok, Richard C. Brewster, Pavol Hell, Nikola Jedlicková, Arash Rafiey:
Min Orderings and List Homomorphism Dichotomies for Signed and Unsigned Graphs. LATIN 2022: 510-526 - [i9]Jan Bok, Jirí Fiala, Nikola Jedlicková, Jan Kratochvíl, Pawel Rzazewski:
List covering of regular multigraphs. CoRR abs/2204.04280 (2022) - [i8]Jan Bok, Richard C. Brewster, Pavol Hell, Nikola Jedlicková, Arash Rafiey:
Min orderings and list homomorphism dichotomies for signed and unsigned graphs. CoRR abs/2206.01068 (2022) - 2021
- [c5]Jan Bok, Nikola Jedlicková, Barnaby Martin, Daniël Paulusma, Siani Smith:
Injective Colouring for H-Free Graphs. CSR 2021: 18-30 - [c4]Jan Bok, Jirí Fiala, Nikola Jedlicková, Jan Kratochvíl, Michaela Seifrtová:
Computational Complexity of Covering Disconnected Multigraphs. FCT 2021: 85-99 - [c3]Jan Bok, Jirí Fiala, Petr Hlinený, Nikola Jedlicková, Jan Kratochvíl:
Computational Complexity of Covering Multigraphs with Semi-Edges: Small Cases. MFCS 2021: 21:1-21:15 - [i7]Jan Bok, Jirí Fiala, Petr Hlinený, Nikola Jedlicková, Jan Kratochvíl:
Computational Complexity of Covering Two-vertex Multigraphs with Semi-edges. CoRR abs/2103.15214 (2021) - 2020
- [c2]Jan Bok, Nikola Jedlicková, Barnaby Martin, Daniël Paulusma, Siani Smith:
Acyclic, Star and Injective Colouring: A Complexity Picture for H-Free Graphs. ESA 2020: 22:1-22:22 - [c1]Jan Bok, Richard C. Brewster, Tomás Feder, Pavol Hell, Nikola Jedlicková:
List Homomorphism Problems for Signed Graphs. MFCS 2020: 20:1-20:14 - [i6]Jan Bok, Richard C. Brewster, Tomás Feder, Pavol Hell, Nikola Jedlicková:
List homomorphism problems for signed graphs. CoRR abs/2005.05547 (2020) - [i5]Jan Bok, Nikola Jedlicková, Barnaby Martin, Daniël Paulusma, Siani Smith:
Acyclic, Star and Injective Colouring: A Complexity Picture for H-Free Graphs. CoRR abs/2008.09415 (2020)
2010 – 2019
- 2019
- [i4]Jan Bok, Boris Furtula, Nikola Jedlicková, Riste Skrekovski:
On Extremal Graphs of Weighted Szeged Index. CoRR abs/1901.04764 (2019) - [i3]Jan Bok, Nikola Jedlicková, Jana Maxová:
A relaxed version of Šoltés's problem and cactus graphs. CoRR abs/1911.10502 (2019) - 2018
- [i2]Jan Bok, Nikola Jedlicková:
Edge-sum distinguishing labeling. CoRR abs/1804.05411 (2018) - [i1]Jan Bok, Nikola Jedlicková:
A note on simultaneous representation problem for interval and circular-arc graphs. CoRR abs/1811.04062 (2018)
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-09-10 01:15 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:
