Friday, January 17, 2020

[DMANET] PhD Positions in Theoretical Computer Science at ETH Zurich

*PhD Positions in Theoretical Computer Science*
The research group of Prof. R. Kyng at the Institute of Theoretical Computer Science at ETH Zurich is looking for new PhD students starting in fall 2020. The start date is flexible and starting sooner is possible. Candidates will be screened continuously until the positions have been filled. We are located in the Department of Computer Science at ETH Zurich.

Click here to read more and apply: https://www.jobs.ethz.ch/job/view/JOPG_ethz_kooELkuLa1i3l0jdEZ
Group website: http://rasmuskyng.com/

*Job Description*
Our research is focused on answering foundational questions in fast algorithms, optimization, and fine-grained complexity theory. Modern algorithms often combine optimization and continuous methods with data structures and combinatorial techniques, and our research attempts to push the boundaries of this paradigm. We also connect theory to applied work by developing and implementing provably correct algorithms that perform well in practice. Our group is small and you will work closely with an excellent team tackling very challenging questions, while also having the independence and freedom to develop your own research agenda over time. In addition to the strong research environment in the Theory Institute, you will be able to draw on top research groups in machine learning, statistics & data science, and mathematical optimization. The salary and general working conditions are according to ETH standards. Your office is located in the heart of Zurich at the beautiful ETH Zentrum campus with cafés, sports facilities, and much more within a five-minute walk, and the whole city is easily accessible via Zurich's excellent public transport system.


**********************************************************
*
* 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] Swedish Summer School in Computer Science 2020

The 7th annual Swedish Summer School in Computer Science (S3CS 2020)
will take place June 28 to July 4, in the Stockholm archipelago, Sweden.

This year, the two speakers and courses are as follows:

- Ankur Moitra from MIT will teach a course about the classic method of
moments and its many applications, e.g. in machine learning.

- Ola Svensson from EPFL will teach a course about combinatorial
optimization and in particular uses of polyhedral techniques therein.

See more details on the S3CS web page:
https://s3cs.eecs.kth.se/

The application deadline for participating in the summer school is March
6, and the application system will open shortly.

Questions about the summer school can be directed to s3cs-2020@kth.se.

Best,
Per Austrin (on behalf of the S3CS organizers)
**********************************************************
*
* 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] Workshop on prediction and optimisation

2nd Call for papers:
The 2020 STOR-i Workshop on Prediction + Optimization (POP 2020) Lancaster, UK, April 2-3 2020.
https://wp.lancs.ac.uk/stori-pop-2020/

The aim of this workshop is to provide a platform for exchange of ideas, raise awareness of recent developments, and stimulate discussion at the interface of prediction and optimisation.
Confirmed Plenary Speakers:
Dick den Hertog (Tilburg University, Netherlands)
Ruud Teunter (University of Groningen)
Dolores Romero Morales (Copenhagen Business School, Denmark)

Important dates
. Abstract submission deadline: 10th of February 2020
. Registration deadline: 28th of February 2020
. Workshop: 2nd and 3rd of April 2020

On behalf of the Organizing Committee:
Trivikram Dokka
Ahmed Kheiri
Rebecca Killick
Adam Letchford
Ivan Svetunkov.

**********************************************************
*
* 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] Evolutionary Multi-objective Optimization (EMO) @ IFORS 2020 (Deadline: January 31)

Dear colleague,

- Dates: June 21-26 (Sun-Fri), 2020
- Location: Seoul, Korea

- Abstract submission closes: January 31, 2020
- Submit an abstract: https://www.euro-online.org/conf/ifors2020/


