8 citations · 8 across the 6 of their papers we have counts for
6 papers
Graphical-Probabilistic Modeling of Generative Flows in LLM-Native Software Systems
Víctor A. Braberman, Flavia Bonomo-Braberman
Engineering LLM-native software remains a challenging and immature field. Current practice is largely exploratory, relying on experimentation and heuristic techniques such as promp…
Removing bottlenecks in the recognition of small -graph classes
Flavia Bonomo-Braberman, Min Chih Lin, Ignacio Maqueda
A graph is a -graph if its vertex set can be partitioned into independent sets and cliques. This family simultaneously generalizes split, bipartite, and co-bip…
Trees with proper thinness 2
Flavia Bonomo-Braberman, Ignacio Maqueda, Nina Pardal
The proper thinness of a graph is an invariant that generalizes the concept of a proper interval graph. Every graph has a numerical value of proper thinness and the graphs with pro…
Non-crossing -graphs: a generalization of proper interval graphs admitting FPT algorithms
Flavia Bonomo-Braberman, Nick Brettell, Noleen Köhler +2
We prove new parameterized complexity results for the FO Model Checking problem on a well-known generalization of interval and circular-arc graphs: the class of -graphs, for any…
Fractional hypergraph isomorphism and fractional invariants
Flavia Bonomo-Braberman, Dora Tilli
Fractional graph isomorphism is the linear relaxation of an integer programming formulation of graph isomorphism. It preserves some invariants of graphs, like degree sequences and…
Better 3-coloring algorithms: excluding a triangle and a seven vertex path
Flavia Bonomo-Braberman, Maria Chudnovsky, Jan Goedgebeur +4
We present an algorithm to color a graph with no triangle and no induced -vertex path (i.e., a -free graph), where every vertex is assigned a list of possible c…