activity
20182026
most citedStructure and enumeration of K4-minor-free links and link-diagrams

1 citations · 2 across the 5 of their papers we have counts for

collaborators

7 papers

cs.LG2026

QEDBENCH: Quantifying the Alignment Gap in Automated Evaluation of University-Level Mathematical Proofs

Santiago Gonzalez, Alireza Amiri Bavandpour, Peter Ye +48

As Large Language Models (LLMs) saturate elementary benchmarks, the research frontier has shifted from generation to the reliability of automated evaluation. We demonstrate that st…

math.ST2023

Inference in balanced community modulated recursive trees

Anna Ben-Hamou, Vasiliki Velona

We introduce a random recursive tree model with two communities, called balanced community modulated random recursive tree, or BCMRT in short. In this setting, pairs of nodes of di…

math.PR2020

Broadcasting on random recursive trees

Louigi Addario-Berry, Luc Devroye, Gabor Lugosi +1

We study the broadcasting problem when the underlying tree is a random recursive tree. The root of the tree has a random bit value assigned. Every other vertex has the same bit val…

math.ST2019★ 1 cited

Learning partial correlation graphs and graphical models by covariance queries

Gábor Lugosi, Jakub Truszkowski, Vasiliki Velona +1

We study the problem of recovering the structure underlying large Gaussian graphical models or, more generally, partial correlation graphs. In high-dimensional problems it is often…

math.CO2019

Minor-Obstructions for Apex Sub-unicyclic Graphs

Alexandros Leivaditis, Alexandros Singh, Giannos Stamoulis +3

A graph is sub-unicyclic if it contains at most one cycle. We also say that a graph is -apex sub-unicyclic if it can become sub-unicyclic by removing of its vertices. We…

math.CO2018★ 1 cited

Structure and enumeration of K4-minor-free links and link-diagrams

Juanjo Rué, Dimitrios M. Thilikos, Vasiliki Velona

We study the class L of link-types that admit a K4-minor-free diagram, i.e., they can be projected on the plane so that the resulting graph does not contain any subdivision of K4.…

math.CO2018

Encoding and avoiding 2-connected patterns in polygon dissections and outerplanar graphs

Vasiliki Velona

Let be a finite set of 2-connected patterns, i.e. graphs up to vertex relabelling. We study the generating function which cou…