MétaCan
ENFR
Menu
Cohort builder

4,299,418 works, Canadian by any of four routes.

Every filter state is a URL; the URL is the query; the query is citable via /q/⟨hash⟩. The page, the API and the export parse the same parameters.

Export CSVExport JSONAPI query

The current cohort, streamed from the database: every work column, the machine labels, the provisional scores, and the per-row validation status. Exports are capped at 100,000 rows. Mints a permanent /q/ link for this exact query. The same filters always produce the same link, whoever asks.

Search term
Author
Year range
→
Sort
Language
Type
Field
Venue
Topic
Computational Geometry and Mesh Generation
Retraction
Abstract
Evidence source
Study design
Label agreement
Label status

Direct Codex and Gemma labels are unvalidated and sparse. Distilled predictions cover the full frame and are also unvalidated. Choose the evidence source explicitly; absence of a direct label is never a negative label.

affaffiliation
fundfunder
venuejournal
aboutaboutness

The four routes compose: require the funder route and exclude affiliation to get the funder-only stratum no affiliation-based frame ever sees.

1,616 results · 1 filter active ·
Results by year
20002025
Publication date
Categories
Machine labels · sparse coverage
Evidence
Language
Type
Citations
An unlabeled work is unknown, not a negative. Label coverage is reported on every query.
1,616 works in the cohort · of 4,299,418page 7 of 33

Labels cover 0 of 1,616 works in this cohort. The rest are unlabeled, which is not a negative label: the label table is sparse today and grows as labeling rounds land.

Distilled predictions cover 1,616 of 1,616 works in this cohort. Predictions are machine_predicted_unvalidated teacher distillation outputs. Candidate is the union; consensus is the intersection.

affno abstractunlabeled
Grid drawings of k-colourable graphs
David R. Wood
2004· article· en· Computational Geometry· Computer Science
distilled prediction:candidate · noneconsensus · none
16
citations
afffundno abstractunlabeled
Extensions of a result of Elekes and Rónyai
Ryan Schwartz, József Solymosi, Frank de Zeeuw
2013· article· en· Journal of Combinatorial Theory Series A· Computer Science
distilled prediction:candidate · noneconsensus · none
16
citations
affunlabeled
Morphing orthogonal planar graph drawings
Anna Lubiw, Mark Petrick, Michael J. Spriggs
2006· article· en· Symposium on Discrete Algorithms· Computer Science
distilled prediction:candidate · noneconsensus · none
16
citations
affno abstractunlabeled
Some properties of k-Delaunay and k-Gabriel graphs
Prosenjit Bose, Sébastien Collette, Ferrán Hurtado, Matias Korman, Stefan Langerman, Vera Sacristán +1 more
2012· article· en· Computational Geometry· Computer Science
distilled prediction:candidate · noneconsensus · none
16
citations
affunlabeled
Staying Close to a Curve
Anil Maheshwari, Jörg-Rüdiger Sack, Kaveh Shahbaz, Hamid Zarrabi-Zadeh
2011· article· en· Computer Science
distilled prediction:candidate · noneconsensus · none
16
citations
venueno affunlabeled
Consistent labeling of rotating maps
Andreas Gemsa, Martin Nöllenburg, Ignaz Rutter
2014· article· en· Journal of Computational Geometry (Carleton University)· Computer Science
distilled prediction:candidate · noneconsensus · none
15
citations
affunlabeled
Layered graph drawing
Matthew Suderman
2005· article· en· Open MIND· Computer Science
distilled prediction:candidate · noneconsensus · none
15
citations
affno abstractunlabeled
Morphing Planar Graphs While Preserving Edge Directions
Thérèse Biedl, Anna Lubiw, Michael J. Spriggs
2006· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
15
citations
afffundvenueunlabeled
On characterizing terrain visibility graphs
William Evans, Noushin Saeedi
2013· article· en· Journal of Computational Geometry (Carleton University)· Computer Science
distilled prediction:candidate · noneconsensus · none
15
citations
affno abstractunlabeled
On the Hardness of Point-Set Embeddability
Stéphane Durocher, Debajyoti Mondal
2012· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · noneconsensus · none
15
citations
affunlabeled
THREE PROBLEMS ABOUT DYNAMIC CONVEX HULLS
Timothy M. Chan
2012· article· en· International Journal of Computational Geometry & Applications· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
14
citations
venueno affunlabeled
Parallel delaunay refinement mesh generation
Omar Ghattas, Clemens Kadow
2004· article· en· Canadian Journal of Microbiology· Computer Science
distilled prediction:candidate · noneconsensus · none
14
citations
afffundunlabeled
TRAVERSAL OF A QUASI-PLANAR SUBDIVISION WITHOUT USING MARK BITS
Edgar Chávez, Stefan Dobrev, Evangelos Kranakis, Jaroslav Opatrny, Ladislav Stacho, Jorge Urrutia
2004· article· en· Journal of Interconnection Networks· Computer Science
distilled prediction:candidate · noneconsensus · none
14
citations
affno abstractunlabeled
Some Aperture-Angle Optimization Problems
Prosenjit Bose, F. Hurtado-Diaz, Elsa Omaña-Pulido, Jack Snoeyink, Godfried T. Toussaint
2002· article· en· Algorithmica· Computer Science
distilled prediction:candidate · noneconsensus · none
14
citations
affno abstractunlabeled
Shortest Path Queries in Polygonal Domains
Hua Guo, Anil Maheshwari, Jörg-Rüdiger Sack
2008· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
14
citations
affunlabeled
On Visibility Representations of Non-Planar Graphs
Thérèse Biedl, Giuseppe Liotta, Fabrizio Montecchiani
2016· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
distilled prediction:candidate · noneconsensus · none
14
citations
affunlabeled
One line and n points
Bernd Gärtner, Falk Tschirschnitz, Emo Welzl, József Solymosi, Pável Valtr
2003· article· en· Random Structures and Algorithms· Computer Science
distilled prediction:candidate · noneconsensus · none
14
citations
affunlabeled
Convexifying Polygons Without Losing Visibilities
Oswin Aichholzer, Greg Aloupis, Erik D. Demaine, Martin L. Demaine, Vida Dujmovi, Ferrán Hurtado +3 more
2011· article· en· Computer Science
distilled prediction:candidate · noneconsensus · none
14
citations
afffundunlabeled
Distinct Distances in Graph Drawings
Paz Carmi, Vida Dujmović, Pat Morin, David R. Wood
2008· article· en· The Electronic Journal of Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
14
citations
venueno affunlabeled
Shortest path in a polygon using sublinear space
Sariel Har-Peled
2015· article· en· Journal of Computational Geometry (Carleton University)· Computer Science
distilled prediction:candidate · noneconsensus · none
14
citations
affno abstractunlabeled
Equitable subdivisions within polygonal regions
Sergey Bereg, Prosenjit Bose, David Kirkpatrick
2005· article· en· Computational Geometry· Computer Science
distilled prediction:candidate · noneconsensus · none
14
citations
afffundunlabeled
Sum-product theorems and incidence geometry
Mei-Chu Chang, József Solymosi
2007· article· en· Journal of the European Mathematical Society· Computer Science
distilled prediction:candidate · noneconsensus · none
14
citations
afffundno abstractunlabeled
Characterizing 2-crossing-critical graphs
Drago Bokal, Bogdan Oporowski, R. Bruce Richter, Gelasio Salazar
2015· article· en· Advances in Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
14
citations
← previousnext →

How this was built: Screen · Findings · About