( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Tight Complexity Bounds for FPT Subgraph Problems Parameterized by Clique-Width.

, , и . IPEC, том 7112 из Lecture Notes in Computer Science, стр. 207-218. Springer, (2011)

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.

Devang Patel

Niranjan Patel

Jashwant Patel

Katrin Pätel

Bhulabhai Patel

 

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

The Complexity Status of Problems Related to Sparsest Cuts., , , и . IWOCA, том 6460 из Lecture Notes in Computer Science, стр. 125-135. Springer, (2010)A near-optimal zero-free disk for the Ising model., , и . CoRR, (2023)Lee-Yang zeros and the complexity of the ferromagnetic Ising Model on bounded-degree graphs., , , и . SODA, стр. 1508-1519. SIAM, (2021)Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials., и . Electron. Notes Discret. Math., (2017)Computing the Number of Induced Copies of a Fixed Graph in a Bounded Degree Graph., и . Algorithmica, 81 (5): 1844-1858 (2019)Mixing of the Glauber dynamics for the ferromagnetic Potts model, , и . CoRR, (2013)Modes preserving wavelet based multi-scale PCA algorithm for compression of smart grid data., , , , и . ICACCI, стр. 817-821. IEEE, (2013)Statistical Physics Approaches to Unique Games., , , , и . CCC, том 169 из LIPIcs, стр. 13:1-13:27. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)A domination algorithm for 0, 1-instances of the travelling salesman problem., , и . Random Struct. Algorithms, 48 (3): 427-453 (2016)Parameterized TSP: Beating the Average., и . CoRR, (2014)