( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Maximal Induced Matchings in Triangle-Free Graphs.

, , , , и . WG, том 8747 из Lecture Notes in Computer Science, стр. 93-104. Springer, (2014)

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.

Nihal Kubilay Pınar

Özer Pınar

Pinar Akman

Nihal Kubilay Pınar

Maurizio Pinarello

 

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

Generation of random chordal graphs using subtrees of a tree., , , и . CoRR, (2018)Computing Minimal Triangulations in Time O(nalpha log n) = o(n 2.376)., , и . SIAM J. Discret. Math., 19 (4): 900-913 (2005)Mixed Search Number of Permutation Graphs., и . FAW, том 5059 из Lecture Notes in Computer Science, стр. 196-207. Springer, (2008)Maximum Cardinality Search for Computing Minimal Triangulations., , и . WG, том 2573 из Lecture Notes in Computer Science, стр. 1-12. Springer, (2002)Strongly chordal and chordal bipartite graphs are sandwich monotone., , , и . J. Comb. Optim., 22 (3): 438-456 (2011)Fixed-Parameter Algorithms for Cochromatic Number and Disjoint Rectangle Stabbing., , , , и . SWAT, том 6139 из Lecture Notes in Computer Science, стр. 334-345. Springer, (2010)Making an Arbitrary Filled Graph Minimal by Removing Fill Edges., , и . SWAT, том 1097 из Lecture Notes in Computer Science, стр. 173-184. Springer, (1996)Making Life Easier for Firefighters., , и . FUN, том 7288 из Lecture Notes in Computer Science, стр. 177-188. Springer, (2012)Enumerating Minimal Connected Dominating Sets in Graphs of Bounded Chordality., , и . IPEC, том 43 из LIPIcs, стр. 307-318. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)Enumerating Minimal Subset Feedback Vertex Sets., , , , и . WADS, том 6844 из Lecture Notes in Computer Science, стр. 399-410. Springer, (2011)