Yevgeny Levanzov

Orcid: 0000-0002-1494-7604

According to our database¹, Yevgeny Levanzov authored at least 6 papers between 2020 and 2025.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

On csauthors.net:

Bibliography

2025

Hardness of Hypergraph Edge Modification Problems.

[BibT_eX]

[DOI]

Lior Gishboliner

Yevgeny Levanzov

Asaf Shapira

CoRR, February, 2025

2024

Trimming Forests Is Hard (Unless They Are Made of Stars).

[BibT_eX]

[DOI]

Lior Gishboliner

Yevgeny Levanzov

Asaf Shapira

SIAM J. Discret. Math., 2024

2023

A new bound for the Brown-Erdős-Sós problem.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2023

2022

Counting Subgraphs in Degenerate Graphs.

[BibT_eX]

[DOI]

J. ACM, 2022

Counting Homomorphic Cycles in Degenerate Graphs.

[BibT_eX]

[DOI]

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

2020

Counting Subgraphs in Degenerate Graphs.

[BibT_eX]

[DOI]

Lior Gishboliner

Yevgeny Levanzov

Asaf Shapira

Electron. Colloquium Comput. Complex., 2020

Yevgeny Levanzov

Timeline

Legend:

Links

On csauthors.net:

Bibliography

Loading...