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 17 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.

affvenueunlabeled
Sumsets of semiconvex sets
Imre Z. Ruzsa, József Solymosi
2021· article· en· Canadian Mathematical Bulletin· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · insufficient_payload
3
citations
affunlabeled
Column planarity and partially-simultaneous geometric embedding
Luis Barba, William Evans, Michael M. Hoffmann, Vincent Kusters, Maria Saumell, Bettina Speckmann
2017· article· en· Journal of Graph Algorithms and Applications· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Point-Set Embedding of Trees with Edge Constraints
Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Stephen Wismath
2008· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
3
citations
affunlabeled
ON THE EXPECTED SIZE OF THE 2D VISIBILITY COMPLEX
Hazel Everett, Sylvain Lazard, Sylvain Petitjean, Linqiao Zhang
2007· article· en· International Journal of Computational Geometry & Applications· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
affunlabeled
On the Stretch Factor of Convex Delaunay Graphs
Prosenjit Bose, Paz Carmi, Sébastien Collette, Michiel Smid
2008· preprint· en· ArXiv.org· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
afffundno abstractunlabeled
Minimum rectilinear polygons for given angle sequences
William Evans, Krzysztof Fleszar, Philipp Kindermann, Noushin Saeedi, Chan-Su Shin, Alexander Wolff
2021· preprint· en· Computational Geometry· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
3
citations
affunlabeled
Dynamic Ham-Sandwich Cuts in the Plane
Timothy G. Abbott, Stefan Langerman, Jelani Nelson, Eynat Rafalin, Kathryn Seyboth
2005· article· en· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
On the Upward Planarity of Mixed Plane Graphs
Fabrizio Frati, Michael Kaufmann, János Pach, Csaba D. Tóth, David R. Wood
2013· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Geometric Path Problems with Violations
Anil Maheshwari, Subhas C. Nandy, Drimit Pattanayak, Sasanka Roy, Michiel Smid
2016· article· en· Algorithmica· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Tight Bounds for Connecting Sites Across Barriers
David W. Krumme, Eynat Rafalin, Diane L. Souvaine, Csaba D. Tóth
2008· article· en· Discrete & Computational Geometry· Computer Science
distilled prediction:candidate · metaepi_narrow+stsconsensus · none
3
citations
affno abstractunlabeled
Fully Dynamic Transitive Closure
Valerie King
2008· book-chapter· en· Encyclopedia of Algorithms· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
3
citations
affno abstractunlabeled
Geometric Spanners
Joachim Gudmundsson, Giri Narasimhan, Michiel Smid
2016· book-chapter· en· Encyclopedia of Algorithms· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
3
citations
affunlabeled
On Combinatorial Depth Measures.
Stéphane Durocher, Robert Fraser, Alexandre Leblanc, Jason Morrison, Matthew Skala
2014· article· en· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
venueno affunlabeled
On the planar edge-length ratio of planar graphs
Manuel Borrazzo, Fabrizio Frati
2019· article· en· Journal of Computational Geometry (Carleton University)· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
fundno affno abstractunlabeled
Lines Pinning Lines
Boris Aronov, Otfried Cheong, Xavier Goaoc, Günter Rote
2010· article· en· Discrete & Computational Geometry· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
3
citations
afffundunlabeled
Dispersion for Intervals: A Geometric Approach
Thérèse Biedl, Anna Lubiw, Anurag Murty Naredla, Peter Dominik Ralbovsky, Graeme Stroud
2021· book-chapter· en· Society for Industrial and Applied Mathematics eBooks· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
3
citations
affunlabeled
Lower Bounds for Pinning Lines by Balls
Otfried Cheong, Xavier Goaoc, Andreas F. Holmsen
2009· preprint· en· ArXiv.org· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
3
citations
affno abstractunlabeled
Monotone Paths in Planar Convex Subdivisions
Adrian Dumitrescu, Günter Rote, Csaba D. Tóth
2012· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
3
citations
affno abstractunlabeled
Orthogonal layout with optimal face complexity
Md. Jawaherul Alam, Stephen Kobourov, Debajyoti Mondal
2017· article· en· Computational Geometry· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Average Stretch Factor: How Low Does It Go?
Vida Dujmović, Pat Morin, Michiel Smid
2015· article· en· Discrete & Computational Geometry· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
3
citations
affaboutno abstractunlabeled
The DFS-heuristic for orthogonal graph drawing☆☆Some of these result were published in the author's PhD thesis at Rutgers University; the author would like to thank her advisor, Prof. Endre Boros, for much helpful input. The results in Section 5 have been presented at the 8th Canadian Conference on Computational Geometry, Ottawa, 1996, see [1].
Thérèse Biedl
2001· article· en· Computational Geometry· Computer Science
distilled prediction:candidate · metaepi_narrow+stsconsensus · none
3
citations
affno abstractunlabeled
Nonplanar Graph Drawings with k Vertices per Face
Carla Binucci, Giuseppe Di Battista, Walter Didimo, Seok-Hee Hong, Michael Kaufmann, Giuseppe Liotta +2 more
2023· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
3
citations
affno abstractunlabeled
Approximating majority depth
Dan Chen, Pat Morin
2013· article· en· Computational Geometry· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
3
citations
affunlabeled
Closest-Pair Queries in Fat Rectangles
Sang Won Bae, Michiel Smid
2018· preprint· en· arXiv (Cornell University)· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
3
citations
affno abstractunlabeled
Caps with free pairs of points
Jeffrey B. Farr, Petr Lisoněk
2006· article· en· Journal of Geometry· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
← previousnext →

How this was built: Screen · Findings · About