Related papers: Rederiving the Upper Bound for Halving Edges using…

We present a novel multilabel/ranking algorithm working in partial information settings. The algorithm is based on 2nd-order descent methods, and relies on upper-confidence bounds to trade-off exploration and exploitation. We analyze this…

A celebrated result of Alon from 1993 states that any $d$-regular graph on $n$ vertices (where $d=O(n^{1/9})$) has a bisection with at most $\frac{dn}{2}(\frac{1}{2}-\Omega(\frac{1}{\sqrt{d}}))$ edges, and this is optimal. Recently, this…

In this paper we consider the problem of reconstructing a hidden weighted hypergraph of constant rank using additive queries. We prove the following: Let $G$ be a weighted hidden hypergraph of constant rank with n vertices and $m$…

We present algorithms that extend the path-based hierarchical drawing framework and give experimental results. Our algorithms run in $O(km)$ time, where $k$ is the number of paths and $m$ is the number of edges of the graph, and provide…

A $d$-dimensional polycube is a facet-connected set of cells (cubes) on the $d$-dimensional cubical lattice $\mathbb{Z}^d$. Let $A_d(n)$ denote the number of $d$-dimensional polycubes (distinct up to translations) with $n$ cubes, and…

In edge orientations, the goal is usually to orient (direct) the edges of an undirected $n$-vertex graph $G$ such that all out-degrees are bounded. When the graph $G$ is fully dynamic, i.e., admits edge insertions and deletions, we wish to…

In this paper we give new bounds on the bisection width of random 3-regular graphs on $n$ vertices. The main contribution is a new lower bound of $0.103295n$ based on a first moment method together with a structural analysis of the graph,…

We establish new exponential in dimension lower bounds for the Maximum Halfspace Discrepancy problem, which models linear classification. Both are fundamental problems in computational geometry and machine learning in their exact and…

This paper explores the application of Hurlbert's Linear Optimization Technique to determine bounds on pebbling numbers. By applying Hurlbert's weight functions and optimization methods, we derive upper bounds for specific graph families.…

We design improved approximation algorithms for NP-hard graph problems by incorporating predictions (e.g., learned from past data). Our prediction model builds upon and extends the $\varepsilon$-prediction framework by Cohen-Addad, d'Orsi,…

We characterize Riemannian orbifolds with an upper curvature bound in the Alexandrov sense as reflectofolds, i.e. Riemannian orbifolds all of whose local groups are generated by reflections, with the same upper bound on the sectional…

Given an undirected graph G, the edge orientation problem asks for assigning a direction to each edge to convert G into a directed graph. The aim is to minimize the maximum out degree of a vertex in the resulting directed graph. This…

This paper studies an inverse boundary value problem for a semilinear Helmholtz equation with Neumann boundary conditions in a bounded domain $\Omega \subset \mathbb{R}^n$ ($n\ge2$). The objective is to recover the unknown linear and…

Given a graph $F$, the random Tur\'an problem asks to determine the maximum number of edges in an $F$-free subgraph of $G_{n,p}$. Prior to this work, the only bipartite graphs $F$ with known tight bounds included certain classes of complete…

We investigate the bounds on algebraic connectivity of graphs subject to constraints on the number of edges, vertices, and topology. We show that the algebraic connectivity for any tree on $n$ vertices and with maximum degree $d$ is bounded…

A {\it good drawing} of a graph $G$ is a drawing where the edges are non-self-intersecting and each two edges have at most one point in common, which is either a common end vertex or a crossing. The {\it crossing number} of a graph $G$ is…

We study the function $H_n(C_{2k})$, the maximum number of Hamilton paths such that the union of any pair of them contains $C_{2k}$ as a subgraph. We give upper bounds on this quantity for $k\ge 3$, improving results of Harcos and…

A bisection of a graph is a bipartition of its vertex set in which the number of vertices in the two parts differ by at most 1, and its size is the number of edges which go across the two parts. In this paper, motivated by several questions…

In this paper, we investigate the complexity of the central path of semidefinite optimization through the lens of real algebraic geometry. To that end, we propose an algorithm to compute real univariate representations describing the…

We derive a new bound for some bilinear sums over points of an elliptic curve over a finite field. We use this bound to improve a series of previous results on various exponential sums and some arithmetic problems involving points on…