Related papers: A Conic Section Problem Involving the Maximum Gene…
We classify maximal quartic generalised projective special real curves up to equivalence. A maximal quartic generalised projective special real curve consists of connected components of the intersection of the hyperbolic points of a quartic…
We study optimal simple second-order cone representations (a particular subclass of second-order cone representations) for weighted geometric means, which turns out to be closely related to minimum mediated sets. Several lower and upper…
Regge theory provides a very simple and economical description of all total cross sections
In this paper, we establish the $R$-linear rate of convergence of a golden ratio algorithm for solving an equilibrium problem in a Hilbert space. Several experiments are performed to show the numerical behavior of the algorithm and also to…
We compute the fundamental groups of the complements of the family of real conic-line arrangements with up to two conics which are tangent to each other at two points, with an arbitrary number of tangent lines to both conics. All the…
We consider the conic linear program given by a closed convex cone in an Euclidean space and a matrix, where vector on the right-hand-side of the constraint system and the vector defining the objective function are subject to change. Using…
We consider the max-cut and max-$k$-cut problems under graph-based constraints. Our approach can handle any constraint specified using monadic second-order (MSO) logic on graphs of constant treewidth. We give a $\frac{1}{2}$-approximation…
The problem of the universal form of the size spectrum is analyzed. The half-widths of two wings of spectrum is introduced and it is shown that their ratio is very close to the golden fraction. In appendix it is shown that behind the golden…
Let G be a graph that may be drawn in the plane in such a way that all internal faces are centrally symmetric convex polygons. We show how to find a drawing of this type that maximizes the angular resolution of the drawing, the minimum…
We propose a new geometric method of IR factorization in sector decomposition. The problem is converted into a set of problems in convex geometry. The latter problems are solved using algorithms in combinatorial geometry. This method…
Denote by $T_k$ the generalised triangle, a $k$-uniform hypergraph on vertex set $\{1,2,\dots,2k-1\}$ with three edges $\{1,\dots,k-1,k\}$,$\{1,\dots,k-1,k+1\}$ and $\{k,k+1,\dots,2k-1\}$. Recently, Bowtell, Kathapurkar, Morrison and…
In this paper, we provide a unified definition of mediated graph, a combinatorial structure with multiple applications in mathematical optimization. We study some geometric and algebraic properties of this family of graphs and analyze…
We consider the symmetric Toeplitz matrix completion problem, whose matrix under consideration possesses specific row and column structures. This problem, which has wide application in diverse areas, is well-known to be computationally…
We provide a solution method for the polyhedral convex set optimization problem, that is, the problem to minimize a set-valued mapping with polyhedral convex graph with respect to a set ordering relation which is generated by a polyhedral…
A rectilinear drawing of a graph $G$ is optimal if it has the smallest number of crossings among all rectilinear drawings of $G$. In this paper it is shown that for $n\geq 8$, the second convex hull of every optimal rectilinear drawing of…
A \emph{co-bipartite chain} graph is a co-bipartite graph in which the neighborhoods of the vertices in each clique can be linearly ordered with respect to inclusion. It is known that the maximum cut problem (MaxCut) is NP-Hard in…
The geodesic $k$-center problem in a simple polygon with $n$ vertices consists in the following. Find a set $S$ of $k$ points in the polygon that minimizes the maximum geodesic distance from any point of the polygon to its closest point in…
Is there any other proportion for a rectangle, other than the Golden Proportion, that will allow the process of cutting off successive squares to produce an infinite paving of the original rectangle by squares of different sizes? The answer…
This paper is a continuation of our recent work in [9].
The general position problem in graphs is to find the maximum number of vertices that can be selected such that no three vertices lie on a common shortest path. The mutual-visibility problem in graphs is to find the maximum number of…