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 VLDB 2026 / reviewers in the wild / expert

Miehal T. Seweryn

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

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

Theory of computation · 1 · 1 since 2021

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
Mathematical optimization · 100%

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

TopicWeightPapersLastEvidence papers
Mathematical optimization
combinatorial optimization		 0.912025
Integer programs with nearly totally unimodular matrices: the cographic case · SODA 2025
Mathematical optimization
integer programming		 0.912025
Integer programs with nearly totally unimodular matrices: the cographic case · SODA 2025
Mathematical optimization › integer programming
totally unimodular matrix		 0.912025
Integer programs with nearly totally unimodular matrices: the cographic case · SODA 2025

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

subdeterminant bounds · 0.9polynomial-time algorithm · 0.9
YearPublicationVenuePosition
2025 Integer programs with nearly totally unimodular matrices: the cographic case
abstract
It is a notorious open question whether integer programs (IPs) with an integer coefficient matrix M whose subdeterminants are all bounded by a constant Δ in absolute value can be solved in polynomial time. We answer this question in the affirmative if we further require that, by removing a constant number of rows and columns from M, one obtains a submatrix A that is the transpose of a network matrix.
Manuel Aprile, Samuel Fiorini, Gwenaël Joret, Stefan Kober, Miehal T. Seweryn, Stefan Weltge, Yelena Yuditsky
 SODA5