We thank Tom Kurtz for a discussion that helped us to simplify the proof of Corollary 3.4 substantially and to note the extension to the convergence in the uniform topology in Remark 3.2. We thank David Aldous and Vlada Limic for help on their resul…

We find scaling limits for the sizes of the largest components at criticality for rank-1 inhomogeneous random graphs with power-law degrees with powe…

We study a parallel service queueing system with servers of types $s_1,\ldots,s_J$, customers of types $c_1,\ldots,c_I$, bipartite compatibility grap…

The purpose of this work is to stimulate more research in a promising application field of computational complexity analysis and algorithmics. Numerous further research challenges can be found in the very active and steadily growing area of computat…

Computational Social Choice is an interdisciplinary research area involving Economics, Political Science, and Social Science on the one side, and Mat…

One of the main drawbacks while implementing the interaction between a plant and a supervisor, synthesised by the supervisory control theory of \cite…

We study a queueing network with a single shared server that serves the queues in a cyclic order. External customers arrive at the queues according t…

Let $\mathcal{T}$ be a rooted and weighted tree, where the weight of any node is equal to the sum of the weights of its children. The popular Treemap…

We focus on a particular connection between queueing and risk models in a multi-dimensional setting. We first consider the joint workload process in …

Let $G=(S, E)$ be a plane straight-line graph on a finite point set $S\subset\R^2$ in general position. The incident angles of a vertex $p \in S$ of …

In this section, we give the overview of the proofs of Theorems 1.4-1.6. The point of departure for our proofs is the conjecture that P(H1(0)>u)≈P(Su>0) for large u. The event {H1(0)>u} obviously implies {Su>0}, but because of the strong downward dr…

Recently, the scaling limit of cluster sizes for critical inhomogeneous random graphs of rank-1 type having finite variance but infinite third moment…

We have modeled the Honey Bee game as a combinatorial game on colored graphs. For the solitaire version, we have analyzed the complexity on many classes of perfect graphs. For the two player version, we have shown that even the highly restricted cas…

The Honey-Bee game is a two-player board game that is played on a connected hexagonal colored grid or (in a generalized setting) on a connected graph…

We consider an extension of the standard G/G/1 queue, described by the equation $W\stackrel{\mathcal{D}}{=}\max\{0, B-A+YW\}$, where $\mathbb{P}[Y=1]…

We study flip graphs of triangulations whose maximum vertex degree is bounded by a constant $k$. In particular, we consider triangulations of sets of…

In this paper we consider a single-server cyclic polling system consisting of two queues. Between visits to successive queues, the server is delayed …

PageRank is a well-known algorithm for measuring centrality in networks. It was originally proposed by Google for ranking pages in the World-Wide Web…

We study occurrences of patterns on clusters of size n in random fields on Z^d. We prove that for a given pattern, there is a constant a>0 such that …

Labeled state-to-function transition systems, FuTS for short, admit multiple transition schemes from states to functions of finite support over gener…

Let $\mathcal{S}$ be a connected planar polygonal subdivision with $n$ edges that we want to preprocess for point-location queries, and where we are …

Quasi-period collapse occurs when the Ehrhart quasi-polynomial of a rational polytope has a quasi-period less than the denominator of that polytope. …

The collective motion of a set of moving entities like people, birds, or other animals, is characterized by groups arising, merging, splitting, and e…

For a given set of intervals on the real line, we consider the problem of ordering the intervals with the goal of minimizing an objective function th…

By signing up you accept our content policy

Already have an account? Sign in

No a member yet? Create an account