The following pages link to Kazuhisa Makino (Q171929):
Displaying 50 items.
- New Results on Monotone Dualization and Generating Hypergraph Transversals (Q4706216) (← links)
- (Q4736834) (← links)
- Sparse Linear Complementarity Problems (Q4924665) (← links)
- An Exact Algorithm for the Boolean Connectivity Problem for k-CNF (Q4930587) (← links)
- (Q4937169) (← links)
- (Q4937207) (← links)
- The Steiner Problem for Count Matroids (Q5041203) (← links)
- Boolean analysis of incomplete examples (Q5054834) (← links)
- Finding Sparse Solutions for Packing and Covering Semidefinite Programs (Q5071107) (← links)
- Oracle-Based Primal-Dual Algorithms for Packing and Covering Semidefinite Programs (Q5075785) (← links)
- Enumerating Vertices of 0/1-Polyhedra associated with 0/1-Totally Unimodular Matrices (Q5116482) (← links)
- Optimal matroid partitioning problems (Q5136271) (← links)
- Efficient generation of all regular non-dominated coteries (Q5176789) (← links)
- Deterministic Random Walks on Finite Graphs (Q5194705) (← links)
- Enumerating Vertices of Covering Polyhedra with Totally Unimodular Constraint Matrices (Q5220475) (← links)
- Deterministic random walks on finite graphs (Q5265345) (← links)
- Computer Science Logic (Q5292637) (← links)
- Mathematical Foundations of Computer Science 2004 (Q5311106) (← links)
- Algorithm Theory - SWAT 2004 (Q5315378) (← links)
- On the Readability of Monotone Boolean Formulae (Q5323097) (← links)
- Parameterized complexity of sparse linear complementarity problems (Q5363788) (← links)
- ENUMERATING SPANNING AND CONNECTED SUBSETS IN GRAPHS AND MATROIDS(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan) (Q5385037) (← links)
- FINDING SIMPLICES CONTAINING THE ORIGIN IN TWO AND THREE DIMENSIONS (Q5388706) (← links)
- Left-to-Right Multiplication for Monotone Boolean Dualization (Q5390600) (← links)
- Randomized Algorithms for Removable Online Knapsack Problems (Q5405917) (← links)
- Enumerating Spanning and Connected Subsets in Graphs and Matroids (Q5449549) (← links)
- Minimum Transversals in Posi-modular Systems (Q5449560) (← links)
- On the Complexity of Some Enumeration Problems for Matroids (Q5470804) (← links)
- A TREE PARTITIONING PROBLEM ARISING FROM AN EVACUATION PROBLEM IN TREE DYNAMIC NETWORKS (Q5471480) (← links)
- Proportional Cost Buyback Problem with Weight Bounds (Q5743550) (← links)
- Approximating Minimum Representations of Key Horn Functions (Q5863327) (← links)
- (Q5875590) (← links)
- Robust matchings and matroid intersections (Q5891380) (← links)
- Robust independence systems (Q5891381) (← links)
- Robust Independence Systems (Q5892606) (← links)
- Algorithms and Computation (Q5897841) (← links)
- Algorithms and Computation (Q5897849) (← links)
- Robust Matchings and Matroid Intersections (Q5901161) (← links)
- Posimodular function optimization (Q5918641) (← links)
- Posimodular function optimization (Q5920106) (← links)
- On the difference of Horn theories (Q5929916) (← links)
- Decision lists and related Boolean functions (Q5958318) (← links)
- Fair ride allocation on a line (Q6109538) (← links)
- Incomplete list setting of the hospitals/residents problem with maximally satisfying lower quotas (Q6109545) (← links)
- Matroid Horn functions (Q6187338) (← links)
- A fast and simple algorithm for identifying 2-monotonic positive Boolean functions (Q6487975) (← links)
- Maximally satisfying lower quotas in the hospitals/residents problem with ties (Q6490979) (← links)
- Online scheduling on identical machines with a metric state space (Q6490980) (← links)
- A fair and truthful mechanism with limited subsidy (Q6494252) (← links)
- Hypergraph Horn functions (Q6499011) (← links)
