Related papers: Refinement of Metrics: Erd\H{o}s Number, a Case St…
We present a refinement, by selfimprovement, of the arithmetic geometric inequality.
In this paper we give refinements of some convex and log-convex moment inequalities of the first and second order using a special kind of positive semi-definite form. An open problem concerning eight parameter refinement of second order is…
We present a new method for parameter identification of ODE system descriptions based on data measurements. Our method works by splitting the system into a number of subsystems and working on each of them separately, thereby being easily…
In this invited contribution, we revisit the stochastic shortest path problem, and show how recent results allow one to improve over the classical solutions: we present algorithms to synthesize strategies with multiple guarantees on the…
Node similarity is a fundamental problem in graph analytics. However, node similarity between nodes in different graphs (inter-graph nodes) has not received a lot of attention yet. The inter-graph node similarity is important in learning a…
We introduce methods that allow to derive continuous-time versions of various discrete-time ergodic theorems. We then illustrate these methods by giving simple proofs and refinements of some known results as well as establishing new results…
Numerical methods: mimetic finite differences and finite elements, are analyzed from a numerical point of view. It seeks to conclude on the efficiency, order of convergence and computational cost of these methods. The analysis is done in…
We study the problem of computing a minimum equivalent digraph (also known as the problem of computing a strong transitive reduction) and its maximum objective function variant, with two types of extensions. First, we allow to declare a set…
Let $P$ be a path graph of $n$ vertices embedded in a metric space. We consider the problem of adding a new edge to $P$ such that the diameter of the resulting graph is minimized. Previously (in ICALP 2015) the problem was solved in…
In \cite{liu2022practical}, a general algorithm is developed to efficiently obtain the best accuracy using the regular refinement. The adaptive refinement allows for obtaining an accuracy with a smaller number of DoFs compared with the…
Inspired by artistic practices such as beadwork and himmeli, we study the problem of threading a single string through a set of tubes, so that pulling the string forms a desired graph. More precisely, given a connected graph (where edges…
Based on improving the classical Bohr inequality, we get in this paper some refined versions for a quasi-subordination family of functions, one of which is key to build our results. By means of these investigations, for a family of harmonic…
The main goal of this article is to find the exact difference between a convex function and its secant, as a limit of positive quantities. This idea will be expressed as a convex inequality that leads to refinements and reversals of well…
Extension dimension is characterized in terms of $\omega$-maps. We apply this result to prove that extension dimension is preserved by refinable maps between metrizable spaces. It is also shown that refinable maps preserve some…
Graph embedding has recently gained momentum in the research community, in particular after the introduction of random walk and neural network based approaches. However, most of the embedding approaches focus on representing the local…
In this paper, we propose a new type of graph, denoted as "embedded-graph", and its theory, which employs a distributed representation to describe the relations on the graph edges. Embedded-graphs can express linguistic and complicated…
In the discretization of differential problems on complex geometrical domains, discretization methods based on polygonal and polyhedral elements are powerful tools. Adaptive mesh refinement for such kind of problems is very useful as well…
The Hybrid network model was introduced in [Augustine et al., SODA '20] for laying down a theoretical foundation for networks which combine two possible modes of communication: One mode allows high-bandwidth communication with neighboring…
We introduce a new graph minimization method, in which it is required to preserve some graph property and there is an effective procedure for checking this property. We applied this method to minimize 5-chromatic unit-distance graphs and…
We give an overview of different approaches to measuring the similarity of, or the distance between, two graphs, highlighting connections between these approaches. We also discuss the complexity of computing the distances.