Gerhard was a leader in algorithms and combinatorial optimization. He has
done pioneering work in many areas of scheduling theory, approximation
algorithms, online algorithms, geometric clustering, packing and covering,
parametrized complexity, graph algorithms, and algorithmic game theory.
His surveys on online algorithms, exact algorithms for NP-hard problems,
and machine scheduling, and his compendium on NP optimization problems are
among the most cited contributions in the field. In this special issue, we
celebrate Gerhard's life and commemorate his extraordinary contributions to
the field. The topics of interest include but are not limited to:
- algorithmic game theory
- approximation algorithms
- bilevel optimization
- bin-packing, knapsack, and TSP
- exact algorithms for NP-hard problems
- fixed-parameter tractability
- geometric algorithms
- graph algorithms
- job shop and open shop scheduling
- multiprocessor scheduling
- online algorithms
- parameterized complexity
- scheduling theory
We solicit contributions in the form of new research
investigations, technical surveys, and memoirs. A technical contribution
may include a section describing Gerhard's influence on the authors, both on
their academic careers and personal lives.
Guest Editors
Saket Saurabh, Professor of Theoretical Computer Science at the The
Institute of Mathematical Sciences, Chennai, India, saket@imsc.res.in
Rajmohan Rajaraman, Professor in the Khoury College of Computer Sciences at
Northeastern University, Boston, MA, USA, R.Rajaraman@northeastern.edu
Important Dates
Deadline for Submissions: 31st March 2023
Deadline for reviews: 30th June 2023
Deadline for revised version: 31st July 2023
Deadline for second reviews: 30th September 2023
Final decision: 15th October 2023
Submission Guidelines
Authors should follow the formatting and submission instructions for TOCS
at https://www.springer.com/journal/224/submission-guidelines.
During submission in Snapp, please confirm that your submission belongs to
this special issue by choosing the special issue title from the drop-down
menu.
With best regards,
Saket
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************