E-LIB Suche - Ergebnisse für: Lampis, Michael

1

Structural Parameterizations for Two Bounded Degree Problem..:

Lampis, Michael ; Vasilakis, Manolis
ACM Transactions on Computation Theory. , 2024

Link: https://doi.org/10.1145/..

2

Faster Winner Determination Algorithms for (Colored) Arc Ka..:

, In: Lecture Notes in Computer Science; SOFSEM 2024: Theory and Practice of Computer Science,

Hanaka, Tesshu ; Kiya, Hironori ; Lampis, Michael.. - p. 297-310 , 2024

Link: https://doi.org/10.1007/..

3

Filling crosswords is very hard:

Gourvès, Laurent ; Harutyunyan, Ararat ; Lampis, Michael.
Theoretical Computer Science. 982 (2024) - p. 114275 , 2024

Link: https://doi.org/10.1016/..

4

Improved (In-)Approximability Bounds for d-Scattered Set:

Katsikarelis, Ioannis ; Lampis, Michael ; Paschos, Vangelis Th.
Journal of Graph Algorithms and Applications. 27 (2023) 3 - p. 219-238 , 2023

Link: https://doi.org/10.7155/..

5

Digraph Coloring and Distance to Acyclicity:

Harutyunyan, Ararat ; Lampis, Michael ; Melissinos, Nikolaos
Theory of Computing Systems. , 2022

Link: https://doi.org/10.1007/..

6

Grundy Distinguishes Treewidth from Pathwidth:

Belmonte, Rémy ; Kim, Eun Jung ; Lampis, Michael..
SIAM Journal on Discrete Mathematics. 36 (2022) 3 - p. 1761-1787 , 2022

Link: https://doi.org/10.1137/..

7

Structurally parameterized d-scattered set:

Katsikarelis, Ioannis ; Lampis, Michael ; Paschos, Vangelis Th.
Discrete Applied Mathematics. 308 (2022) - p. 168-186 , 2022

Link: https://doi.org/10.1016/..

8

(In)approximability of maximum minimal FVS:

Dublois, Louis ; Hanaka, Tesshu ; Khosravian Ghadikolaei, Mehdi..
Journal of Computer and System Sciences. 124 (2022) - p. 26-40 , 2022

Link: https://doi.org/10.1016/..

9

Upper Dominating Set: Tight algorithms for pathwidth and su..:

Dublois, Louis ; Lampis, Michael ; Paschos, Vangelis Th.
Theoretical Computer Science. 923 (2022) - p. 271-291 , 2022

Link: https://doi.org/10.1016/..

10

Parameterized Complexity of $$(A,\ell )$$-Path Packing:

Belmonte, Rémy ; Hanaka, Tesshu ; Kanzaki, Masaaki...
Algorithmica. 84 (2021) 4 - p. 871-895 , 2021

Link: https://doi.org/10.1007/..

11

Upper Dominating Set: Tight Algorithms for Pathwidth and Su..:

, In: Lecture Notes in Computer Science; Algorithms and Complexity,

Dublois, Louis ; Lampis, Michael ; Paschos, Vangelis Th. - p. 202-215 , 2021

Link: https://doi.org/10.1007/..

12

Parameterized Complexity of $$(A,\ell )$$-Path Packing:

, In: Lecture Notes in Computer Science; Combinatorial Algorithms,

Belmonte, Rémy ; Hanaka, Tesshu ; Kanzaki, Masaaki... - p. 43-55 , 2020

Link: https://doi.org/10.1007/..

13

Parameterized Orientable Deletion:

Hanaka, Tesshu ; Katsikarelis, Ioannis ; Lampis, Michael..
Algorithmica. 82 (2020) 7 - p. 1909-1938 , 2020

Link: https://doi.org/10.1007/..

14

Independent Set Reconfiguration Parameterized by Modular-Wi..:

Belmonte, Rémy ; Hanaka, Tesshu ; Lampis, Michael..
Algorithmica. 82 (2020) 9 - p. 2586-2605 , 2020

Link: https://doi.org/10.1007/..

15

K3 Edge Cover Problem in a Wide Sense:

Chiba, Kyohei ; Belmonte, Rémy ; Ito, Hiro...
Journal of Information Processing. 28 (2020) 0 - p. 849-858 , 2020

Link: https://doi.org/10.2197/..