Author of the publication

Computational Complexity of Robot Arm Simulation Problems.

, , , , , , and . IWOCA, volume 10979 of Lecture Notes in Computer Science, page 177-188. Springer, (2018)

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.

 

Other publications of authors with the same name

Efficient algorithms for dualizing large-scale hypergraphs., and . ALENEX, page 1-13. SIAM, (2013)A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs., , , , and . CoRR, (2014)Single versus Multiple Sorting in All Pairs Similarity Search., , , and . ACML, volume 13 of JMLR Proceedings, page 145-160. JMLR.org, (2010)An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence., and . J. Comb. Optim., 13 (3): 243-262 (2007)Efficient Enumeration of Dominating Sets for Sparse Graphs., , , and . ISAAC, volume 123 of LIPIcs, page 8:1-8:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Probabilistic Prediction of Student Affect from Hand Gestures., , , and . ARCS, page 58-63. ISRST, (2008)A Linear Time Algorithm for Finding a k-Tree Core., and . J. Algorithms, 23 (2): 281-290 (1997)Listing Chordal Graphs and Interval Graphs., , and . WG, volume 4271 of Lecture Notes in Computer Science, page 68-77. Springer, (2006)Ladder-Lottery Realization., , , and . CCCG, page 61-67. (2018)A Polynomial Space and Polynomial Delay Algorithm for Enumeration of Maximal Motifs in a Sequence., and . ISAAC, volume 3827 of Lecture Notes in Computer Science, page 724-737. Springer, (2005)