( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Algorithms for the workflow satisfiability problem engineered for counting constraints.

, , , , и . J. Comb. Optim., 32 (1): 3-24 (2016)

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.

Rostislaw Gagarin

Andrei Lehmann

Andrei Belitski

Andrei Negoescu

Andrei Verbovsky

 

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

Multiple domination models for placement of electric vehicle charging stations in road networks., и . Comput. Oper. Res., (2018)A generalised upper bound for the k-tuple domination number., и . Discret. Math., 308 (5-6): 880-885 (2008)Distributed Search for Balanced Energy Consumption Spanning Trees in Wireless Sensor Networks., , и . AINA Workshops, стр. 1037-1042. IEEE Computer Society, (2009)Algorithms for the workflow satisfiability problem engineered for counting constraints., , , , и . J. Comb. Optim., 32 (1): 3-24 (2016)Distributed hierarchical search for balanced energy consumption routing spanning trees in wireless sensor networks., , и . J. Parallel Distributed Comput., 70 (9): 975-982 (2010)Pattern-Based Approach to the Workflow Satisfiability Problem with User-Independent Constraints., , , и . CoRR, (2016)Digraphs and k-Domination Models for Facility Location Problems in Road Networks: Greedy Heuristics., , , и . INOC, стр. 22-27. OpenProceedings.org, (2024)Counting unlabelled toroidal graphs with no K33-subdivisions., , и . CoRR, (2005)Embedding K3,3 and K5 on the double torus., и . Discret. Appl. Math., (2024)Engineering Algorithms for Workflow Satisfiability Problem with User-Independent Constraints., , , , и . FAW, том 8497 из Lecture Notes in Computer Science, стр. 48-59. Springer, (2014)