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

Gabriele E. Meyer

dblp:74/4728 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 1987
—ORCID · none

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

Theory of computation · 2

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
2 papers
Graph algorithms and graph theory · 54% Logic in computer science · 46%

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

TopicWeightPapersLastEvidence papers
Graph algorithms and graph theory
graph coloring		 0.021987
Graph Minimal Uncolorability is D^P-Complete · SIAM J. Comput. 1987
On the Complexity of Graph Critical Uncolorability · ICALP 1987
Logic in computer science
completeness		 0.011987
Graph Minimal Uncolorability is D^P-Complete · SIAM J. Comput. 1987
Logic in computer science › completeness
DP-completeness		 0.011987
Graph Minimal Uncolorability is D^P-Complete · SIAM J. Comput. 1987
Graph algorithms and graph theory › planar graphs
planar graph problems		 0.011987
Graph Minimal Uncolorability is D^P-Complete · SIAM J. Comput. 1987

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

sensitive gadget · 0.0reduction · 0.0
YearPublicationVenuePosition
1987 On the Complexity of Graph Critical Uncolorability
Jin-Yi Cai, Gabriele E. Meyer
 ICALP2
1987 Graph Minimal Uncolorability is D^P-Complete
abstract
In their excellent paper, C. H. Papadimitriou and M. Yannakakis [J. Comput. System Sci., 28 (1982), pp. 244–259] asked whether the minimal-3-uncolorability problem is, among other Critical Problems, DP-complete. This paper gives an affirmative answer to the above question. We show that minimal-k-uncolorability is ${\text{D}}^{\text{p}} $-complete, for all fixed $k \geqq 3$. Furthermore, for $k = 3$, the reduction can be modified by using “sensitive” gadgets to resolve the planar case.
Jin-Yi Cai, Gabriele E. Meyer
 SIAM J. Comput.2