E-LIB Suche - Ergebnisse für: Fomin, Fedor V

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

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/..

3

On coresets for fair clustering in metric and Euclidean spa..:

Bandyapadhyay, Sayan ; Fomin, Fedor V. ; Simonov, Kirill
Journal of Computer and System Sciences. 142 (2024) - p. 103506 , 2024

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

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

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/..

6

Brief Announcement: Distributed Model Checking on Graphs of..:

, In: Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing,

Fomin, Fedor V. ; Fraigniaud, Pierre ; Montealegre, Pedro.. - p. 205-208 , 2024

Link: https://dl.acm.org/doi/1..

7

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/..

8

(Re)packing Equal Disks into Rectangle:

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

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

9

Fast FPT-Approximation of Branchwidth:

Fomin, Fedor V. ; Korhonen, Tuukka
SIAM Journal on Computing. 53 (2024) 4 - p. 1085-1131 , 2024

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

10

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/..

11

Building large k-cores from sparse graphs:

Fomin, Fedor V. ; Sagunov, Danil ; Simonov, Kirill
Journal of Computer and System Sciences. 132 (2023) - p. 68-88 , 2023

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

12

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/..

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

Detours in directed graphs:

Fomin, Fedor V. ; Golovach, Petr A. ; Lochet, William...
Journal of Computer and System Sciences. 137 (2023) - p. 66-86 , 2023

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

15

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/..