You are kindly invited to submit an abstract to the stream "Evolutionary Multi-objective Optimization (EMO)" at the 22nd Conference of the International Federation of Operational Research Societies (IFORS), Seoul, Korea (http://www.ifors2020.kr/).

We welcome contributions within the scope of EMO including:
Applications of EMO to continuous, combinatorial or mixed-integer problems
Many-objective optimization
Hybridization with exact methods
Multi-objective Local search and other multi-objective metaheuristics, such as Ant Colony Optimization, Particle Swarm Optimization, Estimation of Distribution Algorithms, etc.
Preference handling and MCDM techniques in EMO and interactive approaches
Constraint handling techniques
Parallel EMO
Performance assessment and benchmarking
Automatic algorithm selection, configuration and design
Data-driven and Bayesian optimization and other applications of evolutionary machine learning
Real-world applications

If you intend to participate and give a talk, please upload an abstract of maximum 1500 characters to the IFORS 2020 submission platform (https://www.euro-online.org/conf/ifors2020/), using one of the Session Codes:

e52d90f3 - "Evolutionary Multi-objective Optimization (EMO) 1"

383397e0 - "Evolutionary Multi-objective Optimization (EMO) 2"

The abstract submission deadline is January 17, 2020, so all abstracts of your session should be in the Abstract Submission System before that date.

IMPORTANT DATES:
Abstract Submission Deadline: January 31, 2020
Abstracts Accepted/Rejected Deadline: February 14, 2020
Early-bird Registration Deadline: February 28, 2020
Speakers Registration Deadline: March 1, 2020

Also, if you are interested in organising a special session, please contact us (contact information below) with a tentative title and description of your proposal. Once accepted, we will include your session in the electronic Abstract Submission System and you can invite speakers to your session conveniently (a session can naturally have more than one organizer in which case you'll just have to decide who will chair the session).

If you have any question, please do not hesitate to get in touch.

Happy new year!

Stream Organizers:

Dr Richard Allmendinger <richard.allmendinger@manchester.ac.uk>
https://personalpages.manchester.ac.uk/staff/Richard.Allmendinger/

Dr Manuel López-Ibáñez <manuel.lopez-ibanez@manchester.ac.uk>
http://lopez-ibanez.eu

Alliance Manchester Business School
The University of Manchester, 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/
*
**********************************************************

[DMANET] “OR in Water and Hydro Energy Management” --- Stream at IFORS 2020, Seoul, Korea

+++ Abstract Submission Deadline: 1 day left +++

You are kindly invited to the Stream " OR in Water and Hydro Energy Management " at the 22nd Conference of the International Federation of Operational Research Societies ( IFORS 2020 ), Seoul, Korea ( [ http://www.ifors2020.kr/ | http://www.ifors2020.kr/ ] ).


Contributions are welcome related to all OR aspects of Water and Hydro Energy Management . In the past, this stream hosted talks of high industrial and environmental impact; the sessions were prosperous and cheerful.

If you intend to participate, please upload an abstract of maximum 1500 characters, including spaces, to the EURO Conference submission platform ( [ https://www.euro-online.org/conf/ifors2020/ | https://www.euro-online.org/conf/ifors2020/ ] ), using one of the Session Codes :


1b9b7a48 - "OR in Water and Hydro Energy Management 1"

e82987d5 - "OR in Water and Hydro Energy Management 2"

cd82e48f - "OR in Water and Hydro Energy Management 3"

If you have any question, please do not hesitate to get in touch.


gerhard-wilhelm.weber@put.poznan.pl


**********************************************************
*
* 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] INFORMS Telecommunications & Network Analytics Conference 2020 - Deadlines extended

*Deadlines extended*

Dear colleagues,

We would like to invite you to the INFORMS Telecommunications and
Network Analytics Conference (TNAC), which will take place at Zuse
Institute Berlin (ZIB), on March 29 - April 1, 2020 in Berlin, Germany
(http://informs_tnac2020.zib.de/).

INFORMS TNAC 2020 (previously INFORMS Telecommunications Conference) is
the 15th of bi-annual conferences held by the INFORMS Telecommunications
and Network Analytics Section. The conference is going to be focused on
the theory and application of operations research and management science
to problems in telecommunications and network analytics, with particular
emphasis on new and emerging technologies. Additionally, the conference
is going to provide a platform for academics and industry experts
working in telecommunications and network analytics to exchange ideas
and initiate new collaborations, as in previous conferences.

Submissions from the interested researchers are welcome for an organized
session with 3-4 presentations, a tutorial session or a single
presentation. The topics of interest include (but are not limited to):

 * Telecommunications modeling, policy and technology;
 * Data mining and big data applications in telecommunications;
 * Machine learning and artificial intelligence in network analytics;
 * Network economics;
 * Network design;
 * Traffic routing;
 * Network optimization;
 * Network algorithms and metaheuristics;
 * Sensor networks;
 * Wireless and broadband networks;
 * Vehicle and mobile computing;
 * Cloud computing and fog computing;
 * Semantic networks;
 * Network survivability and reliability;
 * Information security and privacy;
 * Game theory applications;
 * Internet and multimedia;
 * Quality of service.

The abstract submission system is available online at
https://easychair.org/conferences/?conf=informstnac2020. Proposals for
organized sessions or tutorials can be directly submitted to
*informs_tnac2020@zib.de* <mailto:informs_tnac2020@zib.de>.

Registration is now *OPEN* at:
http://informs_tnac2020.zib.de/registration.html


*Important dates*

Abstract Submission Deadline - February 3, 2020.
Acceptance Notification for Presentations - February 17, 2020.
End of Early Bird Registration - February 24, 2020.

*Keynote speakers*

Prof. Bernard Fortz - Université Libre de Bruxelles
Prof. Bernard Gendron - Université de Montréal / Interuniversity
Research Centre on Enterprise Networks, Logistics and Transportation
(CIRRELT)
Dr. Bo Bai  - Huawei Technologies Co., Ltd., Hong Kong

A special issue of the international journal *Networks* (ISSN:1097-0037)
on "Telecommunications and Network Analytics" will follow the conference.

We are looking forward to your contributions and to greeting you in
Berlin in 2020!

The Organization Committee:

Thorsten Koch, Conference Chair– Zuse Institute Berlin
Haldun Süral – Middle East Technical University
Christine Tawfik – Zuse Institute Berlin
Inci Yüksel-Ergün – Zuse Institute Berlin


**********************************************************
*
* 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] SDN-NFV2020 CFP:The Fourth International workshop on Software Defined Networks and Network Function Virtualization , Paris, France. April 20-23, 2020

[Apologies if you got multiple copies of this invitation]

The Fourth International workshop on Software Defined Networks and Network
Function Virtualization (SDN-NFV 2020)
<http://emergingtechnet.org/SDN-NFV2020/>

in conjunction with

The Seventh International Conference on Software Defined Systems (SDS-2020)
<http://emergingtechnet.org/SDS2020/>

Paris, France. April 20-23, 2020

(Technically Co-Sponsored by IEEE France Section)

*SDN-NFV 2020 CFP*

The emerging networking techniques such as Software Defined Network (SDN)
and Network Function Virtualization (NFV) are promising a complete paradigm
shift in how we manage our future networks. With their enormous benefits
which include reducing the operational cost, better resources utilization
and easier management requirements, the adoption of such technologies is
gaining momentum. Supported by a well-defined basis such as network
virtualization and the decoupling of the data and control planes, the
integration of SDN and NFV with current systems might be a straightforward
process. However, this might incur many challenges which require deep
analysis to propose creative solutions. In the (SDN-NFV 2020) workshop, we
are aiming to invite researchers from both the academia and the industry to
present their state-of-the-art research efforts and findings and to open
the doors for discussion about how to contribute of the advancement of this
important research field.

The Fourth International workshop on Software Defined Network and Network
Function Virtualization (SDN-NFV) will be a forum for scientists,
researchers, students, and practitioners to present their latest research
results, ideas, developments, and applications in the areas of SDN, NFV,
5G, Internet of Things (IoT) and Edge Computing. We are mainly interested
in receiving state of the art work on different aspect of SDN and NFV
management system, security and privacy, cloud computing and big data
supported SDN and NFV, to mention but few. The topics of interest of the
workshop include, but are not limited to:

* Software Defined Network (SDN) Architectures and Design

* Network Function Virtualization (NFV) Architectures and Design

* SDN-NFV Integration

* SDN-NFV Orchestration

* SDN-NFV Based Control plane design

* SDN-NFV Based Data plane design

* SDN-NFV Performance Management

* SDN-NFV support for Cloud based DataCenter

* SDN-NFV support for 5G Networks

* SDN-NFV support for Internet of Things (IoT)

* SDN-NFV support for Big Data Computing

* SDN-NFV support for large scale storage system

* Hardware system design for SDN-NFV

* SDN-NFV Security management

* Radio Access Network virtualization

* SDN-NFV in access networks

* Edge and Fog Computing

* Cloud Computing

* Case studies



*Submission*

Papers selected for presentation will appear in the SDN-NFV and SDS
Proceedings, which will be submitted to IEEE Xplore for inclusion. Papers
must be 6 pages max in IEEE format, 10pt font using the IEEE 8.5" x 11"
two-column format, single space, A4 format. All papers should be in PDF
format, and submitted electronically at Paper Submission Link. A full paper
must not exceed the stated length (including all figures, tables and
references).

Submitted papers must present original unpublished research that is not
currently under review for any other conference or journal. Papers not
following these guidelines may be rejected without review. Also submissions
received after the due date, exceeding length limit, or not appropriately
structured may also not be considered. Authors may contact the Program
Chair for further information or clarification.

*Important Dates:*

Submission Date: 1st February, 2020 (Extended)

Notification to Authors: 28th February, 2020

Camera Ready Submission: 10th March, 2020



Please send any inquiry on SDN-NFV 2020 to the Emerging Tech. Network Team
at: emergingtechnetwork@gmail.com

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

Thursday, January 16, 2020

[DMANET] 2020 MIP Workshop - First Announcement, Poster Submission and Call for Registration

The 2020 MIP Workshop feat. DANniversary will be held May 18-21, 2020 at
DIMACS, Rutgers University. The 2020 edition will be the seventeenth in the
MIP series, and it will be opened by DANniversary, a special conference in
celebration of Daniel Bienstock's 60th birthday.

MIP is a single-track workshop highlighting the latest trends in integer
programming and discrete optimization, with invited speakers covering
topics of interest to the community, including theory, computational
issues, and applications. As in previous years, the workshop will include a
poster session reserved to students and an award for the best poster.

The website of MIP 2020 can be found at
https://sites.google.com/view/mipworkshop2020/home?authuser=0


Call for Student Poster Submissions

We invite abstract submissions for MIP 2020. The student poster session
will take place during the reception of the workshop. Students can submit
an abstract of their poster at
https://virginiatech.qualtrics.com/jfe/form/SV_8IZs72cIz7E9Epf.

The abstract format is: a PDF file, one letter-size page maximum, one-inch
margins, 11-point font, single-space.

Only students may submit poster abstracts. The program committee will
select poster competition finalists, who as in years past will also be
eligible for travel support funds (estimated at $500 per student).
Submitting students not selected as competition finalists may still present
their poster (space permitting), but only finalists are eligible for the
competition and for travel support.

The deadline for poster submissions is February 1, and the committee will
communicate decisions to submitting students by March 1. Please contact
mip2020Posters@vt.edu if you have any questions.

Call for Registration

Registration is now open:
https://sites.google.com/view/mipworkshop2020/registration?authuser=0

MIP 2020 Confirmed Speakers

* Amitabh Basu (Johns Hopkins University)

* Daniel Bienstock (Columbia University)

* Karthekeyan Chandrasekaran (UIUC)

* Sanjeeb Dash (IBM Research)

* Jesús De Loera (UC Davis)

* Martina Fischetti (Vattenfall)

* Ambros Gleixner (ZIB)

* Jamie Haddock (UCLA)

* Gregor Hendel (ZIB)

* Christopher Hojny (TU Darmstadt)

* Aleksandr Kazachkov (Polytechnique Montréal)

* Elias Khalil (University of Toronto)

* Fatma Kilinç-Karzan (CMU)

* Jon Lee (University of Michigan)

* Jannik Matuschke (KU Leuven)

* Andrea Qualizza (Amazon)

* Thiago Serra (Bucknell University)

* Siqian Shen (University of Michigan)

* Dan Steffy (Oakland University)

* Noriyoshi Sukegawa (Tokyo University of Science)

* Jose Verschae (O'Higgins University)

* Boshi Yang (Clemson University)

DANniversary Confirmed Speakers

* Chen Chen (Ohio State University)

* Misha Chertkov (University of Arizona)

* Jonathan Eckstein (Rutgers University)

* Thorsten Koch (ZIB)

* Andrea Lodi (Polytechnique Montréal)

* Gonzalo Munoz (O'Higgins University)

* Iraj Saniee (Nokia Bell Labs)

* Willem Van Hoeve (CMU)

* Mark Zuckerberg (University of Melbourne)

MIP 2020 Program Committee

* Timo Berthold (FICO & Zuse Institute Berlin)

* Yuri Faenza (Columbia University)

* Robert Hildebrand (Virginia Tech)

* Carla Michini, co-chair (University of Wisconsin-Madison)

* Yuan Zhou, co-chair (University of Kentucky)

DANniversary Program Committee

* Jeff Linderoth (University of Wisconsin-Madison)

* Alper Atamtürk (UC Berkeley)

* Gabor Pataki (University of North Carolina)

* Oktay Günlük (IBM Research)

Local Organizing Committee

* Tami Carpenter (DIMACS, Rutgers 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] 3 PhD positions in Algorithms at The University of Sydney

We are advertising three 3-year PhD scholarships in algorithms at
The University of Sydney, Australia.

The successful applicant will conduct research with Joachim Gudmundsson,
William Umboh, and André van Renssen in the Sydney Algorithms and
Computing Theory (SACT) group.

The specific topic will depend on the skills and interests of the student and
could include for example computational geometry, network design, routing,
trajectory analysis, approximation algorithms, and online algorithms.

The Full Scholarship will provide tuition fees and annual stipend
allowance for up to three years, subject to satisfactory academic performance.

The recipient may apply for an extension of up to 6 months.

For more details about the positions and on how to apply:
https://sydney.edu.au/scholarships/b/postgraduate-research-scholarship-in-algorithms.html

Application date: 27 February 2020 (Sydney time).

Please forward to anyone who might be interested.

If you have any questions, you are welcome to mail us directly
(joachim.gudmundsson@sydney.edu.au<mailto:joachim.gudmundsson@sydney.edu.au>).
**********************************************************
*
* 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] Several positions in Computer Science, Math/Optimization, Stat at UBC Okanagan

The faculty of Arts and Sciences at the University of British Columbia, Okanagan campus has 4 positions in Computer Science, Data Science, Mathematics, and Math/Statistics.

The specific profiles are: data science (instructor), mathematics (assistant professor; optimization), computer science (assistant professor; cloud computing, machine learning, big data and data analytics, cyber security, networking and Internet of Things, or software engineering), mathematics/statistics (instructor).

See https://webapps.hr.ubc.ca/hrjobs/jobpostings?facultydept=OKBR
for the list of positions and details including how to apply.

P.S. The website works best with Firefox but may have issue with Chrome.
--
Yves Lucet, PhD
Professor, Computer Science
The University of British Columbia, Okanagan
Phone 250.807.9505 http://people.ok.ubc.ca/ylucet



**********************************************************
*
* 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] [cfp] Special Issue on Entropy in Metaheuristics and Bioinspired Algorithms, MDPI

Special Issue on Entropy in Metaheuristics and Bioinspired Algorithms
Journal of Entropy (ISSN 1099-4300). IF = 2.419 (JCR 2018)
DEADLINE 30 September 2020

Dear Colleagues,
Metaheuristics and bioinspired algorithms are used in different fields of
science and technology. They are important optimization tools that commonly
are based on populations to explore the solutions to complex problems.
Different methods are also used for the classification of approximation
using different learning rules extracted from nature.

Entropy is a powerful tool that has changed the analysis of information.
The use of entropy has been extended in metaheuristics and bioinspired
algorithms from measuring uncertainty to helping to explore and exploit
search spaces in optimization. Different kinds of entropy are used
depending on what is required. Moreover, in the information era, it is
necessary to use metaheuristics and bioinspired methods to provide accurate
solutions to complex problems. Hybrid algorithms are also important; they
merge skills from different approaches and make decisions based on
different rules to accurately explore the possible solutions.

Since the fields of metaheuristics and bioinspired algorithms are
constantly growing, it is complicated to follow all the branches where they
are combined with entropy. Considering the above, this Special Issue aims
to present the latest advances in metaheuristics and bioinspired algorithms
that employ or solve problems where entropy is included. It also seeks to
include literature reviews and surveys on related topics.

Dr. Diego Oliva
Dr. Salvador Miguel Hinojosa Cervantes
Guest Editors

--
Dr. Diego Oliva
diegoliva.com <http://www,diegoliva.com>

**********************************************************
*
* 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] CFP - SITA 20 Submission -- Extended Deadline : 31 january

*13th International Conference on Intelligent Systems :*

*Theories and Applications*
*26–27 May, 2020, INPT - Rabat, Morocco*

*Extended Deadline : 31 january*

*http://www.sitaconference.org/ <http://www.sitaconference.org/>*

*About the Conference:*

SITA is a conference for the presentation, discussion and dissemination of
the theory and applications of intelligent systems. It is the result of
fruitful cooperation between many universities and institutions since 2001.
This conference brings together leading scientists, researchers and
academics in Intelligent Systems from around the world.

SITA'20 will be hosted by National Institute of Posts et Telecommunications
(INPT). It is the thirteenth in the series of previous editions that have
been held since 2001.

This conference aims at presenting the latest research works dealing with
up-to-date and emerging theories of Intelligent Systems using connectionist
and symbolic approaches (Knowledge Based Systems , Soft Computing, Fuzzy
Logics, Neural Networks, Genetic Algorithms, etc.) together with their
applications in different engineering fields: Computing,
Telecommunications, Networking, Robotics, Manufacturing, Health care, Data
Mining, Big Data, Image, Video and Audio Processing, Pattern Recognition.
Emphasis will be particularly laid on the contribution of these new
theories in solving the complex problems that many scientific and
industrial communities encounter. SITA'20 will include special sessions.

*Submissions:*

Authors are invited to send their original and previously unpublished
papers (6 pages maximum) in English following the template: word or latex.
Accepted papers will appear in the ACM's International Conference
Proceedings Series under ISBN 978-1-4503-7733-1. (Scopus and dblp
indexing). The submission guidelines can be found on the conference website
at www.sitaconference.org


--


*Dr. M.Lahby*

Laboratory of Mathematics and Applications, University Hassan II, Ecole
Normale Supérieure (ENS) Casablanca, Morocco

mlahby@gmail.com
GSM : +212 6 65 29 23 76
In the world of Linux, who needs Windows and Gates

**********************************************************
*
* 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] 2 Optimisation positions at Satalia (remote work possible)

We are currently seeking to extend our Optimisation team with two
optimisation scientists who have experience in Mixed-Integer Programming
and Heuristics, and are comfortable with Java 8 or a similar programming
language. The positions are permanent and involve designing and
implementing solving approaches for large-scale industrial problems.
Ideally, new employees would join Satalia at one of our existing offices in
Vienna, London, Kaunas or Athens, but remote work (also from another
country, ideally within Europe) is possible. We are seeking to fill the
positions as soon as possible.

SATALIA
Satalia is an AI company that provides optimisation and data science
solutions for industrial clients. Satalia has a flat hierarchy and a
trust-based working culture with a strong focus on transparency and
freedom. Satalia supports employees with family/caring obligations, and
allows flexible working hours and flexible/part-time working time.

POSITION DETAILS:
https://hire.withgoogle.com/public/jobs/sataliacom/view/P_AAAAABkAACLM7uHAK3iosG

**********************************************************
*
* 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] Call for Nominations: 2020 Edsger W. Dijkstra Prize in Distributed Computing

The 2020 Edsger W. Dijkstra Prize in Distributed Computing

http://www.podc.org/dijkstra/
http://www.disc-conference.org/wp/dijkstra-prize/

Nomination deadline: March 15, 2020


The Edsger W. Dijkstra Prize in Distributed Computing is named for
Edsger Wybe Dijkstra (1930-2002), a pioneer in the area of
distributed computing. His seminal works on concurrency primitives
(such as semaphores), concurrency problems (such as mutual
exclusion and deadlock), finding shortest paths in graphs,
fault-tolerance, and self-stabilization are important foundations
upon which the field of distributed computing is built.

The prize is given for outstanding papers on the principles of
distributed computing, whose significance and impact on the theory
and/or practice of distributed computing has been evident for at least
a decade. The Prize includes an award of $2000.

The Prize is sponsored jointly by the ACM Symposium on Principles
of Distributed Computing (PODC) and the EATCS Symposium on
Distributed Computing (DISC). This award is presented annually,
with the presentation taking place alternately at ACM PODC and
EATCS DISC. In 2020, it will be presented at PODC. The winners of
the award will share the cash award, and each winning author will
be presented with a plaque. An announcement of each year's prize
recipient(s) will be included in the PODC and DISC proceedings of
that year, describing the paper's lasting contributions.


Nominations and Eligibility:

Nominations by any member of the scientific community are eligible,
as long as the nominated work has had a significant impact on research
areas of interest within the theory of distributed computing
community, and as long as the year of the original publication is
at least ten years prior to the year in which the award is given.

Papers authored or co-authored by members of the Award Committee will
not be eligible for consideration. Members of the Award Committee can
nominate papers. However, they must carefully consider
nominations from within the community. Members of the Award Committee
will be especially sensitive to conflict-of-interests issues if
papers by former students or close colleagues are nominated.
(Members of the Award Committee cannot nominate such papers themselves.)
Self-nominations are not allowed.

The nomination must include a short paragraph (approximately 200 words)
summarizing the contribution of the nominated work. The nomination
may include additional material, for example, support letters, but its
total length should not exceed six pages.

Your nomination must be sent to the chair of the 2020 Award Committee,
Hagit Attiya (hagit@cs.technion.ac.il).
The nomination deadline is March 15, 2020.


Selection Process:

Although the Award Committee is encouraged to consult with the
distributed computing community at large, the Award Committee is
solely responsible for the selection of the winner of the award. The
prize may be shared by more than one paper. All matters relating to
the selection process that are not specified here are left to the
discretion of the Award Committee.

The list of past winners can be found at http://www.podc.org/dijkstra/
and http://www.disc-conference.org/wp/dijkstra-prize/

Award Committee for 2020:
Hagit Attiya, Technion (chair)
Christian Cachin, University of Bern
Rachid Guerraoui, Ecole Polytechnique Fédérale de Lausanne
Nancy Lynch, Massachusetts Institute of Technology
Yoram Moses, Technion
Paul Spirakis, University of Liverpool and University of Patras
Alex Schwarzmann, Augusta University

--
Hagit Attiya
Professor hagit@cs.technion.ac.il
The Harry W. Labov and Charlotte Ullman Labov Academic Chair
Department of Computer Science http://www.cs.technion.ac.il/~hagit
The Technion Tel: +972-4-8294365
Haifa 32000, Israel Fax: +972-4-8293900

**********************************************************
*
* 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] Wi-DroIT 2020 – 2nd International Workshop on Wireless Drones over Internet of Things

Wi-DroIT 2020 – 2nd International Workshop on Wireless Drones over Internet
of Things

Marina Del Rey, Los Angeles, CA, USA
May 25-27, 2020

Link: https://sites.google.com/view/widroit2020

in conjunction with the:
16th International Conference on Distributed Computing in Sensor Systems
(DCOSS 2020)

Workshop papers will get 8 pages in the IEEE proceedings, in the same
volume with the DCOSS papers.

Important Dates
Paper Submission: 15th March 2020
Acceptance Notification: TBD
Camera Ready: 15th April 2020
Early Registration: TBD

Scope
For this workshop, we search for papers that combine design of algorithms,
optimization, and test-bed to develop the theoretical foundations for the
drone systems operating in symbiosis with WSN in IoT applications. The
numerous emergent applications nurtured by IoT may require an
interdisciplinary approach, involving techniques from algorithm foundations
as well as different areas, like robotics, artificial intelligence,
mathematical modeling. Applications in complex domains lead to situations
where multiple optimization objectives should be accounted in the proposed
solutions. Decentralized and distributed, robust and secure algorithms are
searched for drones systems that operate in rapidly-changing, uncertain,
and potentially adversarial environments.

Topics (Not limited to)
Autonomous WSN via Drones
Topology monitoring of WSN with Drones
Build Remote Sensing Networks in emergency context via Drones
Communication architectures and protocols of Drones over IoT
Modeling and analysis of Drone systems over IoT
Theoretical foundations for communication routing beyond line-of-sight of
Drones
Communication and networking aspects of cyber-physical systems
Theoretical foundations for parcel delivery using Drones
Drones/UAVS for monitoring network properties (coverage, connectivity) in
emergency
Drones for detecting or discovering events
Facility location problem and Resource Management for Drone systems
4G-5G networks and UAVs
UAV assisted networks
Drones for environment (crop/forest) monitoring
Constraints and multi-objective optimization problems in UAVs
Localization, navigation, and dynamic path planning of UAVs over IoT
Ground Localization with Drones
Cooperative control of multiple UAVs
UAV secure communication techniques
Optimal UAV deployment strategies
High-accuracy navigation techniques
Real-time surveillance techniques
Performance, scalability, energy, and reliability in Drones' systems
Anomaly detection, network monitoring and forecasting
Trust, security, and privacy
Experimental results, simulators and test beds for drone networks
Cooperative Rendezvous for secure drone to drone communications
Secure communication between the drone and the ground networks

Program Chairs
Wan Du, UC Merced, CA, USA; wdu3@ucmerced.edu
Enrico Natalizio, University of Lorraine/LORIA, France;
enrico.natalizio@loria.fr
Cristina M. Pinotti, University of Perugia, Italy; cristina.pinotti@unipg.it

Submission instructions
Authors are invited to submit original unpublished manuscripts reporting
applied or technical research. Accepted and presented papers will be
published in the same volume with the DCOSS 2020 conference proceedings.
All papers will be reviewed by Technical Program Committee members and
selected papers will be organized for presentation at the workshop.

All submissions will be exclusively electronic with a maximum length of
eight (8) printed pages including title, authors, abstract, figures,
diagrams, references and attachments. Articles must be prepared in English
following the IEEE two-column Manuscript Templates for Conference
Proceedings (available here) and submitted in PDF format only.
Submission link: https://easychair.org/conferences/?conf=widroit2020


--------------------------------
Publicity Chair
Francesco Betti Sorbelli, Missouri S&T University, USA;
francesco.bettisorbelli@mst.edu

**********************************************************
*
* 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] Postdoc position in Algorithms and Optimization at the London School of Economics

Applications are invited for a postdoctoral research fellowship in the Mathematics Department at the London School of Economics and Political Science. The position is funded by the European Research Council (ERC) Starting Grant 'Scaling Methods for Discrete and Continuous Optimization' held by Laszlo Vegh.

The project focuses on problems and methods on the interface between discrete and continuous optimization. A key goal is to further our understanding of strongly polynomial computability, including making progress towards the important open question of finding a strongly polynomial algorithm for linear programming.

Areas of particular interest include: efficient algorithms for linear and convex programming, and the geometry of linear and convex programs; strongly polynomial computability; mean payoff games and tropical linear programming; polynomial-time exact and approximation algorithms for network optimization problems; market equilibrium computation.

Please see a brief summary of the project on the webpage http://personal.lse.ac.uk/veghl/scaleopt.html
The job advertisement is available at the LSE website: https://jobs.lse.ac.uk/Vacancies/W/6186/0/255910/15539/research-officer-in-algorithms-and-optimisation

The initial appointment is for one year with the possibility of an extension. The starting date is flexible. The closing date for applications is 24th January 2020 (23.59 UK time).

If you have any questions, please do not hesitate to send an email to l.vegh@lse.ac.uk<mailto:l.vegh@lse.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/
*
**********************************************************

[DMANET] Release of Data Reduction Algorithms for Maximum Cut

Release of Data Reduction Algorithms for Maximum Cut v1.00
-------------------------------------------------------------------------------------

We are proud to announce the release of our maximum cut data reduction
algorithms. Kernelization is a general theoretical framework for
preprocessing instances of NP-hard problems into (generally smaller)
instances with bounded size, via the repeated application of data
reduction rules.  We engineered a new suite of efficient data reduction
rules that subsume most of the previously published rules, and
demonstrate their significant impact on benchmark data sets, including
synthetic instances, and data sets from the VLSI and image segmentation
application domains. Our experiments reveal that current
state-of-the-art solvers can be sped up by up to multiple orders of
magnitude when combined with our data reduction rules.

The framework is build such that the reduction rules can be easily
combined with any maximum cut solver (such as MQLib, LocalSolver or BiqMac).

* open source implementation / website
http://algo2.iti.kit.edu/schulz/maxcut/
https://github.com/Amtrix/fpt-max-cut

We are glad for any comments and error reports (or even bug fixes) that
you send us.

Damir Ferizovic, Demian Hespe, Sebastian Lamm, Matthias Mnich, Christian
Schulz, Darren Strash
Karlsruhe Institute of Technology (KIT)
Technische Universität Hamburg
University of Vienna
Hamilton College
**********************************************************
*
* 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] computational optimization

