Skip to main content

3 Result(s)

within Tuomo Lehtilä Remove this filter

and

  1. No Access

    Chapter and Conference Paper

    Resolving Sets in Temporal Graphs

    A resolving set R in a graph G is a set of vertices such that every vertex of G is uniquely identified by its distances to the vertices of R. Introduced in the 1970’s, this concept has been since then extensively...

    Jan Bok, Antoine Dailly, Tuomo Lehtilä in Combinatorial Algorithms (2024)

  2. No Access

    Chapter and Conference Paper

    The Red-Blue Separation Problem on Graphs

    We introduce the Red-Blue Separation problem on graphs, where we are given a graph \(G = (V, E)\) ...

    Subhadeep Ranjan Dev, Sanjana Dey, Florent Foucaud… in Combinatorial Algorithms (2022)

  3. No Access

    Article

    Improved lower bound for locating-dominating codes in binary Hamming spaces

    In this article, we study locating-dominating codes in binary Hamming spaces \(\mathbb {F}^n\) ...

    Ville Junnila, Tero Laihonen, Tuomo Lehtilä in Designs, Codes and Cryptography (2022)