Pathwidth of cubic graphs and exact algorithmsFast Minor Testing in Planar GraphsA Subexponential Parameterized Algorithm for Proper Interval CompletionA measure & conquer approach for the analysis of exact algorithmsSubexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphsApproximating minimum cocoloringsMore About SubcoloringsSubexponential Parameterized Algorithm for Minimum Fill-InMetric Dimension of Bounded Width GraphsNew upper bounds on the decomposability of planar graphsOn the complexity of some colorful problems parameterized by treewidthParameterized complexity of firefightingDistortion is Fixed Parameter TractableLocal search: Is brute-force avoidable?Special Issue on Parameterized Complexity of Discrete OptimizationDistortion Is Fixed Parameter TractableLargest Chordal and Interval Subgraphs Faster than $$2^n$$ 2 n(Meta) KernelizationA $c^k n$ 5-Approximation Algorithm for TreewidthAn O(c^k n) 5-Approximation Algorithm for TreewidthA Note on Exact Algorithms for Vertex Ordering Problems on GraphsOn exact algorithms for treewidthParameterized Complexity of the Spanning Tree Congestion ProblemEfficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Decompositions(Meta) KernelizationEquitable colorings of bounded treewidth graphsRadio Labeling with Preassigned FrequenciesTree decompositions with small costApproximation of pathwidth of outerplanar graphsOn the parameterized complexity of vertex cover and edge cover with connectivity constraintsAlgorithms Parameterized by Vertex Cover and Modular Width, Through Potential Maximal CliquesRepresentative Families of Product FamiliesEfficient Computation of Representative Families with Applications in Parameterized and Exact AlgorithmsExact algorithms via monotone local searchForewords: Special issue on Theory and Applications of Graph Searching ProblemsHitting Forbidden Minors: Approximation and KernelizationHow to hunt an invisible rabbit on a graphParameterized Complexity of Secluded Connectivity ProblemsParameterized Complexity of Superstring ProblemsParameterized complexity of the anchored k -core problem for directed graphs
P50
Q56032469-003F1A21-E087-4DA0-94DB-AFBD94969252Q56235104-2F1B674C-C9B5-4A0D-9E68-0513C6E304D3Q56267427-529E84ED-8908-4663-B418-D842A9BE0B3FQ56335609-707BB0CB-1778-4FC0-B615-6AA538392BCBQ56338015-453F1CD6-479D-45B6-BE71-736D2930F3ABQ56428494-0BE20343-A116-4DDE-9595-D432385FD18DQ56428501-43AF6014-E651-45E3-8AEE-921FB5E1B772Q56430107-86C01B2B-8F31-4C54-8848-E13885992703Q56551545-EB29884E-9165-4FF5-A7A2-9EC24DCAC4C5Q56679466-D16E28DA-944B-4E15-9CA6-50BE6BABE622Q56926595-68E15910-22CA-4618-83C9-BAD112AB3736Q57359593-7C5FF246-814C-4060-A247-3D631A2F4478Q57359610-ED1B8033-B981-42F1-A905-3137817436B4Q57359626-C52D3AF8-AFA1-413C-BCD8-98DE310300E3Q57359716-7B4CC31C-28D1-4259-A022-3F3509013987Q57359785-E1B35D4F-9510-4C69-B83D-D5C334FC9DB2Q59473710-7597A732-5A81-4E22-BB0E-A4308F227653Q59567396-1780BA91-7005-474E-AD09-60EF6010715AQ59567401-9DE00B74-698F-4DE8-B3AB-57EB33802CD7Q59567496-F4E26E90-B537-419D-96DE-6EF947342F20Q59567532-5515E8B0-A7AD-4E4D-BFB5-7F0AD8802D8DQ59567551-68994F7A-37B8-457C-8708-670612845865Q59567562-C99F9658-F60A-4EE1-A963-2F9282A1A97DQ59567665-B557F265-F1C8-4B8D-AA99-F054F0FDE255Q59567683-AB27AF4D-0492-45D4-B829-05CB072ABAB7Q59567836-FD95FB13-6209-4A92-A90A-DA0DF22F7FC9Q59567849-7B1C1A2A-5EC1-411D-BF0C-B0F36905A43CQ59567852-FE89AFAA-D50C-41DD-80B0-D9CFF1C4249EQ59567890-4B90D8AC-7200-4984-994D-AB3FAE3A9997Q59864899-CC02F4ED-7CB4-442B-B48C-C7CB52F2D76DQ60488354-52C4DA1A-BB0C-4B63-9460-B64D5814D1EEQ60488357-5CBCB9E5-D3AD-4F27-BFAB-90C77C148415Q60488363-9CA08B36-69A7-4061-A1C7-2801F482D3D7Q60488372-609C98EA-2E3A-4517-A085-3FF85F0D7849Q60488374-1ADBEFAF-CFD1-4037-854C-862157B1DA6EQ60488375-45121C00-259A-4468-809A-77B1D7080EF1Q60488376-AC902EFA-1E27-4A87-ABBF-3155DA9D3CFAQ60488378-A246B6CD-072C-49D9-801E-04428ECA1A09Q60488379-EF4CEBE4-2828-46D1-B291-5EC460D7FAC4Q60488380-1DEFDD0D-60D0-4E3C-8A2C-C5E3E40DF803
P50
description
hulumtues
@sq
informaticus
@nl
researcher
@en
ricercatore
@it
հետազոտող
@hy
name
Fedor Fomin
@ast
Fedor Fomin
@de
Fedor Fomin
@en
Fedor Fomin
@es
Fedor Fomin
@fr
Fedor Fomin
@nl
Fedor Fomin
@sl
type
label
Fedor Fomin
@ast
Fedor Fomin
@de
Fedor Fomin
@en
Fedor Fomin
@es
Fedor Fomin
@fr
Fedor Fomin
@nl
Fedor Fomin
@sl
altLabel
Fedor V. Fomin
@en
Fedor Vladimirovič Fomin
@en
prefLabel
Fedor Fomin
@ast
Fedor Fomin
@de
Fedor Fomin
@en
Fedor Fomin
@es
Fedor Fomin
@fr
Fedor Fomin
@nl
Fedor Fomin
@sl
P214
P244
P101
P1153
7003803014
P166
P1960
96ZXvOsAAAAJ
P21
P214
P244
no2006122893
P2456
f/FedorVFomin
P31
P496
0000-0003-1955-4612
P569
1968-03-16T00:00:00Z
2000-01-01T00:00:00Z
P735
P7859
lccn-no2006122893
P856
P864
81100282175