Call for Papers

13th International Workshop on Computational Optimization (WCO20)
Sofia, Bulgaria, September 6-9, 2020

organized in the framework of FEDERATED CONFERENCE ON COMPUTER SCIENCE AND
INFORMATION SYSTEMS
FedCSIS - 2020

IEEE CS is a technical co-sponsor of FedCSIS 2020

https://fedcsis.org/2020/wco

===============================

We invite original contributions related to both theoretical and practical
aspects of optimization methods. The list of topics includes, but is not
limited to:

* combinatorial and continuous global optimization
* unconstrained and constrained optimization
* multiobjective and robust optimization
* optimization in dynamic and/or noisy environments
* optimization on graphs
* large-scale optimization, in parallel and distributed computational
environments
* meta-heuristics for optimization, nature-inspired approaches and any
other derivative-free methods
* exact/heuristic hybrid methods, involving natural computing techniques
and other global and local optimization methods
*numerical and heuristic methods for modeling

The applications of interest are included in the list below, but are not
limited to:

* classical operational research problems (knapsack, traveling salesman,
etc)
* computational biology and distance geometry
* data mining and knowledge discovery
* human motion simulations; crowd simulations
* industrial applications
* optimization in statistics, econometrics, finance, physics, chemistry,
biology, medicine, and engineering.
*environment modeling and optimization
===============================

