( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Constraint Satisfaction with Counting Quantifiers 2.

, и . CoRR, (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.

Juraj Kukolja

Juraj Kukolja

Juraj Böhm

Juraj Koza

Juraj Mészáro

 

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

Contact Representations of Planar Graphs: Extending a Partial Representation is Hard, , , , и . Graph-Theoretic Concepts in Computer Science - 40th International Workshop, WG 2014, Nouan-le-Fuzelier, France, June 25-27, 2014. Revised Selected Papers, том 8747 из Lecture Notes in Computer Science, стр. 139--151. Springer, (2014)Polarity of chordal graphs., , , и . Discret. Appl. Math., 156 (13): 2469-2479 (2008)Unique Perfect Phylogeny Is NP-Hard., и . CPM, том 6661 из Lecture Notes in Computer Science, стр. 132-146. Springer, (2011)The vertex leafage of chordal graphs, и . CoRR, (2011)Max point-tolerance graphs, , , , , , и . Discrete Applied Mathematics, (2017)Vertex Ordering Characterizations of Graphs of Bounded Asteroidal Number., и . J. Graph Theory, 78 (1): 61-79 (2015)Polynomial-Time Algorithm for the Leafage of Chordal Graphs., и . ESA, том 5757 из Lecture Notes in Computer Science, стр. 290-300. Springer, (2009)3-Colouring AT-Free Graphs in Polynomial Time.. ISAAC (2), том 6507 из Lecture Notes in Computer Science, стр. 144-155. Springer, (2010)Algorithmic complexity of finding cross-cycles in flag complexes., и . SCG, стр. 51-60. ACM, (2012)Constraint Satisfaction with Counting Quantifiers 2., и . CoRR, (2013)