Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from EDBT 2026 / reviewers in the wild / expert

Kirill Nikolaev 0003

dblp:95/1906-3 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2018
—ORCID · unresolved

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Graph algorithms and graph theory · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Graph algorithms and graph theory
graph cut		 0.312018
Minimum Cut of Directed Planar Graphs in O(n log log n) Time · SODA 2018
Graph algorithms and graph theory
minimum cut		 0.312018
Minimum Cut of Directed Planar Graphs in O(n log log n) Time · SODA 2018
Graph algorithms and graph theory
planar graphs		 0.312018
Minimum Cut of Directed Planar Graphs in O(n log log n) Time · SODA 2018
Graph algorithms and graph theory › minimum cut
planar graph minimum cut		 0.312018
Minimum Cut of Directed Planar Graphs in O(n log log n) Time · SODA 2018
Graph algorithms and graph theory › graph theory › graph parameters
shortest cycle		 0.312018
Minimum Cut of Directed Planar Graphs in O(n log log n) Time · SODA 2018

Methods — techniques the papers use, named apart from their topics

planar graph algorithms · 0.3divide-and-conquer · 0.3
YearPublicationVenuePosition
2018 Minimum Cut of Directed Planar Graphs in O(n log log n) Time
abstract
We give an O(n log log n) time algorithm for computing the minimum cut (or equivalently, the shortest cycle) of a weighted directed planar graph. This improves the previous fastest O(n log3 n) solution. Interestingly, while in undirected planar graphs both min cut and min st-cut have O(n log log n) solutions, in directed planar graphs our result makes min cut faster than min st-cut, which currently requires O(n log n).
Shay Mozes, Kirill Nikolaev 0003, Yahav Nussbaum, Oren Weimann
 SODA2