Best paper award

The best WCO18 paper will be awarded during the social dinner of
FedCSIS2020.
The best paper will be selected by WCO19 co-Chairs by taking into
consideration the scores suggested by the reviewers, as well as the quality
of the given oral presentation.

===============================

Submission and Publication

* Authors should submit draft papers in PDF format.
* The total length of a paper should not exceed 10 pages for regular paper
and 4 pages for short papers (IEEE style). IEEE style templates are
available at http://www.fedcsis.org/.
* Papers will be refereed and accepted on the basis of their scientific
merit and relevance to the workshop.
* Accepted and presented papers will be published in the Conference
Proceedings and included in the IEEE Xplore database and submitted for
different indexations (Communication and Position papers will only appear
in the conference proceedings).
* Extended versions of selected papers presented at WCO18 will be published
in edited books of the series "Studies of Computational Intelligence",
Springer.

===============================

Important dates:

Paper submission (sharp / no extensions) : May 15th, 2020
Position paper submission : June 9th, 2020
Author notification : June 30th, 2020
Final paper submission and registration : July 15, 2020
Conference date : September 6-9, 2020

===============================

Organizing Committee

Stefka Fidanova, Bulgarian Academy of Science, Bulgaria
Antonio Mucherino, IRISA, University of Rennes 1, France
Daniela Zaharie, West University of Timisoara, Romania

