Guochuan Zhang

Orcid: 0000-0003-1947-7872

According to our database1, Guochuan Zhang authored at least 126 papers between 1996 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
An Improved Pseudopolynomial Time Algorithm for Subset Sum.
CoRR, 2024

Approximating Partition in Near-Linear Time.
CoRR, 2024

2023
Scheduling on a graph with release times.
J. Sched., December, 2023

Mathematical challenges in scheduling theory.
J. Sched., December, 2023

Learning-augmented algorithms for online subset sum.
J. Glob. Optim., November, 2023

A Nearly Quadratic-Time FPTAS for Knapsack.
CoRR, 2023

Faster Algorithms for Bounded Knapsack and Bounded Subset Sum Via Fine-Grained Proximity Results.
CoRR, 2023

Facility Location Games with Thresholds.
Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023

2022
From packing rules to cost-sharing mechanisms.
J. Comb. Optim., 2022

Truthful mechanism design for bin packing with applications on cloud computing.
J. Comb. Optim., 2022

Preface.
J. Comb. Optim., 2022

Block-structured integer programming: Can we parameterize without the largest coefficient?
Discret. Optim., 2022

Fair Graphical Resource Allocation with Matching-Induced Utilities.
CoRR, 2022

A Best Cost-Sharing Rule for Selfish Bin Packing.
CoRR, 2022

Approximation Algorithms for Interdiction Problem with Packing Constraints.
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

2021
Approximate ridesharing of personal vehicles problem.
Theor. Comput. Sci., 2021

Scheduling with variable-length calibrations: Two agreeable variants.
Theor. Comput. Sci., 2021

New Perspectives in Scheduling Theory.
J. Sched., 2021

On the price of anarchy of two-stage machine scheduling games.
J. Comb. Optim., 2021

Two-Facility Location Games with a Minimum Distance Requirement on a Circle.
Proceedings of the Combinatorial Optimization and Applications, 2021

Scheduling Stochastic Jobs - Complexity and Approximation Algorithms.
Proceedings of the Thirty-First International Conference on Automated Planning and Scheduling, 2021

Traffic Shaping in E-Commercial Search Engine: Multi-Objective Online Welfare Maximization.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
Scheduling Many Types of Calibrations.
Proceedings of the Algorithmic Aspects in Information and Management, 2020

2019
Efficient algorithms for ridesharing of personal vehicles.
Theor. Comput. Sci., 2019

Strategy-proof mechanisms for obnoxious facility game with bounded service range.
J. Comb. Optim., 2019

Facility location games with distinct desires.
Discret. Appl. Math., 2019

Multiple Constrained Routing Algorithms in Large-Scaled Software Defined Networks.
CoRR, 2019

Weighted Throughput Maximization with Calibrations.
Proceedings of the Algorithms and Data Structures - 16th International Symposium, 2019

Truthful Mechanism Design of Reversed Auction on Cloud Computing.
Proceedings of the Computing and Combinatorics - 25th International Conference, 2019

The k-Delivery Traveling Salesman Problem: Revisited.
Proceedings of the Combinatorial Optimization and Applications, 2019

Facility Location Games with Externalities.
Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, 2019

2018
Mechanism design for one-facility location game with obnoxious effects on a line.
Theor. Comput. Sci., 2018

Algorithmic analysis for ridesharing of personal vehicles.
Theor. Comput. Sci., 2018

Packing Groups of Items into Multiple Knapsacks.
ACM Trans. Algorithms, 2018

Online scheduling of moldable parallel tasks.
J. Sched., 2018

New challenges in scheduling theory.
J. Sched., 2018

On the optimality of exact and approximation algorithms for scheduling problems.
J. Comput. Syst. Sci., 2018

Online lazy bureaucrat scheduling with a machine deadline.
J. Comb. Optim., 2018

Parallel machine scheduling with speed-up resources.
Eur. J. Oper. Res., 2018

The Path Set Packing Problem.
Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

2017
Parameterized and Approximation Results for Scheduling with a Low Rank Processing Time Matrix.
Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017

