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

Kensuke Otsuki

dblp:148/1953 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2014
—ORCID · none

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

Computer networks · 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.

Computer networks
1 paper
Network management and operations · 50% Optical networks · 50%
Theoretical computer science
1 paper
Graph algorithms and graph theory · 100%

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

TopicWeightPapersLastEvidence papers
Network management and operations › network robustness
fault tolerance		 0.212014
Max-flow min-cut theorem and faster algorithms in a circular disk failure model · INFOCOM 2014
Optical networks › network survivability
regional failure		 0.212014
Max-flow min-cut theorem and faster algorithms in a circular disk failure model · INFOCOM 2014
Graph algorithms and graph theory › minimum cut
max-flow min-cut		 0.212014
Max-flow min-cut theorem and faster algorithms in a circular disk failure model · INFOCOM 2014

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

polynomial-time algorithm · 0.4
YearPublicationVenuePosition
2014 Max-flow min-cut theorem and faster algorithms in a circular disk failure model
abstract
Fault-tolerance is one of the most important factors in designing networks. Failures in networks are sometimes caused by an event occurring in specific geographical regions such as hurricanes, earthquakes, bomb attacks, and Electromagnetic Pulse (EMP) attacks. In INFOCOM 2012, Neumayer et al. introduced geographical variants of max-flow min-cut problems in a circular disk failure model, in which each failure is represented by a disk with a predetermined size. In this paper, we solve two open problems in this model: we give a first polynomial-time algorithm for the geographic max-flow problem, and prove a conjecture of Neumayer et al. on a relationship between the geographic max-flow and the geographic min-cut.
Yusuke Kobayashi 0001, Kensuke Otsuki
 INFOCOM2