If you have any question do not hesitate to send an email to :
wco2020@fedcsis.org

===============================

--
Prof. Stefka Fidanova
IICT-BAS
Acad. G. Bonchev str. bl.25A
1113 Sofia Bulgaria
Ph. +359-2-9796642

**********************************************************
*
* 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] Deadline extended: SIGOPT 2020 Conference at TU Dortmund University

Dear colleagues,

We would like to draw your attention to the upcoming SIGOPT conference,

SIGOPT 2020 International Conference on Optimization,

to be held on

March 4-6, 2020, at TU Dortmund University, Germany.

The SIGOPT conference series addresses the full range of theory and
practice in all branches of mathematical optimization, e.g.,

- Linear Programming
- Discrete and Combinatorial Optimization
- Nonlinear Programming
- Mixed-Integer Non-Linear Optimization
- Optimal Control
- Stochastic Programming
- Multiobjective Programming
- Application of Optimization in Real-World Problems
- Optimization on Manifolds
- Robust Optimization
- Convex Optimization
- Conic Optimization
- Machine Learning
- Game Theory and Bilevel Optimization

Young researchers from all areas of optimization are especially
encouraged to participate and to present their work. There will be a
"Work in Progress" session.
The conference will provide a good opportunity for exchanging ideas,
especially across disciplines, and for establishing contacts with
colleagues in a friendly atmosphere.

Plenary Speakers:

- Christian Clason (Universitaet Duisburg-Essen)
- Peter Gritzmann (Technische Universitaet Muenchen)
- Laura Palagi (Sapienza Universita di Roma)
- Sebastian Sager (Otto-von-Guericke-Universitaet Magdeburg)
- Angelika Wiegele (Alpen-Adria Universitaet Klagenfurt)


Important Dates:

- abstract submission: until 31st January 2020

- notification of acceptance: in timely manner after abstract
submission, latest 7th February 2020

We hope to see you soon in Dortmund!

With best regards,

the organizing and the program committee
(Christoph Buchheim, Mirjam Dür, Anja Fischer, Christian Meyer, Peter
Recht, Ralf Werner)

---------------------------------------------------------------
JProf. Dr. Anja Fischer
Faculty of Business and Economics
Management Science
TU Dortmund University
D-44227 Dortmund
Phone: +49 2317553162
Email: sigopt2020.wiwi@tu-dortmund.de
Web page: http://www.wiwi.tu-dortmund.de/sigopt/
--

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

Wednesday, January 15, 2020

[DMANET] [GECCO CFP - Remainder] Call for Papers - GECCO 2020

REMAINDER

*********************************************************************
2020 Genetic and Evolutionary Computation Conference (GECCO 2020)
8-12 July, 2020, Cancun, Mexico. http://gecco-2020.sigevo.org/
*********************************************************************

Important Dates
---------------------------------------------------------------------

* Full papers (traditional category)
* Abstract deadline: January 30, 2020
* Submission of full papers: February 6, 2020
* Poster-only papers:
* Submission of poster-only papers: February 6, 2020
* Conference: July 8-12, 2020

Call for Papers
---------------------------------------------------------------------

The Genetic and Evolutionary Computation Conference (GECCO 2020) will
present the latest high-quality results in genetic and evolutionary
computation. Topics include genetic algorithms, genetic programming,
evolution strategies, evolutionary programming, memetic algorithms,
hyper-heuristics, real-world applications, evolutionary machine
learning, evolvable hardware, artificial life, adaptive behavior, ant
colony optimization, swarm intelligence, biological applications,
evolutionary robotics, coevolution, artificial immune systems, and more.

The full list of tracks is available at:
https://gecco-2020.sigevo.org/index.html/Program+Tracks

The GECCO 2020 Program Committee invites the submission of technical
papers describing your best work in genetic and evolutionary
computation. Full papers of at most 8 pages (excluding references)
should present original work that meets the high-quality standards of
GECCO. Accepted full papers appear in the ACM digital library as part
of the **Main Proceedings** of GECCO. For full papers, a separate
abstract needs to be submitted first by January 30, 2020. Full papers
are due by the non-extensible deadline of February 6, 2020.