Cost-Sharing Mechanisms for Selfish Bin Packing.
Proceedings of the Combinatorial Optimization and Applications, 2017

The Price of Anarchy in Two-Stage Scheduling Games.
Proceedings of the Combinatorial Optimization and Applications, 2017

2016
Approximate composable truthful mechanism design.
Theor. Comput. Sci., 2016

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

Mechanism Design for One-Facility Location Game with Obnoxious Effects.
Proceedings of the Frontiers in Algorithmics, 10th International Workshop, 2016

An Efficient PTAS for Parallel Machine Scheduling with Capacity Constraints.
Proceedings of the Combinatorial Optimization and Applications, 2016

Strategy-proof Mechanism Design for Facility Location Games: Revisited (Extended Abstract).
Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, 2016

Approximation Algorithms for Parallel Machine Scheduling with Speed-up Resources.
Proceedings of the Approximation, 2016

2015
An asymptotic competitive scheme for online bin packing.
Theor. Comput. Sci., 2015

New perspectives in scheduling theory.
J. Sched., 2015

New challenges in scheduling theory.
RAIRO Oper. Res., 2015

Approximating the Optimal Algorithm for Online Scheduling Problems via Dynamic Programming.
Asia Pac. J. Oper. Res., 2015

Approximate Truthful Mechanism Design for Two-Dimensional Orthogonal Knapsack Problem.
Proceedings of the Computing and Combinatorics - 21st International Conference, 2015

2014
Computing and Combinatorics.
Theor. Comput. Sci., 2014

An improved lower bound for rank four scheduling.
Oper. Res. Lett., 2014

Single machine batch scheduling to minimize the sum of total flow time and batch delivery cost with an unavailability interval.
Inf. Sci., 2014

Online Scheduling of mixed CPU-GPU jobs.
Int. J. Found. Comput. Sci., 2014

On the optimality of approximation schemes for the classical scheduling problem.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

2013
Strategy-proof approximation mechanisms for an obnoxious facility game on networks.
Theor. Comput. Sci., 2013

Approximation algorithms for a bi-level knapsack problem.
Theor. Comput. Sci., 2013

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

Guest editorial: "New trends in scheduling" - Centre CNRS "La Villa Clythia" Frejus Workshop, September 12-17, 2010.
J. Sched., 2013

Approximating the optimal competitive ratio for an ancient online scheduling problem
CoRR, 2013

A note on scheduling with low rank processing times.
CoRR, 2013

Obnoxious Facility Game with a Bounded Service Range.
Proceedings of the Theory and Applications of Models of Computation, 2013

Online Scheduling on a CPU-GPU Cluster.
Proceedings of the Theory and Applications of Models of Computation, 2013

2012
Approximation schemes for two-machine flow shop scheduling with two agents.
J. Comb. Optim., 2012

Coordination Mechanisms for Selfish Parallel Jobs Scheduling - (Extended Abstract).
Proceedings of the Theory and Applications of Models of Computation, 2012

Vehicle Scheduling on a Graph Revisited.
Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

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

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

Scheduling on two identical machines with a speed-up resource.
Inf. Process. Lett., 2011

Improved Approximation Algorithms for Routing Shop Scheduling.
Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

Offline Scheduling of Multi-threaded Request Streams on a Caching Server.
Proceedings of the 25th IEEE International Symposium on Parallel and Distributed Processing, 2011

Mechanisms for Obnoxious Facility Game on a Path.
Proceedings of the Combinatorial Optimization and Applications, 2011

Approximation Algorithms for Unrelated Machine Scheduling with an Energy Budget.
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

Guest editorial - Special issue "New challenges in scheduling theory" (Marseilles Workshop, May 12-16, 2008).
J. Sched., 2010

On-line scheduling of multi-core processor tasks with virtualization.
Oper. Res. Lett., 2010

Online knapsack with resource augmentation.
Inf. Process. Lett., 2010

