( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Efficiently computing the Shapley value of connectivity games in low-treewidth graphs.

, , и . Oper. Res., 23 (1): 6 (марта 2023)

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.

Moritz Bodlaender

Emma Bodlaender

Hans-L Endl

Hans-L Wedler

Hans L Schläfer

 

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

On exact algorithms for treewidth., , , , и . ACM Trans. Algorithms, 9 (1): 12:1-12:23 (2012)Relaxed Update and Partition Network Games., , и . Fundam. Informaticae, 49 (4): 301-312 (2002)On Linear Time Minor Tests and Depth First Search.. WADS, том 382 из Lecture Notes in Computer Science, стр. 577-590. Springer, (1989)On Linear Time Minor Tests with Depth-First Search.. J. Algorithms, 14 (1): 1-23 (1993)Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs., и . J. Algorithms, 21 (2): 358-402 (1996)lambda-Coloring of Graphs., , , и . STACS, том 1770 из Lecture Notes in Computer Science, стр. 395-406. Springer, (2000)Weighted Treewidth Algorithmic Techniques and Results., и . ISAAC, том 4835 из Lecture Notes in Computer Science, стр. 893-903. Springer, (2007)Starting with Nondeterminism: The Systematic Derivation of Linear-Time Graph Layout Algorithms., , и . MFCS, том 2747 из Lecture Notes in Computer Science, стр. 239-248. Springer, (2003)Cutwidth I: A linear time fixed parameter algorithm., , и . J. Algorithms, 56 (1): 1-24 (2005)A Cubic Kernel for Feedback Vertex Set and Loop Cutset., и . Theory Comput. Syst., 46 (3): 566-597 (2010)