Each paper submitted to GECCO will be rigorously evaluated in a
double-blind review process. Evaluation is done on a per-track basis,
ensuring high interest and high expertise of the reviewers. Review
criteria include the significance of the work, technical soundness,
novelty, clarity, writing quality, relevance and, if applicable,
sufficiency of information to permit replication.

Besides full papers, poster-only papers of at most 2 pages may be
submitted. Poster-only papers should present original work that has
not yet reached the maturity and completeness of research results
that are published as full papers at GECCO. The review of
poster-only papers follows the same double-blind process described
above. Accepted poster-only papers will appear in the ACM digital
library as part of the **Companion Proceedings** of GECCO.
Poster-only papers are due by the non-extensible deadline of
February 6, 2020, and no abstract needs to be submitted first.

By submitting a paper, the author(s) agree that, if their paper is
accepted, they will:

* Submit a final, revised, camera-ready version to the publisher on
or before the camera-ready deadline
* Register at least one author to attend the conference
(by April 17, 2020)
* Attend the conference (at least one author)
* Present the accepted paper at the conference

Each paper accepted needs to have at least one author registered. If
an author is presenting more than one paper at the conference, she/he
does not pay any additional registration fees.

More information about paper submission is available at:
https://gecco-2020.sigevo.org/index.html/Call+for+Papers

--
Gregorio Toscano, Cinvestav Tamaulipas, Mexico
Mario Garza-Fabre, Cinvestav Tamaulipas, Mexico
Publicity Chairs

Jose A. Lozano, University of the Basque Country, Spain
Editor-in-Chief

Carlos A. Coello Coello, CINVESTAV-IPN, Mexico
General Chair
--
GECCO is sponsored by the Association for Computing Machinery Special
Interest Group for Genetic and Evolutionary Computation (ACM SIGEVO).
**********************************************************
*
* 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] SDE 2020 CFP: The International Workshop on Software Defined Everything, Paris, France. April 20-23, 2020

[Apologies if you got multiple copies of this invitation]

*The International Workshop on Software Defined Everything (SDE2020)
<http://www.emergingtechnet.org/SDE2020/> *

in conjunction with

The Seventh International Conference on Software Defined Systems (SDS-2020)
<http://emergingtechnet.org/SDS2020/>

Paris, France. April 20-23, 2020

(Technically Co-Sponsored by IEEE France Section)

*SDE 2020 CFP*

Software Defined Infrastructures consists of fully virtualised compute,
networking, storage and other resources are abstracted away from the
underlying physical infrastructure through software, such as Software
Defined Data Centre. This allows policy-based infrastructure provisioning
and enables IT automation. Software-defined infrastructure is not tied to
specific hardware and can operate without or with little human involvement.
This paradigm fully integrated and automated IT functions and resources.
Software Defined Data Centre combines can be a result of a combination of
all software defined technologies, such as SDN, SDStore, SDCompute, SDSec
etc, otherwise called Software Defined Everything. Cloud computing is one
major factor driving the growth of software defined everything.

The International workshop for Software Defined Everything (SDE2020) is
calls for contributors to present and discuss the most recent research
results, innovations, trends, and concerns in the fields the new emerging
opportunity of Software Defined Everything. The topics of the workshop
include but not limited to:

· Trends in SDE, theories, applications and trends

· SDE Markets

· Security in SDE

· Software defined data centre

· Software defined infrastructures

· Software defined IOT/Edge

· Software Defined – Centralized Vs Decentralized infrastructure

· Software-Defined WAN

· Softwarization methodologies for SDE

· SDE on demand

· SDE as a service

· Business models for SDE

· Adaptive Software for SDE

· SDE and Vendor-lock-in

· SDE Business Agility

· Business case for SDE

· SDE and compliance

*Submission*

Papers selected for presentation will appear in the SDE and SDS
Proceedings, which will be submitted to IEEE Xplore for inclusion. Papers
must be 6 pages max in IEEE format, 10pt font using the IEEE 8.5" x 11"
two-column format, single space, A4 format. All papers should be in PDF
format, and submitted electronically at Paper Submission Link. A full paper
must not exceed the stated length (including all figures, tables and
references).

Submitted papers must present original unpublished research that is not
currently under review for any other conference or journal. Papers not
following these guidelines may be rejected without review. In addition,
submissions received after the due date, exceeding length limit, or not
appropriately structured may also not be considered. Authors may contact
the Program Chair for further information or clarification.

*Important Dates:*

Submission Date: 1st February, 2020 (Extended)

Notification to Authors: 28th February, 2020

Camera Ready Submission: 10th March, 2020

Please send any inquiry on SDE2020 to the Emerging Tech. Network Team at:
emergingtechnetwork@gmail.com

**********************************************************
*
* 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] Next Virtual Combinatorics Colloquium on Tuesday -- Matjaz Konvalinka

*Please join us for our next online Virtual Combinatorics Colloquium (VCC)*

*Date: *Tuesday, January 21, 2020 at 2:00 p.m. (14:00) Eastern Standard Time

*Speaker: *Matjaz Konvalinka, University of Ljubljana

*Title:* The first bijective proof of the ASM theorem

*Zoom Link: *https://wpi.zoom.us/j/870427125 Join Meeting ID: 870-427-125

*Abstract: * Alternating sign matrices (ASMs) were introduced by Robbins
and Rumsey in the early 1980s. Together with Mills they conjectured an
enumerative formula for the number of ASMs of size n x n, which was proved
independently by Zeilberger and Kuperberg about 10 years later. In this
talk, I will present the first bijective proof of this result. A crucial
part is played by signed sets and sijections (bijections on signed sets).
This is a joint project with Ilse Fischer.

*Bio:* Matjaž Konvalinka works in enumerative and algebraic combinatorics.
He received his Ph.D. at the Massachusetts Institute of Technology under
Igor Pak, and is now a Professor at the University of Ljubljana, Slovenia.
Together with Roger Behrend and Ilse Fischer, he was the recipient of the
2019 Robbins Prize awarded by the Americal Mathematical Society. He is one
of the Editors-in-Chief of Annals of Combinatorics.

Individuals and viewing party groups from around the world can "attend"
these online talks and interact with the speaker and other attendees
remotely via Zoom. It is very easy--Just click on the link below to join.
If you have not used Zoom before, there may be a very brief download, but
then you will be in the event. Here are quick instructions for joining a
Zoom meeting if you would like more details:
https://support.zoom.us/hc/en-us/articles/201362193-How-Do-I-Join-A-Meeting-

The talk will start at the stated time, but the Zoom invitation will open
30 minutes earlier so that participants may call in early if they wish to
get a sense of how the platform works (how to mute/unmute, share screens,
shared whiteboard, raise hand, chat, etc.).

*Jo*

Jo Ellis-Monaghan

Chair, Department of Mathematics and Statistics (on sabbatical 2019-2020)

Editor-in-Chief, PRIMUS

Saint Michael's College

One Winooski Park

Colchester, VT 05439

office: Jeanmarie 279

website: http://academics.smcvt.edu/jellis-monaghan/

phone: 802 654 2660

fax: 802 654 2960

e-mail: je <jellis-monaghan@smcvt.edu>llismonaghan@gmail.com

**********************************************************
*
* 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] Call for Papers: International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR-23): May 22-27, 2020, Alicante, Spain

LPAR23: LPAR-23: 23RD INTERNATIONAL CONFERENCE ON LOGIC FOR PROGRAMMING, ARTIFICIAL INTELLIGENCE AND REASONING

****************************************************************

The series of International Conferences on Logic for Programming, Artificial Intelligence and Reasoning (LPAR) is a forum where, year after year, some of the most renowned researchers in the areas of logic, automated reasoning, computational logic, programming languages and their applications come to present cutting-edge results, to discuss advances in these fields, and to exchange ideas in a scientifically emerging part of the world.

****************************************************************

