Toshihide Ibaraki - Citegraph

Author Info

Name	Affiliation	Papers
TOSHIHIDE IBARAKI	Department of Informatics, School of Science and Technology, Kwansei Gakuin University, Sanda 669-1337, Japan	179
Collaborators	Citations	PageRank
132	2593	385.64
Referers	Referees	References
3365	1474	1997

Search Limit

1001000

Publications (100 rows)

Collaborators (100 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
Recent progress of local search in handling the time window constraints of the vehicle routing problem	19	0.67	2010
Computing Bounds on Risk-neutral Distributions from the Observed Prices of Call Options	0	0.34	2010
Solving The Irregular Strip Packing Problem Via Guided Local Search For Overlap Minimization	4	0.41	2009
Scheduling of corrugated paper production	1	0.40	2009
An iterated local search algorithm for the vehicle routing problem with convex time penalty functions	41	1.44	2008
An iterated local search algorithm for the time-dependent vehicle routing problem with time windows	42	1.41	2008
The complexity of assigning genotypes to people in a pedigree consistently	1	0.36	2007
Packing problems with soft rectangles	0	0.34	2006
Construction of Classifiers by Iterative Compositions of Features with Partial Knowledge	1	0.38	2006
Augmenting a (k-1)-Vertex-Connected Multigraph l-Edge-Connected and k-Vertex-Connected Multigraph	0	0.34	2006
A path relinking approach with ejection chains for the generalized assignment problem	41	1.45	2006
The vehicle routing problem with flexible time windows and traveling times	29	1.17	2006
A 3-flip neighborhood local search for the set covering problem	19	0.85	2006
Minimum edge ranking spanning trees of split graphs	1	0.36	2006
Dynamic Generalized Assignment Problems with Stochastic Demands and Multiple Agent-Task Relationships	3	0.39	2005
Lowering eccentricity of a tree by node upgrading	3	0.50	2005
On generalized greedy splitting algorithms for multiway partition problems	5	0.46	2004
A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem	21	0.95	2004
One-dimensional cutting stock problem with a given number of setups: a hybrid approach of metaheuristics and linear programming	6	0.57	2004
Finding Essential Attributes from Binary Data	8	0.54	2003
Variations on extending partially defined boolean functions with missing bits	2	0.52	2003
A linear time 5/3-approximation for the minimum strongly-connected spanning subgraph problem	9	0.57	2003
Average running time analysis of an algorithm to calculate the size of the union of Cartesian products	0	0.34	2003
Convex Embeddings and Bisections of3-Connected Graphs<Superscript>1</Superscript>	0	0.34	2002
Better approximation ratios for the single-vehicle scheduling problems on line-shaped networks	13	0.99	2002
Minimum Edge Ranking Spanning Trees of Threshold Graphs	8	0.64	2002
Augmenting a Submodular and Posi-modular Set Function by a Multigraph	2	0.39	2001
A Unified Framework for Approximating Multiway Partition Problems	4	0.50	2001
An Index for the Data Size to Extract Decomposable Structures in LAD	0	0.34	2001
A primal-dual approximation algorithm for the survivable network design problem in hypergraphs	4	0.81	2001
On functional dependencies in q-Horn theories	3	0.39	2001
On metaheuristic algorithms for combinatorial optimization problems.	48	3.74	2001
Translation among CNFs, characteristic models and ordered binary decision diagrams	1	0.36	2001
Fully Consistent Extensions of Partially Defined Boolean Functions with Missing Bits	2	0.40	2000
Optimal Augmentation of a 2-Vertex-Connected Multigraph to a k-Edge-Connected and 3-Vertex-Connected Multigraph	3	0.40	2000
Constant ratio approximation algorithms for the rectangle stabbing problem and the rectilinear partitioning problem	40	2.06	2000
Optimal Scheduling in Parallel and Serial Manufacturing Systems via the Maximum Principle	1	0.35	2000
On the difference of horn theories	1	0.37	1999
On minimum edge ranking spanning trees	13	0.82	1999
Horn Extensions of a Partially Defined Boolean Function	10	0.68	1999
Inner-core and outer-core functions of partially defined Boolean functions	7	0.67	1999
Minimum self-dual decompositions of positive dual-minor Boolean functions	5	0.53	1999
Bidual Horn functions and extensions	3	0.43	1999
Functional dependencies in Horn theories	16	1.12	1999
Computing intersections of Horn theories for reasoning with models	8	0.53	1999
Analyses on the 2 and 3-Flip Neighborhoods for the MAX SAT	6	0.51	1999
Ordered binary decision diagrams as knowledge-bases	10	0.58	1999
Algorithmic Aspects of the Core of Combinatorial Optimization Games	66	3.23	1999
K-Edge and 3-Vertex Connectivity Augmentation in an Arbitrary Multigraph	4	0.43	1998
Error-free and best-fit extensions of partially defined Boolean functions	44	5.18	1998

1
2
50 / page