Tuesday, November 12, 2019

[DMANET] Three PhD positions in Algorithms at The University of Sydney

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 of $27,082 per annum (indexed to the RTP rate) 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: 3 December 2019 (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/
*
**********************************************************

Monday, November 11, 2019

[DMANET] Teaching Stream – Data and Analytics faculty position at the Department of Mechanical and Industrial Engineering, University of Toronto

Dear colleagues,

The Department of Mechanical & Industrial Engineering at the University of Toronto invites applications for a full-time teaching stream faculty appointment at the rank of Assistant Professor, Teaching Stream, in the general areas of Data Science, Machine Learning, and Big Data Analytics, including the mathematical, statistical, and computational foundations of these disciplines. The appointment will commence on July 1, 2020, or shortly thereafter. Please find the details here <https://utoronto.taleo.net/careersection/10050/jobdetail.ftl?job=1904191&tz=GMT-04:00&tzname>.

Best regards,

--
Merve Bodur, PhD
Assistant Professor, Dean's Spark Professor, Industrial Engineering

Department of Mechanical & Industrial Engineering
Faculty of Applied Science & Engineering | University of Toronto
5 King's College Rd., Toronto, Ontario M5S 3G8
Office: 40 St. George Street, BA8106 Phone: 416 978 4739


**********************************************************
*
* 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] DIMACS postdoctoral associateship

DIMACS, the Center for Discrete Mathematics and Theoretical Computer Science, based at Rutgers University, invites applications for postdoctoral positions associated with the Center.



DIMACS will have four positions available:



a) DIMACS - Institute for Advanced Study (IAS) Postdoc. This is a two-year postdoctoral associateship with the first year (2020-2021) spent at DIMACS, and the second year (2021-2022) spent at IAS in Princeton. There is a requirement to teach one course during the first year. Applicants should be recent PhDs with interest in theoretical computer science and/or discrete mathematics. Research areas include but are not limited to: computational complexity, algorithms, optimization, cryptography, combinatorics, graph theory, and discrete probability. For this postdoc, applicants must apply both to DIMACS and IAS.



b) Economics and Computation Research area of Artificial Intelligence Postdoc, in collaboration with the Department of Computer Science at Rutgers University. This is a one-year position with the possibility of renewal. Topics include but are not limited to: algorithmic game theory, auctions, crowdsourcing, information elicitation, machine learning in economics, mechanism/market design, and prediction markets. Applicants should be recent PhD graduates in computer science, economics, information science, operations research, or a related field, preferably with a focus in artificial intelligence or theory.



c) DATA-INSPIRE Postdoc. This position is in a new transdisciplinary (TRIPODS) Institute based at DIMACS on Data Science for INtelligent Systems and People Interaction that integrates Computer Science, Mathematics, and Statistics with a focus on data science principles and the emerging convergence of humans with machines. Applicants should be recent PhDs in computer science, math, or statistics, with a demonstrated interest in working across these disciplines.



d) Simons A&G Postdoc. This is a one- or two-year position, part of the Simons Collaboration on Algorithms and Geometry, which aims to address fundamental questions at the interface of mathematics and theoretical computer science. Applicants should be recent PhDs with interest in theoretical computer science and/or discrete mathematics. Research areas include but are not limited to: computational complexity, algorithms, optimization, cryptography, combinatorics, graph theory, and discrete probability.



All positions provide salary, health benefits, and an allowance for domestic travel.



Applicants should provide a cover letter specifying which postdoctoral position(s) they are applying for, a curriculum vitae, a research statement highlighting their past and planned future research, optionally a teaching statement, and the names & email addresses of three references.



DIMACS is a consortium of several universities (Rutgers, Columbia, Georgia Tech, NJIT, Princeton, RPI, and Stevens) and corporate research labs (AT&T, Avaya, IBM, Microsoft, NEC, Nokia, and Perspecta). Research and education areas at DIMACS include algorithms, combinatorics, complexity, privacy and security, discrete and computational geometry, optimization, graph theory, data science, artificial intelligence, and machine learning, with applications in sustainability, epidemiology, genetics, networks, transportation, security, and economics. Many DIMACS activities relate to specific topics of current interest represented by the DIMACS Special Focus programs. Postdoctoral Associates at DIMACS are encouraged to collaborate with DIMACS members and visitors and to participate in all of the research and educational activities of DIMACS.



We believe that research and society benefit from a diverse workplace, and strongly encourage applications from women, minorities, individuals with disabilities, veterans, and students with non-traditional backgrounds.



For more information: http://jobs.rutgers.edu/postings/103779

<http://jobs.rutgers.edu/postings/103779>


---


Isha Deen-Cole

Program Coordinator - DIMACS Center

Rutgers, The State University of New Jersey

96 Frelinghuysen Road

CORE Building, 4th fl, Room 428

Piscataway, NJ, 08854

848-445-4521

**********************************************************
*
* 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: Emerging Applications Track and the 2020 INFORMS Optimization Society Conference

Dear colleagues,

As co-chairs of the Emerging Applications track, we would like to invite
abstract submissions to the 2020 INFORMS Optimization Society (IOS)
Conference (https://cecas.clemson.edu/informs-conference/).

The 2020 IOS Conference will be held in beautiful Greenville, South
Carolina, from March 15 to March 17. There is also a best paper award with
a cash prize $500 to be given to an IOS submission going through the
referee process. Authors who choose to compete for the best paper award
should submit an extended abstract up to four pages, in addition to the
abstract of the talk. In this extended abstract, the authors must include a
publicly accessible link to the full manuscript, e.g., Optimization Online,
ArXiv, etc. (We do not have format requirements on either the extended
abstract or the paper.)

If you are interested, please submit an abstract through Easychair
<https://easychair.org/cfp/IOS2020> and also enter the information about
your abstract submission here
<https://docs.google.com/spreadsheets/d/1SZddFCeMnt_7xmswb9Sxbd9Lx5pqeIvjdTOkzEyuBRc/edit#gid=1251972651>
(the abstract number is sent via email after completing the Easychair
submission). We will organize talks into sessions following indications
provided on the Google sheet
<https://docs.google.com/spreadsheets/d/1SZddFCeMnt_7xmswb9Sxbd9Lx5pqeIvjdTOkzEyuBRc/edit#gid=0>.


We thank you for the consideration and look forward to your participation.

How beautiful is Greenville? See for yourself in this video
<https://www.youtube.com/watch?v=xZA252lotHM>.

Sincerely,
Thiago Serra and Siqian Shen

--
Thiago Serra, Ph.D.
Assistant Professor of Business Analytics
Freeman College of Management
Bucknell 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] SoCG 2020, 2nd Call for Papers

36th SoCG - Zürich, Switzerland - June 23-26, 2020

******* SoCG 2020, 2nd Call for Papers*************


The 36th International Symposium on Computational Geometry (SoCG 2020)
will be held in Zürich, Switzerland, June 23-26, 2020, as part of the
Computational Geometry (CG) Week. We invite submissions of high quality
that describe original research on computational problems in a geometric
setting. Topics of interest include, but are not limited to:
• Design, analysis, and implementation of geometric algorithms and data
structures;
• Lower bounds on the computational complexity of geometric problems;
• Mathematical, numerical, and algebraic issues arising in the
formulation, analysis, implementation, and experimental evaluation of
geometric algorithms and heuristics;
• Discrete and combinatorial geometry;
• Computational topology, topological data analysis, and topological
combinatorics;
• Applications of computational geometry in any field.