The 23rd LPAR will be held will be held in Alicante, Spain, 22-27 May, 2020.

****************************************************************

Submission and publication

****************************************************************

The proceedings will be published by EasyChair Publications, in the EPiC Series in Computing<https://easychair.org/publications/EPiC/Computing>. The volume will be open access and the authors will retain copyright.

****************************************************************

Important Dates

****************************************************************

* Paper submission deadline: February 15, 2020
* Author notifications: April 8, 2020
* Final paper deadline: April 24, 2020
* Conference: May 22-27, 2020

***************************************************************

Program Committee Chairs

****************************************************************

* Elvira Albert,<http://costa.fdi.ucm.es/~elvira/> Complutense University of Madrid
* Laura Kovacs<https://forsyte.at/people/kovacs/>, TU Wien

****************************************************************

Workshop Chair

****************************************************************

* Martin Suda<http://people.ciirc.cvut.cz/~sudamar2/>, Czech Institute of Informatics, Robotics and Cybernetics

****************************************************************

Website

****************************************************************

https://easychair.org/smart-program/LPAR23/index.html






**********************************************************
*
* 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] CTW2020: 18th Cologne-Twente Workshop on Graphs and Combinatorial Optimization - Ischia (Italy) June 15-17, 2020 - 2ND AND LAST EXTENSION FOR STANDARD PAPERS

------------------------------------------------------------------------------
[Please accept our apologies if you receive multiple copies of this Call
for Papers.]
-----------------------------------------------------------------------------


CALL FOR PAPERS - 2ND AND LAST EXTENSION
CTW2020: 18th Cologne-Twente Workshop on Graphs and Combinatorial
Optimization
June 15-17, 2020
Hotel Re Ferdinando
Ischia – Italy


http://ctw2020.iasi.cnr.it
----------------------------------------------------------------------------
SCOPE
The Cologne-Twente Workshop on Graphs and Combinatorial Optimization 2020
welcomes contributions on theory and applications of discrete algorithms,
graphs, operations research with discrete variables, and combinatorial
optimization in the wider sense.

The series of Cologne-Twente Workshops on Graphs and Combinatorial
Optimization started with meetings organized every two years by the
universities of Cologne and Twente. The organizational base was later
expanded by other universities. Since 2003 the workshop is held (almost)
every year.

CTWs are especially intended to let doctoral students and young researchers
present the results of their research activities in a friendly and highly
interactive atmosphere.

PLENARY SPEAKERS:
Dan Bienstock (Columbia University, USA)
Marco Sciandrone (Università di Firenze, Italia)

PAPER SUBMISSION
There will be two types of submissions:
Standard papers (from 8 to 12 pages) that will be selected for publication
in a volume of the AIRO Springer series (a copyright transfer will be
necessary).
Traditional CTW Extended abstracts (up to 4 pages) that will be published
on the workshop webpage (subject to author's approval).
See http://ctw2020.iasi.cnr.it submission page for information.

IMPORTANT DATES
JANUARY 30th, 2020: Submission EXTENDED DEADLINE for Standard papers.
February 15th, 2020: Notification of acceptance for standard papers.
March 1st, 2020: Submission deadline for extended abstracts.
April 15th, 2020: Notification of acceptance for extended abstracts.
May 1st, 2020: Deadline for Early Registration payment.
June 15th, 2020: Beginning of Conference.

CTW2020 PROGRAM COMMITTEE
Ali Fuat Alkaya, Marmara U.
Christoph Buchheim, TU Dortmund
Francesco Carrabs, U. Salerno
Alberto Ceselli, U. Milano
Roberto Cordone, U. Milano
Ekrem Duman, Ozyegin U.
Yuri Faenza, Columbia U.
Bernard Gendron, IRO – U. Montreal & CIRRELT
Claudio Gentile, IASI-CNR
Johann Hurink, U. Twente
Ola Jabali, Politecnico di Milano
Leo Liberti, CNRS & LIX Polytechnique Palaiseau
Frauke Liers, FAU Erlangen-Nuremberg
Bodo Manthey, U. Twente
Gaia Nicosia, U. Roma Tre
Tony Nixon, U. Lancaster
Andrea Pacifici, U. Roma Tor Vergata
Ulrich Pferschy, U. Graz
Stefan Pickl, U. Bundeswehr München
Michael Poss, LIRMM – U. Montpellier & CNRS,
Bert Randerath, U. Koeln
Giovanni Righini, U. Milano
Heiko Roeglin, U. Bonn
Oliver Schaudt, U. Koeln
Rainer Schrader, U. Koeln
Giuseppe Stecca, IASI-CNR
Frank Vallentin, U. Koeln
Paolo Ventura, IASI-CNR
Maria Teresa Vespucci, U. Bergamo
Angelika Wiegele, Alpen-Adria U. Klagenfurt

CTW2020 ORGANIZING COMMITTEE
Fabio Furini, IASI-CNR & Paris-Dauphine U.
Claudio Gentile, IASI-CNR
Leo Liberti, CNRS-LIX
Gaia Nicosia, U. RomaTre
Andrea Pacifici, U. TorVergata Roma
Giovanni Rinaldi, IASI-CNR
Giuseppe Stecca, IASI-CNR
Paolo Ventura, IASI-CNR

--
*http://ctw2020.iasi.cnr.it <http://ctw2020.iasi.cnr.it>*
*18th Cologne-Twente Workshop on Graphs and Combinatorial Optimization*
*Ischia, Italy - June 15-17, 2020*
--
Claudio Gentile
Istituto di Analisi dei Sistemi ed Informatica "Antonio Ruberti" (IASI-CNR)
Via dei Taurini, 19 - I 00185 Roma Italy.
Tel: +39 06 4993 7128 - Fax: +39 06 49937106 - e-mail: gentile@iasi.cnr.it

**********************************************************
*
* 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] PostDoc in Complexity Theory at KTH Stockholm

A postdoc position is open in the Approximability and Proof Complexity
project at KTH Royal Institute of Technology in Stockholm.

The postdoc position is in the area of computational complexity theory,
focusing on questions at the intersection of approximation algorithms
and subexponential algorithms. Examples of topics of particular interest
are the use of linear and semidefinite programming to solve hard
combinatorial problems, or to prove that the problems are beyond the
reach of such methods. Exciting recent developments have identified the
so-called sums of squares hierarchy as a unifying theme for these
questions, and one aim of our research is to build and expand on this
theme. However, we will also freely explore whatever other methods turn
out to be helpful for attacking these and other topics of interest in
algorithms and complexity theory. If so desired, up to 20% teaching can
be included in the position.

Application deadline: January 23.

Link to the position:
https://www.kth.se/en/om/work-at-kth/lediga-jobb/what:job/jobID:308077/where:4/

Questions about the position can be directed to either:
Per Austrin <austrin@kth.se>
Johan Håstad <johanh@kth.se>

**********************************************************
*
* 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] CfP: 12th Multidisciplinary Workshop on Advances in Preference Handling (M-PREF 2020) @ ECAI 2020

======================================================================
CALL FOR PAPERS

12th Multidisciplinary Workshop on
Advances in Preference Handling (M-PREF)
Santiago de Compostela, Spain, June 8, 2020
in conjunction with ECAI 2020.

http://mpref2020.preferencesql.com
======================================================================




======================================================================
DESCRIPTION OF WORKSHOP
======================================================================
Human-centered AI requires that AI systems are able to adapt to
humans, to understand the preferences underlying human choice
behavior, and to take them into account when interacting with humans
or when acting on their behalf. Preference models are needed in
decision-support systems such as web-based recommender systems, in
digital assistants and chatbots, in automated problem solvers such as
configurators, and in autonomous systems such as Mars rovers. Nearly
all areas of artificial intelligence deal with choice situations and
can thus benefit from computational methods for handling preferences
while gaining new capabilities such as explainability and revisability
of choices. Preference handling is also important for machine learning
as preferences may guide learning behavior and be subject of dedicated
learning methods. Moreover, social choice methods are of key
importance in computational domains such as multi-agent
systems. Preferences are studied in many areas of artificial
intelligence such as knowledge representation & reasoning, multi-agent
systems, game theory, computational social choice, constraint
satisfaction, logic programming and non-monotonic reasoning, decision
making, decision-theoretic planning, and beyond. Preferences are
inherently a multi-disciplinary topic, of interest to economists,
computer scientists (including AI, databases, and human-computer
interaction), operations researchers, mathematicians and more.

