Related papers: Maximal skew sets of lines on a Hermitian surface …
Maximal clique enumeration appears in various real-world networks, such as social networks and protein-protein interaction networks for different applications. For general graph inputs, the number of maximal cliques can be up to…
The maximum cut problem for a quintic del Pezzo surface ${\rm Bl}_{4}(\mathbb{P}^2)$ asks: Among all partitions of the 10 exceptional curves into two disjoint sets, what is the largest possible number of pairwise intersections? In this…
We construct a family of (n,k) convolutional codes with degree \delta in {k,n-k} that have a maximum distance profile. The field size required for our construction is of the order n^{2\delta}, which improves upon the known constructions of…
We give an upper bound for the degree of rational curves in a family that covers a given birational ruled surface in projective space. The upper bound is stated in terms of the degree, sectional genus and arithmetic genus of the surface. We…
We combine classical Vinberg's algorithms with the lattice-theoretic/arithmetic approach from arXiv:1706.05734 [math.AG] to give a method of classifying large line configurations on complex quasi-polarized K3-surfaces. We apply our method…
We propose a multi-stage learning approach for pruning the search space of maximum clique enumeration, a fundamental computationally difficult problem arising in various network analysis tasks. In each stage, our approach learns the…
We study a large family of graph covering problems, whose definitions rely on distances, for graphs of bounded cyclomatic number (that is, the minimum number of edges that need to be removed from the graph to destroy all cycles). These…
Generalized Tur\'an problems have been a central topic of study in extremal combinatorics throughout the last few decades. One such problem, maximizing the number of cliques of a fixed order in a graph with fixed number of vertices and…
All the work made so far on edge-covering a graph by cliques focus on finding the minimum number of cliques that cover the graph. On this paper, we fix the number of cliques that cover a graph by the same number of vertices that the graph…
We study the critical points of the likelihood function over the Fermat hypersurface. This problem is related to one of the main problems in statistical optimization: maximum likelihood estimation. The number of critical points over a…
In this paper, we formally investigate two mathematical aspects of Hermite splines which translate to features that are relevant to their practical applications. We first demonstrate that Hermite splines are maximally localized in the sense…
We propose a scalable approximate algorithm for the NP-hard maximum-weight independent set problem. The core component of our algorithm is a dual coordinate descent applied to a smoothed LP relaxation of the problem. This technique is…
Computing maximum weight independent sets in graphs is an important NP-hard optimization problem. The problem is particularly difficult to solve in large graphs for which data reduction techniques do not work well. To be more precise,…
We present an exact algorithm for computing all common subgraphs with the maximum number of vertices across multiple graphs. Our approach is further extended to handle the connected Maximum Common Subgraph (MCS), identifying the largest…
The maximum independent set problem is known to be NP-hard in the class of subcubic graphs, i.e. graphs of vertex degree at most 3. We present a polynomial-time solution in a subclass of subcubic graphs generalizing several previously known…
We study the approximability of the maximum size independent set (MIS) problem in bounded degree graphs. This is one of the most classic and widely studied NP-hard optimization problems. We focus on the well known minimum degree greedy…
The crossing resolution of a non-planar drawing of a graph is the value of the minimum angle formed by any pair of crossing edges. Recent experiments have shown that the larger the crossing resolution is, the easier it is to read and…
This manuscript provides a comprehensive review of the Maximum Clique Problem, a computational problem that involves finding subsets of vertices in a graph that are all pairwise adjacent to each other. The manuscript covers in a simple way…
We consider the maintenance of the set of all maximal cliques in a dynamic graph that is changing through the addition or deletion of edges. We present nearly tight bounds on the magnitude of change in the set of maximal cliques, as well as…
Some constructions and bounds on the sizes of semiovals contained in the Hermitian curve are given. A construction of an infinite family of 2-blocking sets of the Hermitian curve is also presented.