相关论文: A nongraphical obstacle problem for elastic curves

A free boundary problem arising from materials science is studied in one-dimensional case. The problem studied here is an obstacle problem for the non-convex energy consisting of a bending energy, tension and an adhesion energy. If the…

We introduce a novel framework of graph modifications specific to interval graphs. We study interdiction problems with respect to these graph modifications. Given a list of original intervals, each interval has a replacement interval such…

In the setting of a metric space equipped with a doubling measure supporting a $(1,1)$-Poincar\'e inequality, we study the problem of minimizing the BV-energy in a bounded domain $\Omega$ of functions bounded between two obstacle functions…

For a class $\mathcal C$ of graphs, we define $\mathcal C$-edge-brittleness of a graph $G$ as the minimum $\ell$ such that the vertex set of $G$ can be partitioned into sets inducing a subgraph in $\mathcal C$ and there are $\ell$ edges…

The composition technique is a popular method for excluding polynomial-size problem kernels for NP-hard parameterized problems. We present a new technique exploiting triangle-based fractal structures for extending the range of applicability…

We reconsider the geometrically nonlinear Cosserat model for a uniformly convex elastic energy and write the equilibrium problem as a minimization problem. Applying the direct methods of the calculus of variations we show the existence of…

We show the existence of global minimizers for a geometrically nonlinear isotropic elastic Cosserat 6-parameter shell model. The proof of the main theorem is based on the direct methods of the calculus of variations using essentially the…

We establish the existence of extremizers for a Fourier restriction inequality on planar convex arcs without points with colinear tangents whose curvature satisfies a natural assumption. More generally, we prove that any extremizing…

We study the Minimum Shared Edges problem introduced by Omran et al. [Journal of Combinatorial Optimization, 2015] on planar graphs: Planar MSE asks, given a planar graph G = (V,E), two distinct vertices s,t in V , and two integers p, k,…

We study the problem of finding curves of minimum pointwise-maximum arc-length derivative of curvature, here simply called curves of minimax spirality, among planar curves of fixed length with prescribed endpoints and tangents at the…

An obstacle representation of a graph $G$ is a set of points in the plane representing the vertices of $G$, together with a set of polygonal obstacles such that two vertices of $G$ are connected by an edge in $G$ if and only if the line…

In this paper we are concerned with a two-penalty boundary obstacle problem of interest in thermics, fluid dynamics and electricity. Specifically, we prove existence, uniqueness and optimal regularity of the solutions, and we establish…

We prove the existence of a homogenization limit for solutions of appropriately formulated sequences of boundary obstacle problems for the Laplacian on $C^{1,\alpha}$ domains. Specifically, we prove that the energy minimizers $u_\epsilon$…

We investigate the problem of dimension reduction for plates in nonlinear magnetoelasticity. The model features a mixed Eulerian-Lagrangian formulation, as magnetizations are defined on the deformed set in the actual space. We consider…

In this paper, we investigate optimal control problems governed by semilinear elliptic variational inequalities involving constraints on the state, and more precisely the obstacle problem. Since we adopt a numerical point of view, we first…

A model for a MEMS device, consisting of a fixed bottom plate and an elastic plate, is studied. It was derived in a previous work as a reinforced limit when the thickness of the insulating layer covering the bottom plate tends to zero. This…

By introducing a shape manifold as a solution set to solve inverse obstacle scattering problems we allow the reconstruction of general, not necessarily star-shaped curves. The bending energy is used as a stabilizing term in Tikhonov…

Effective resistances are ubiquitous in graph algorithms and network analysis. In this work, we study sublinear time algorithms to approximate the effective resistance of an adjacent pair $s$ and $t$. We consider the classical adjacency…

Connectivity problems like k-Path and k-Disjoint Paths relate to many important milestones in parameterized complexity, namely the Graph Minors Project, color coding, and the recent development of techniques for obtaining kernelization…

We tackle the problem of nonparametric variable selection with a focus on discovering interactions between variables. With $p$ variables there are $O(p^s)$ possible order-$s$ interactions making exhaustive search infeasible. It is…