Brouer, Berit Dangaard Karsten, Christian Vad Pisinger, David

Seaborne trade is the lynchpin in almost every international supply chain, and about 90% of non-bulk cargo worldwide is transported by container. In this survey we give an overview of data-driven optimization problems in liner shipping. Research in liner shipping is motivated by a need for handling still more complex decision problems, based on big...

Brouer, Berit Dangaard Karsten, Christian Vad Pisinger, David

Seaborne trade is the lynchpin in almost every international supply chain, and about 90% of non-bulk cargo worldwide is transported by container. In this survey we give an overview of data-driven optimization problems in liner shipping. Research in liner shipping is motivated by a need for handling still more complex decision problems, based on big...

Emme, Jordan Prikhod'ko, Alexander

Let $s_2(x)$ denote the number of digits ``$1$'' in a binary expansion of any $x \in \mathbb{N}$. We study the mean distribution $\mu_a$ of the quantity $s_2(x+a)-s_2(x)$ for a fixed positive integer $a$.It is shown that solutions of the equation$$ s_2(x+a)-s_2(x)= d $$are uniquely identified by a finite set of prefixes in $\{0,1\}^*$, and that the...

Deif, Dina Gadallah, Yasser
Published in
EURASIP Journal on Wireless Communications and Networking

Evaluating the reliability of a wireless sensor network (WSN) deployment is a highly important task especially when the WSN is used for a critical Internet of Things (IoT) application. In this paper, we introduce a novel comprehensive reliability metric to evaluate the reliability of WSN deployments over their intended mission time. Unlike the exis...

Hivert, Florent

The goal of this abstract is to report on some parallel and high performance computations in combinatorics, each involving large datasets generated recursively: we start by presenting a small framework implemented in Sagemath [12] allowing performance of map/reduce like computations on such recursively defined sets. In the second part, we describe ...

Pierrot, Adeline Rossin, Dominique
Published in
Theory of Computing Systems

In this article, we give a polynomial algorithm to decide whether a given permutation σ is sortable with two stacks in series. This is indeed a longstanding open problem which was first introduced by Knuth ([1973]). He introduced the stack sorting problem as well as permutation patterns which arises naturally when characterizing permutations that c...

Rahm, Ludwig

This thesis examines the problem of counting and describing walks in graphs, and the problem when such walks have modular restrictions on how many timesit visits each vertex. For the special cases of the path graph, the cycle graph, the grid graph and the cylinder graph, generating functions and regular languages for their walks and walks with modu...

Archibald, Blair Maier, Patrick Stewart, Robert Trinder, Phil De Beule, Jan

Lockwood, Elise Reed, Zackery Caughman, John S.
Published in
International Journal of Research in Undergraduate Mathematics Education

The multiplication principle serves as a cornerstone in enumerative combinatorics. The principle underpins many basic counting formulas and provides students with a critical element of combinatorial justification. Given its importance, the way in which it is presented in textbooks is surprisingly varied. In this paper, we analyze a number of univer...

Chapoton, Frédéric Hivert, Florent Novelli, Jean-Christophe

We introduce an operad of formal fractions, abstracted from the Mould operads and containing both the Dendriform and the Tridendriform operads. We consider the smallest set-operad contained in this operad and containing four specific elements of arity two, corresponding to the generators and the associative elements of the Dendriform and Tridendrif...