This paper studies a dynamic assortment problem on a two-sided service platform with incomplete information and heterogeneous customers, and develops a data-driven algorithm to learn parameters and op…

This paper benchmarks zero-shot synthesis of parent-selection operators across eight large language models and finds that Claude Sonnet~4.6 and Gemini~3.1 Pro perform strongly, with the best operator…

This paper presents a simpler variation of the NC detection criterion for perfect matchings in bipartite graphs with improved parameters.

This paper proves that the number of distinct rooted binary phylogenetic trees displayed by a binary tree-child network with n leaves is at most 2^(n-1)-1, and shows that this upper bound is sharp.

A new method for selecting knots in Generalized Additive Models using an extension of adaptive splines and a customized Fellner-Schall scheme.

This paper proposes a Genetic Algorithm with constraint repair mechanism for optimally allocating educational resources to high school mathematics students under study time constraints.

This paper presents three new algorithms for maximizing revenue in the Stackelberg Vertex Cover problem on certain kinds of trees.

The paper introduces a new quantitative metric, Contextual Alternative Choice (CAC), to rigorously test language models' syntactic and functional understanding of determiners, showing that current mod…

This paper presents methods for ranking and unranking permutations avoiding a pattern of length three in lexicographic or colexicographic order.

This paper proves that winner determination under Stable Voting and Simple Stable Voting is PSPACE-complete.

A new polynomial-time algorithm is presented for optimally coloring perfect graphs using graph-theoretic operations and iterative walk counting.

The paper proposes a novel, practical upper bound to estimate the worst-case performance of medical prediction models on the target population, even when the selection bias mechanism and target data a…

This paper presents deterministic and randomized algorithms for the incremental dominating set problem in vertex-weighted graphs, achieving competitive ratios of O(Δ) and O(log^2Δ) respectively. It al…

The paper introduces WebKnoGraph, an open-source framework for systematically evaluating internal linking strategies on websites by modeling the site as a graph and assessing trade-offs between author…

This paper introduces a method to automatically determine the optimal learning period ($ au$) for the Random Gradient hyper-heuristic, enabling it to optimally solve Pseudo-Boolean Problems without ma…

This paper uses local flag algebra to prove bounds on the strong chromatic index of graphs, making progress towards established conjectures for general, bipartite, and asymmetric bipartite graphs.