This paper introduces HySpecPro, a single-level hypergraph partitioner that performs end-to-end optimization in a spectral embedding space, delivering cut quality comparable to multilevel methods with…

This paper characterizes acyclic hypergraphs according to whether they admit unique canonical join trees as root and provides a linear-time algorithm to construct them.

This paper determines the linear Tur'an numbers for higher uniformity $r$-uniform linear hypergraphs and studies specific cases such as stars, hypertrees, and paths.

This paper improves the lower bound on the maximum size of trifferent codes using a locally sparse hypergraph and the Verstraete-Wilson theorem.

This paper proposes HyCoRec, a method to alleviate the Matthew effect in conversational recommendation by learning multi-aspect preferences.

This paper presents new polynomial-time algorithms for determining the winner of the unbiased triangle game on the edge set of general graphs using the edge-triangle incidence graph.

This paper introduces online assignment policies for stochastic matching on hypergraphs, which are maximally stable and allow for the derivation of necessary and sufficient stability criteria.

This paper studies the maximum size of an independent set in the discrete simplex graph and provides new bounds using translated smaller graphs and finite rational linear systems.

The authors improve the bound on the chromatic number of t-perfect graphs from 199053 to 186 by refining the proof of Chudnovsky et al.

The paper introduces a robust, two-part framework (HyPE and HyPS) using hyperbolic geometry to efficiently detect and sanitize malicious prompts targeting Vision-Language Models (VLMs).

This paper studies the NP-completeness and provides a polynomial-time algorithm for the disjoint separators problem in planar graphs when all sizes are equal to one.

The paper simplifies and speeds up an algorithm for computing a Hamilton path on the skeleton of a 0/1-polytope by removing the log n factor, leading to improved algorithms for various problems.

This paper characterizes stabilizability of stochastic dynamic matching on hypergraphs using the arrival rates and incidence matrix, and proposes a stabilizing policy.

This paper settles the complexity of three sketching problems in graphs and distributions.

This paper provides non-asymptotic and explicit estimates for the exponential deviation inequalities of the HyperLogLog estimator.

This paper introduces ZipLine, a system for integrative analysis of multivariate graphs through a unified predicate language and learning algorithm.

This paper improves the time complexity of exact algorithms for converting a connected graph into a cactus by reducing it from O*(3^n) to O*(2^n) for unweighted graphs, and provides faster algorithms…