[DMANET] Postdoc position in operations research at École des Ponts, Paris

A postdoc position in operations research is available at École des Ponts, in its research center in mathematics (CERMICS).

*Topic: Day-ahead dynamic pricing and intraday scheduling of EV charging stations. Enclosed, the detailed project.

*Practical informations: This is a 12-month position, which should start during the first semester of 2022. The net salary is 2100€/month. There is no teaching duty. Financial support to attend workshops will be granted. CERMICS is located in Champs-sur-Marne (20 minutes from downtown Paris by public transportation).

*Applications and deadline: The successful candidate will hold a PhD in operations research, optimization, or a related field by the start of the position. Interested candidates should send their application to frederic.meunier@enpc.fr <mailto:frederic.meunier@enpc.fr>. The application should include a CV and a publication list. Letters of recommendation are optional, but contact information of at least two references should be provided. They might be requested to provide a letter.

For further inquiries contact frederic.meunier@enpc.fr <mailto:frederic.meunier@enpc.fr> (https://cermics.enpc.fr/~meuniefr/).

**********************************************************
*
* 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/
*
**********************************************************

[DMANET] IWOCA 2022: 2nd Call for Papers

IWOCA, 33rd International Workshop on Combinatorial Algorithms


NEWS:


The submission server is OPEN:

https://ocs.springer.com/ocs/home/IWOCA2022

Venue

* University of Trier (June 7th - 9th, 2022)

* Graph- and Stringmasters: June 10th, 2022

Important Dates (a.o.e.)

* Abstract submission: January 6th, 2022

* Paper submission: January 11th, 2022

Proceedings

will be published within the LNCS series<https://www.uni-trier.de/fileadmin/fb4/prof/INF/TIN/Miscellaneous/LNCS-Logo.jpg> of Springer, within the ARCoSS subline. We therefore ask for submissions of original work in LNCS format, allowing for 12 pages plus bibliography and a possible, clearly marked appendix.

Invited Speakers

* Akanksha Agrawal, IITM Chennai, India

* Erik Demaine, MIT Boston, USA

* Bhaskar Ray Chaudhury, University of Illinois at Urbana Champaign, USA

List of Topics (Not Exclusive)

* Algorithms and Data Structures

* Algorithmic and Combinatorial Aspects of Cryptography and Information Security

* Algorithmic Game Theory and Complexity of Games

* Approximation Algorithms

* Combinatorics and Graph Theory

* Combinatorial Generation, Enumeration and Counting

* Combinatorial Optimization

* Combinatorics of Words

* Complexity Theory

* Computational Biology

* Computational Geometry

* Decompositions and Combinatorial Designs

* Distributed, Parallel and Network Algorithms

* Experimental Combinatorics

* Fine-grained Complexity

* Graph Algorithms and Modelling with Graphs

* Graph Drawing and Graph Labelling

* Network Theory and Temporal Graphs

* Quantum Computing / Algorithms for Quantum Computers

* Online Algorithms

* Parameterized and Exact Algorithms

* Probabilistic and Randomized Algorithms

* Streaming Algorithms

Program Committee

* Cristina Bazgan, University Paris Dauphine, France, Co-Chair

* Henning Fernau, University of Trier, Germany, Co-Chair

* Faisal Abu-Khzam, LAU Beirut, Lebanon

* Jérémy Barbay, University of Chile, Santiago

* Ljiljana Brankovic, University of Newcastle, Australia

* Katrin Casel, HPI Potsdam, Germany

* Katarína Cechlárová, University Košice, Slovakia

* Charles Colbourn, Arizona State University, USA

* Thomas Erlebach, Durham University, UK

* Florent Foucaud, University Clermont Auvergne, France

* Kshitij Gajjar, National University of Singapore

* Adriana Hansberg, Instituto de Matemáticas, Universidad Nacional Autónoma de México

* Toru Hasunuma, Tokushima University, Japan

* Sun-Yuan Hsieh, National Cheng Kung University, Taiwan

* Philipp Kindermann, Univesity of Trier, Germany

* Gunnar Klau, University of Düsseldorf, Germany

* Yasuaki Kobayashi, Kyoto University, Japan

* Veli Mäkinen, University of Helsinki, Finland

* Florin Manea, University of Göttingen, Germany

* David Manlove, University of Glasgow, UK

* André Nichterlein, TU Berlin, Germany

* Mateus de Oliveira Oliveira, University of Bergen, Norway

* Jakub Radoszewski, University of Warszawa, Poland

* Giovanna Rosone, University of Pisa, Italy

* Irena Rusu, University of Nantes, France

* Jeffrey Shallit, University of Waterloo, Canada

* Blerina Sinaimeri‬, LUISS University, Rome, Italy

* Wing-Kin Sung, National University of Singapore

* Sue Whitesides, University of Victoria, Canada

* Meirav Zehavi, Ben-Gurion University of the Negev, Israel

Local Organizing Committee (preliminary)

* Henning Fernau

* Philipp Kindermann

* Kevin Mann

* Norbert Müller

* Esther Stürmer-Schwarz

* Petra Wolf

Steering Committee<https://nms.kcl.ac.uk/iwoca/steering.html>

* Maria Chudnovsky, Princeton University, USA

* Costas Iliopoulos, King's Collega London, UK

* Ralf Klasing, CNRS and University of Bordeaux, France

* Wing-Kin Sung, National University of Singapore

**********************************************************
*
* 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/
*
**********************************************************

[DMANET] PhD position(s) in string algorithms at Stony Brook University (New York, USA)

A funded PhD position in the area of string algorithms is available in
the Department of Computer Science at Stony Brook University (New
York, USA). A successful candidate will pursue their PhD degree under
the supervision of Dr Dominik Kempa. Candidates should have a good
background in algorithms and/or discrete mathematics. The position
will start in the Fall of 2022. For more details about the topics, see
[1]. For application details, please have a look at [2]. Interested
candidates are encouraged to reach out by e-mail (see [1] for contact
details). Application deadline: Jan 15, 2022.

Links:
[1] https://sites.google.com/view/dkempa
[2] https://www.cs.stonybrook.edu/students/Graduate-Programs
**********************************************************
*
* 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/
*
**********************************************************

[DMANET] The discrete mathematical charms of Paul Erdős

A list of misprints and errors in "The discrete mathematical charms of
Paul Erdős" has been posted at
https://users.encs.concordia.ca/~chvatal/errata.pdf .
(Other links relevant to the book can be found just below the top of
https://users.encs.concordia.ca/~chvatal/ .)

Best regards to all, Vašek Chvátal

**********************************************************
*
* 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/
*
**********************************************************

[DMANET] IJOC CFPs: Scalable RL Algorithms (Paul Brooks)

Calls for Papers: Special Issue of INFORMS Journal on
Computing—Scalable Reinforcement Learning Algorithms

Guest Editors: J. Paul Brooks, Ted Ralphs, Nicola Secomandi

Letter of Interest Due: April 30, 2022

Details: <https://pubsonline.informs.org/page/ijoc/calls-for-papers>.

**********************************************************
*
* 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/
*
**********************************************************

[DMANET] PhD Student Position in Algorithms, TU Munich

PhD Student Position in Algorithms
TU Munich

The Department of Computer Science, Technical University of Munich, has a
vacancy for a PhD candidate/researcher position in the area of efficient
algorithms. The position is hosted at the Chair for Algorithms and
Complexity,
headed by Prof. Susanne Albers (http://wwwalbers.in.tum.de/index.html.en).
The dissertation work will involve research in the fields of approximation
and online algorithms, algorithmic game theory or algorithm engineering.

The position is paid according to the German public salary scale TVL-13 and
provides a competitive salary with standard benefits. The initial
appointment
is for a period of two years and can be renewed for another two years.

The successful candidate should have a Master's degree in computer science
or mathematics. Since the position involves teaching obligations, very good
proficiency in German is required. The application material should include
(1) a cover letter describing the interest in the position, (2) a CV,
(3) transcripts, and (4) a copy of the Master's thesis.

The material should be sent electronically to <albers@in.tum.de>.

Applications will be reviewed starting January 20, 2022.

Susanne Albers
Department of Computer Science
Technical University Munich
Boltzmannstr. 3
85748 Garching (near Munich), Germany
E-mail: albers@in.tum.de

**********************************************************
*
* 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/
*
**********************************************************

[DMANET] [Scheduling seminar] Rubén Ruiz (UP de València)| December 22| State-of-the-art flowshop scheduling heuristics: Dos and Don'ts

Dear Dmanet moderator,

please discard my morning email notice (I made a mistake in the date of
the next seminar) and use the one below.

Kind regards

Zdenek

Dear scheduling researcher,

We are delighted to announce the talk given by Rubén Ruiz (UP de València).

The title is "State-of-the-art flowshop scheduling heuristics: Dos and
Don'ts".

The seminar will take place on Zoom on Wednesday, December 22 at 14:00 UTC.

Join Zoom Meeting
https://cesnet.zoom.us/j/91381308994?pwd=bFgzTFR1ZzlNNHpybTc5YTlTTHRxQT09
<https://cesnet.zoom.us/j/91381308994?pwd=bFgzTFR1ZzlNNHpybTc5YTlTTHRxQT09>

Meeting ID: 913 8130 8994
Passcode: 212305

You can follow the seminar online or offline on our Youtube channel as well:

https://www.youtube.com/channel/UCUoCNnaAfw5NAntItILFn4A

The abstract follows.

Many scheduling problems are simply too hard to be solved exactly,
especially for instances of medium or large size or when realistic
constraints are present. As a result, the literature on heuristics and
metaheuristics for scheduling is extensive. More often than not,
metaheuristics are capable of generating solutions close to optimality
or to tight lower bounds for instances of realistic size in a matter of
minutes. Metaheuristics have been refined over the years and there are
literally hundreds of papers published every year with applications to
most domains in many different journals. Most regrettably, some of these
methods are complex in the sense that they have many parameters that
affect performance and hence need careful calibration. Furthermore, many
times published results are hard to reproduce due to specific speed-ups
being used or complicated software constructs. These complex methods are
difficult to transfer to industries in the case of scheduling problems.
Another important concern is the recently recognized "tsunami" of novel
metaheuristics that mimic the most bizarre natural or human processes,
as for example intelligent water drops, harmony search, firefly
algorithms and the like. See K. Sörensen "Metaheuristics—The Metaphor
exposed" (2015), ITOR 22(1):3-18. In this presentation, we briefly
review different flowshop problems and variants. From the basic flowshop
problem with makespan minimization to other objectives like flowtime
minimization, flowshops with sequence-dependent setup times, no-idle
flowshops, all the way up to complex hybrid flexible flowline problems.
We will show how simple Iterated Greedy (IG) algorithms often outperform
much more complex approaches. IG methods are inherently simple with very
few parameters. They are easy to code and results are easy to reproduce.
We will show that for all tested problems so far they show
state-of-the-art performance despite their simplicity. As a result, we
will defend the choice of simpler, yet good performing approaches over
complicated metaphor-based algorithms.

The next talk in our series will be given by

Christian Artigues (LAAS-CNRS
<https://homepages.laas.fr/artigues/drupal/node/11> Toulouse)| January
19, 2022| Mixed-integer linear programming for resource-constrained
scheduling

For more details, please visit https://schedulingseminar.com/

With kind regards

Zdenek, Mike and Guohua

--
Zdenek Hanzalek
Industrial Informatics Department,
Czech Institute of Informatics, Robotics and Cybernetics,
Czech Technical University in Prague,
Jugoslavskych partyzanu 1580/3, 160 00 Prague 6, Czech Republic
https://rtime.ciirc.cvut.cz/~hanzalek/

**********************************************************
*
* 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/
*
**********************************************************

[DMANET] [Scheduling seminar] Rubén Ruiz (UP de València)| December 22| State-of-the-art flowshop scheduling heuristics: Dos and Don'ts

Dear scheduling researcher,

We are delighted to announce the talk given by Rubén Ruiz (UP de València).

The title is "State-of-the-art flowshop scheduling heuristics: Dos and
Don'ts".

The seminar will take place on Zoom on Wednesday, December 22 at 14:00 UTC.

Join Zoom Meeting
https://cesnet.zoom.us/j/91381308994?pwd=bFgzTFR1ZzlNNHpybTc5YTlTTHRxQT09

Meeting ID: 913 8130 8994
Passcode: 212305

You can follow the seminar online or offline on our Youtube channel as well:

https://www.youtube.com/channel/UCUoCNnaAfw5NAntItILFn4A

The abstract follows.

Many scheduling problems are simply too hard to be solved exactly,
especially for instances of medium or large size or when realistic
constraints are present. As a result, the literature on heuristics and
metaheuristics for scheduling is extensive. More often than not,
metaheuristics are capable of generating solutions close to optimality
or to tight lower bounds for instances of realistic size in a matter of
minutes. Metaheuristics have been refined over the years and there are
literally hundreds of papers published every year with applications to
most domains in many different journals. Most regrettably, some of these
methods are complex in the sense that they have many parameters that
affect performance and hence need careful calibration. Furthermore, many
times published results are hard to reproduce due to specific speed-ups
being used or complicated software constructs. These complex methods are
difficult to transfer to industries in the case of scheduling problems.
Another important concern is the recently recognized "tsunami" of novel
metaheuristics that mimic the most bizarre natural or human processes,
as for example intelligent water drops, harmony search, firefly
algorithms and the like. See K. Sörensen "Metaheuristics—The Metaphor
exposed" (2015), ITOR 22(1):3-18. In this presentation, we briefly
review different flowshop problems and variants. From the basic flowshop
problem with makespan minimization to other objectives like flowtime
minimization, flowshops with sequence-dependent setup times, no-idle
flowshops, all the way up to complex hybrid flexible flowline problems.
We will show how simple Iterated Greedy (IG) algorithms often outperform
much more complex approaches. IG methods are inherently simple with very
few parameters. They are easy to code and results are easy to reproduce.
We will show that for all tested problems so far they show
state-of-the-art performance despite their simplicity. As a result, we
will defend the choice of simpler, yet good performing approaches over
complicated metaphor-based algorithms.

The next talk in our series will be given by

Christian Artigues (LAAS-CNRS Toulouse)| December 22|

For more details, please visit https://schedulingseminar.com/

With kind regards

Zdenek, Mike and Guohua

--
Zdenek Hanzalek
Industrial Informatics Department,
Czech Institute of Informatics, Robotics and Cybernetics,
Czech Technical University in Prague,
Jugoslavskych partyzanu 1580/3, 160 00 Prague 6, Czech Republic
https://rtime.ciirc.cvut.cz/~hanzalek/

**********************************************************
*
* 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/
*
**********************************************************

[DMANET] PhD student pos. at HU Berlin in (applied) graph algorithms

You love graph algorithms, their systematic analysis and efficient
implementation? You are about to graduate with an excellent Master's
(or PhD) degree and can teach in German? You love research and always
wanted to work in Berlin? Then read on:

The research group "Modeling and Analysis of Complex Systems" at the
Dept. of Computer Science of HU Berlin advertises a fixed-term position
(pay grade 13 TV-L, 100%) on algorithm engineering for graph problems.
Application deadline: Jan 13th.

More details at:
https://www.personalabteilung.hu-berlin.de/de/personalabteilung/stellenausschreibungen/wissenschaftliche-r-mitarbeiter-in-m-w-d-befristet-fuer-4-jahre-e-13-tv-l-hu

If interested, feel encouraged to direct informal inquiries to Prof.
Henning Meyerhenke (meyerhenke (at) hu-berlin.de) first. Submit your
formal application with the relevant documents (preferably as 1 PDF
attachment) by Jan 13th to sekr-maks (at) informatik.hu-berlin.de, see
the call above.

Henning Meyerhenke
**********************************************************
*
* 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/
*
**********************************************************

[DMANET] One PhD Position in Probabilistic Combinatorics at TU Graz, Austria

One PhD Position in Probabilistic Combinatorics is available at TU Graz,
Austria.

A successful candidate will pursue their PhD degree within the FWF
funded Doctoral Program 'Discrete Mathematics' under the supervision of
Univ.-Prof. Mihyun Kang. Research topics include random graphs, random
graphs on surfaces, random hypergraphs, random simplicial complexes, and
random subgraphs.

The position is up to 3 years, and the preferred starting date is 1
March 2022. The salary is according to the standard personnel costs and
salaries for FWF projects, and the current gross salary per month is
2,237.60 Euros (14 times a year). There is additional funding for
participating in conferences.

Qualifications and condition of employment:
- Strong track record of mathematical studies
- Master's degree in mathematics or theoretical computer science

Application documents:
- Cover letter describing your qualification and your research
experience and interests
- Transcript (or a list) of courses for your Masters and Bachelor
programs including grades
- Master thesis if available
- CV

Please merge all your application documents into a single pdf-file and
send it by e-mail to

karin.kernbichler@tugraz.at.

One to three confidential reference letters (one by their master thesis
advisor) should be sent directly to karin.kernbichler@tugraz.at.

The deadline for application is 15 January 2022.

Online interviews of short-listed applicants are expected to take place
during 17-28 January 2022.

Further information on the position can be found at
https://www.math.tugraz.at/comb/index.php?link=jobs

**********************************************************
*
* 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/
*
**********************************************************

[DMANET] International Conference on Continuous Optimization (ICCOPT) 2022 at Lehigh University

Dear Colleagues,

The Industrial and Systems Engineering (ISE) department at Lehigh
University is excited to host the jointly held International Conference on
Continuous Optimization (ICCOPT) and Modeling and Optimization: Theory and
Applications (MOPTA) conference at Lehigh University in Bethlehem,
Pennsylvania, USA on July 23-28, 2022. A summer school will take place on
July 23-24, with the main conference taking place on July 25-28.

Please save the dates and visit our conference website
https://iccopt2022.lehigh.edu , where you will find preliminary
information about the plenary and semi-plenary speakers, conference
clusters/themes, important deadlines, travel, and local accommodations.
Cluster chairs have already started to invite session organizers
to submit invited sessions, and contributed talk submissions will be
accepted starting in a few weeks.

The local organizing committee is excited to host and organize ICCOPT/MOPTA
2022. This will give us an opportunity to share our beautiful campus and
vibrant city of Bethlehem with everyone.

Please note that the organizing committee is fully committed to hosting
ICCOPT/MOPTA 2022 as an *in-person conference.* We ask all potential
participants to respond optimistically to invitations from session
organizers, even though individual plans may change at a later date.
Further information about registration, including cancellation policies, is
expected to be made available in January 2022.

We are looking forward to a wonderful ICCOPT/MOPTA 2022 and hope that you
are able to join us!

Regards,
Daniel P. Robinson and Frank E. Curtis

p.s. Local organizing committee:

Daniel P. Robinson (co-chair)
Frank E. Curtis (co-chair)
Aida Khajavirad
Ted Ralphs
Karmel Shehadeh
Tamas Terlaky
Luis Zuluaga

Program committee:
Steve Wright (chair)
Xiaojun Chen
Roberto Cominetti
Frank E. Curtis
Alex D'Aspremont
Maryam Fazel
Tito Homem-de-Mello
Fatma Kilinc-Karzan
Michal Kocvara
Daniel P. Robinson
Kim-Chuan Toh
Michael Ulbrich

Plenary speakers:
Ernesto Birgin
Jean-Bernard Lasserre
Asu Ozdaglar
Defeng Sun

Semi-plenary speakers:
Daniel Kuhn
Guanghui (George) Lan
Angelia Nedich
Pablo Parillo
Suvrit Sra
Akiko Takeda
Zaiwen Wen

-------------------------------------------------------------------
Daniel P. Robinson
Lehigh University
Industrial and Systems Engineering
200 W. Packer Avenue,
Bethlehem, PA 18015, USA
phone: (610) 758-4039
office: Mohler Laboratory, Room 479
-------------------------------------------------------------------

**********************************************************
*
* 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/
*
**********************************************************

[DMANET] SoCG Test of Time Award 2022

*SoCG Test of Time Award 2022*

*Call for Nominations*

The SoCG Test of Time Award, instated two years ago, recognizes papers
published at the Proceedings of the Annual Symposium on Computational
Geometry (SoCG). An award will be given to a paper published in SoCG no
later than 2002. More than one paper may be selected for the award.

*Nomination Procedure*

Anyone in the computational geometry community may nominate a paper by
submitting the nomination via e-mail to socga.tota.2022@gmail.com
with a subject line of *SoCG Test of Time Award. *The nomination should
contain a brief explanation of the impact of the nominated paper(s).The
deadline for submitting the nomination is*January 31, 2022*.

*Selection*

The winners are selected by a committee appointed by the SoCG steering
committee and for 2022 it consists of Pankaj K. Agarwal (Duke
University), Dan Halperin (Tel Aviv University), and Raimund Seidel
(Saarland University).

In selecting the Test of Time Award, the Committee will pay particular
attention to long term impact. This impact can come in many forms and
some possibilities are to: (i) open up a new area of research; (ii)
introduce new techniques; (iii) solve a problem of lasting importance.
The selection will be announced by *March 1, 2022.*

*About the Award*

This is the third SoCG Test of Time Award and it will be an annual
award; the winners of the first two awards can be found at

https://computational-geometry.org/Awards/SoCG_Test_of_Time.html

The 2022 award winners will be presented at CG Week 2022, to be held in
Berlin, Germany, June 7-10, 2022.

--
Pankaj K. Agarwal
Duke University

**********************************************************
*
* 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/
*
**********************************************************

[DMANET] IFAAMAS Influential paper award: Nomination Deadline is 5th Jan 2022

[Apologies for cross-posting]

IFAAMAS Influential paper award: Call for Nominations

The International Foundation for Autonomous Agents and Multi-Agent Systems,
IFAAMAS, established an award in 2006 to recognize publications in the
autonomous agents and multiagent systems field that have made influential
and long-lasting contributions. Candidates for this award are papers that
have proved a key result, led to the development of a new subfield,
demonstrated a significant new application or system, or simply presented a
new way of thinking about a topic that has proved influential. A list of
previous winners of this award appears at
http://www.ifaamas.org/award-influential.html

This award is presented annually at the AAMAS Conference.

Winning papers must have been published at least 10 years before the first
day of the conference. Therefore, papers eligible for the 2022 award must
have been published earlier than July 2012 , and in a recognized scientific
forum (e.g., journal, conference, or workshop).

To nominate a publication for this award, please send the full reference
plus a brief statement (200 words or fewer) arguing for the significance of
the paper to chair of the 2022 IFAAMAS Influential Paper Award committee,
Wiebe van der Hoek (wiebe@csc.liv.ac.uk).

Nominations are due by the extended deadline of *January 5, 2022. *

**********************************************************
*
* 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/
*
**********************************************************

[DMANET] Full Professorship (W3) for Applied Discrete Mathematics at Goethe University Frankfurt

An der Johann Wolfgang Goethe-Universität Frankfurt am Main ist am
Institut für Mathematik des Fachbereichs Informatik und Mathematik
zum nächstmöglichen Zeitpunkt folgende Stelle im Beamten- bzw. im
Arbeitsverhältnis zu besetzen:

Professur (W3) für Angewandte Diskrete Mathematik

Gesucht ist eine Persönlichkeit, welche die vorhandene Ausrichtung
des Instituts für Mathematik im Schwerpunkt Diskrete Mathematik
ergänzt und auf einem aktuellen Gebiet der angewandten diskreten
Mathematik (z. B. angewandte diskrete Geometrie, kombinatorische
Optimierung, computerorientierte diskrete Mathematik oder
Mathematical Data Science) besonders ausgewiesen ist. Erfahrungen
in der Einwerbung von Drittmitteln werden ebenso erwartet wie die
Bereitschaft zur Zusammenarbeit mit bestehenden Arbeitsgruppen der
Mathematik und Informatik. Des Weiteren wird von der Professur die
Beteiligung an den vom Institut angebotenen Lehrveranstaltungen,
insbesondere im Grundlagenbereich und im Lehrservice für die
Informatik erwartet.

Die Goethe-Universität setzt sich aktiv ein für Chancengleichheit,
Vielfalt und Inklusion. Sie begrüßt besonders Bewerbungen von
qualifizierten Frauen und Menschen mit Migrationsgeschichte und legt
großen Wert auf die familienfreundliche Gestaltung universitärer
Arbeitszusammenhänge. Personen mit einer Schwerbehinderung oder
diesen Gleichgestellte werden bei gleicher Qualifikation bevorzugt
berücksichtigt; dies gilt auch für Frauen in den Bereichen, in denen
sie unterrepräsentiert sind. Details zu den rechtlichen
Rahmenbedingungen der Einstellungsvoraussetzungen finden Sie unter:
www.vakante-professuren.uni-frankfurt.de

Wenn Sie in Forschung und Lehre exzellent ausgewiesen sind und dies
durch international sichtbare Forschungsleistungen belegen können,
sind Sie eingeladen, Ihre Bewerbung mit Lebenslauf
(wissenschaftlichem und beruflichem Werdegang), Schriftenverzeichnis,
Übersicht über Lehrtätigkeiten, bisherige und geplante
Forschungsschwerpunkte im Umfang von maximal fünf Seiten, sowie
eingeworbenen Drittmitteln, Lehrevaluationen, Zeugnissen und
Urkunden (alle Dateien zusammengefasst in einer PDF-Datei) bis zum
16.01.2022 an den Dekan des Fachbereichs Informatik und Mathematik
zu richten, E-Mail: bewerbung@fb12.uni-frankfurt.de.

***

The Institute of Mathematics, Faculty of Computer Science and
Mathematics of Johann Wolfgang Goethe University Frankfurt am Main
invites applications for the following position as civil servant or
public employee starting at the earliest possible date:

Professorship (W3) for Applied Discrete Mathematics

We are seeking a candidate whose interests complement our existing
capabilities in the Institute of Mathematics and who is widely
recognized for excellent research in a timely area of Applied
Discrete Mathematics (e. g. applied discrete geometry, combinatorial
optimization, computer-oriented discrete mathematics or mathematical
data science). Commitment to acquire third-party funding and
willingness for cooperation with the existing research groups in
mathematics and computer science are expected.

Furthermore, the successful applicant is required to be actively
involved in the teaching tasks of the department, which include, in
particular, courses for first and second year students in
mathematics and computer science.

The designated salary for the position is based on the German
university pay scale or equivalent. Goethe University is an equal
opportunity employer, committed to diversity and inclusion. In
particular, we are welcoming applications by qualified women and
people with a migrant background. At Goethe University, a special
emphasis is placed on creating and sustaining a family-friendly work
and research environment. Where applicants are otherwise equally
qualified, preference is given to candidates with disabilities or
equivalent. The same applies to women in fields in which they are
under-represented. For further information regarding the general
conditions for professorship appointments, please see:
www.vakante-professuren.uni-frankfurt.de

Researchers with an excellent international record in research and
teaching are invited to submit their application in English or
German including curriculum vitae (with scientific and professional
experience), a summary of teaching and research projects on no more
than five pages, research grants and teaching evaluations as well
as certificates and documents as a single PDF-file until 16.01.2022
to the Dean of the Department of Computer Science and Mathematics,
e-mail: bewerbung@fb12.uni-frankfurt.de.
**********************************************************
*
* 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/
*
**********************************************************

[DMANET] Registration Open for EURO PhD School “Data Driven Decision Making and Optimization”

!!!Registration Open!!!

The EURO PhD School "Data Driven Decision Making and Optimization", IMUS-Mathematical Institute of the University of Seville, Spain, June 13-22, 2022, https://congreso.us.es/epsdata/.

The EURO PhD School (EPS) will be focused on giving participants advanced training on the use of Data Science to aid Data Driven Decision Making. There will be two main components in this EPS. First, methodological training on the role of Mathematical Optimization in Data Science will be given in the format of lectures and computer workshops. The lectures will highlight the mathematical modelling and numerical optimization behind data analysis and data visualization tools. The computer workshops will put this knowledge in action. Second, applications of the acquired knowledge to the modeling of specific industrial problems will be presented by professionals from industry and worked out by the PhD students. Mathematical models and numerical solution approaches will be developed and communicated, following a collaborative approach, in which the PhD students will work in small groups under the guidance of the instructors.

To apply to the EURO PhD School on Data Driven Decision Making and Optimization, https://congreso.us.es/epsdata/, the candidates should be from a EURO member society country or studying in a EURO member society country. Preference will be given to applicants who have not previously received support from EURO for other PhD schools.

PhD students need to apply to be admitted to the EURO PhD School. The candidates will be required to have basic knowledge of Mathematical Optimization, Operations Research or Statistical Data Analysis. Applications should be submitted via email to mailto:eps2022@cbs.dk, with the subject "Application to EURO PhD School in Seville". For the application the following documents are needed:

• Curriculum Vitae from the applicant
• A letter of motivation from the applicant to attend EURO PhD School
• Recommendation letter from the PhD supervisor

Those applicants admitted to the EURO PhD School will be automatically considered for a scholarship to partially cover the fees of the EURO PhD School. The deadline for applications is February 15, 2022. The applications will be reviewed by the scientific committee. The committee will consider (amongst other criteria): the excellence of the applicants, the area they are working in, and the benefit to the PhD student of attending the EURO PhD School. The applicants will be notified by March 1, 2022.

The attendance of the EURO PhD School implies the payment of a fee covering: (i) accommodation, (ii) meals, and (iii) social activities. There will be 20 scholarships to partially cover the fees.
• The reduced fee (with a scholarship) is €200.
• The full fee (without a scholarship) is €500.

Important dates:
February 15, 2022 Deadline for applications
March 1, 2022 Notification of acceptance decision
June 13-22, 2022 EURO PhD School on Data Driven Decision Making and Optimization

The organizers:
Emilio Carrizosa
Professor in Statistics and Operations Research
President of math-in
IMUS-Instituto de Matemáticas de la Universidad de Sevilla, University of Seville, Spain

Dolores Romero Morales
Professor in Operations Research
Coordinator & Scientific Leader of the H2020 MSCA NeEDS project, http://www.riseneeds.eu, @needs_project
Copenhagen Business School, Denmark

**********************************************************
*
* 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/
*
**********************************************************

[DMANET] Postdoctoral Fellowship in Packing Problems

Postdoctoral Fellowship in Packing Problems

We are seeking candidates for a 1-year post-doctoral fellowship
position to work at the Institute of Computing, University of
Campinas, Unicamp, Campinas, SP, Brazil. This fellowship is part of the
project entitled ``Investigation of hard problems from the
algorithmic and structural standpoints'', funded by the São Paulo
Research Foundation (Fapesp).

Goals.
Development of approximation algorithms and exact solution methods for
packing problems, mainly for two- and three-dimensional versions.
Obtain new or better approximation factors for variants or improved
models and algorithms for packing problems.

Specifications.
The candidate must have a Ph.D. in Computer Science, Operations
Research, Applied Mathematics, or in a related field. The candidate
must have finished the Ph.D. less than seven years before the
beginning of the PD fellowship. The candidate should demonstrate a
solid background in the design and analysis of algorithms,
approximation algorithms, integer programming, heuristics, and
meta-heuristics. The candidate is expected to interact with other
members of the project, including master and Ph.D. students and
professors.

Fellowship:
The post-doctoral fellowship includes a monthly stipend of R$ 7.373,10,
access to the healthcare system of Unicamp, and
research contingency funds (15% of the annual value of the fellowship,
each year). The research activities are expected to start on February 01,
2022.
For more details, check out Fapesp's webpage http://www.fapesp.br/.

How to Apply:
The candidate must send by email, until January 15, 2022, the
following documents:

* Curriculum vitae with a list of publications, and previous experience.
* A motivation letter for the application.
* Contact of an earlier supervisor that can give a recommendation.

All documents must be sent by email to Flavio K. Miyazawa at
fkm@ic.unicamp.br.

--
Flavio Keidi Miyazawa
Institute of Computing -- UNICAMP
Phone: +55.19.3521-5882
fkm@ic.unicamp.br
www.ic.unicamp.br/~fkm

**********************************************************
*
* 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/
*
**********************************************************

[DMANET] ISAIM-2022: Call for Participation

CALL FOR PARTICIPATION

Seventeenth International Symposium on
ARTIFICIAL INTELLIGENCE and MATHEMATICS
ISAIM 2022
http://isaim2022.cs.ou.edu/
January 3-5, 2022
Online via Zoom (Fort Lauderdale, Florida)
Registration is free and required in advance
Zoom links will be sent by email several days before the symposium

The International Symposium on Artificial Intelligence and Mathematics (ISAIM), is a biennial meeting that fosters interactions between mathematics, theoretical computer science, and artificial intelligence. This will be the seventeenth Symposium in the series, sponsored by Florida Atlantic University and the Annals of Mathematics and Artificial Intelligence.

Due to the pandemic the three-day Symposium will take place online. ISAIM-2022 will feature invited speakers, special topic sessions, and a special event: an interview of Judea Pearl by Stephen Wolfram. Registration is free but you need to register in advance so that you can get the Zoom links in a timely manner.

KEYNOTE SPEAKERS:

o Noa Agmon (Bar-Ilan University)

o Cynthia Dwork (Harvard University)

o Jerome Lang (LAMSADE, CNRS, Universite Paris-Dauphine, PSL)

o Arun Ross (Michigan State University)

o Ohad Shamir (Weizmann Institute of Science)

o Noam Slonim (IBM Research AI)

o Noga Zaslavsky (MIT)

SPECIAL EVENT:

o Judea Pearl 85th Birthday Celebration
-Interview of Judea Pearl by Stephen Wolfram

SPECIAL TOPIC INVITED SESSIONS:

o In Memory of Naftali Tishby
-Organized by Martin Golumbic (University of Haifa)

o Boolean and pseudo-Boolean Functions
-Organized by Endre Boros (Rutgers University) and Yves Crama (University of Liege)

o Coalition Formation Games
-Organized by Judy Goldsmith (University of Kentucky) and Joerg Rothe (Heinrich-Heine-Universitat Dusseldorf)

o Combinatorial and Geometric Problems in Imaging Sciences
-Organized by Valentin Brimkov (Buffalo State College)

o Formalization in Mathematics
-Organized by Gonzalo A. Aranda-Corral (Universidad de Sevilla) and Francisco Jesus Martin Mateos (Universidad de Sevilla)

o Sequencing, sequential decision making and scheduling
-Organized by Lisa Hellerstein (New York University) and Thomas Lidbetter (Rutgers University)

o Uncertain Reasoning
-Organized by Alessandro Antonucci (Istituto Dalle Molle di Studi sull'Intelligenza Artificiale - IDSIA), Salem Benferhat (University of Artois), and Kamal Premaratne (University of Miami)

ORGANIZERS:

o General Chair: Martin Charles Golumbic, University of Haifa
o Conference Chair: Frederick Hoffman, Florida Atlantic University
o Publications & Publicity Chair: Dimitrios I. Diochnos, University of Oklahoma

REGISTRATION:
o Registration is free and required in advance
-Zoom links will be sent by email several days before the symposium
-Visit https://isaim2022.cs.ou.edu/registration.html

Send inquiries and requests to <isaim2022 AT cs.ou.edu>.
Visit http://isaim2022.cs.ou.edu/.
Join isaim@googlegroups.com to receive announcements related to ISAIM.

**********************************************************
*
* 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/
*
**********************************************************

[DMANET] IBM 2022-23 Herman Goldstine Memorial Postdoctoral Fellowship, final announcement

The Mathematical Sciences department of IBM Research invites
applications for its 2022–2023 Herman Goldstine Memorial Postdoctoral
Fellowship for research in the mathematical and computer sciences. The
department provides an atmosphere in which basic research is combined
with work on practical applications. Areas of interest include
various branches of computer science and operations research.

For full consideration, please apply by December 31, 2021. More
information available at https://research.ibm.com/goldstine/

**********************************************************
*
* 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/
*
**********************************************************

[DMANET] Second announcement and Call for papers for the 10th IFAC MIM 2022 conference in Nantes, France, June 22 to 24, 2022

Dear colleagues:

We invite you to submit proposals of invited sessions, invited and
regular papers for the 10th IFAC triennial conference on Manufacturing
Modelling, Management and Control, MIM 2022

                        June 22 - 24, 2022, Nantes, France -
www.mim2022.com

One of the worlwide largest conferences matching industrial and
manufacturing engineering, supply chain and operations management,
computer science, robotics and automation, artificial intelligence,
decision science and operations research.

<https://hub.imt-atlantique.fr/mim2022/>

The submission website
is:https://ifac.papercept.net/conferences/scripts/start.pl

Invited session organizers should submit a short abstract that
summarizes the aim and content of the invited session, a code will be
assigned to the session.  Potential authors are invited to submit papers
by using the code.

If at least 5 papers are accepted, the session is included in the
conference program as an invited session.

If an invited session is not accepted, accepted papers submitted to this
session will be included in regular sessions.

If you wish to organize an entire Track (at least 3 sessions), invited
sessions which will compose the track must be submitted independently,
but in addition an abstract of the Track should also be submitted and
mention the titles of sessions.

The tentative deadlines for IFAC MIM 2022:

* *10 December 2021:* Submission of invited session proposals
* 25 December 2021 : Submission of draft papers for regular and
invited sessions (6 pages in IFAC format)
* 15 February 2022: Notification to authors/ Start of registration
* 15 March 2022: Submission of final camera ready versions of accepted
papers
* 30 April 2022: Early registration rates expire

*The conference is dedicated to the 60th volume anniversary of the
International Journal of Production Research**(IJPR).*

/The proceedings of IFAC MIM 2022 will be published in Open Access by
Elsevier in IFAC-PapersOnLine (see
https://www.journals.elsevier.com/ifac-papersonline) which is indexed
in  Scopus and Web of Science.
/

The session chairs can propose best presentations for Special Issues in
ANOR, IJPR, FSM, and IJISM (the list of journals which will publish
special issues is regularly completed, see the web site of the conference).

Sincerely yours,

Prof. Dr. Alexandre Dolgui
General chair of MIM 2022, Vice-chair of IFAC TC 5.2 (former chair
2011-2017)

Prof. Dr. Dmitry Ivanov
IPC chair of MIM 2022, Chair of IFAC TC 5.2

Prof. Dr. David Lemoine
NOC chair of MIM 2022

PS: The previous edition of the conference was in Berlin in 2019 with
740 attendees:https://blog.hwr-berlin.de/mim2019/

--
____________________________________________________________________________

Alexandre Dolgui, Dr.habil., Ph.D., IISE Fellow,
Professor and Head

Automation, Production and Computer Sciences Dept.
IMT Atlantique, LS2N-CNRS
La Chantrerie, 4, rue Alfred Kastler - B.P. 20722
F-44307 NANTES Cedex 3, France
E-mails:alexandre.dolgui@imt-atlantique.fr
URL:www.researchgate.net/profile/Alexandre_Dolgui

Editor-in-Chief
International Journal of Production Research
https://www.tandfonline.com/toc/tprs20/current

Last Book: Scheduling in industry 4.0 and cloud manufacturing
https://www.springer.com/gp/book/9783030431761#aboutAuthors

Invite you to celebrate the 60th Volume Anniversary of IJPR at
10th IFAC MIM conference, June 22 to 24, 2022, Nantes, France
_____________________________________________________________________________

**********************************************************
*
* 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/
*
**********************************************************

[DMANET] Two-year Research Fellow in Extremal Combinatorics at the University of Birmingham

We welcome applications for a research fellowship in extremal combinatorics to work with Dr Allan Lo and Dr Andrew Treglown on the EPSRC funded project Ramsey theory: an extremal perspective.

This post is available for a period of two years. The starting date is between 1 June 2022 and 1 October 2022 (with some flexibility).

The successful candidate will join a community of researchers in the Combinatorics, Probability and Algorithms group within the School of Mathematics at the University of Birmingham. The group consists of ten permanent staff as well as a large cohort of postgraduate students and postdoctoral researchers and has a proven track-record in mentoring and supporting the development of early-career researchers. The profile and research interests of this group may be found at: http://web.mat.bham.ac.uk/combinatorics/main.html

Applicants should have a PhD in mathematics awarded or submitted at the time of taking up the position, a strong record of research and publications, and familiarity with Combinatorics.

The full job advert and details about how to apply are available here: https://bham.taleo.net/careersection/external/jobdetail.ftl?job=61247

During the application, you will need to upload a cover letter (1 page max), research statement (4 page max), CV + list of publication (summary of at most three publications) and provide a list of three references.
(There is an option to enter them as text, but it may be easier to upload pdf files instead.)

The closing date for applications is 13 February 2022.

Informal enquires should be directed to Dr Allan Lo and Dr Andrew Treglown, emails: s.a.lo@bham.ac.uk<mailto:s.a.lo@bham.ac.uk> and a.c.treglown@bham.ac.uk<mailto:a.c.treglown@bham.ac.uk>.

**********************************************************
*
* 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/
*
**********************************************************