( en | de | ru )

 

Disambiguation of "Makino, Kazuhisa"

Author of the publication

copydeleteadd this publication to your clipboard
Online removable knapsack with limited cuts.

, and . Theor. Comput. Sci., 411 (44-46): 3956-3964 (2010)

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.

Kazuhisa Kakurai

 

Other publications of authors with the same name

Randomized Algorithms for Removable Online Knapsack Problems., , and . FAW-AAIM, volume 7924 of Lecture Notes in Computer Science, page 60-71. Springer, (2013)Boolean Analysis of Incomplete Examples., , and . SWAT, volume 1097 of Lecture Notes in Computer Science, page 440-451. Springer, (1996)Unit Cost Buyback Problem., , and . Theory Comput. Syst., 63 (6): 1185-1206 (2019)Parameterized Complexity of Sparse Linear Complementarity Problems., , and . IPEC, volume 43 of LIPIcs, page 355-364. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)On the Boolean Connectivity Problem for Horn Relations., , and . SAT, volume 4501 of Lecture Notes in Computer Science, page 187-200. Springer, (2007)On Expressing Majority as a Majority of Majorities., , , and . SIAM J. Discret. Math., 34 (1): 730-741 (2020)Ranking Top-$k$ Trees in Tree-Based Phylogenetic Networks., and . IEEE ACM Trans. Comput. Biol. Bioinform., 20 (3): 2349-2355 (2023)Guest Editors' Foreword., and . Algorithmica, 79 (3): 884-885 (2017)A Multiplicative Weight Updates Algorithm for Packing and Covering Semi-infinite Linear Programs., , and . Algorithmica, 81 (6): 2377-2429 (2019)Generating Cut Conjunctions in Graphs and Related Problems., , , , , and . Algorithmica, 51 (3): 239-263 (2008)