We continue the study of (tw, ω)-bounded graph classes, that is, hereditary graph classes in
which the treewidth can only be large due to the presence of a large clique, with the goal of …

For a tree decomposition $\mathcal {T} $ of a graph $ G $, by $\mu (\mathcal {T}) $ we
denote the size of a largest induced matching in $ G $ all of whose edges intersect one bag …

We consider the pilot assignment problem in large-scale distributed multi-input multi-output
(MIMO) networks, where a large number of remote radio head (RRH) antennas are …

In 2020, we initiated a systematic study of graph classes in which the treewidth can only be
large due to the presence of a large clique, which we call (tw, ω)-bounded. The family of (tw …

We continue the study of graph classes in which the treewidth can only be large due to the
presence of a large clique, and, more specifically, of graph classes with bounded tree …

A formulation, a heuristic, and branch-and-cut algorithms are investigated for the chordless
cycle problem. This is the problem of finding a largest simple cycle for a given graph so that …

This study focuses on two-echelon synchronized logistics problems in the context of
integrated water-and land-based transportation (IWLT) systems. The aim is to meet the …

We consider the problem of identifying the induced star with the largest cardinality open
neighborhood in a graph. This problem, also known as the star degree centrality (SDC) …

In this dissertation, we present new classes of network optimization models and algorithms,
including heuristics and decomposition-based methods, to solve them. Overall, our …

We consider the pilot assignment problem in cell-free massive multi-input multi-output
(MIMO) networks, where a large number of remote radio head (RRH) antennas are …