An instance of the Connected Maximum Cut problem consists of an undirected graph G = (V, E) and the goal is to find a subset of vertices S $\subseteq…

From a mathematical point of view self-organization can be described as patterns to which certain dynamical systems modeling social dynamics tend spo…

Among the main actors of organism development there are morphogens, which are signaling molecules diffusing in the developing organism and acting on …

We introduce the rigorous limit process connecting finite dimensional sparse optimal control problems with ODE constraints, modeling parsimonious int…

Measure Differential Equations (MDE) describe the evolution of probability measures driven by probability velocity fields, i.e. probability measures …

[1] L.J. Gagliardi, J. Electrostat. 54 (2002) 219. [2] L.J. Gagliardi, Phys. Rev. E 66 (2002) 011901. [3] L.J. Gagliardi, J. Electrostat. 63 (2005) 309. [4] C. Ciferri et al., Cell 133 (2008) 427. [5] G.J. Guimaraes, Y. Dong, B.F. McEwen, J.G. …

Recent experiments revealing possible nanoscale electrostatic interactions in force generation at kinetochores for chromosome motions have prompted s…

In this section, we show that the approximation hardness of the group Steiner problem under the ETH, which implies that the subexponential-time algorithm for Group-Steiner-Tree of Chekuri and Pal [12] is nearly tight. This hardness result is implici…

This paper concerns proving almost tight (super-polynomial) running times, for achieving desired approximation ratios for various problems. To illust…

An innovative numerical technique is presented to adjust the inflow to a supply chain in order to achieve a desired outflow, reducing the costs of in…

We consider nonlinear transport equations with non-local velocity, describing the time-evolution of a measure, which in practice may represent the de…

In the modeling of traffic networks, a signalized junction is typically treated using a binary variable to model the on-and-off nature of signal oper…

Mobile sensing enabled by GPS or smart phones has become an increasingly important source of traffic data. For sufficient coverage of the traffic str…

We propose a bound-preserving Runge-Kutta (RK) discontinuous Galerkin (DG) method as an efficient, effective and compact numerical approach for numer…

Motivated by proving hardness for the basic k-spanner problem (one of the only spanner problems for which strong hardness was not already known), we gave a proof that Label Cover and Min-Rep are hard to approximate even when restricted to instances …

We study the well-known Label Cover problem under the additional requirement that problem instances have large girth. We show that if the girth is so…

We present a continuous-time link-based kinematic wave model (LKWM) for dynamic traffic networks based on the scalar conservation law model. Derivati…

In the Tree Augmentation Problem (TAP) the goal is to augment a tree $T$ by a minimum size edge set $F$ from a given edge set $E$ such that $T \cup F…

Motivated by pedestrian modelling, we study evolution of measures in the Wasserstein space. In particular, we consider the Cauchy problem for a trans…

We study an optimal control problem for traffic regulation via variable speed limit. The traffic flow dynamics is described with the Lighthill-Whitha…

In this section, we prove the main results of this article, that are Theorem 3 about existence of solutions to (3) and Theorem 4 about uniqueness.

We introduce a new formulation for differential equation describing dynamics of measures on an Euclidean space, that we call Measure Differential Equ…

This paper establishes the continuity of the path delay operators for dynamic network loading (DNL) problems based on the Lighthill-Whitham-Richards …

Collective migration of animals in a cohesive group is rendered possible by a strategic distribution of tasks among members: some track the travel ro…

By signing up you accept our content policy

Already have an account? Sign in

No a member yet? Create an account