To ensure that a submission is evaluated on its own merits, authors will
need to identify the main strengths of their submission, as captured by
four possible paper types. Please consult the corresponding section of
this CFP (or the conference web-page) for a detailed description of
the paper types and associated evaluation criteria. There are no quotas
for the paper types and submissions can be labeled with more than one
paper type at the time of submission.


*Conference Web Page*

https://socg20.inf.ethz.ch/


*Link for Submissions*

https://easychair.org/my/conference?conf=cgweek2020


*Important Dates*

• November 27, 2019 (Wednesday): Abstracts due (23:59 AoE)
• December 4, 2019 (Wednesday): Papers due (23:59 AoE)
• February 10, 2020 (Monday): Notification of acceptance/rejection
• March 22, 2020 (Sunday): Final versions of accepted papers due
• June 23-26, 2020 (Tuesday-Friday): Symposium


*Submission Guidelines*

Submissions must be formatted in accordance with the LIPIcs proceedings
guidelines and not exceed 500 lines, excluding front matter, references,
and a clearly marked appendix (further described below). To ensure an
accurate line counting, authors must use the LaTeX class file
socg-lipics-v2019, which is a wrapper around the standard class. The
class file, as well as a document describing the motivation and
technicalities behind this class, are available from the SoCG webpage
(http://computational-geometry.org). Authors should refrain from putting
excessive amounts of texts in parts in which lines are not counted
automatically. If authors need constructs that contain large amounts of
uncounted text, they should compensate for this by reducing the final
line count accordingly.

Papers should be submitted in the form of an extended abstract, which
begins with the title of the paper, each author's name and affiliation,
as well as a short abstract. This should be followed by the main body of
the paper that begins with a precise statement of the problem
considered, a succinct summary of the results obtained (emphasizing the
significance, novelty, and potential impact of the research), and a
clear comparison with related work. The remainder of the extended
abstract should provide sufficient details to allow the program
committee to evaluate the validity, quality, and relevance of the
contribution. Clarity of presentation is very important; the entire
extended abstract should be written carefully, taking into consideration
that it will be read and evaluated by both experts and non-experts,
often under tight time constraints. All details needed to verify the
results must be provided.

Supporting materials, including proofs of theoretical claims and
experimental details, that do not fit in the 500-line limit should be
given in an appendix. If more appropriate, the full version may be given
as the appendix. In both cases, however, the authors should include in
the main part specific pointers to the relevant locations in the
appendix. The appendix will be read by the program committee members at
their discretion and will not be published as part of the proceedings.
Thus, the paper without the appendix should be able to stand on its own.
Experimental and implementation results (independent of paper type) must
be reproducible and verifiable. Authors of all types of papers are
encouraged to put accompanying software and relevant data, if there are
any, in a repository accessible to the reviewers. Authors are asked to
indicate which of the supporting materials will remain publicly
available if their papers are accepted.

Submissions deviating from the above guidelines risk being rejected
without further consideration.

Results previously published or accepted for publication in the
proceedings of another conference cannot be submitted. Simultaneous
submissions of the results to another conference with published
proceedings are not allowed. Exempted are workshops and conferences
without formal proceedings, but possibly with handouts containing short
abstracts. Results that have already been accepted (with or without
revision) for publication in a journal at the time of their submission
to the symposium are not allowed. A paper submitted to a journal but not
yet accepted for publication can be submitted to the symposium. In such
cases, the authors must mention this on the front page of the submission
and clearly identify the status of the journal submission as of
November 27, 2019.


*Format of Accepted Papers*

Final proceedings versions of accepted papers must be formatted in
accordance with the LIPIcs proceedings guidelines and not exceed 500
lines, excluding a title page and references. These final versions must
be submitted by March 22, 2020. If any supporting material (including
complete proofs of theoretical claims and experimental details) does not
fit in the specified limit, then the full version of the paper
containing this information must be referenced in the conference version
and made available at a public repository, such as arXiv, by the time
the final version is submitted. Where applicable, we encourage the
authors to make accompanying software and/or data publicly accessible,
with proper references in the paper.

An author of each accepted paper will be expected to attend the
symposium and present the paper (approximately 20 minutes). An award
will be given to the best paper. Authors of a selection of papers from
the symposium will be invited to submit extended versions of their
papers to special issues of Discrete & Computational Geometry and
Journal of Computational Geometry.


*Paper types*

When writing or evaluating a SoCG paper, it is important to keep in mind
that there are different types of contributions, each with its own
strengths. Results of all kinds (theoretical and practical) need to be
reproducible and verifiable. To ensure that each submission is evaluated
on its own merits, the authors need to identify the main strengths of
their submissions, as captured by four possible paper types.
PC members and external reviewers will be asked to take into account
these paper types together with their associated evaluation criteria
when they evaluate a paper. There are no quotas for the paper types
and submissions can be labeled with more than one paper type at the
time of submission.


/Mathematical Foundations/

A typical paper will contain theorems and proofs describing new results
in discrete or combinatorial geometry, or in topological combinatorics.
The paper will primarily be evaluated on its technical depth, the
importance of the results, the elegance of the solution, the connection
of the problem studied to computational geometry and topology, and the
potential future impact on algorithm development.

/Algorithmic Complexity/

A typical paper will contain algorithms, data structures, theorems,
proofs, or lower bound constructions describing new results on
computational geometry problems. The paper will primarily be evaluated
on the (mathematical or computational) relevance and importance of the
problem studied, its technical depth, the elegance of the solution, and
the potential future impact of the results or the proposed new methods
and techniques.

/Experiments & Implementation/

A typical paper will make a clear contribution to the implementation and
evaluation of geometric algorithms, such as exact, approximate, or
algebraic computation, algorithms engineering, or the experimental
evaluation of competing algorithmic approaches. The paper will primarily
be evaluated on the completeness and the expected impact of the proposed
implementation, the soundness of the experiments, the quality and
quantity of testing, and on the general amount of knowledge gained.

/Applications/

A typical paper will describe the modeling and algorithmic choices made
when developing or adapting computational geometry techniques for an
application area. The paper will be primarily evaluated on the soundness
of the modeling decisions, the ingenuity of the solution, the
effectiveness of the proposed method, and the expected impact in the
application area. One might also consider the lesson learned regarding
the applicability or suitability of computational geometry tools to the
specific area.


*Program Committee*

Mikkel Abrahamsen (University of Copenhagen)
Therese Biedl (University of Waterloo)
Mickaël Buchet (TU Graz)
Sergio Cabello; co-chair (University of Ljubljana)
Danny Z. Chen; co-chair (University of Notre Dame)
David Eppstein (University of California, Irvine)
Stefan Funke (University Stuttgart)
Marc Glisse (INRIA Saclay)
Dan Halperin (Tel Aviv University)
Iyad Kanj (DePaul University)
Irina Kostitsyna (TU Eindhoven)
Jan Kynčl (Charles University)
Jian Li (Tsinghua University)
Nabil Mustafa (Université Paris-Est, ESIEE Paris)
Eunjin Oh (POSTECH)
Tim Ophelders (Michigan State University)
Florian T. Pokorny (KTH Royal Institute of Technology)
Sharath Raghvendra (Virginia Tech)
Don Sheehy (North Carolina State University)
Primož Škraba (Queen Mary University of London)
Frank Staals (Utrecht University)
Katharine Turner (Australian National University)
Torsten Ueckerdt (Karlsruhe Institute of Technology)
Hubert Wagner (IST Austria)
Bartosz Walczak (Jagiellonian University)
Jinhui Xu (SUNY Buffalo)

--
http://www.fmf.uni-lj.si/~cabello
Faculty of Mathematics and Physics
University of Ljubljana
Slovenia
**********************************************************
*
* 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] Fully-funded PhD positions in Mathematics, Computer and Data Sciences, IST Austria