Approximation Algorithms for Scheduling with a Variable Machine Maintenance.
Proceedings of the Algorithmic Aspects in Information and Management, 2010

2009
Scheduling with a minimum number of machines.
Oper. Res. Lett., 2009

Hardness of lazy packing and covering.
Oper. Res. Lett., 2009

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

Optimal online-list batch scheduling.
Inf. Process. Lett., 2009

On-line extensible bin packing with unequal bin sizes.
Discret. Math. Theor. Comput. Sci., 2009

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

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

A Note on Online Scheduling for Jobs with Arbitrary Release Times.
Proceedings of the Combinatorial Optimization and Applications, 2009

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

On-line scheduling of parallel jobs on two machines.
J. Discrete Algorithms, 2008

On lazy bureaucrat scheduling with common deadlines.
J. Comb. Optim., 2008

On Two Dimensional Orthogonal Knapsack Problem
CoRR, 2008

Bin Packing of Selfish Items.
Proceedings of the Internet and Network Economics, 4th International Workshop, 2008

2007
On-line scheduling mesh jobs with dependencies.
Theor. Comput. Sci., 2007

On-line scheduling of parallel jobs in a list.
J. Sched., 2007

Online bin packing of fragile objects with application in cellular networks.
J. Comb. Optim., 2007

Maximizing the throughput of parallel jobs on hypercubes.
Inf. Process. Lett., 2007

Maximizing the Total Profit of Rectangles Packed into a Rectangle.
Algorithmica, 2007

The Hardness of Selective Network Design for Bottleneck Routing Games.
Proceedings of the Theory and Applications of Models of Computation, 2007

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

Online Scheduling of Equal-Length Jobs on Parallel Machines.
Proceedings of the Algorithms, 2007

Optimal Resource Augmentations for Online Knapsack.
Proceedings of the Approximation, 2007

2006
Strip Packing vs. Bin Packing.
Electron. Colloquium Comput. Complex., 2006

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

Common Deadline Lazy Bureaucrat Scheduling Revisited.
Proceedings of the LATIN 2006: Theoretical Informatics, 2006

Online Scheduling with Hard Deadlines on Parallel Machines.
Proceedings of the Algorithmic Aspects in Information and Management, 2006

2005
A 3-approximation algorithm for two-dimensional bin packing.
Oper. Res. Lett., 2005

2004
Maximizing the Number of Packed Rectangles.
Proceedings of the Algorithm Theory, 2004

On rectangle packing: maximizing benefits.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

On-Line Scheduling of Parallel Jobs.
Proceedings of the Structural Information and Communication Complexity, 2004

2003
On maximizing the throughput of multiprocessor tasks.
Theor. Comput. Sci., 2003

On-line scheduling with extendable working time on a small number of machines.
Inf. Process. Lett., 2003

Online Scheduling of Parallel Jobs with Dependencies on 2-Dimensional Meshes.
Proceedings of the Algorithms and Computation, 14th International Symposium, 2003

2001
An on-line bin-batching problem.
Discret. Appl. Math., 2001

2000
Linear time-approximation algorithms for bin packing.
Oper. Res. Lett., 2000

A constrained minimum spanning tree problem.
Comput. Oper. Res., 2000

1999
Optimal on-line algorithms for variable-sized bin covering.
Oper. Res. Lett., 1999

Semi On-Line Scheduling on Two Identical Machines.
Computing, 1999

1998
A new approximation algorithm for UET-Scheduling with chain-type precedence constraints.
Comput. Oper. Res., 1998

Parameterized On-Line Open-End Bin Packing.
Computing, 1998

1997
A Simple Semi On-Line Algorithm for P2//C_{max} with a Buffer.
Inf. Process. Lett., 1997

A New Version of On-line Variable-sized Bin Packing.
Discret. Appl. Math., 1997

Bounded Space On-Line Variable-Sized Bin Packing.
Acta Cybern., 1997

1996
Short Communication: Worst-Case Analysis of the FFH Algorithm for Online Variable-Sized Bin Packing.
Computing, 1996


  Loading...