Xin Han

According to our database1, Xin Han authored at least 72 papers between 2000 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
Proportional cost buyback problem with weight bounds.
Theor. Comput. Sci., 2019

Online knapsack problem under concave functions.
Theor. Comput. Sci., 2019

Unit Cost Buyback Problem.
Theory Comput. Syst., 2019

Group topic-author model for efficient discovery of latent social astroturfing groups in tourism domain.
Cybersecurity, 2019

Online Knapsack Problems with a Resource Buffer.
CoRR, 2019

NDNVIC: Named Data Networking for Vehicle Infrastructure Cooperation.
IEEE Access, 2019

User requirements dynamic elicitation of complex products from social network service.
Proceedings of the 25th International Conference on Automation and Computing, 2019

2018
Online buffer management for transmitting packets with processing cycles.
Theor. Comput. Sci., 2018

An Improved Speedup Factor for Sporadic Tasks with Constrained Deadlines under Dynamic Priority Scheduling.
CoRR, 2018

A General Bin Packing Game: Interest Taken into Account.
Algorithmica, 2018

Detecting Suspicious Social Astroturfing Groups in Tourism Social Networks.
Proceedings of the 5th International Conference on Behavioral, 2018

Sentiment Analysis to Enhance Detection of Latent Astroturfing Groups in Online Social Networks.
Proceedings of the Applications and Techniques in Information Security, 2018

2017
Flowshop problem F2 → D|v = 1, c ≥ 1|Cmax revisited.
Theor. Comput. Sci., 2017

Online bin packing problem with buffer and bounded size revisited.
J. Comb. Optim., 2017

Online Knapsack Problem Under Concave Functions.
Proceedings of the Frontiers in Algorithmics - 11th International Workshop, 2017

Re-designing Cloud Platforms for Massive Scale Using a P2P Architecture.
Proceedings of the IEEE International Conference on Cloud Computing Technology and Science, 2017

2016
Online minimization knapsack problem.
Theor. Comput. Sci., 2016

Scheduling on parallel identical machines with late work criterion: Offline and online cases.
J. Scheduling, 2016

Complexity of problem TF2|v=1, c=2|Cmax.
Inf. Process. Lett., 2016

Approximate strip packing: Revisited.
Inf. Comput., 2016

Research on Variation Rule of Sensible Heat Flux in Field Under Different Soil Moisture Content and Underlying Surface by Large Aperture Scintillometer.
Proceedings of the Computer and Computing Technologies in Agriculture X, 2016

2015
Randomized algorithms for online knapsack problems.
Theor. Comput. Sci., 2015

Online bin packing with (1, 1) and (2, R) bins.
J. Comb. Optim., 2015

Online hierarchical scheduling on two machines with known total size of low-hierarchy jobs.
Int. J. Comput. Math., 2015

Bin Packing Game with an Interest Matrix.
Proceedings of the Computing and Combinatorics - 21st International Conference, 2015

Black and White Bin Packing Revisited.
Proceedings of the Combinatorial Optimization and Applications, 2015

2014
Online algorithms for 1-space bounded 2-dimensional bin packing and square packing.
Theor. Comput. Sci., 2014

Online removable knapsack problem under convex function.
Theor. Comput. Sci., 2014

Online Minimum makespan Scheduling with a Buffer.
Int. J. Found. Comput. Sci., 2014

Online Unweighted Knapsack Problem with Removal Cost.
Algorithmica, 2014

2013
2D knapsack: Packing squares.
Theor. Comput. Sci., 2013

Tight absolute bound for First Fit Decreasing bin-packing: FFD(l) ≤ 11/9 OPT(L) + 6/9.
Theor. Comput. Sci., 2013

A Harmonic Algorithm for the 3D Strip Packing Problem.
SIAM J. Comput., 2013

A note on a selfish bin packing problem.
J. Global Optimization, 2013

Online algorithms for 1-space bounded multi dimensional bin packing and hypercube packing.
J. Comb. Optim., 2013

Semi-online hierarchical scheduling problems with buffer or rearrangements.
Inf. Process. Lett., 2013

The Train Delivery Problem Revisited.
Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

Randomized Algorithms for Removable Online Knapsack Problems.
Proceedings of the Frontiers in Algorithmics <i>and</i> Algorithmic Aspects in Information and Management, 2013

2012
Online call control in cellular networks revisited.
Inf. Process. Lett., 2012

Online scheduling with one rearrangement at the end: Revisited.
Inf. Process. Lett., 2012

Online Knapsack Problem with Removal Cost.
Proceedings of the Computing and Combinatorics - 18th Annual International Conference, 2012

Online Minimum Makespan Scheduling with a Buffer.
Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2012

2011
Online multiple-strip packing.
Theor. Comput. Sci., 2011

Online scheduling with rearrangement on two related machines.
Theor. Comput. Sci., 2011

Optimal algorithms for online scheduling with bounded rearrangement at the end.
Theor. Comput. Sci., 2011

A new upper bound 2.5545 on 2D Online Bin Packing.
ACM Trans. Algorithms, 2011

Online Algorithm for 1-Space Bounded Multi-dimensional Bin Packing.
Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2011

2D Knapsack: Packing Squares.
Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2011

2010
Deterministic on-line call control in cellular networks.
Theor. Comput. Sci., 2010

Online removable knapsack with limited cuts.
Theor. Comput. Sci., 2010

Deadline scheduling and power management for speed bounded processors.
Theor. Comput. Sci., 2010

Dynamic bin packing with unit fraction items revisited.
Inf. Process. Lett., 2010

Deterministic Online Call Control in Cellular Networks and Triangle-Free Cellular Networks
CoRR, 2010

A note on online hypercube packing.
CEJOR, 2010

Improved Online Algorithms for 1-Space Bounded 2-Dimensional Bin Packing.
Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

Graph-Based Semi-supervised Learning with Adaptive Similarity Estimation.
Proceedings of the ICDM 2010, 2010

Deterministic Online Call Control in Cellular Networks and Triangle-Free Cellular Networks.
Proceedings of the Frontiers in Algorithmics, 4th International Workshop, 2010

2009
A note on online strip packing.
J. Comb. Optim., 2009

A note on on-line broadcast scheduling with deadlines.
Inf. Process. Lett., 2009

A New Upper Bound on 2D Online Bin Packing
CoRR, 2009

Online Knapsack Problems with Limited Cuts.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

On-Line Multiple-Strip Packing.
Proceedings of the Combinatorial Optimization and Applications, 2009

Models of Antifreeze Proteins Bound to Ice by Tandem Repeat Motif.
Proceedings of the 2nd International Conference on BioMedical Engineering and Informatics, 2009

2008
A fast asymptotic approximation scheme for bin packing with rejection.
Theor. Comput. Sci., 2008

Online Removable Square Packing.
Theory Comput. Syst., 2008

On Two Dimensional Orthogonal Knapsack Problem
CoRR, 2008

2007
Harmonic algorithm for 3-dimensional strip packing problem.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Approximating the Maximum Independent Set and Minimum Vertex Coloring on Box Graphs.
Proceedings of the Algorithmic Aspects in Information and Management, 2007

2006
Strip Packing vs. Bin Packing.
Electronic Colloquium on Computational Complexity (ECCC), 2006

New Upper Bounds on The Approximability of 3D Strip Packing
CoRR, 2006

Improved online hypercube packing
CoRR, 2006

2000
A Strategy for Persistent Object Service under CORBA and WEB Environment.
Proceedings of the TOOLS Asia 2000: 36th International Conference on Technology of Object-Oriented Languages and Systems, Xi'an, China, 30 October, 2000


  Loading...