default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDViktoriia Korchemna
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j3]Robert Ganian, Viktoriia Korchemna:
Slim Tree-Cut Width. Algorithmica 86(8): 2714-2738 (2024)- [j2]Robert Ganian
, Thekla Hamm, Viktoriia Korchemna, Karolina Okrasa, Kirill Simonov:
The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width. ACM Trans. Algorithms 20(3): 19 (2024) - [j1]Cornelius Brand, Viktoriia Korchemna, Kirill Simonov, Michael Skotnica:
Counting vanishing matrix-vector products. Theor. Comput. Sci. 1021: 114877 (2024) - [c11]Argyrios Deligkas, Eduard Eiben, Viktoriia Korchemna, Simon Schierreich:
The Complexity of Fair Division of Indivisible Items with Externalities. AAAI 2024: 9653-9661 - [c10]Viktoriia Korchemna, Daniel Lokshtanov, Saket Saurabh, Vaishali Surianarayanan, Jie Xue:
Efficient Approximation of Fractional Hypertree Width. FOCS 2024: 754-779 - [c9]Robert Ganian, Viktoriia Korchemna, Stefan Szeider:
Revisiting Causal Discovery from a Complexity-Theoretic Perspective. IJCAI 2024: 3377-3385 - [c8]Cornelius Brand, Viktoriia Korchemna, Kirill Simonov, Michael Skotnica:
Counting Vanishing Matrix-Vector Products. WALCOM 2024: 335-349 - [i8]Argyrios Deligkas, Eduard Eiben, Tiger-Lily Goldsmith, Viktoriia Korchemna:
EF1 and EFX Orientations. CoRR abs/2409.13616 (2024) - [i7]Viktoriia Korchemna, Daniel Lokshtanov, Saket Saurabh, Vaishali Surianarayanan, Jie Xue:
Efficient Approximation of Fractional Hypertree Width. CoRR abs/2409.20172 (2024) - 2023
- [c7]Eduard Eiben, Robert Ganian, Thekla Hamm, Viktoriia Korchemna:
A Structural Complexity Analysis of Synchronous Dynamical Systems. AAAI 2023: 6313-6321 - [c6]Cornelius Brand, Viktoriia Korchemna, Michael Skotnica:
Deterministic Constrained Multilinear Detection. MFCS 2023: 25:1-25:14 - [i6]Argyrios Deligkas, Eduard Eiben, Viktoriia Korchemna, Simon Schierreich:
The Complexity of Fair Division of Indivisible Items with Externalities. CoRR abs/2308.08869 (2023) - [i5]Cornelius Brand, Viktoriia Korchemna, Michael Skotnica, Kirill Simonov:
Counting Vanishing Matrix-Vector Products. CoRR abs/2309.13698 (2023) - [i4]Eduard Eiben, Robert Ganian, Thekla Hamm, Viktoriia Korchemna:
A Structural Complexity Analysis of Synchronous Dynamical Systems. CoRR abs/2312.08385 (2023) - 2022
- [c5]Robert Ganian, Thekla Hamm, Viktoriia Korchemna, Karolina Okrasa, Kirill Simonov:
The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width. ICALP 2022: 66:1-66:20 - [c4]Robert Ganian, Thekla Hamm, Viktoriia Korchemna, Karolina Okrasa, Kirill Simonov:
The Complexity of k-Means Clustering when Little is Known. ICML 2022: 6960-6987 - [c3]Robert Ganian, Viktoriia Korchemna:
Slim Tree-Cut Width. IPEC 2022: 15:1-15:18 - [c2]Cornelius Brand, Esra Ceylan, Robert Ganian, Christian Hatschka, Viktoriia Korchemna:
Edge-Cut Width: An Algorithmically Driven Analogue of Treewidth Based on Edge Cuts. WG 2022: 98-113 - [i3]Cornelius Brand, Esra Ceylan, Christian Hatschka, Robert Ganian, Viktoriia Korchemna:
Edge-Cut Width: An Algorithmically Driven Analogue of Treewidth Based on Edge Cuts. CoRR abs/2202.13661 (2022) - [i2]Robert Ganian, Viktoriia Korchemna:
Slim Tree-Cut Width. CoRR abs/2206.15091 (2022) - [i1]Robert Ganian, Thekla Hamm, Viktoriia Korchemna, Karolina Okrasa, Kirill Simonov:
The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width. CoRR abs/2210.06845 (2022) - 2021
- [c1]Robert Ganian, Viktoriia Korchemna:
The Complexity of Bayesian Network Learning: Revisiting the Superstructure. NeurIPS 2021: 430-442
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-12-10 20:45 CET 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:
