Guochuan Zhang

Math. Program., November, 2024

Two homogeneous facility location games with a minimum distance requirement on a circle.

[BibT_eX]

[DOI]

Xiaoyu Wu

Theor. Comput. Sci., 2024

Bike rebalancing: How to find a balanced matching in the k center problem?

[BibT_eX]

[DOI]

Jinxiang Gan

Yuhao Zhang

Eur. J. Oper. Res., 2024

Approximating Partition in Near-Linear Time.

[BibT_eX]

[DOI]

Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

A Nearly Quadratic-Time FPTAS for Knapsack.

[BibT_eX]

[DOI]

Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

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

[BibT_eX]

[DOI]

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

An Improved Pseudopolynomial Time Algorithm for Subset Sum.

[BibT_eX]

[DOI]

Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

Fair and Efficient Division of a Discrete Cake with Switching Utility Loss.

[BibT_eX]

[DOI]

Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems, 2024

2023

Scheduling on a graph with release times.

[BibT_eX]

[DOI]

Mordecai J. Golin

J. Sched., December, 2023

Mathematical challenges in scheduling theory.

[BibT_eX]

[DOI]

J. Sched., December, 2023

Learning-augmented algorithms for online subset sum.

[BibT_eX]

[DOI]

Chenyang Xu

J. Glob. Optim., November, 2023

Facility Location Games with Thresholds.

[BibT_eX]

[DOI]

Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023

2022

From packing rules to cost-sharing mechanisms.

[BibT_eX]

[DOI]

Chenhao Zhang

J. Comb. Optim., 2022

Truthful mechanism design for bin packing with applications on cloud computing.

[BibT_eX]

[DOI]

Feng Xie

J. Comb. Optim., 2022

Preface.

[BibT_eX]

[DOI]

Bo Chen

Dachuan Xu

J. Comb. Optim., 2022

Block-structured integer programming: Can we parameterize without the largest coefficient?

[BibT_eX]

[DOI]

Hua Chen

Discret. Optim., 2022

Fair Graphical Resource Allocation with Matching-Induced Utilities.

[BibT_eX]

[DOI]

CoRR, 2022

A Best Cost-Sharing Rule for Selfish Bin Packing.

[BibT_eX]

[DOI]

Changjun Wang

CoRR, 2022

Approximation Algorithms for Interdiction Problem with Packing Constraints.

[BibT_eX]

[DOI]

Xiaoyu Wu

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

2021

Approximate ridesharing of personal vehicles problem.

[BibT_eX]

[DOI]

Qian-Ping Gu

Jiajian Leo Liang

Theor. Comput. Sci., 2021

Scheduling with variable-length calibrations: Two agreeable variants.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

New Perspectives in Scheduling Theory.

[BibT_eX]

[DOI]

J. Sched., 2021

On the price of anarchy of two-stage machine scheduling games.

[BibT_eX]

[DOI]

J. Comb. Optim., 2021

Two-Facility Location Games with a Minimum Distance Requirement on a Circle.

[BibT_eX]

[DOI]

Xiaoyu Wu

Proceedings of the Combinatorial Optimization and Applications, 2021

Scheduling Stochastic Jobs - Complexity and Approximation Algorithms.

[BibT_eX]

[DOI]

Liangde Tao

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.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020

Scheduling Many Types of Calibrations.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 2020

2019

Efficient algorithms for ridesharing of personal vehicles.

[BibT_eX]

[DOI]

Qian-Ping Gu

Jiajian Leo Liang

Theor. Comput. Sci., 2019

Strategy-proof mechanisms for obnoxious facility game with bounded service range.

[BibT_eX]

[DOI]

J. Comb. Optim., 2019

Facility location games with distinct desires.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

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

[BibT_eX]

[DOI]

CoRR, 2019

Weighted Throughput Maximization with Calibrations.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 16th International Symposium, 2019

Truthful Mechanism Design of Reversed Auction on Cloud Computing.

[BibT_eX]

[DOI]

Feng Xie

Proceedings of the Computing and Combinatorics - 25th International Conference, 2019

The k-Delivery Traveling Salesman Problem: Revisited.

[BibT_eX]

[DOI]

Jinxiang Gan

Proceedings of the Combinatorial Optimization and Applications, 2019

Facility Location Games with Externalities.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

Algorithmic analysis for ridesharing of personal vehicles.

[BibT_eX]

[DOI]

Qian-Ping Gu

Jiajian Leo Liang

Theor. Comput. Sci., 2018

Packing Groups of Items into Multiple Knapsacks.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2018

Online scheduling of moldable parallel tasks.

[BibT_eX]

[DOI]

Danny Z. Chen

J. Sched., 2018

On the optimality of exact and approximation algorithms for scheduling problems.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2018

Online lazy bureaucrat scheduling with a machine deadline.

[BibT_eX]

[DOI]

J. Comb. Optim., 2018

Parallel machine scheduling with speed-up resources.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2018

The Path Set Packing Problem.

[BibT_eX]

[DOI]

Chenyang Xu

Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

2017

Parameterized and Approximation Results for Scheduling with a Low Rank Processing Time Matrix.

[BibT_eX]

[DOI]

Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017

Cost-Sharing Mechanisms for Selfish Bin Packing.

[BibT_eX]

[DOI]

Chenhao Zhang

Proceedings of the Combinatorial Optimization and Applications, 2017

The Price of Anarchy in Two-Stage Scheduling Games.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2017

2016

Approximate composable truthful mechanism design.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

New challenges in scheduling theory.

[BibT_eX]

[DOI]

J. Sched., 2016

Approximate strip packing: Revisited.

[BibT_eX]

[DOI]

Inf. Comput., 2016

Mechanism Design for One-Facility Location Game with Obnoxious Effects.

[BibT_eX]

[DOI]

Proceedings of the Frontiers in Algorithmics, 10th International Workshop, 2016

An Efficient PTAS for Parallel Machine Scheduling with Capacity Constraints.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2016

Strategy-proof Mechanism Design for Facility Location Games: Revisited (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, 2016

Approximation Algorithms for Parallel Machine Scheduling with Speed-up Resources.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2016

2015

An asymptotic competitive scheme for online bin packing.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

New perspectives in scheduling theory.

[BibT_eX]

[DOI]

J. Sched., 2015

New challenges in scheduling theory.

[BibT_eX]

[DOI]

RAIRO Oper. Res., 2015

Approximating the Optimal Algorithm for Online Scheduling Problems via Dynamic Programming.

[BibT_eX]

[DOI]

Asia Pac. J. Oper. Res., 2015

Approximate Truthful Mechanism Design for Two-Dimensional Orthogonal Knapsack Problem.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 21st International Conference, 2015

2014

Computing and Combinatorics.

[BibT_eX]

[DOI]

Ding-Zhu Du

Theor. Comput. Sci., 2014

An improved lower bound for rank four scheduling.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2014

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

[BibT_eX]

[DOI]

Yunqiang Yin

Inf. Sci., 2014

Online Scheduling of mixed CPU-GPU jobs.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2014

On the optimality of approximation schemes for the classical scheduling problem.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Yukun Cheng

Theor. Comput. Sci., 2013

Approximation algorithms for a bi-level knapsack problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

A Harmonic Algorithm for the 3D Strip Packing Problem.

[BibT_eX]

[DOI]

SIAM J. Comput., 2013

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

[BibT_eX]

[DOI]

J. Sched., 2013

Approximating the optimal competitive ratio for an ancient online scheduling problem

[BibT_eX]

[DOI]

CoRR, 2013

A note on scheduling with low rank processing times.

[BibT_eX]

[DOI]

CoRR, 2013

Obnoxious Facility Game with a Bounded Service Range.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2013

Online Scheduling on a CPU-GPU Cluster.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2013

2012

Approximation schemes for two-machine flow shop scheduling with two agents.

[BibT_eX]

[DOI]

Wenchang Luo

J. Comb. Optim., 2012

Coordination Mechanisms for Selfish Parallel Jobs Scheduling - (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2012

Vehicle Scheduling on a Graph Revisited.

[BibT_eX]

[DOI]

Mordecai J. Golin

Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

2011

Online multiple-strip packing.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

A new upper bound 2.5545 on 2D Online Bin Packing.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2011

Scheduling on two identical machines with a speed-up resource.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2011

Improved Approximation Algorithms for Routing Shop Scheduling.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

Offline Scheduling of Multi-threaded Request Streams on a Caching Server.

[BibT_eX]

[DOI]

Proceedings of the 25th IEEE International Symposium on Parallel and Distributed Processing, 2011

Mechanisms for Obnoxious Facility Game on a Path.

[BibT_eX]

[DOI]

Yukun Cheng

Proceedings of the Combinatorial Optimization and Applications, 2011

Approximation Algorithms for Unrelated Machine Scheduling with an Energy Budget.

[BibT_eX]

[DOI]

Wenchang Luo

Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2011

2010

Deterministic on-line call control in cellular networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

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

[BibT_eX]

[DOI]

J. Sched., 2010

On-line scheduling of multi-core processor tasks with virtualization.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2010

Online knapsack with resource augmentation.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2010

Approximation Algorithms for Scheduling with a Variable Machine Maintenance.

[BibT_eX]

[DOI]

Wenchang Luo

Proceedings of the Algorithmic Aspects in Information and Management, 2010

2009

Scheduling with a minimum number of machines.

[BibT_eX]

[DOI]

Guosong Yu

Oper. Res. Lett., 2009

Hardness of lazy packing and covering.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2009

A note on online strip packing.

[BibT_eX]

[DOI]

J. Comb. Optim., 2009

Optimal online-list batch scheduling.

[BibT_eX]

[DOI]

Jacob Jan Paulus

Inf. Process. Lett., 2009

On-line extensible bin packing with unequal bin sizes.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2009

A New Upper Bound on 2D Online Bin Packing

[BibT_eX]

[DOI]

CoRR, 2009

On-Line Multiple-Strip Packing.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2009

A Note on Online Scheduling for Jobs with Arbitrary Release Times.

[BibT_eX]

[DOI]

Jihuan Ding

Proceedings of the Combinatorial Optimization and Applications, 2009

2008

Online Removable Square Packing.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2008

On-line scheduling of parallel jobs on two machines.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2008

On lazy bureaucrat scheduling with common deadlines.

[BibT_eX]

[DOI]

J. Comb. Optim., 2008

On Two Dimensional Orthogonal Knapsack Problem

[BibT_eX]

[DOI]

CoRR, 2008

Bin Packing of Selfish Items.

[BibT_eX]

[DOI]

Guosong Yu

Proceedings of the Internet and Network Economics, 4th International Workshop, 2008

2007

On-line scheduling mesh jobs with dependencies.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

On-line scheduling of parallel jobs in a list.

[BibT_eX]

[DOI]

J. Sched., 2007

Online bin packing of fragile objects with application in cellular networks.

[BibT_eX]

[DOI]

J. Comb. Optim., 2007

Maximizing the throughput of parallel jobs on hypercubes.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2007

Maximizing the Total Profit of Rectangles Packed into a Rectangle.

[BibT_eX]

[DOI]

Algorithmica, 2007

The Hardness of Selective Network Design for Bottleneck Routing Games.

[BibT_eX]

[DOI]

Haiyang Hou

Proceedings of the Theory and Applications of Models of Computation, 2007

Harmonic algorithm for 3-dimensional strip packing problem.

[BibT_eX]

[DOI]

Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Online Scheduling of Equal-Length Jobs on Parallel Machines.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2007

Optimal Resource Augmentations for Online Knapsack.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2007

2006

Strip Packing vs. Bin Packing.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2006

New Upper Bounds on The Approximability of 3D Strip Packing

[BibT_eX]

[DOI]

CoRR, 2006

Common Deadline Lazy Bureaucrat Scheduling Revisited.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2006: Theoretical Informatics, 2006

Online Scheduling with Hard Deadlines on Parallel Machines.

[BibT_eX]

[DOI]

Jihuan Ding

Proceedings of the Algorithmic Aspects in Information and Management, 2006

2005

A 3-approximation algorithm for two-dimensional bin packing.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2005

2004

Maximizing the Number of Packed Rectangles.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2004

On rectangle packing: maximizing benefits.

[BibT_eX]

[DOI]

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

On-Line Scheduling of Parallel Jobs.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2004

2003

On maximizing the throughput of multiprocessor tasks.

[BibT_eX]

[DOI]

Aleksei V. Fishkin

Theor. Comput. Sci., 2003

On-line scheduling with extendable working time on a small number of machines.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2003

Online Scheduling of Parallel Jobs with Dependencies on 2-Dimensional Meshes.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 14th International Symposium, 2003

2001

An on-line bin-batching problem.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2001

2000

Linear time-approximation algorithms for bin packing.

[BibT_eX]

[DOI]

Xiaoqiang Cai

C. K. Wong

Oper. Res. Lett., 2000

A constrained minimum spanning tree problem.

[BibT_eX]

[DOI]

Guangting Chen

Comput. Oper. Res., 2000

1999

Optimal on-line algorithms for variable-sized bin covering.

[BibT_eX]

[DOI]

Gerhard J. Woeginger

Oper. Res. Lett., 1999

Semi On-Line Scheduling on Two Identical Machines.

[BibT_eX]

[DOI]

Yong He

Computing, 1999

1998

A new approximation algorithm for UET-Scheduling with chain-type precedence constraints.

[BibT_eX]

[DOI]

Jiye Han

Jianjun Wen

Comput. Oper. Res., 1998

Parameterized On-Line Open-End Bin Packing.

[BibT_eX]

[DOI]

Computing, 1998

1997

A Simple Semi On-Line Algorithm for P2//C_{max} with a Buffer.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1997

A New Version of On-line Variable-sized Bin Packing.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1997

Bounded Space On-Line Variable-Sized Bin Packing.

[BibT_eX]

[DOI]

Rainer E. Burkard

Acta Cybern., 1997

1996

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

[BibT_eX]

[DOI]