Biblio Discovery — Demo Discovery Service

8 results for "Michael Lampis"

Showing 1–8 · 0.14 seconds · RSS

  1. Journal Article

    First Order Logic on Pathwidth Revisited Again

    Michael Lampis

    Logical Methods in Computer Science, Vol. Volume 22 No. ue 2 · 2026 · English · DOAJ Scopus

    Courcelle's celebrated theorem states that all MSO-expressible properties can be decided in linear time on graphs of bounded treewidth. Unfortunately, the hidden constant implied by this theorem is a tower of exponentials whose height increases with each quantifier alternation in the formula. More…

  2. Journal Article

    Model Checking Lower Bounds for Simple Graphs

    Michael Lampis

    Logical Methods in Computer Science, Vol. Volume 10 No. ue 1 · 2014 · English · DOAJ Scopus

    A well-known result by Frick and Grohe shows that deciding FO logic on trees involves a parameter dependence that is a tower of exponentials. Though this lower bound is tight for Courcelle's theorem, it has been evaded by a series of recent meta-theorems for other graph classes. Here we provide…

  3. Journal Article

    Fine-grained Meta-Theorems for Vertex Integrity

    Michael Lampis; Valia Mitsou

    Logical Methods in Computer Science, Vol. Volume 20 No. ue 4 · 2024 · English · DOAJ Scopus

    Vertex Integrity is a graph measure which sits squarely between two more well-studied notions, namely vertex cover and tree-depth, and that has recently gained attention as a structural graph parameter. In this paper we investigate the algorithmic trade-offs involved with this parameter from the…

  4. Journal Article

    On the parameterized complexity of red-blue points separation

    Edouard Bonnet; Panos Giannopoulos; Michael Lampis

    Journal of Computational Geometry, Vol. 10 No. 1 · 2019 · English · DOAJ Scopus

    We study the following geometric separation problem: Given a set $\mathcal R$ of red points and a set $\mathcal B$ of blue points in the plane, find a minimum-size set of lines that separate $\mathcal R$ from $\mathcal B$. We show that, in its full generality, parameterized by the number of lines…

  5. Journal Article

    Defective Coloring on Classes of Perfect Graphs

    Rémy Belmonte; Michael Lampis; Valia Mitsou

    Discrete Mathematics & Theoretical Computer Science, Vol vol. 24, no. 1, Iss Discrete… · 2022 · English · DOAJ Scopus

    In Defective Coloring we are given a graph $G$ and two integers $\chi_d$, $\Delta^*$ and are asked if we can $\chi_d$-color $G$ so that the maximum degree induced by any color class is at most $\Delta^*$. We show that this natural generalization of Coloring is much harder on several basic graph…

  6. Journal Article

    New Algorithms for Mixed Dominating Set

    Louis Dublois; Michael Lampis; Vangelis Th. Paschos

    Discrete Mathematics & Theoretical Computer Science, Vol. vol. 23 no. 1 No. Discrete Algorithms · 2021 · English · DOAJ Scopus

    A mixed dominating set is a collection of vertices and edges that dominates all vertices and edges of a graph. We study the complexity of exact and parameterized algorithms for \textsc{Mixed Dominating Set}, resolving some open questions. In particular, we settle the problem's complexity…

  7. Journal Article

    Parameterized Power Vertex Cover

    Eric Angel; Evripidis Bampis; Bruno Escoffier et al.

    Discrete Mathematics & Theoretical Computer Science, Vol. vol. 20 no. 2 No. Discrete Algorithms · 2018 · English · DOAJ Scopus

    We study a recently introduced generalization of the Vertex Cover (VC) problem, called Power Vertex Cover (PVC). In this problem, each edge of the input graph is supplied with a positive integer demand. A solution is an assignment of (power) values to the vertices, so that for each edge one of its…

  8. Journal Article

    New Results on Directed Edge Dominating Set

    Rémy Belmonte; Tesshu Hanaka; Ioannis Katsikarelis et al.

    Discrete Mathematics & Theoretical Computer Science, Vol. vol. 25:1 · 2023 · English · DOAJ Scopus

    We study a family of generalizations of Edge Dominating Set on directed graphs called Directed $(p,q)$-Edge Dominating Set. In this problem an arc $(u,v)$ is said to dominate itself, as well as all arcs which are at distance at most $q$ from $v$, or at distance at most $p$ to $u$. First, we give…