E-LIB Suche - Ergebnisse für: Golovach, Petr

1

Parameterized complexity of broadcasting in graphs:

Fomin, Fedor V. ; Fraigniaud, Pierre ; Golovach, Petr A.
Theoretical Computer Science. 997 (2024) - p. 114508 , 2024

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

2

Approximating Long Cycle Above Dirac's Guarantee:

Fomin, Fedor V. ; Golovach, Petr A. ; Sagunov, Danil.
Algorithmica. 86 (2024) 8 - p. 2676-2713 , 2024

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

3

(Re)packing Equal Disks into Rectangle:

Fomin, Fedor V. ; Golovach, Petr A. ; Inamdar, Tanmay..
Discrete & Computational Geometry. , 2024

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

4

Fixed-Parameter Tractability of Maximum Colored Path and Be..:

Fomin, Fedor V. ; Golovach, Petr A. ; Korhonen, Tuukka..
ACM Transactions on Algorithms. , 2024

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

5

Diverse Pairs of Matchings:

Fomin, Fedor V. ; Golovach, Petr A. ; Jaffke, Lars..
Algorithmica. 86 (2024) 6 - p. 2026-2040 , 2024

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

6

FPT approximation and subexponential algorithms for coverin..:

Fomin, Fedor V. ; Golovach, Petr A. ; Inamdar, Tanmay.
Information Processing Letters. 185 (2024) - p. 106471 , 2024

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

7

Parameterized Complexity of Broadcasting in Graphs:

, In: Graph-Theoretic Concepts in Computer Science; Lecture Notes in Computer Science,

Fomin, Fedor V. ; Fraigniaud, Pierre ; Golovach, Petr A. - p. 334-347 , 2023

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

8

Diverse collections in matroids and graphs:

Fomin, Fedor V. ; Golovach, Petr A. ; Panolan, Fahad..
Mathematical Programming. 204 (2023) 1-2 - p. 415-447 , 2023

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

9

Shortest Cycles with Monotone Submodular Costs:

Fomin, Fedor V. ; Golovach, Petr A. ; Korhonen, Tuukka..
ACM Transactions on Algorithms. 20 (2023) 1 - p. 1-16 , 2023

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

10

Hitting Topological Minor Models in Planar Graphs is Fixed ..:

Golovach, Petr A. ; Stamoulis, Giannos ; Thilikos, Dimitrios M.
ACM Transactions on Algorithms. 19 (2023) 3 - p. 1-29 , 2023

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

11

Parameterized complexity of categorical clustering with siz..:

Fomin, Fedor V. ; Golovach, Petr A. ; Purohit, Nidhi
Journal of Computer and System Sciences. 136 (2023) - p. 171-194 , 2023

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

12

How to find a good explanation for clustering?:

Bandyapadhyay, Sayan ; Fomin, Fedor V. ; Golovach, Petr A....
Artificial Intelligence. 322 (2023) - p. 103948 , 2023

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

13

Lossy Kernelization of Same-Size Clustering:

Bandyapadhyay, Sayan ; Fomin, Fedor V. ; Golovach, Petr A...
Theory of Computing Systems. 67 (2023) 4 - p. 785-824 , 2023

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

14

On the Parameterized Complexity of the Structure of Lineal ..:

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

Sam, Emmanuel ; Fellows, Michael ; Rosamond, Frances. - p. 353-367 , 2023

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

15

Parameterized Complexity of Feature Selection for Categoric..:

Bandyapadhyay, Sayan ; Fomin, Fedor V. ; Golovach, Petr A..
ACM Transactions on Computation Theory. 15 (2023) 3-4 - p. 1-24 , 2023

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