( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
On the Approximability of Maximum and Minimum Edge Clique Partition Problems.

, , , , и . Int. J. Found. Comput. Sci., 18 (2): 217-226 (2007)

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.

Björn Lundell

Eva Marta Hardy

Fares Martak

Martarizal

Hans Martan

 

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

Detecting and Counting Small Pattern Graphs., , , и . ISAAC, том 8283 из Lecture Notes in Computer Science, стр. 547-557. Springer, (2013)Exact and approximation algorithms for graph problems with some biological applications.. Lund University, Sweden, (2009)base-search.net (ftulundlup:oai:lup.lub.lu.se:3ac9524a-89fc-40bc-9b39-5b50884d3287).Induced Subgraph Isomorphism: Are Some Patterns Substantially Easier Than Others?, , , и . COCOON, том 7434 из Lecture Notes in Computer Science, стр. 37-48. Springer, (2012)The Approximability of Maximum Rooted Triplets Consistency with Fan Triplets and Forbidden Triplets., , и . CPM, том 9133 из Lecture Notes in Computer Science, стр. 272-283. Springer, (2015)Unique Small Subgraphs Are Not Easier to Find., , и . LATA, том 6638 из Lecture Notes in Computer Science, стр. 336-341. Springer, (2011)Subexponential-Time Framework for Optimal Embeddings of Graphs in Integer Lattices., , и . SWAT, том 3111 из Lecture Notes in Computer Science, стр. 248-259. Springer, (2004)Detecting and Counting Small Pattern Graphs., , , и . SIAM J. Discret. Math., 29 (3): 1322-1339 (2015)Efficient approximation algorithms for shortest cycles in undirected graphs., и . Inf. Process. Lett., 109 (10): 493-498 (2009)Counting and Detecting Small Subgraphs via Equations., , и . SIAM J. Discret. Math., 27 (2): 892-909 (2013)Counting and detecting small subgraphs via equations and matrix multiplication., , и . SODA, стр. 1468-1476. SIAM, (2011)