The workshop will provide a forum for presenting advances in
preference handling and for exchanging experiences between researchers
facing similar questions, but coming from different fields.


======================================================================
TOPICS
======================================================================
The workshop on Advances in Preference Handling addresses all
computational aspects of preference handling. This includes methods
for the elicitation, learning, modeling, representation, aggregation,
and management of preferences as well as methods for reasoning about
preferences. The workshop studies the usage of preferences in
computational tasks from decision making, database querying, web
search, personalized human-computer interaction, personalized
recommender systems, e-commerce, multi-agent systems, game theory,
computational social choice, combinatorial optimization, automated
problem solving, non-monotonic reasoning, planning and robotics,
perception and natural language understanding, and other computational
tasks involving choices. A particular challenge consists in using
preferences for explaining decisions and for counterfactual reasoning
based on hypothetical preference change. Another challenge is to
explore new application areas for preferences such as sustainable
development and digital healthcare systems. The workshop seeks to
improve the overall understanding of and best methodologies for
preferences in order to realize their benefits in the multiplicity of
tasks for which they are used. Another important goal is to provide
cross-fertilization between the numerous fields that work with
preferences.

- Preference handling in artificial intelligence
- Preference handling in database systems
- Preference handling in multiagent systems
- Applications of preferences
- Preference elicitation and learning
- Preference representation and modeling
- Properties and semantics of preferences
- Practical preferences


======================================================================
FORMAT
======================================================================
The program will consist of presentations of peer-reviewed papers,
panel discussions about future challenges, and an invited talk. We
plan to invite an expert from one of the topics mentioned
above. Preference will be given to papers focused on new and emerging
areas as well as papers that are likely to stimulate discussion during
the workshop.


======================================================================
ATTENDANCE
======================================================================
At least one author from each accepted paper must register for the
workshop. All authors as well as researchers interested in the field
are encouraged to participate.


======================================================================
SUBMISSION REQUIREMENTS
======================================================================
Papers must be formatted according to the ECAI Formatting Instructions
and up to 7 pages in length + 1 page for references in PDF format.
Authors can choose between an anonymized or non-anonymized submission.


======================================================================
IMPORTANT DATES
======================================================================

Feb 28, 2020: Workshop paper submission deadline.
April 8, 2020: Notification on workshop paper submissions.
June 8, 2020: M-PREF 2020 Workshop.


======================================================================
SUBMIT TO
======================================================================
https://easychair.org/conferences/?conf=mpref20


======================================================================
WORKSHOP CHAIRS
======================================================================
Markus Endres
Ulrich Junker
Andreas Pfandler


======================================================================
CONTACT EMAIL
======================================================================
mpref20@easychair.org<mailto:mpref20@easychair.org>

======================================================================
WORKSHOP URL
======================================================================
http://mpref2020.preferencesql.com






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

Tuesday, January 14, 2020

[DMANET] ETAPS Test of Time Award 2020, call for nominations

The ETAPS Test of Time Award recognizes outstanding papers published
more than 10 years in the past in one of the constituent conferences
of ETAPS. The Award recognises the impact of excellent research
results that have been published at ETAPS.


Nominations 2020

Nominations for the 2020 ETAPS Test of Time Award are solicited from
the ETAPS community. A nomination should include the title and
publication details of the nominated paper, explain the influence it
has had since publication, and why it merits the award. It should be
phrased in terms that are understandable by the members of the award
committee and suitable for use in the award citation, and should be
endorsed by at least 2 people other than the person submitting the
nomination. Self-nominations are not allowed.

Nominations should be sent by

Monday 2 March 2020

to the chair of the award committee, Don Sannella <dts@inf.ed.ac.uk>.


Award committee

The 2020 award committee consists of Rance Cleaveland, Ugo Dal Lago,
Marieke Huisman, Tiziana Margaria, Don Sannella (chair), Gabriele
Taentzer and Peter Thiemann.
**********************************************************
*
* 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] Computational Geometry: Media Exposition -- First Announcement

Computational Geometry: Media Exposition -- First Announcement
==============================================================

Media, Visualizations, and Geometric Art are sought for the /29th
International Computational Geometry Media Exposition (CG:ME)/, which
will take place as part of Computational Geometry Week 2020,
encompassing the /35th International Symposium on Computational
Geometry/. Submissions showcase creative approaches to illustrate
research and/or support education in computational geometry.

DATES
=====
All deadlines are 23:59 anywhere on earth.

* February 21, 2020Abstract and media portfolio submissions due
* March 8, 2020Notification of acceptance/rejection
* March 30, 2020Final version of abstract and portfolio
* June 23-26, 2020Computational Geometry Week


CONTENT
=======

* The submission should be related to computational geometry, broadly
interpreted, but is otherwise unrestricted: for example, it can
illustrate a (new or existing) concept, technique or algorithm from
computational geometry, it can explain an application of
computational geometry, it can be meant for educational purposes or
for entertainment purposes, and so on.

* The form of media is broad, including algorithm animations,
interactive software and games, scientific artwork, sculptures,
paintings, and virtual reality demonstrations. While videos are
welcome, they are no longer required as in previous years.


SUBMISSION
==========
A submission consists of two parts: a portfolio and a paper.

* Submit a portfolio of the work, such as images, video, link to
interactive apps, etc.  The submission should still be "displayable"
during CGweek, and the authors should specify in their submission
how the piece will be displayed. For example, if it is about a
geometry-inspired sculpture, then one can bring the sculpture
itself, or submit a video about this sculpture, its story and its
connection to computational geometry. Note that if your work is a
video, then the portfolio and the work are in fact identical.

* Submit a paper which details the portfolio and where applicable, the
techniques used in the implementation. The paper should explain the
connection of the submission to computational geometry, broadly
interpreted.

* Acceptance is based on both the submitted portfolio and the
accompanying paper.

Technical Details

* Portfolio submissions are limited to 100 MB. Authors are free to
post higher quality versions on their own web sites, and we will
include links in the electronic proceedings to their version, in
addition to the official version (<100 MB) archived on
http://www.computational-geometry.org
<https://urldefense.com/v3/__http://www.computational-geometry.org/__;!!KGKeukY!nRB4rdQSVgfdOKYJVoMnlcb7DpOmE6vxOeUxAcsWvBKIT4Ps4HHXz2nOXmsqprjLOn7Iog$>

* Videos should be 720p or better, using H.264, where the embedded
audio stream should be AAC of at least 128kBit/s.

* The paper must be formatted according to the guidelines for the
conference proceedings using the LIPIcs format, and not
exceed 100 lines, excluding front matter and references.  The number
of images in the paper should also be kept reasonable. Typesetting
instructions and the .cls style file are available on the CG
website: http://www.computational-geometry.org
<https://urldefense.com/v3/__http://www.computational-geometry.org/__;!!KGKeukY!nRB4rdQSVgfdOKYJVoMnlcb7DpOmE6vxOeUxAcsWvBKIT4Ps4HHXz2nOXmsqprjLOn7Iog$>


EVENT
=====

* The Work will be on display at a gallery during Computational
Geometry Week.

* The authors will have a session devoted to giving a short talk on
their work at the Symposium on Computational Geometry.


COMMITTEE
=========

* Henry Adams, Colorado State University, USA
* Jit Bose, Carleton University, Canada
* Satyan Devadoss (chair), University of San Diego, USA
o email devadoss@sandiego.edu <mailto:devadoss@sandiego.edu> with
any questions
* David Eppstein, University of California, Irvine, USA
* John McCleary, Vassar College, USA
* Marc van Kreveld, Utrecht University, Netherlands
* Yusu Wang, The Ohio State University, USA
* Lori Ziegelmeier, Macalester College, USA


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