Search results for: Kazuhisa Makino
Lecture Notes in Computer Science > Theory and Applications of Satisfiability Testing – SAT 2010 > Part 2. Regular Papers > 172-180
Lecture Notes in Computer Science > Theoretical Computer Science: Exploring New Frontiers of Theoretical Informatics > Fully consistent extensions of partially defined Boolean functions with missing bits > 257-272
Lecture Notes in Computer Science > Computing and Combinatorics > Complexity and Computability > 496-505
Lecture Notes in Computer Science > Algorithms – ESA 2006 > Contributed Papers: Design and Analysis Track > 576-587
Lecture Notes in Computer Science > LATIN 2006: Theoretical Informatics > Regular Contributions > 769-780
Lecture Notes in Computer Science > Automata, Languages and Programming > Session A8: Submodular Optimization, Matroids > 367-378
Lecture Notes in Computer Science > Computing and Combinatorics > Learning and Cryptography > 396-406
Lecture Notes in Computer Science > Automata, Languages and Programming > Contributed Papers > 183-194
Discrete Applied Mathematics > 2016 > 200 > C > 67-78
Theoretical Computer Science > 2016 > 609 > P1 > 185-196
International Journal of Game Theory > 2016 > 45 > 4 > 1111-1131