The Institute of Science and Technology Austria (IST Austria) is looking for highly qualified candidates to apply for our PhD program. We offer fully-funded PhD positions in the natural and mathematical sciences in a world-class research environment on the outskirts of Vienna.



The research topics that might interest students in your department include:



Mathematics: https://phd.pages.ist.ac.at/mathematics/

- Barton Evolutionary Genetics

- Browning Analytic Number Theory and its Interfaces

- Edelsbrunner Algorithms, Computational Geometry and Topology

- Erdős Mathematics of Disordered Quantum Systems and Matrices

- Fischer Theory of Partial Differential Equations, Applied and Numerical Analysis

- Hausel Geometry and its Interfaces

- Maas Stochastic Analysis

- Seiringer Mathematical Physics

- Wagner Discrete and Computational Geometry and Topology



Computer Science: https://phd.pages.ist.ac.at/computer-science/

- Alistarh Distributed Algorithms and Systems

- Bickel Computer Graphics and Digital Fabrication

- Chatterjee Computer-aided Verification, Game Theory

- Edelsbrunner Algorithms, Computational Geometry and Topology

- Henzinger Design and Analysis of Concurrent and Embedded Systems

- Kolmogorov Discrete Optimization

- Lampert Computer Vision and Machine Learning

- Mondelli Data Science, Machine Learning, and Information Theory

- Pietrzak Cryptography

- Wagner Discrete and Computational Geometry and Topology

- Wojtan Computer Graphics and Physics Simulation



Data Science & Scientific Computing: https://phd.pages.ist.ac.at/data-science-scientific-computing/

- Alistarh Distributed Algorithms and Systems

- Barton Evolutionary Genetics

- Bickel Computer Graphics and Digital Fabrication

- Guet Systems and Synthetic Biology of Genetic Networks

- Hannezo Physical Principles in Biological Systems

- Lampert Computer Vision and Machine Learning

- Mondelli Data Science, Machine Learning, and Information Theory

- Tkačik Theoretical Biophysics and Neuroscience

- Vicoso Sex-Chromosome Biology and Evolution

- Wojtan Computer Graphics and Physics Simulation



We also have research groups in the following fields:

Biology

Neuroscience

Physics



Our PhD program is characterized by innovative training with a special focus on interdisciplinarity, close mentoring by outstanding faculty within small research groups, and access to first-rate facilities. Students spend the first year completing coursework and rotations before choosing a thesis group and passing the qualifying exam. Our PhD graduates have gone on to top positions in academia and industry all over the world.



Students with a bachelor's or master's degree in a relevant field are encouraged to apply. We offer internationally competitive salaries, full health benefits, and subsidized on-campus housing in the first year.



For more information about the IST Austria PhD program and application process, as well as faculty profiles, please visit our website at http://phd.ist.ac.at, or come to our Student Open Day on November 22nd (register at: http://ist.ac.at/studentopenday).



The deadline for PhD applications is January 8th 2020 for a start date in September 2020.



Yours sincerely,

Monica Sandberg

IST Austria Graduate School Office

gradschool@ist.ac.at





----------------------------------

More information about the PhD Open Call: https://phd.ist.ac.at/phd-admissions/

Register here for the Student Open Day: http://ist.ac.at/studentopenday

Download our 2020 PhD open call flyers here: https://phd.ist.ac.at/downloads/

**********************************************************
*
* 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] Thematic Einstein Semester "Geometric and Topological Structure of Materials"

----------------------
CALL FOR PARTICIPATION
----------------------


Dear Scientists and Mathematicians,

We wish to announce the upcoming


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

Thematic Einstein Semester

"Geometric and Topological Structure of Materials"

TU Berlin, Summer 2020

https://www3.math.tu-berlin.de/TES-Summer2020/

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


This third Berlin Thematic Einstein Semester is devoted to recent
developments in the field of computational materials science.
It aims to bring together experts from the sciences with experts
from computational topology, computational algebraic, discrete
differential and stochastic geometry working on the structure
and function of materials.

The semester is organized within the framework of the Berlin Mathematics
Research Center MATH+ and is supported by the Einstein Foundation Berlin.


Activities:
----------

Phase I, Spring 2020:

* TES block course "Stochastic Topology"
(March 16-20, 2020).
https://www3.math.tu-berlin.de/TES-Summer2020/TES_Block_Course_Stochastic_Topology.html

* TES conference "Structure of Materials"
(March 23-27, 2020).
https://www3.math.tu-berlin.de/TES-Summer2020/TES_Conference_Structure_of_Materials.html

Phase II, Summer 2020:

* Meeting of Women in Computational Topology (WinCompTop)
(August 19-21, 2020).

* TES conference "Geometric and Topological Structures"
(August 24-28, 2020).

* TES block course "Computational Topology and Machine Learning"
(August 31 - September 4, 2020).



Organizers:
----------

Myfanwy Evans (TU Berlin)
Kathryn Hess Bellwald (EPFL)
Frank Lutz (TU Berlin)
Dmitriy Morozov (LBNL)
Ileana Streinu (Smith 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/
*
**********************************************************

Sunday, November 10, 2019

[DMANET] Call for abstracts on EMO for the IFORS2020 conference

Dear colleague,

You are kindly invited 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


e52d90f3 - Evolutionary Multi-objective Optimization (EMO)

383397e0 - Evolutionary Multi-objective Optimization (EMO)

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

Stream Organizers:

Manuel López-Ibáñez (manuel.lopez-ibanez@manchester.ac.uk) and Richard Allmendinger (richard.allmendinger@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] Calls for Sessions on EMO for the IFORS2020 conference

Dear colleague,
The 22nd Conference of the International
Federation of Operational Research Societies (IFORS 2020)
will be held on June 21-26, 2020 in Seoul, South Korea. http://www.ifors2020.kr

We are the organisers of the "Evolutionary
Multi-objective Optimization (EMO)" stream at IFORS and we
welcome session proposals 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<br>
* Real-world applications

As a session organiser, your role will be to select abstract
submissions or invite authors to deliver a talk within your session.

A session typically consists of four talks. If there are more
than four speakers, it is still possible that the same
organisers hold more than one session dedicated to the same
topic.

If you are interested in organising a 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).

The abstract submission deadline is January 17, 2020, so all
abstracts of your session should be in the Abstract Submission
System before that date. Please note that abstracts must be
written in English and contain no more than 1500 characters in
plain text format (no formulas allowed). Each registered
attendee is allowed to give one presentation at the
conference. The speaker must enter the abstract and will be
shown as the first author.

IMPORTANT DATES:

* Abstract Submission Deadline - January 17, 2020
* Abstracts Accepted/Rejected Deadline - January 31, 2020
* Early-bird Registration Deadline - February 28, 2020
* Speakers Registration Deadline - March 1, 2020

If you know a colleague who might be interested in organizing
a session in this stream, please, feel free to forward this
invitation.

If you have any questions, please, do not hesitate to contact us!

With best regards,
Richard and Manuel

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

Saturday, November 9, 2019

[DMANET] Simons-Berkeley Research Fellowships for spring of 2021 on theory and practice of NP and beyond

The call for applications for research fellowships (postdoc positions) at the Simons Institute at UC Berkeley for 2020-21 has now been posted at https://simons.berkeley.edu/fellows2020 with an application deadline of December 15.

