( en | de | ru )

 

Disambiguation of "Bodlaender, Hans L."

Author of the publication

copydeleteadd this publication to your clipboard
Efficiently Computing the Shapley Value of Connectivity Games in Low-Treewidth Graphs.

, , and . CoRR, (2022)

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. You can also use the button next to the name to display some publications already assigned to the person.

Moritz Bodlaender

Emma Bodlaender

Hans-L Endl

Hans-L Wedler

Hans L Schläfer

 

Other publications of authors with the same name

Fast Partitioning l-Apex Graphs with Application to Approximating Maximum Induced-Subgraph Problems., and . Inf. Process. Lett., 61 (5): 227-232 (1997)Treewidth computations I. Upper bounds., and . Inf. Comput., 208 (3): 259-275 (2010)On the Complexity of Some Coloring Games.. Int. J. Found. Comput. Sci., 2 (2): 133-147 (1991)Exact algorithms for dominating set., and . Discret. Appl. Math., 159 (17): 2147-2164 (2011)On exact algorithms for treewidth., , , , and . ACM Trans. Algorithms, 9 (1): 12:1-12:23 (2012)The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs., , , , and . Theor. Comput. Sci., 244 (1-2): 167-188 (2000)Derivation of algorithms for cutwidth and related graph layout parameters., , and . J. Comput. Syst. Sci., 75 (4): 231-244 (2009)Some Lower Bound Results for Decentralized Extrema-Finding in Rings of Processors.. J. Comput. Syst. Sci., 42 (1): 97-118 (1991)Faster Parameterized Algorithms for Minimum Fill-In., , and . ISAAC, volume 5369 of Lecture Notes in Computer Science, page 282-293. Springer, (2008)Framework for ETH-tight Algorithms and Lower Bounds in Geometric Intersection Graphs., , , , and . CoRR, (2018)