1 citations · 1 across the 4 of their papers we have counts for
6 papers · 1 filter
Parameterized Complexity of Isometric Path Cover: Treewidth and Diameter
Dibyayan Chakraborty, Oscar Defrain, Florent Foucaud +2
We study the fixed-parameter tractability of the \textsc{Isometric Path Cover} problem where, given an integer and a simple, undirected, and unweighted graph , the objective…
The Complexity of Hamiltonian Cycles and Paths with Prescribed Walk Lengths
Hitendra Kumar, Mathieu Mari, R. B. Sandeep
Fix a set of positive integers. An -Hamiltonian cycle is a cyclic ordering of all vertices of a graph such that each consecutive pair is joined by a walk whose length belong…
Parameterized complexity of isometric path partition: treewidth and diameter
Dibyayan Chakraborty, Oscar Defrain, Florent Foucaud +2
We investigate the parameterized complexity of the Isometric Path Partition problem when parameterized by the treewidth () of the input graph, arguably one of the most…
Online Multi-level Aggregation with Delays and Stochastic Arrivals
Mathieu Mari, Michał Pawłowski, Runtian Ren +1
This paper presents a new research direction for online Multi-Level Aggregation (MLA) with delays. In this problem, we are given an edge-weighted rooted tree , and we have to se…
Modeling Online Paging in Multi-Core Systems
Mathieu Mari, Anish Mukherjee, Runtian Ren +1
Web requests are growing exponentially since the 90s due to the rapid development of the Internet. This process was further accelerated by the introduction of cloud services. It ha…
Online hitting set of -dimensional fat objects
Shanli Alefkhani, Nima Khodaveisi, Mathieu Mari
We consider an online version of the geometric minimum hitting set problem that can be described as a game between an adversary and an algorithm. For some integers and , let…