We wish to highlight the semester program "Satisfiability: Theory, Practice, and Beyond" (https://simons.berkeley.edu/programs/sat2021), which will run in the spring of 2021 in parallel with "Theoretical Foundations of Computer Systems" (https://simons.berkeley.edu/programs/tfcs2021).

Simons-Berkeley Research Fellowships are intended for up-and-coming researchers who are getting close to defending their PhD degree or are at most 6 years past it at the start of the academic year 2020-21. This includes researchers who already hold junior faculty or postdoctoral positions. In particular, applicants who expect to have postdoc positions at other institutions are encouraged to apply to spend one semester as a Simons-Berkeley Fellow, subject to the approval of the home institution. The Institute expects to award about 30 Fellowships in 2020-21; the majority of these are for one semester, but several appointments for a full academic year are expected to be made. In each semester of residence, each Fellow will normally participate in at least one of the ongoing programs at the Institute -- please indicate if you are applying for the SAT semester program. Salaries and benefits are competitive, and assistance with visas and housing will be provided. The Institute particularly encourages applications from women and minority candidates.

If interdisciplinary research at the crossroads between theory and practice of SAT and other hard problems in logic and/or combinatorics seems interesting to you (also including going beyond NP to areas such as SMT solving, constraint programming, and mixed integer linear programming), then you are strongly encouraged to apply!

All help with distributing this announcement further would be much appreciated.

Best regards,
Jakob Nordström

On behalf of the organizing committee for the SAT semester program,
Albert Atserias, Sam Buss, Vijay Ganesh, Antonina Kolokolova, and Jakob Nordström


**********************************************************
*
* 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: IPDPS ParSocial 2020 Workshop - 4th IEEE Workshop on Parallel and Distributed Processing for Computational Social Systems

[Apologies if you receive multiple postings]
###############################################################################################
CALL FOR PAPERS
The 4th IEEE Workshop on Parallel and Distributed Processing for
Computational Social Systems
May 22 2020, New Orleans, Louisiana USA.
Conference Website : https://www.cpp.edu/~jkorah/parsocial/
(In conjunction with IEEE International Parallel & Distributed Processing
Symposium (IPDPS))

IMPORTANT DATES
Paper submission deadline : January 27, 2020
Notification of acceptance : February 21, 2020
Camera-ready papers : March 15, 2017
Workshop : May 22, 2020
###############################################################################################

ABOUT PARSOCIAL
Computational methods to represent, model and analyze problems using social
information have come a long way in the last decade. Computational methods,
such as social network analysis, have provided exciting insights into how
social information can be utilized to better understand social processes,
and model the evolution of social systems over time. We have also seen a
rapid proliferation of sensor technologies, such as smartphones and medical
sensors, for collecting a wide variety of social data, much of it in real
time. Meanwhile, the emergence of parallel architectures, in the form of
multi-core/many-core processors, and distributed platforms have provided
new approaches for large-scale modeling and simulation, and new tools for
analysis. These two trends have dramatically broadened the scope of
computational social systems research, and are enabling researchers to
tackle new challenges. These challenges include modeling of real world
scenarios with dynamic and real-time data, and formulating rigorous
computational frameworks to embed social and behavioral theories while
taking into account ramifications in relation to policy, ethics, privacy
and other areas. This workshop provides a platform to bring together
interdisciplinary researchers from areas, such as computer science, social
sciences, applied mathematics and engineering, to showcase innovative
research in computational social systems that leverage the emerging trends
in parallel and distributed processing, computational modeling, and high
performance computing.

The papers selected for ParSocial will be published in the workshop
proceedings. Proceedings of the workshops are distributed at the conference
and are submitted for inclusion in the IEEE Xplore Digital Library after
the conference. At least one of the authors of each accepted paper must
register as a participant of the workshop and present the paper at the
workshop.

CALL FOR PAPERS
Areas of research interests and domains of applications include, but are
NOT LIMITED to:

*Large-Scale Modeling and Simulation for Social Systems*
Social network-based models
Models of social interactions and network dynamism (e.g. influence spread,
group formation, group stability, and social resilience)
Complex Adaptive System (CAS) models (e.g. modeling emergence in social
systems)
Models incorporating socio-cultural factors
Novel agent based social modeling and simulation
Modeling with uncertain, incomplete and real-time social data
Representations of social and behavioral theories in computational models
Simulation methodologies for social processes including numerical and
statistical methods
Modeling human and social elements in cyber systems (e.g. cyber-physical
systems, and socio-technical systems)

*Social Computing Algorithms for Parallel and Distributed Platforms*
Analysis of massive social data
Algorithms for dynamic social data
Algorithms for social network analysis
Machine learning/data mining-based analysis
Social Computing and Internet of Things (IoT)
Computing for social good and privacy
Analysis methods for incomplete, uncertain social data
Social analysis methods on parallel and distributed frameworks
Social computing for emerging architectures (e.g. cloud,
multi-core/many-core, GPU, and neuromorphic computing architectures)

*Application*
Domains of applications include but are not limited to:
Emergency management (e.g. infrastructure resilience, and natural disaster
management)
Financial Technology (e.g. algorithmic trading, blockchains, and P2P
lending)
Health science (e.g. disease spread models, health informatics, and health
policy models)
Social analytics (e.g. business analytics, political influence, and
economic analysis)

PAPER SUBMISSION
The workshop will accept submissions for both *regular* and *short* papers.
Manuscripts for regular papers should not exceed 10 single-spaced
double-column pages. Manuscripts for short papers should not exceed 4
single-spaced, double-column pages. The manuscripts should use 10-point
font on 8.5 x 11 inch pages (IEEE conference style) and the page limit
includes references, figures and tables.

Please visit the workshop website(https://www.cpp.edu/~jkorah/parsocial/)
for details on submission.


*Workshop Organization*

**Workshop Co-Chairs**
John Korah, Assistant Professor, California Polytechnic University
Pomona, USA.
Eunice E. Santos, Professor and Dean of the School of Information
Sciences, University of Illinois at Urbana-Champaign, USA.

**Steering Committee**
George Cybenko, Dorothy and Walter Gramm Professor of Engineering,
Dartmouth College, USA.
James A. Hendler, Tetherless World Professor of Computer Science,
Rensselaer Polytechnic Institute, USA.
Eugene Santos Jr., Professor of Engineering, Dartmouth College, USA
V. S. Subrahmanian, The Dartmouth College Distinguished Professor in
Cybersecurity, Technology, and Society, Dartmouth College, USA.
Albert Y. Zomaya, Chair Professor of High Performance Computing &
Networking, The University of Sydney, Australia.

**********************************************************
*
* 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: Dec. 31: JIP DCGGG Special Issue

The deadline of The Special Issue on
"Discrete and Computational Geometry, Graphs, and Games (DCGGG)"
of Journal of Information Processing was extended.
(Apologize for multiple distributions)

We extend the deadline of the JIP Special Issue on DCGGG
(from Nov. 15) to

Dec. 31, 2019. (New Deadline)

https://www.ipsj.or.jp/english/jip/cfp/20-T.html
(The information on the deadline will be revised soon.)

----

Journal of Information Processing, Special issue on
"Discrete and Computational Geometry, Graphs, and Games"

We will publish a special issue on
"Discrete and Computational Geometry, Graphs, and Games."

The submission deadline is

*** December 31, 2019. (Extended) ***

Please see the following URL for detail:
https://www.ipsj.or.jp/english/jip/cfp/20-T.html
(The information on the deadline will be revised soon.)

We are looking forward to your submissions.

Hiro Ito

--------------------------------------------------------------------------
2nd Call for Papers ---
Journal of Information Processing, Special issue on
"Discrete and Computational Geometry, Graphs, and Games."
https://www.ipsj.or.jp/english/jip/cfp/20-T.html

This special issue will focus on research papers that describe discrete
and computational geometry, graphs, and games. The topics include, but
not limited to: discrete geometry, computational geometry, graph theory,
graph algorithms, complexity and winning strategies of games and puzzles.

Free of publication charge.
^^^^^^^^^^^^^^^^^^^^^^^^^^

Non members of IPSJ can submit papers to JIP.

The submission deadline is

*** December 31, 2019. (Extended) ***

Editor in-Chief: Hiro ITO (The Univ. of Electro-Communications).
Editorial Board: Takashi HORIYAMA (Hokkaido Univ.).
Editorial Committee:
Jean CARDINAL (Univ. Libre de Bruxelles, Belgium),
Ruy FABILA-MONROY (Cinvestav, Mexico),
Chie NARA (Meiji Univ.),
Yoshio OKAMOTO (The Univ. of Electro-Communications),
Hirotaka ONO (Nagoya Univ.),
Kenta OZEKI (Yokohama National Univ.),
Vera SACRISTAN (Univ. Politecnica de Catalunya, Spain),
Toshiki SAITOH (Kyushu Institute of Technology),
Yuuki TANAKA (Gunma Univ.),
Toshinori SAKAI (Tokai Univ.),
Ryuhei UEHARA (JAIST),
Yushi UNO (Osaka Prefecture Univ.),
Kunihiro WASA (National Institute of Informatics),
Aaron WILLIAMS (Williams College, USA).

Please see the following URL for detail:
https://www.ipsj.or.jp/english/jip/cfp/20-T.html
---------------------------------------------------------------------------

..A A .. ......ITO Hiro, Professor
. ..... School of Informatics and Engineering,
. @ @ .... The University of Electro-Communications
. = x = . .... 1-5-1 Chofugaoka, Chofu, Tokyo 182-8585, JAPAN
. . . . Tel/Fax: +81 42 443 5332
.(( (( ( .. E-mail: itohiro@uec.ac.jp
**********************************************************
*
* 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] Visiting Assistant Professor positions at Department of Statistics, Carlos III University of Madrid

The Department of Statistics at Universidad Carlos III de Madrid (UC3M) is offering up to two full-time Visiting Assistant Professor (non-tenure-track) positions. Selected candidates will be expected to contribute to teaching Statistics related courses, either in English or Spanish, as well as to the Department's research lines. The expected start date is January 15, 2020.

The teaching load is 144 hours per academic year, which roughly corresponds to six groups, each comprising 1.5 hours per week during a semester.

UC3M adheres to the European Commission Code of Conduct for the Recruitment of Researchers. Selection will be based on an assessment of the applicants' cv valuing especially research quality and fit to the Department. The Social Sciences Selection Committee, which will oversee the process, is composed of: Beatriz García Osma (President), Raquel Carrasco Perea (Secretary), Paloma Aguilar Fernández (member), Daniel Bruno Entrena Ruiz (member) and José Niño Mora (Statistics Department Head).

Applicants should possess a PhD by the expected start date, as well as experience in any of the fields of the Department (Econometrics, Operations Research, Probability and Statistics).

The contract is for one year, annually renewable up to three years.

Annual gross salary: 24,000 euros (approx.).

Deadline for applications: December 1, 2019 (included).

For more information about UC3M and the Statistics Department, you can visit the web page http://www.uc3m.es/departamento.estadistica. Applicants must possess the required permits to work in Spain prior to starting.

Applicants should send the following information via email to departamento.estadistica@uc3m.es:

- Statement of interest, including the expected research and teaching objectives to be achieved in the position.
- Curriculum vitae.
-Two letters of reference to be sent by letter writers to the above email address.

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

Friday, November 8, 2019

[DMANET] Virtual Combinatorics Colloquium

> *Please join us for the Virtual Combinatorics Colloquium (VCC) Series: *
> https://sites.google.com/view/northeastcombinatoricsnetwork/virtual-combinatorics-colloquium
>
> 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.).
>
> *We are very pleased to announce the next talk in the series--*
>


> *Speaker: *Heide Gluesing-Luerssen University of Kentucky
>
> *Date: *Tuesday, November 19, 2019 at 2:00 p.m. (14:00) Eastern Standard
> Time
>
> *Zoom Link: * https://smcvt.zoom.us/j/858049685 Join Meeting ID: 858 049
> 685
>
> *Title:* Rank-Metric Codes for Random Network Coding
>
> *Abstract: *In multicast networks, information is passed through a
> network of nodes to several receivers. The goal is to transmit the
> information to all receivers with the least amount of uses of the network.
> We will see that suitable encoding of the information at the nodes (inner
> coding) can decrease the number of applications of the network. In
> addition, encoding the information before transmission (outer coding) can
> safeguard the information against errors during transmission. It turns out
> that rank-metric codes are the appropriate tool for outer coding. After a
> gentle introduction into the theory of rank-metric codes I will present
> some recent results, such as constructions of optimal Ferrers-diagram codes
> and their proportion among all Ferrers-diagram codes of the same dimension
>
>
>
> Further information and upcoming talks may be found here:
>
>
> https://sites.google.com/view/northeastcombinatoricsnetwork/virtual-combinatorics-colloquium/upcoming-vccs
>
> We especially invited groups to host viewing parties
> <https://sites.google.com/view/northeastcombinatoricsnetwork/virtual-combinatorics-colloquium>
> for these events. However, To avoid the possibility of distraction and
> feedback noise, please keep your mic muted unless you or someone in your
> group has something particular to say.
>
>
>
> The *Northeast Combinatorics Network* (NCN) is funded by the US National
> Science Foundation.
>
> Activities, including *Discrete Math Days in the Northeast* (DMD), *Summer
> Combo in Vermont*, and the *Virtual Combinatorics Colloquium* (VCC), are
> detailed on the NCN website:
>
> Google Sites: Northeast Combinatorics Network
> <https://sites.google.com/view/northeastcombinatoricsnetwork/home>
>
> Email: northeastcombinatoricsnetwork@gmail.com
>
> YouTube Channel: Northeast Combinatorics Network
> <https://www.youtube.com/channel/UCQYSxI_EL0nhE9E6aZZra5Q>
>

Organizers: Jo Ellis-Monaghan & Bill Martin

> <northeastcombinatoricsnetwork@gmail.com>
>
>
> *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] Postdoctoral position in Edinburgh (link fixed)

Applications are invited for a 3-year postdoctoral position on
Spectral Algorithms at the University of Edinburgh.

The position is funded by the £1.5M EPSRC Fellowship of He Sun on
"Efficient Spectral Algorithms for Massive and Dynamic Graphs". This
fellowship aims at advancing our understanding of fundamental spectral
techniques, investigating new spectral algorithms for fundamental
graph problems, as well as implementing and evaluating these
algorithms on large-scale data sets.

This post will involve working on graph sparsification and its
applications, and will be a member of the Laboratory for Foundations
of Computer Science (LFCS) at Edinburgh. There will be opportunities
to take responsibility for supervising PhD students and collaborating
with the project partners on related research problems, all within the
freedom of an academic research environment. In addition, the post
will receive support for travel and collaborating with other
researchers.

For informal queries, please contact He Sun at h.sun@ed.ac.uk

Deadline for application: 9 December 2019.

Shortlisted candidates will be contacted in December or January for an
interview.

For more information and the application procedure, please see the link below:

https://www.vacancies.ed.ac.uk/pls/corehrrecruit/erq_jobspec_version_4.jobspec?p_id=050307

**********************************************************
*
* 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] NYCAC 2019 -- the New York Colloquium on Algorithms and Complexity

Apologies for multiple copies.

This is to announce NYCAC 2019, which will take place on Friday, November
15 in New York.
The website for this year's NYCAC is
http://www.sci.brooklyn.cuny.edu/~zachos/nycac_2019/

We look forward to seeing you there!

Please distribute to anyone who may be interested.


Time and location:

Friday, November 15, 2019
9:00AM TO 6:30PM

The Graduate Center, CUNY
The Science Center
Room 4102

The New York Colloquium on Algorithms and Complexity NYCAC, is an annual
event.
Its purpose is to give the opportunity to graduate students in New York to
observe talks
of researchers from all areas of the theory of Algorithms and Computational
Complexity.


Invited Speakers for 2019:

Eric Allender (Rutgers)

Marshall Ball (Columbia)

Vaggos Chatziafratis (Stanford)

Lane A. Hemaspaandra (University of Rochester)

Yiannis Koutis (NJIT)

Antigoni Polychroniadou (Cornell and JP Morgan)

Dana Ron (Tel-Aviv U)

Dimitris Tsipras (MIT)

Manolis Vlatakis (Columbia)

Ilias Zadik (MIT)

Lydia Zakynthinou (Northeastern)


On behalf of the 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] Postdoctoral position in Edinburgh

Applications are invited for a 3-year postdoctoral position on Spectral Alg=
orithms at the University of Edinburgh.=20=20

The position is funded by the =C2=A31.5M EPSRC Fellowship of He Sun on =E2=
=80=9CEfficient Spectral Algorithms for Massive and Dynamic Graphs". This f=
ellowship aims at advancing our understanding of fundamental spectral techn=
iques, investigating new spectral algorithms for fundamental graph problems=
, as well as implementing and evaluating these algorithms on large-scale da=
ta sets.

This post will involve working on graph sparsification and their applicatio=
ns, and will be a member of the Laboratory for Foundations of Computer Scie=
nce (LFCS) at Edinburgh. There will be opportunities to take responsibility=
for supervising PhD students and collaborating with the project partners o=
n related research problems, all within the freedom of an academic research=
environment. In addition, the post will receive support for travel and col=
laborating with other researchers.

For informal queries, please contact He Sun at h.sun@ed.ac <mailto:h.sun@ed=
.ac>.uk

Deadline for application: 9 December 2019.

Shortlisted candidate will be contacted in December or January for an inter=
view.

For more information and the application procedure, please see the link bel=
ow:

https://www.vacancies.ed.ac.uk/pls/corehrrecruit/erq_jobspec_version_4.jobs=
pec?p_id=3D050307
<https://www.vacancies.ed.ac.uk/pls/corehrrecruit/erq_job=
spec_version_4.jobspec?p_id=3D050307
>=


**********************************************************
*
* 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] Faculty position in Algorithms at Hamburg University of Technology

FACULTY POSITION IN ALGORITHMS RESEARCH AT HAMBURG UNIVERSITY OF
TECHNOLOGY (TUHH)

--
The Institute of Algorithms and Complexity at TUHH: Hamburg University
of Technology (http://tuhh.de) in Hamburg, Germany invites applications
for one permanent position at the rank of Senior Engineer
(Oberingenieur). The focus of this position is research in the general
area of algorithms, applied to combinatorial optimization, operations
research, discrete mathematics, and related fields. Exceptional
candidates who enhance the research profile and teaching needs of the
institute may also be considered.

The position is within the newly formed Institute for Algorithms and
Complexity, whose research covers a broad spectrum of algorithmic
research; this includes big data algorithms, foundations of data
science, combinatorial optimization, approximation and parameterized
algorithms, and applications in operations research and discrete
mathematics. The Institute for Algorithms and Complexity at TU Hamburg
currently hosts several international researchers, so English is used on
a daily basis as a working language.

The institute is located in the newly built Hamburg Innovation Port
(http://channel-hamburg.de/bueroflaechen/hamburg-innovation-port/),
which is located right at the Harburg harbour with great views of the
harbour and Hamburg's famous opera house (Elbphilharmonie). TU Hamburg
offers several attractive benefits, including subsidized public
transport for the Hamburg metropolitan area, a sports centre on campus,
family-friendly working hours, healthy campus initiatives, and more.
Several other institutes of the TU Hamburg, the Helmholtz Center for
Data Science, and the German Air and Space Research Center (DLR) are
located in the area. They are all located in the Free and Hanseatic City
of Hamburg, which is Germany's second largest city, home to a population
of ca. 1.8 million people. It is a famous city of trade and commerce,
with several universities and much research in algorithms.

A Ph.D. degree and evidence of excellence in research and teaching are
required. Successful applicants are expected to maintain an active
program of research, to attract and supervise graduate students, and to
participate in undergraduate and graduate teaching. Teaching is
generally conducted in English. Knowledge of German is not strictly
necessary but considered an advantage.
The salary of the position is determined according to level TV-L E-14 of
German public sector. The exact amount of salary depends on experience,
family circumstances, tax classification and other factors. The position
is available with immediate effect.

Interested individuals should apply using the official application
portal of the vacancy
(https://stellenportal.tuhh.de/jobposting/186edde4ca4eff6cd15f992d624b4fee4f4baec8).
<https://stellenportal.tuhh.de/jobposting/186edde4ca4eff6cd15f992d624b4fee4f4baec80>
Applications can also be submitted in English. Applications received by
21 November 2019 will receive full consideration. Applications should
include a curriculum vitae, research and teaching statements, and a
publication list. In addition, contact details of letter writers may be
submitted at the candidate's discretion. Any questions regarding the
position should be directed to Matthias Mnich (matthias.mnich@tuhh.de).

Hamburg University of Technology regards diversity as an integral part
of academic excellence and is committed to employment equity and
accessibility for all employees. As such, we encourage applications from
women, persons with disabilities, members of diverse gender identities,
and others who may contribute to the further diversification of ideas.
In Hamburg, you will have the opportunity to work across disciplines and
collaborate with an international community of scholars and a diverse
student body.

**********************************************************
*
* 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, November 7, 2019

[DMANET] LATIN 2020 Deadline extended

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

Dear colleagues,

We have decided to extend the submission deadline of LATIN 2020.

Please find below the 2nd call for papers with the new dates.

Yours faithfully,

Yoshiharu Kohayakawa
Flávio Keidi Miyazawa

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

SECOND CALL FOR PAPERS

LATIN 2020

The 14th Latin American Theoretical Informatics Symposium
May 25 to 29, 2020 --- São Paulo, Brazil

https://latin2020.ime.usp.br

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

LATIN (Latin American Theoretical Informatics) started in 1992, when a
group of Latin American researchers, under the leadership of Imre
Simon (São Paulo, Brazil), launched the first of a series of symposia
in theoretical computer science, to be held in Latin America. This is
the 14th meeting of the series, after São Paulo, Brazil (1992),
Valparaiso, Chile (1995), Campinas, Brazil (1998), Punta del Este,
Uruguay (2000), Cancún, Mexico (2002), Buenos Aires, Argentina (2004),
Valdivia, Chile (2006), Búzios, Brazil (2008), Oaxaca, Mexico (2010),
Arequipa, Peru (2012), Montevideo, Uruguay (2014), Ensenada, Mexico
(2016) and Buenos Aires, Argentina (2018).

In 2020, LATIN will be held at the University of São Paulo, Brazil.

For further information on LATIN, visit http://latintcs.org

----------------------------------------------------------------------
SCOPE AND TOPICS
----------------------------------------------------------------------

LATIN is devoted to different areas in theoretical computer science
including, but not limited to: algorithms (approximation, online,
combinatorial optimization, etc.), algorithmic game theory, analytic
combinatorics and analysis of algorithms, automata theory and formal
languages, combinatorics and graph theory, computational algebra and
number theory, computational complexity, computational biology,
computational geometry, data structures and information retrieval,
foundations of data science and theoretical machine learning, parallel
and distributed computing, quantum computing, randomization and
pseudorandomness, sublinear algorithms and testing.

----------------------------------------------------------------------
INVITED SPEAKERS
----------------------------------------------------------------------

Maria-Florina Balcan, Carnegie Mellon University
Nikhil Bansal, CWI and Eindhoven University of Technology
Maria Chudnovsky, Princeton University
Nicole Immorlica, Microsoft Research
Eduardo Sany Laber, Pontifical Catholic University of Rio de Janeiro
Alexander Razborov, The University of Chicago
Luca Trevisan, Bocconi University
Bianca Zadrozny, IBM Research Brazil

----------------------------------------------------------------------
IMPORTANT DATES
----------------------------------------------------------------------

Paper Abstract Submission: 17 November 2019
Paper Submission: 24 November 2019
Notification of Paper Authors: 10 February 2020
Camera Ready: 2 March 2020

------

Poster Abstract Submission: 23 February 2020
Notification of Poster Authors: 17 March 2020
Poster Final Version Submission: 20 March 2020

All deadlines are AOE time zone.

----------------------------------------------------------------------
PROCEEDINGS
----------------------------------------------------------------------

As in previous editions, the proceedings of LATIN 2020 will be
published in Springer's Lecture Notes in Computer Science. Visit the
LATIN webpage at SpringerLink:
https://link.springer.com/conference/latin

----------------------------------------------------------------------
SUBMISSION
----------------------------------------------------------------------

The submission process must be completed electronically through
EasyChair (https://easychair.org/conferences/?conf=latin2020).

Submitted papers are limited to twelve (12) single-column letter-size
pages in Springer LNCS format, and must be written in English. For
the submission guidelines, please check the LATIN 2020 website at
https://latin2020.ime.usp.br

----------------------------------------------------------------------
POSTER SESSIONS
----------------------------------------------------------------------

LATIN 2020 will have poster sessions to facilitate and promote
attendance. We especially encourage students and young researchers to
submit their preliminary findings and on-going work covering all the
subjects of LATIN.

Poster authors are required to submit a two-page abstract of their
work. All submissions will be peer-reviewed, and at least one author
of each abstract accepted to the poster session must present the work
personally at the poster session of LATIN 2020.

For details, please visit https://latin2020.ime.usp.br

----------------------------------------------------------------------
MINICOURSES
----------------------------------------------------------------------

We plan to have minicourses during LATIN2020. Details will be
available on the LATIN 2020 website.

----------------------------------------------------------------------
PROGRAMME COMMITTEE
----------------------------------------------------------------------

Yoshiharu Kohayakawa (Chair), Universidade de São Paulo, Brazil
Flávio Keidi Miyazawa (Chair), Universidade Estadual de Campinas, Brazil

* Andris Ambainis, University of Latvia, Latvia
* Frédérique Bassino, Université Paris 13, France
* Flavia Bonomo, Universidad de Buenos Aires, Argentina
* Prosenjit Bose, Carleton University, Canada
* Olivier Carton, Université Paris Diderot, France
* Ferdinando Cicalese, University of Verona, Italy
* Jose Correa, Universidad de Chile, Chile
* Pierluigi Crescenzi, Université Paris Diderot, France
* Luc Devroye, McGill University, Canada
* Martin Dietzfelbinger, TU Ilmenau, Germany
* David Fernández-Baca, Iowa State University, USA
* Esteban Feuerstein, Universidad de Buenos Aires, Argentina
* Eldar Fischer, The Technion, Israel
* Pierre Fraigniaud, Université Paris Diderot, France
* Martin Fürer, The Pennsylvania State University, USA
* Anna Gál, The University of Texas at Austin, USA
* Ron Holzman, The Technion, Israel
* Marcos Kiwi, Universidad de Chile, Chile
* Teresa Krick, Universidad de Buenos Aires, Argentina
* Cláudia Linhares Sales, Universidade Federal do Ceará, Brazil
* Kazuhisa Makino, Kyoto University, Japan
* Conrado Martínez, Universitat Politècnica de Catalunya, Spain
* Marco Molinaro, Pontifical Catholic University of Rio de Janeiro, Brazil
* Veli Mäkinen, University of Helsinki, Finland
* Gonzalo Navarro, Universidad de Chile, Chile
* Rolf Niedermeier, TU Berlin, Germany
* Rafael Oliveira, University of Toronto, Canada
* Roberto Imbuzeiro Oliveira, IMPA, Brazil
* Daniel Panario, Carleton University, Canada
* Alessandro Panconesi, Sapienza Università di Roma, Italy
* Pan Peng, University of Sheffield, UK
* Ely Porat, Bar-Ilan University, Israel
* Paweł Prałat, Ryerson University, Canada
* Pavel Pudlák, Czech Academy of Sciences, Czech Republic
* Svetlana Puzynina, Saint Petersburg State University, Russia
* Sergio Rajsbaum, Universidad Nacional Autónoma de México, Mexico
* Andrea Richa, Arizona State University, USA
* Rahul Santhanam, University of Oxford, UK
* Asaf Shapira, Tel Aviv University, Israel
* Alistair Sinclair, UC Berkeley, USA
* Mohit Singh, Georgia Tech, USA
* Maya Stein, Universidad de Chile, Chile
* Jayme Luiz Szwarcfiter, Universidade Federal do Rio de Janeiro, Brazil
* Eli Upfal, Brown University, USA
* Jorge Urrutia, Universidad Nacional Autónoma de México, Mexico
* Brigitte Vallée, Université de Caen, France
* Mikhail V. Volkov, Ural Federal University, Russia
* Raphael Yuster, University of Haifa, Israel

----------------------------------------------------------------------
IMRE SIMON TEST-OF-TIME AWARD
----------------------------------------------------------------------

As of 2012, the Imre Simon Test-of-Time Award is given to the LATIN
paper deemed most influential among all those published at least ten
years prior to the current edition of the conference. Papers
published in the LATIN proceedings up to and including 2010 are
eligible for the 2020 award.

----------------------------------------------------------------------
BEST PAPER AWARD
----------------------------------------------------------------------

Papers presented at the conference will be considered for the LATIN
2020 Alejandro Lopez-Ortiz Best Paper Award.

----------------------------------------------------------------------
ORGANIZING COMMITTEE
----------------------------------------------------------------------

C. N. Lintzmayer (co-chair), UFABC; G. O. Mota (co-chair), UFABC;
J. C. de Pina (co-chair), USP; Y. Wakabayashi (co-chair), USP;
M. K. de Carli Silva, USP; C. E. Ferreira, USP; C. G. Fernandes, USP;
A. Mandel, USP; D. M. Martin, UFABC; L. L. C. Pedrosa, Unicamp;
S. Robins, USP; C. M. Sato, UFABC; R. C. S. Schoeury, Unicamp;
E. C. Xavier, Unicamp.

----------------------------------------------------------------------
LATIN STEERING COMMITTEE
----------------------------------------------------------------------

Kirk Pruhs (chair), University of Pittsburgh, USA; Michael A. Bender,
Stony Brook University, USA; Cristina G. Fernandes, Universidade de
São Paulo, Brazil; Joachim von zur Gathen, Bonn-Aachen I.C.I.T.,
Germany; Evangelos Kranakis, Carleton University, Canada; Alfredo
Viola, Universidad de la República, Uruguay.

**********************************************************
*
* 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] reminder: call for papers, IPCO XXI

Conference on Integer Programming and Combinatorial Optimization
IPCO XX1, June 8–10, 2020
London School of Economics and Political Science
Submission deadline: November 29, 2019 (23:59 EST)

The IPCO conference is a forum for researchers and practitioners working on
various aspects of integer programming and combinatorial optimization. The
aim is to present recent developments in theory, computation, and
applications. The scope of IPCO is viewed in a broad sense, to include
algorithmic and structural results in integer programming and combinatorial
optimization as well as revealing computational studies and novel
applications of discrete optimization to practical problems.

Authors are invited to submit extended abstracts of their recent work by
November 29, 2019 (23:59 EST); see the submission guidelines below for more
information. The Program Committee will select the papers to be presented
on the basis of the submitted extended abstracts. Contributions are
expected to be original, unpublished and not submitted to journals or
conferences with proceedings before the notification date (January 31,
2020). Papers violating these requirements will not be considered by the
Program Committee.

During the conference, approximately 33 papers will be presented in
single-track sessions. Each lecture will be 30 minutes long. The
proceedings will be published as a volume of Springer Lecture Notes in
Computer Science. They will contain extended abstracts of all accepted
submissions. It is expected that revised and extended versions will
subsequently be submitted for publication in appropriate journals.

Program Committee
Tobias Achterberg, Gurobi & ZIB
Alper Atamtürk, UC Berkeley
Amitabh Basu, Johns Hopkins U.
Daniel Bienstock, Columbia U. (Programme Committee Chair)
Claudia D'Ambrosio, LIX Ecole Polytechnique
Daniel Dadush, CWI
Alberto del Pia, U. of Wisconsin-Madison
Santanu S. Dey, Georgia Tech
Yuri Faenza, Columbia U.
Jon Lee, U. of Michigan
Jeff Linderoth, U. of Wisconsin-Madison
Michele Monaci, U. of Bologna
Sebastian Pokutta, Georgia Tech
Eduardo Uchoa, PUC-Rio
László Végh, LSE
Giacomo Zambelli, LSE

Best Paper Award
For the first time in its history, IPCO will present a Best Paper Award, to
be chosen by the program committee.

Submission Guidelines
The extended abstract — in Springer LNCS format — should not exceed 10
pages plus references. An appendix of at most 2 pages for more detailed
proofs (e.g., main lemma) and / or detailed computational results is
welcome and, if present, will be refereed and published. Submissions not
following these guidelines will not be considered. Full versions of the
submitted papers freely accessible in on-line repositories are welcome.

The first page should contain the title, the authors with their
affiliations, and a short abstract. The introduction should be a broadly
accessible exposition of the main ideas and techniques used to achieve the
results, including motivation and a clear comparison with related work. In
particular, the introduction should convey to the non-expert why the paper
should be accepted to IPCO. Submitted extended abstracts will be refereed
according to the standards of top tier refereed conferences. The main
acceptance criteria used by the Program Committee are the quality and
originality of the research, plus its interest to people working in the
field. It is crucial that the importance of the work is understood by the
committee. The claimed results must be correct and new.

A paper will not be considered in any of the following cases:
it has been already published;
it has been submitted to a journal or to another conference with
proceedings before the notification date;
it has a member of the Program Committee among its authors;
it is submitted after the submission deadline.

Authors must use LaTeX2e together with the LNCS class file from Springer.
Please check the Springer Information for LNCS Authors for additional
information (bleow).

Submission website:
Abstracts should be submitted through the submission website,
https://easychair.org/cfp/IPCO21
Abstracts should be submitted using the LNCS template for November 29, 2020
Information for authors and template available here:
https://www.springer.com/us/computer-science/lncs/conference-proceedings-guidelines

Conference website: http://www.lse.ac.uk/IPCO-2020

www.columbia.edu/~dano

**********************************************************
*
* 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] Assistant Professor in Optimization at DKE, Maastricht University, Netherlands

Dear all,

The Department of Data Science and Knowledge Engineering (DKE) at Maastricht University in the Netherlands is looking
for an Assistant Professor in Optimization (tenure track).

Full details of the position, and an explanation of how to apply, are available here:-

https://www.academictransfer.com/en/287137/assistant-professor-in-optimization-tenure-track/

For your convenience a subset of the information on that page has been partially reproduced below, but the academic transfer page remains the official source of information for this position.

Kind regards,

Dr. Steven Kelk

http://skelk.sdf-eu.org
https://www.maastrichtuniversity.nl/research/department-data-science-and-knowledge-engineering

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

Assistant Professor in Optimization (tenure track)

Deadline: 31 dec 2019

We are searching for a new colleague in the area of Optimization. Next to being embedded in our department at Maastricht University, where you will contribute to ongoing research and education, our new colleague can increase their research impact via a joint industry position.

* Job description

We are the Department of Data Science and Knowledge Engineering (DKE) at Maastricht University, the Netherlands: an international community of ~50 researchers at various stages of their career, embedded in the Faculty of Science and Engineering (FSE). Our department has nearly 30 years' experience with research and teaching in the fields of Artificial Intelligence, Computer Science and Applied Mathematics. To strengthen our team, we are looking for an assistant professor who will work on Optimization.

(The Department of Data Science and Knowledge Engineering is growing rapidly. This position is one of multiple job openings: you are more than welcome to browse through our other vacancies.)

* Assistant professor in Optimization

The focus of this position is on the optimization of all kind of dynamic processes, running from industrial production lines to improving customer satisfaction in healthcare systems or efficient routing of traffic in customer service centers. These days, sensor data and other digital measurements allow for almost real-time optimization of these processes. Through this position, we want to blend expertise on traditional methods from operations research (Markov chains, queueing models, systems and control, planning and scheduling) with expertise on machine learning and data extraction.

In addition to your research, you will contribute to top-rated education in our department. We offer one bachelor's programme and two master's programmes, all of which are nationally ranked #1 in their category and involve a mix of Artificial Intelligence, Computer Science and Applied Mathematics.

* Embedding

This position builds on, and benefits from, foundational expertise at DKE. Our research centers around nine established themes, which includes the theme Algorithms, Complexity and Optimization. Researchers typically work on multiple themes at the same time to ensure knowledge transfer across (sub)disciplines. Outside of the department, we offer an extensive, worldwide network of collaborators in the public and private sector, as well as a firm rooting in national and international AI networks. Facilities include access to a supercomputer cluster.

This position is offered with the opportunity for a joint-appointment with industry. The joint appointment program creates an extra opportunity for the candidate to work for part of their time directly for a company. If accepted by the candidate and the company, this will create multiple benefits for all parties. It allows the candidate to have greater impact for their research output via the company, which can bring research results to real-life. The candidate can experience industrial research and be adequately compensated. Moreover, the candidate is in a unique position to help build a close collaboration between the university and the company, fostering a collaborative environment and creating opportunities for joint PhD research 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] Associate professor in Algorithms, Bergen

We are seeking for a new colleague who can strengthen the Algorithms group at the University of Bergen. The position is at associate professor level.
For the full announcement, see here
https://www.jobbnorge.no/en/available-jobs/job/177203/associate-professor-in-algorithms <https://www.jobbnorge.no/en/available-jobs/job/177203/associate-professor-in-algorithms>


Please feel free to contact me for further inquiries.

With best regards,
Fedor

**********************************************************
*
* 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] WINE 2019 registration

Call for participation at WINE 2019, the 15th Conference on Web and
Internet Economics (Columbia University, New York, Dec 10-12, 2019)

https://wine2019.cs.columbia.edu/

Reminder that the registration deadline is November 14th - please
register by then!


--
Prof. Paul W. Goldberg, Dept of Computer Science, Oxford
Room 255, Wolfson Building
Office phone +44 (0)1865 610756

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