Viktoriia Korchemna

Orcid: 0000-0001-8038-905X

According to our database1, Viktoriia Korchemna authored at least 12 papers between 2021 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Slim Tree-Cut Width.
Algorithmica, August, 2024

The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width.
ACM Trans. Algorithms, July, 2024

Counting vanishing matrix-vector products.
Theor. Comput. Sci., 2024

Efficient Approximation of Fractional Hypertree Width.
CoRR, 2024

EF1 and EFX Orientations.
CoRR, 2024

Revisiting Causal Discovery from a Complexity-Theoretic Perspective.
Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024

The Complexity of Fair Division of Indivisible Items with Externalities.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
Deterministic Constrained Multilinear Detection.
Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

A Structural Complexity Analysis of Synchronous Dynamical Systems.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
Edge-Cut Width: An Algorithmically Driven Analogue of Treewidth Based on Edge Cuts.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2022

The Complexity of k-Means Clustering when Little is Known.
Proceedings of the International Conference on Machine Learning, 2022

2021
The Complexity of Bayesian Network Learning: Revisiting the Superstructure.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021


  Loading...