Temporal Unit Interval Independent Sets

Danny Hermelin, Yuval Itzhaki, Hendrik Molter, Rolf Niedermeier

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations


Temporal graphs have been recently introduced to model changes to a given network that occur throughout a fixed period of time. We introduce and investigate the Temporal ∆ Independent Set problem, a temporal variant of the well known Independent Set problem. This problem is e.g. motivated in the context of finding conflict-free schedules for maximum subsets of tasks, that have certain (changing) constraints on each day they need to be performed. We are specifically interested in the case where each task needs to be performed in a certain time-interval on each day and two tasks are in conflict on a day if their time-intervals overlap on that day. This leads us to considering Temporal ∆ Independent Set on the restricted class of temporal unit interval graphs, i.e., temporal graphs where each layer is unit interval. We present several hardness results for this problem, as well as two algorithms: The first is a constant-factor approximation algorithm for instances where τ, the total number of time steps (layers) of the temporal graph, and ∆, a parameter that allows us to model some tolerance in the conflicts, are constants. For the second result we use the notion of order preservation for temporal unit interval graphs that, informally, requires the intervals of every layer to obey a common ordering. We provide an FPT algorithm parameterized by the size of minimum vertex deletion set to order preservation.

Original languageEnglish
Title of host publication1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022
EditorsJames Aspnes, Othon Michail
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959772242
StatePublished - 1 Apr 2022
Event1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022 - Virtual, Online
Duration: 28 Mar 202230 Mar 2022

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
ISSN (Print)1868-8969


Conference1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022
CityVirtual, Online


  • Algorithms
  • Complexity
  • Interval Graphs
  • Order Preservation
  • Temporal Graphs
  • Vertex Orderings

ASJC Scopus subject areas

  • Software


Dive into the research topics of 'Temporal Unit Interval Independent Sets'. Together they form a unique fingerprint.

Cite this