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

William McCuaig

dblp:01/5347 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 1997
—ORCID · none

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

Security and privacy · 1Theory of computation · 1 · 1 first-author

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 · 67% Computational complexity · 33%

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

TopicWeightPapersLastEvidence papers
Computational complexity › algebraic complexity
permanent and determinant		 0.011997
Permanents, Pfaffian Orientations, and Even Directed Circuits (Extended Abstract) · STOC 1997
Graph algorithms and graph theory › directed graph › graph orientation
pfaffian orientation		 0.011997
Permanents, Pfaffian Orientations, and Even Directed Circuits (Extended Abstract) · STOC 1997
YearPublicationVenuePosition
1997 Permanents, Pfaffian Orientations, and Even Directed Circuits (Extended Abstract)
abstract
We give a polynomial-time algorithm for the following problem of P61ya.Given an n x n O-1 matrix, either find a matrix obtained from it by changing some of the 1's to -1's in such a way that the determinant of the new matrix equals the permanent of the old one, or determine that no such matrix exists.This is equivalent to finding Pfafiian orientations of bipartite graphs and to the even circuit problem for directed graphs.The aigorithm is based on a structural characterization of bipartite graphs that admit a Pfaffian orientation.-
William McCuaig, Neil Robertson 0001, Paul D. Seymour, Robin Thomas 0001
 STOC1
1993 The Connectivity of the Block-Intersection Graphs of Designs
Donovan R. Hare, William McCuaig
 Des. Codes Cryptogr.2