( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Myhill-Nerode Methods for Hypergraphs.

, , , и . ISAAC, том 8283 из Lecture Notes in Computer Science, стр. 372-382. Springer, (2013)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Frances Allen

Frances Buttelmann

Frances McGinnity

Daniela Frances

Frances Dielmann

 

Другие публикации лиц с тем же именем

On the parameterized complexity of multiple-interval graph problems., , , и . Theor. Comput. Sci., 410 (1): 53-61 (2009)Clustering with Partial Information., , , , , и . MFCS, том 5162 из Lecture Notes in Computer Science, стр. 144-155. Springer, (2008)A Fixed-Parameter Approach to Two-Layer Planarization., , , , , , , , , и 2 other автор(ы). GD, том 2265 из Lecture Notes in Computer Science, стр. 1-15. Springer, (2001)The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number., и . CiE, том 4497 из Lecture Notes in Computer Science, стр. 268-277. Springer, (2007)Efficient Parameterized Preprocessing for Cluster Editing., , , и . FCT, том 4639 из Lecture Notes in Computer Science, стр. 312-321. Springer, (2007)Local Search: Is Brute-Force Avoidable?, , , , , и . IJCAI, стр. 486-491. (2009)Distortion Is Fixed Parameter Tractable., , , , , и . ICALP (1), том 5555 из Lecture Notes in Computer Science, стр. 463-474. Springer, (2009)Proving NP-hardness for clique-width II: non-approximability of clique-width, , , и . Electron. Colloquium Comput. Complex., (2005)Open Problems in (Hyper)Graph Decomposition., , , , , , , , , и 19 other автор(ы). CoRR, (2023)Finding k Disjoint Triangles in an Arbitrary Graph., , , , и . WG, том 3353 из Lecture Notes in Computer Science, стр. 235-244. Springer, (2004)