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 4 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. The Gemma side is a direct model label for every work (title-only); the Codex side is a distilled, calibrated classifier. Candidate is the union; consensus is the intersection.

affunlabeled
Truly Optimal Euclidean Spanners
Hung Le, Shay Solomon
2019· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
31
citations
affno abstractunlabeled
Encompassing colored planar straight line graphs
Ferrán Hurtado, Mikio Kanō, David Rappaport, Csaba D. Tóth
2007· article· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
31
citations
affno abstractunlabeled
On RAC drawings of 1-planar graphs
Michael A. Bekos, Walter Didimo, Giuseppe Liotta, Saeed Mehrabi, Fabrizio Montecchiani
2017· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
31
citations
affunlabeled
Instance-Optimal Geometric Algorithms
Peyman Afshani, Jérémy Barbay, Timothy M. Chan
2017· article· en· Journal of the ACM· Computer Science
machine prediction:candidate · noneconsensus · none
30
citations
affno abstractunlabeled
Algorithms for optimal outlier removal
Rossen Atanassov, Prosenjit Bose, Mathieu Couture, Anil Maheshwari, Pat Morin, Michel Paquette +2 more
2009· article· en· Journal of Discrete Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
30
citations
affno abstractunlabeled
Space–Time Trade-offs for Stack-Based Algorithms
Luis Barba, Matias Korman, Stefan Langerman, Kunihiko Sadakane, Rodrigo I. Silveira
2014· article· en· Algorithmica· Computer Science
machine prediction:candidate · noneconsensus · none
30
citations
affunlabeled
Box cutter
Max Limper, Nicholas Vining, Alla Sheffer
2018· article· en· ACM Transactions on Graphics· Computer Science
machine prediction:candidate · noneconsensus · none
30
citations
affno abstractunlabeled
Tight degree bounds for pseudo-triangulations of points
Lutz Kettner, David Kirkpatrick, Andrea Mantler, Jack Snoeyink, Bettina Speckmann, Fumihiko Takeuchi
2003· article· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
29
citations
affno abstractunlabeled
Coloring axis-parallel rectangles
János Pach, Gábor Tardos
2009· article· en· Journal of Combinatorial Theory Series A· Computer Science
machine prediction:candidate · noneconsensus · none
29
citations
affno abstractunlabeled
Polygons cuttable by a circular saw
Erik D. Demaine, Martin L. Demaine, Craig S. Kaplan
2001· article· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
29
citations
afffundno abstractunlabeled
An analysis of simplex shape measures for anisotropic meshes
Julien Dompierre, M.‐G. Vallet, Paul Labbé, François Guibault
2005· article· en· Computer Methods in Applied Mechanics and Engineering· Computer Science
machine prediction:candidate · noneconsensus · none
29
citations
affno abstractunlabeled
The projection median of a set of points
Stéphane Durocher, David Kirkpatrick
2008· article· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
29
citations
fundno affunlabeled
Minimum-Cost Coverage of Point Sets by Disks
Esther M. Arkin, Herve Broennimann, Jeff Erickson, Sándor P. Fekete, Christian Knauer, Jonathan Lenchner +2 more
2006· preprint· en· ArXiv.org· Computer Science
machine prediction:candidate · noneconsensus · none
27
citations
affunlabeled
Optimal covering tours with turn costs
Esther M. Arkin, Michael A. Bender, Erik D. Demaine, Sándor P. Fekete, Joseph S. B. Mitchell, Saurabh Sethia
2001· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
27
citations
fundno affno abstractunlabeled
Homotopic -Oriented Routing
Bose, Prosenjit
2013· article· en· Graph Drawing E-print Archive (Die Universität zu Köln)· Computer Science
machine prediction:candidate · noneconsensus · none
27
citations
afffundno abstractunlabeled
Transversals to Line Segments in Three-Dimensional Space
Hervé Brönnimann, Hazel Everett, Sylvain Lazard, Frank Sottile, Sue Whitesides
2005· article· en· Discrete & Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
27
citations
afffundno abstractunlabeled
Moving coins
Manuel Abellanas, Sergey Bereg, Ferrán Hurtado, Alfredo García Olaverri, David Rappaport, Javier Tejel
2005· article· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
26
citations
affno abstractunlabeled
Computing a visibility polygon using few variables
Luis Barba, Matias Korman, Stefan Langerman, Rodrigo I. Silveira
2014· article· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
26
citations
affunlabeled
Efficient Broadcast on Random Geometric Graphs
Milan Bradonjić, Robert Elsässer⋆, Tobias Friedrich, Thomas Sauerwald, Alexandre Stauffer
2010· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
26
citations
aboutno affunlabeled
Open Problems from CCCG 2002
Erik D. Demaine, Joseph O’Rourke
2002· preprint· en· ArXiv.org· Computer Science
machine prediction:candidate · noneconsensus · none
26
citations
affunlabeled
Parameterized Complexity of Geometric Problems
Panos Giannopoulos, Christian Knauer, Sue Whitesides
2007· article· en· The Computer Journal· Computer Science
machine prediction:candidate · noneconsensus · none
26
citations
affno abstractunlabeled
Watchman tours for polygons with holes
Adrian Dumitrescu, Csaba D. Tóth
2012· article· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
25
citations
affno abstractunlabeled
Editorial
2001· editorial· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
25
citations
afffundunlabeled
Morphing orthogonal planar graph drawings
Thérèse Biedl, Anna Lubiw, Mark Petrick, Michael J. Spriggs
2013· article· en· ACM Transactions on Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
25
citations
affno abstractunlabeled
Monotone Drawings of Graphs with Fixed Embedding
Patrizio Angelini, Walter Didimo, Stephen Kobourov, Tamara Mchedlidze, Vincenzo Roselli, Antonios Symvonis +1 more
2013· article· en· Algorithmica· Computer Science
machine prediction:candidate · noneconsensus · none
25
citations
affno abstractunlabeled
On Constrained Minimum Pseudotriangulations
Günter Rote, Cao An Wang, Lusheng Wang, Yinfeng Xu
2003· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
25
citations
← previousnext →

How this was built: Screen · Findings · About