Wednesday, November 29, 2023

[DMANET] OLISSIPO Winter School | Mathematical modelling of inter-cell and communities’ interactions with a focus on metabolism | February 6-9, 2024

Dear all,

Please find below an announcement of the OLISSIPO Winter School on
Mathematical modelling of inter-cell and communities' interactions with
a focus on metabolism, which will be held in Lisbon, Portugal, between
February 6-9, 2024.

The school will involve four speakers, experts in Computer Science and
Computational Biology.

Hoping to see you there!

Kind regards,
Susana Vinga

----

Dear colleagues and friends,

We are happy to announce the OLISSIPO School on Mathematical modelling
of inter-cell and communities' interactions with a focus on metabolism,
which will be held in Lisbon, Portugal, at INESC-ID, between February
6-9, 2024.

OLISSIPO Winter School
Mathematical modelling of inter-cell and communities' interactions with
a focus on metabolism
February 6-9, 2024 | INESC-ID, Lisbon, Portugal

Keynote speakers:

Prof. Jörg Stelling [1], ETH Zürich, Switzerland
Prof. Jürgen Zanghellini [2], University of Vienna, Austria
Prof. Kiran Patil [3], University of Cambridge, UK
Prof. Steffen Klamt [4], Max Planck Institute for Dynamics of Complex
Technical Systems, Germany

See the preliminary agenda at
https://olissipo.inesc-id.pt/olissipo-school-on-mathematical-modelling/
[5].

Registration is free* but mandatory for organizational purposes. Seating
is limited and on a first-come, first-served basis.
Please register here https://forms.gle/HBVK9vpLoEEjxJ7V8 [6] until
January 12, 2024.

_*Lunches and coffee-breaks from Tuesday to Friday are included,
accommodation and flights are not. The social event and dinner on
Wednesday have limited seats (requires confirmation from the
organisation)._

We will have slots for flash talks (3-10 min, depending on the number of
submissions) to present yourself and the work you have been developing
in your research.

Please do not hesitate to contact us if you have any questions.

We are looking forward to meeting you all in Lisbon.

Best wishes,

The OLISSIPO Coordination Team

Susana Vinga [7] (INESC-ID), Marie-France Sagot [8] (Inria), Niko
Beerenwinkel [9] (ETH Zürich), Wolfgang Huber [10] (EMBL)

Sara Tanqueiro (INESC-ID)
___________________________________________________________________

OLISSIPO

Funded by the European Commission within its H2020 Research and
Innovation programme "Spreading Excellence and Widening
Participation|Twinning", OLISSIPO aims to enhance the competences in
Computational Biology at INESC-ID in Lisbon, towards the creation of an
international pole of excellence in multi-disciplinary science in
Portugal.

Rua Alves Redol, 9 | 1000-227 Lisboa
Email: olissipo@inesc-id.pt
Website: https://olissipo.inesc-id.pt/
Twitter: https://twitter.com/Olissipo_eu
Linkedin: https://www.linkedin.com/in/olissipo/ [11]

--
Prof. Susana Vinga
Instituto Superior Técnico, Universidade de Lisboa
INESC-ID / IDMEC
URL: http://web.ist.utl.pt/~susanavinga/
Rua Alves Redol 9, 1000-029 Lisboa, Portugal
Tel.: (+351) 213 100 384
Email: susanavinga@tecnico.ulisboa.pt


Links:
------
[1] https://csb.ethz.ch/
[2] https://chemnet.univie.ac.at/team/juergen-zanghellini/
[3] https://www.mrc-tox.cam.ac.uk/staff/kiran-patil
[4] https://www.mpi-magdeburg.mpg.de/klamt
[5]
https://olissipo.inesc-id.pt/olissipo-school-on-mathematical-modelling/
[6] https://forms.gle/HBVK9vpLoEEjxJ7V8
[7] http://web.ist.utl.pt/susanavinga/
[8] https://team.inria.fr/erable/en/marie-france-sagot/
[9]
https://bsse.ethz.ch/department/people/detail-person.MTQ5NDE3.TGlzdC8yNjY5LDEwNjI4NTM0MDk=.html
[10] https://www.embl.de/research/units/genome_biology/huber/
[11] https://www.linkedin.com/in/olissipo/
**********************************************************
*
* 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, November 28, 2023

[DMANET] CFP: DCFS 24

CALL FOR PAPERS
DCFS 2024

International Conference on Descriptional Complexity of Formal Systems
Santa Clara University
June 25 - 27, 2024

https://sites.google.com/scu.edu/dcfs24
dcfs2024@gmail.com

Paper submission deadline: March 1, 2024
Author notification: April 2, 2024
Camera-ready deadline: April 11, 2024


The 26th edition of DCFS is organized by the Department of Mathematics
and Computer Science of Santa Clara University, USA and by the IFIP
Working Group 1.02 "Descriptional Complexity".

TOPICS

Original research papers concerning the descriptional complexity of
formal systems and structures (and its applications) are sought. Topics
include, but are not limited to:

  Automata, grammars, languages and other formal systems; various modes
of  operations and complexity measures.

  Succinctness of description of objects, state-explosion-like phenomena.

  Circuit complexity of Boolean functions and related measures.

  Size complexity of formal systems.

  Structural complexity of formal systems.

  Trade-offs between computational models and mode of operation.

  Applications of formal systems -- for instance in software and
hardware testing, in dialogue systems,  in systems modeling or in
modeling natural languages -- and their complexity constraints.

  Co-operating formal systems.

  Size or structural complexity of formal systems for modeling natural
languages.

  Complexity aspects related to the combinatorics of words.

  Descriptional complexity in resource-bounded or structure-bounded
environments.

  Structural complexity as related to descriptional complexity.

  Frontiers between decidability and undecidability.

  Universality and reversibility.

  Nature-motivated (bio-inspired) architectures and unconventional
models of computing.

  Blum Static (Kolmogorov/Chaitin) complexity, algorithmic information.

PROGRAM COMMITTEE

    Henning Bordihn (University of Potsdam, Germany), co-chair

    Pascal Caron (University of Rouen, France)

    Szilárd Fazekas (Akita University, Japan)

    Yo-Sub Han (Yonsei University, Republic of Korea)

    Galina Jirásková (Slovak Academy of Sciences, Slovakia)

    Stavros Konstantinidis (Saint Mary's University, Canada)

    Martin Kutrib (University of Giessen, Germany)

    Ian McQuillan (University of Saskatchewan, Canada)

    Timothy Ng (University of Chicago, USA)

    Alexander Okhotin (St. Petersburg State University, Russia)

    Giovanni Pighizzini (University of Milan, Italy)

    Chris Pollett (San Jose State University, USA)

    Luca Prigioniero (Loughborough University, UK)

    Bala Ravikumar (Sonoma State University, USA)

    Rogérior Reis (University of Porto, Portugal)     Kai Salomaa
(Queen's University, Canada)

    Shinnosuke Seki (The University of Electro-Communications, Japan)

    Howard Straubing (Boston College, USA)

    Nicholas Tran (Santa Clara University, USA), co-chair

    György Vaszil (University of Debrecen, Hungary)

    Hsu-Chun Yen (National Taiwan University, Taiwan)


PAPER SUBMISSION

Submissions to DCFS must not exceed 12 pages in Springer-Verlag's
Lecture Notes style including bibliography. If the authors believe that
more details are essential to substantiate the main claims, they may
include a clearly marked appendix that will be read at the discretion of
the program committee. Simultane\
ous submissions of papers to any other conference with published
proceedings or submitting previously published papers is not allowed. 
Papers should be submitted electronically as a PDF document to

https://www.easychair.org/conferences/?conf=dcfs24.

After logging in to your EasyChair account, select the "New Submission"
menu item on the top of the page.  If you do not have an EasyChair
account, follow the instructions on the login page.  The proceedings
will be published by Springer-Verlag in the series Lecture Notes in
Computer Science. In addition, a special issue of Journal of Automata,
Languages, and Combinatorics will be devoted to revised and extended
versions of selected papers of the conference.

**********************************************************
*
* 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 MINLP at the Politecnico di Milano

The Optimization group at the Dept. of Electronics, Information, and Bioengineering of the Politecnico di Milano invites applications for a postdoctoral position in the area of Mixed Integer Nonlinear Optimization, with special focus on ACOPF problems in power networks. The postdoc is part of the HEXAGON project funded by the PRIN-PNRR program. This is a two-year position starting in February 2024.

A solid background in Optimization is required, with a PhD-level knowledge of nonlinear optimization, mixed integer linear optimization, and/or MINLO being desirable. Strong communication skills in English are required. As the project will focus on solution algorithms for a well-known class of optimization problems, some experience on the development of solver components and knowledge of C/C++ and/or Python are necessary.

A salary of 32,000 euro/year is offered. Applications must be submitted following the procedure described here:

https://www.polimi.it/fileadmin/user_upload/Lavora-con-noi/allegati_bandi_pnrr/BANDO_DEIB_139_2023_eng.pdf

Please note that the (non-extendable) deadline for application is 20 December 2023.

The Politecnico di Milano boasts one of the best Engineering schools in Europe, with several groups at the forefront of research in various fields and a large international community both in students and faculty. Milan is a vibrant, lively city with a creative, cosmopolitan, and industrious spirit.

For more information, please contact

Pietro Belotti
Dept. of Electronics, Information, and Bioengineering
Politecnico di Milano
email: pietro.belotti@polimi.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] BCC thesis prize 2024

The British Combinatorial Committee (BCC) announces its second "BCC
PhD Prize in Combinatorics", to be awarded at the next British
Combinatorial Conference for an outstanding UK PhD thesis in the field
of Combinatorics, broadly interpreted. Details concerning eligibility,
the nomination process, dates, and the award of the prize can be found
below and at https://britishcombinatorial.wordpress.com/phd-thesis-prize/.

Eligibility:

A PhD thesis is eligible for the prize if the PhD was awarded by a UK
university in the two years prior to the cutoff date (inclusive)
specified below, and if the topic of the PhD thesis is in the area of
Combinatorics.

Nominations:

Nominations are made by the thesis supervisor by email to Prof Jozef
Skokan (j.skokan@lse.ac.uk) with subject "BCC prize 2024" and the
following documents attached in electronic form:

- the thesis,
- a nomination letter by the supervisor,
- a reference letter by an external examiner,
- a formal confirmation by the university of award of or eligibility
for the award of the PhD.

This confirmation should be dated between 1 January 2022 and 31 December 2023.

The abstract of the thesis should be added to the main body of the
submission email.

Dates:

The cutoff date determining eligibility is 31 December 2023.

The submission deadline for nominations is 19 January 2024.

Prize Award:

The prize will be awarded at the 30th British Combinatorial Conference
at Queen Mary University of London (1st July - 5th July 2024). The
prize winner will normally be expected to attend this meeting, and
will be invited to give a prize lecture.

Funding:

The prize (£1000) is funded by the Heilbronn Institute for
Mathematical Research and the Institute of Combinatorics and its
Applications, and supported by Cambridge University Press.

-------------------------
Prof Jozef Skokan
Department of Mathematics, LSE
j.skokan@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] Special issue: Learning based Solution Techniques for Optimization in Logistics and Transportation Systems (TRE)

Dear all

Apologies for cross-posting.

This Special Issue invites authors to submit articles focusing on
optimization methods that rely on learning techniques to address problems
in logistics and transportation. Theoretical papers are acceptable,
provided that they have case studies/numerical examples in the
logistics/transportation field; models and algorithms that utilize learning
to better understand the problem structure, physics, and behavior fall in
the scope of the special session. We are particularly interested in
contributions that are comprehensive enough to also cover or address
problems in logistics and supply chains, that consider sustainability, IoT,
electric vehicles, energy efficiency, and other relevant areas. We welcome
both original research and review articles. Possible contributions may
include, but are not limited to, the following topics:

§ Enhancing classical methods via ML

§ Markov Decision Process

§ Neural methods

§ Learning for primal-dual techniques

§ Reinforcement learning based methods,

§ Novel classes of methods.

*Manuscript submission information:*

Submission process and papers must adhere to the standard author guidelines
of *Transportation Research Part E: Logistics and Transportation Review*,
which can be found at:
https://www.elsevier.com/journals/transportation-research-part-e-logistics-and-transportation-review/1366-5545/guide-for-authors

Submitted articles must not have been previously published or currently
submitted for journal publication elsewhere. Please follow the submission
guidelines, which can be found from the journal website:
https://www.editorialmanager.com/tre/default1.aspx

All submissions to the Special section should be submitted via the
*Transportation
Research Part E* online submission system. When you submit your paper to
the Special section, please choose article type "MLOPT23" Otherwise, your
submission will be handled as a regular manuscript. Papers submitted to the
Special section will be subjected to normal thorough double-blind review
process.

*Keywords:*

Logistics, transportation systems, machine learning, optimization,
combinatorial optimization, solution methods

Learn more about the benefits of publishing in a special issue:
https://www.elsevier.com/authors/submit-your-paper/special-issues

*Guest editors:*

- Shahin Gelareh - Universite d'Artois, Bethune, France (
shahin.gelareh@univ-artois.fr )


- Nelson Maculan - Federal University of Rio de Janiero (
maculan@cos.ufrj.br)


- Rahimeh Neamatian Monemi - Predictim Globe (contact@predictim-globe.com
)


- Pedro Henrique González - Federal University of Rio de Janeiro (
pegonzalez@cos.ufrj.br)


- Xiaopeng Li - University of Wisconsin-Madison, Madison, WI, United
States ( xli2485@wisc.edu )


- Fatmah Almazkoor - University of Kuwait ( fatmah.almazkoor@ku.edu.kw)


- Ran Yan - School of Civil and Environmental Engineering, Nanyang
Technological University ( ran.yan@ntu.edu.sg )

*Deadline: Feb 1, 2024*

**********************************************************
*
* 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] Research Assistant Positions within Programming at the University of Bergen (Remote work also possible within Norway) - Deadline: December 10.

We are looking for exceptionally talented bachelor's or master's students
in computer science, mathematics or related areas to work as research
assistants in programming at the University of Bergen.

The duration of each position is 6 months and the workload corresponds to
up to 30% of a full time research assistant position (SKO 1019 or SKO
1020).

During the position, you will be employed by the Institute of Informatics
at the University of Bergen. Nevertheless, the position is totally
compatible with remote work *within Norway*. Therefore, exceptionally
qualified students from anywhere in Norway are encouraged to apply.

*DESCRIPTION OF THE WORK*

As a research assistant you will be responsible for three tasks:

1) Implementation of a specific algorithm for a specific combinatorial
problem.
2) Experimental evaluation of the implementation.
3) Writing a report describing the problem, the algorithm, relevant details
of the implementation, and the experimental results.
4) Participation in research activities such as reading research papers,
etc.

The duration of the position is 6 months and the workload corresponds to up
to 30% of a full time position. The work is split into a sequence of
milestones. You will have total freedom to organize your own schedule
towards completing the milestones. Eventual meetings will happen online.

*REQUIRED QUALIFICATIONS*

You should be currently enrolled as a bachelor's or master's student in
computer science or mathematics in a Norwegian institution of higher
education. Additionally, the following are required qualifications for the
position.

1) Exceptional programming skills in C++.
2) Strong experience on implementation of algorithms.
3) Strong teamwork and collaborative mindset.
4) Strong ability to plan and deliver work in an independent and organized
way.

Candidates with experience with participation in national/international
programming competitions will be given priority.
Candidates with a high score in some code challenge website (such as
codeforces, leetcode, topcoder, etc) will also be given priority.

*HOW TO APPLY*

1) Please send your CV to mateus.oliveira@uib.no
2) Please include in your CV evidence of strong experience in programming
in C++, such as links to your code repositories, ranks in
national/international competitions, links to your profiles in programming
websites, etc.
3) Please include in your email a short justification for why you are
suitable for the position.

*DEADLINE*

Applications that arrive by December 10 will be given full consideration.
Nevertheless, applications will be considered until the positions are
fulfilled.

Looking forward for your application,

Mateus de Oliveira Oliveira
-------------------------------------
Senior Lecturer - Department of Computer and System Sciences, Stockholm
University, Sweden
Associate Professor - Department of Informatics, University of Bergen,
Norway
oliveira@dsv.su.se / mateus.oliveira@uib.no
https://autoproving.org/mateus-de-oliveira-oliveira/

**********************************************************
*
* 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 Positions at KFUPM

Dear DMANET Community,

We are pleased to announce a faculty position opening in the Department of Mathematics at King Fahd University of Petroleum & Minerals (KFUPM), Dhahran, Saudi Arabia. The department is inviting applications for Assistant/Associate/Full Professor positions in Mathematics, Statistics, and Actuarial Science, with special consideration given to the areas of Data Science, Financial Mathematics, Actuarial Science, Graph Theory, and Combinatorics.
Qualifications:
        A conferred Ph.D. or equivalent international doctoral degree is required. Junior candidates should demonstrate outstanding promise in research and a         strong interest and ability in teaching. Senior candidates must have demonstrated excellence in research and a strong commitment to graduate and         undergraduate teaching.

Duties:         The responsibilities include research, undergraduate and graduate teaching, and departmental, university, and professional service.

More information about KFUPM and the Math Department can be found here and here, respectively.
Required Documents:

- Letter of application
- Curriculum Vitae (including teaching experience, list of publications, area of specialization, institution & date of Ph.D., and Ph.D. advisor)
- Brief teaching statement

- Brief research statement
- Copies of all BS/MS/Ph.D. transcripts
- Three letters of recommendations
Additional Information about KFUPM:
- 104th Worldwide Mathematics Department ranking by QS (2023)
- 3rd Worldwide ranking by the number of US patents

- 4% Student acceptance rate
Grants & Funds:
- Generous research grant opportunities
- Funds for conferences and research visitors
- Opportunities to hire Master, PhD, and postgraduate researchers
Teaching:
- Flexible teaching duties
- Diverse course pool
- Curriculum update opportunities
Life:
- Fully equipped free modern housing
- State-of-the-art sports facilities
- Private beach at the Gulf Sea
- Annual return flight tickets
- Summer research funds
Location:
- Proximity to Dammam Airport with frequent flights to all major destinations
- Driving distance from Bahrain, Kuwait, UAE, and Qatar
Families:
- Modern amenities for faculty families

- International schools offering US and British curricula with school fee contributions.


We encourage qualified candidates from your network to apply for these positions and contribute to the diverse vibrant academic community at KFUPM.For more details and to apply, please visit MathJobs (Position ID: KFUPM-ASASCFP [#20460]).
Thank you for helping us spread the word about these exciting opportunities.

**********************************************************
*
* 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] Upcoming seminar: 07 December, 2023 - IoT in digital agriculture

Dear connect-them-all Viewers,

Here is the update about the upcoming talk in the connect them all seminar series.

You can participate in the live session on our youtube channel (https://www.youtube.com/live/SHqSq7iQAEU?si=Uc31oLyDl8_71Jm9) and ask your question in the live chat during the seminar.

Upcoming Seminar

• Dec 07, 2023 | 4:00 PM CET : IoT in digital agriculture

Speaker: Nathalie Mitton, Scientific head of the FUN (Future Ubiquitous Networks) research group at Inria Lille-Nord Europe.

Nathalie Mitton received the MSc and PhD. degrees in Computer Science from INSA Lyon in 2003 and 2006 respectively. She received her Habilitation à diriger des recherches (HDR) in 2011 from Université Lille 1. She is currently an Inria full researcher since 2006 and from 2012, she is the scientific head of the Inria FUN team. Her research interests focus on self-organization from PHY to routing for wireless constrained dynamic and mobile networks. She has been nominated as one of the 10 women stars in computer Science in 2020 by the IEEE Communication Society. She has published her research in more than 40 international revues and more than 120 international conferences. She coordinates the Horizon Europe SLICES-PP project, participates in different Horizon Europe projects (CyberSANE, NEPHELE) and in several program and organization committees such as Infocom (since 2019), PerCom (since 2018), DCOSS (since 2018). She also supervises several PhD students and engineers.


Abstract: Digital technologies are spreading in agriculture as they do in other economic sectors. One of the emerging technologies in agriculture is IoT and among it wireless sensors and drones. Sensors are for instance deployed to monitor the usage of intrants in different fields based on the needs of the crop. But this goes with different challenges. During this talk, we will see what are these challenges and how they could be tackled.

Check out the previous talks: connect them all seminar series

To learn more, visit our website: http://www.connect-them-all.net

Contact: connect-them-all@comnets.uni-bremen.de

Organizers of the Seminar:

Anna Förster (PhD | Comnets | Prof. at University of Bremen, Germany)

Marco Zennaro (PhD | Research Scientist at ICTP | Visiting Prof. at Kobe Institute of Computing, Japan)

Pietro Manzoni (PhD | Prof. at Universitat Politècnica de València, Spain)

Fredrik Ahlgren (PhD | Senior lecturer at Linnaeus University, Sweden)

Administrator: Saurabh Band (MSc. | Comnets | Research Assistant at University of Bremen, Germany)


Best Regards,
Connect-them-all team


**********************************************************
*
* 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] Fwd: PhD Opportunities in Optimization and Operational Research at the University of Edinburgh

PhD Opportunities in Optimization and Operational Research at the University of Edinburgh


Applications are invited for PhD studies in Optimization and Operational Research at the School of Mathematics at the University of Edinburgh for the academic year 2024-2025. A degree in mathematics or operational research is not an application requirement. Our PhD students have backgrounds in engineering, mathematics, computer science, business, physical sciences, or related fields.

The School of Mathematics offers several fully funded PhD studentships each year. Students receiving School funding are awarded a competitive stipend equivalent to UKRI stipend rates (£18,622 per year for the current academic year) for a period of 4 years plus tuition fee waiver. All applications received by 22 January 2024 will receive full consideration for funding. Later applications will be considered until all positions are filled.


Why Study Optimization and Operational Research in Edinburgh?

The Optimization and Operational Research Group<https://www.maths.ed.ac.uk/school-of-mathematics/research/data-decisions/optimization-and-operational-research/people> in the School of Mathematics is an international leader in the mathematical and computing aspects of optimization and operational research, core elements of Data Science, with members of high repute, as evidenced by Editorial Board Memberships in major international journals, international research awards, fellowships, and other peer recognitions, and memberships of prestigious international societies. The group members collaborate with several research groups in the UK and overseas, and are actively engaged in collaborations with industry and government.

Research Areas

1. Computational Optimization and Applications
2. Continuous Optimization
3. Decision Making under Uncertainty
4. Future Energy Networks
5. Integer and Combinatorial Optimization

Further Information and Application Requirements


For further information on our PhD programme and application process, please visit

https://www.maths.ed.ac.uk/school-of-mathematics/research/data-decisions/optimization-and-operational-research/phd-opportunities

For queries, please send an e-mail to Dr Alper Yildirim, our PhD representative, at E.A.Yildirim@ed.ac.uk<mailto:E.A.Yildirim@ed.ac.uk>

The University of Edinburgh is a charitable body, registered in Scotland, with registration number SC005336. Is e buidheann carthannais a th' ann an Oilthigh Dhùn Èideann, clàraichte an Alba, àireamh clàraidh SC005336.
**********************************************************
*
* 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 - WiMob 2024

[Apologies if you receive multiple copies of this message]
==========================================================
CALL FOR PAPERS
******************************************************************
The 20th International Conference on Wireless and Mobile
Computing, Networking and Communications (WiMob 2024), October 9-11, 2024
in Paris, France.

http://wimob.org/wimob2024/

******************************************************************
!**** IEEE Communications Society sponsorship under approval ****!
!**** The papers will be included in the conference proceedings, published
by IEEE CS Press (IEEE Xplore) and indexed by Scopus and Ei Compendex.


The WiMob conference is an international forum for the exchange of
experience and knowledge among researchers and developers concerned with
wireless and mobile technology. For seventeen years, the International
WiMob conference has provided unique opportunities for researchers to
interact, share new results, show live demonstrations, and discuss emerging
directions in - Wireless Communication, - Wireless Networking, Mobility and
Nomadicity, - Ubiquitous Computing, Services and Applications, - Green and
sustainable communications and network computing and - Security on Wireless
and mobile Networks.

WiMob 2024 is soliciting high quality technical papers addressing research
challenges in the areas of wireless communications, wireless networking,
mobility, nomadicity, ubiquitous computing, services and
applications. Papers should present original work validated via analysis,
simulation or experimentation. Practical experiences and Testbed trials
also are welcome.

WiMob 2024 will host FIVE parallel symposia:

1. Wireless Communications (WC)
2. Wireless Networking, Mobility and Nomadicity (WNMN)
3. Ubiquitous Computing, Services and Applications (UCSA)
4. Green and Sustainable Communications and Network computing (GSCN)
5. Security on Wireless and Mobile Networks (SWMN)

For the detailed topics, you can refer to WiMob 2024 web site.

Important Dates

- Submissions Date: May 15, 2024
- Notifications Date: July 30, 2024
- Camera ready Date: September 9, 2024
- Registrations for Authors: September 9, 2024


INSTRUCTIONS FOR PAPER SUBMISSION

Authors are required to submit fully formatted, original papers (PDF), with
graphs, images, and other special areas arranged as intended for the final
publication.
Papers should be written in English conforming to the IEEE standard
conference format (two-column, 10 pt font, etc., including figures, tables,
and references). The review submissions are limited to six pages, with two
additional pages for final papers (additional charges may apply for
additional pages).
Conference content will be submitted for inclusion into IEEE Xplore as well
as other Abstracting and Indexing (A&I) databases.
Each accepted paper must be presented at the conference by one of the
co-authors or a third party, otherwise it will not be indexed and archived
through IEEE Xplore.
Only timely submissions through EDAS will be accepted. To submit your
paper, please, click here:
https://edas.info/newPaper.php?c=30581

For more details, please visit the WiMob 2024 official website (
http://wimob.org/wimob2024) and Facebook page for WiMob 2024:
https://www.facebook.com/profile.php?id=100088392632437

ACCEPTED PAPERS
Accepted papers will be submitted for inclusion into IEEE Xplore subject to
meeting IEEE Xplore's scope and quality requirements.

**********************************************************
*
* 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] Heureka Student Award 2023 (2nd Call)

The Heureka Foundation for Environment and Mobility honors outstanding Diploma or Master's theses that are dedicated to issues in mobility in connection with environmental aspects or the use of optimization methods with the

*** Heureka Student Award 2023 ***

The selected work will be awarded prizes of 2.000€ (1. Prize), 1.000 € (2. Prize), and 500 € (3. Prize) and an invitation to the heureka'24 conference in Stuttgart (March 13/14 2024, coverage of conference fee and travel expenses).

You can submit theses from all disciplines that meet the following criteria:

- The thesis investigates a mobility topic in connection with environmental aspects or the use of optimization methods.
- The work was done at a German-speaking university.
- The work was finally handed over to the respective department / institute / professorship between 01.01.2022 and 30.09.2023.

Applications for the Student Award 2023 can be submitted by the supervisor or by the author by November 30, 2023 by e-mail to

student-award@stiftung-heureka.de<mailto:student-award@stiftung-heureka.de>

Your application should contain (see http://stiftung-heureka.de/student-award/ for details):

- A 1- to 3-page summary of the work
- A CV (max one page)
- The Diploma or Master's thesis as a PDF
- The completed cover sheet (download from the website) signed by a professor supporting the application.

The thesis and all other documents can be submitted in German or English.

The winners will be notified in mid-january 2024.

--

Prof. Dr. Ralf Borndoerfer

Zuse Institute Berlin, Optimization
Freie Universität Berlin, Mathematics
Takustrasse 7, 14195 Berlin, Germany
Fon: +49.30.84185-243
Sec: -209
Fax: -269
E-mail: mailto:borndoerfer@zib.de
WWW: http://www.zib.de/borndoerfer

**********************************************************
*
* 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 27, 2023

[DMANET] GAC Santander 2024, Deadlines approaching

Santander Workshop on Geometric and Algebraic Combinatorics
Santander, Spain, January 15-19, 2024
https://gacsantander2024.unican.es/

----------------------------------
Deadline for contribution proposals and for reduced registration is December 1st.
----------------------------------

The Santander Workshop on Geometric and Algebraic Combinatorics will take place at Universidad de Cantabria in Santander (Spain), in January 15-19, 2024, with its format consisting of two mini courses, eight invited talks, plus short talks and posters contributed from participants.

Registration
------------
Registration is now open. There is a small registration fee to cover expenses that we cannot cover via grants: 80€ (until *December 1st*) or 125€ (after Dec. 1st).

Call for contributions
----------------------
We have some slots for 30 minute talks contributed by participants, plus a poster session. Abstracts should be sent by *December 1st*.

Minicourses (3 hours each):
-----------
• Eran Nevo: "Algebraic shifting: variations and connections"
• Rekha Thomas: "Graphical Designs and Graph Sparsifiers"

Invited speakers
----------------
• Karim Adiprasito.
• Carolina Benedetti.
• Giulia Codenotti.
• Luis Ferroni.
• Michael Joswig.
• Martina Juhnke-Kubitzke.
• Benjamin Nill.

For details on how to register/apply please visit our website
https://gacsantander2024.unican.es/

Sincerely,

The organising committee
• Mónica Blanco Gómez, Universidad de Cantabria
• Arnau Padrol, Universitat de Barcelona
• Julian Pfeifle, Universitat Politècnica de Catalunya
• Vincent Pilaud, CNRS & LIX, École Polytechnique
• Francisco Santos, Universidad de Cantabria

PS: Apologies for multiple posting. If you want to be added / removed from our mailing list send a message to GACsantander2024@unican.es


**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] PhD positions at LSE in Algorithms and Optimisation

Subject: PhD positions at LSE in Algorithms and Optimisation

The Operations Research group in the Department of Mathematics at LSE
invites applications by potential PhD students to work on topics within
the research interests of the group. Such topics include: algorithmic
game theory; algorithms and theory of linear, convex and integer
programming; approximation algorithms; algorithms beyond the worst-case;
combinatorial optimisation; matroid theory; multiagent learning; network
design and optimisation; and random structures and phase transitions.
For more specifics, please consult the personal pages of the faculty:
https://www.lse.ac.uk/Mathematics/Research/Operations-Research

Applicants will be considered for LSE PhD studentships covering fees and
paying GBP £19,668/year for up to 4 years, usually tax free. The award
of these scholarships is competitive, based on academic performance.

The application deadline to be eligible for funding is *15 January 2024*.

For further information about the PhD programme and application
procedures, please see
https://www.lse.ac.uk/study-at-lse/Graduate/degree-programmes-2024/MPhilPhD-Mathematics
and
https://www.lse.ac.uk/Mathematics/Prospective-Students

For academic questions, applicants can contact Prof Gregory Sorkin
(g.b.sorkin@lse.ac.uk). For administrative and regulatory questions,
please contact Emily Jackson (e.jackson2@lse.ac.uk).

LSE values diversity and strives to promote equality at all levels. We
strongly encourage applications from women, ethnic minorities, and
members of other groups under-represented in higher education.

**********************************************************
*
* 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/Non-tenure-track positions] IBS Discrete Mathematics Group, Daejeon, Korea

THE IBS DISCRETE MATHEMATICS GROUP (DIMAG) RESEARCH FELLOWSHIP
(DUE: DEC. 3, 2023)

The IBS Discrete Mathematics Group (DIMAG, https://dimag.ibs.re.kr/) in
Daejeon, Korea invites applications for three research fellowship positions.

DIMAG is a research group that was established on December 1, 2018 at
the Institute for Basic Science (IBS), led by Prof. Sang-il Oum. DIMAG
is located at the headquarters of the Institute for Basic Science (IBS)
in Daejeon, South Korea, a city of 1.5 million people.

Successful candidates for research fellowship positions will be new or
recent Ph.D.'s with outstanding research potential in all fields of
discrete mathematics with emphasis on structural graph theory,
combinatorial optimization, matroid theory, and algorithms.

These appointments are for about two years, and the starting salary is
no less than KRW 59,000,000. The appointment is one-time renewable up to
5 years in total contingent upon the outstanding performance of the
researcher. The expected appointment date is September 1, 2024, but it
is negotiable within the same calendar year.

These are purely research positions and will have no teaching duties.

Application Deadline: December 3, 2023, Sunday. (Anywhere on Earth)

Application Instruction: https://dimag.ibs.re.kr/hiring/

--
Sang-il Oum (엄상일) https://dimag.ibs.re.kr/home/sangil/
CI, Discrete Mathematics Group, Institute for Basic Science (IBS).
KAIST Endowed Professor, Dept. of Mathematical Sciences, KAIST.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] [Scheduling seminar] Maria Elena Bruni (Uni of Calabria) | November 29 | Enhancing project resilience: a risk-averse approach to payment delays

Dear scheduling researcher,

We are delighted to announce the talk given by Maria Elena Bruni (Uni of
Calabria).
The title is " Enhancing project resilience: a risk-averse approach to
payment delays ".
The seminar will take place on Zoom on Wednesday, November 29 at 14:00 UTC.
Please check carefully the summer/winter time change in your country.

Join Zoom Meeting
https://cesnet.zoom.us/j/92922491900?pwd=TU9uWlpSSHJxSjlnUitxcjdDWkR3UT09
Meeting ID: 929 2249 1900
Passcode: 781666

You can follow the seminar online or offline on our Youtube channel as well:
https://www.youtube.com/channel/UCUoCNnaAfw5NAntItILFn4A

The abstract follows.
The onset of the pandemic and the conflict in Europe have disrupted our
society, supply chains, and economies. The effects of these global
shocks are evident in every type of project - whether related to the
energy transition, the renewal of transport infrastructure, or the
construction industry- impacted by the highest rates of inflation in
more than 30 years and by a significant cash flow crisis. In this
complex landscape, delays in payments have become a common risk factor
for projects, since they create a time lag between the expenses incurred
by the contractor and the progress payments received from the client.
The challenges associated with obtaining continuous project finances
often place undue financial strain on contractors that may seek loans
from financial institutions to maintain their daily operations. These
loans must be returned with interest, increasing financing costs, and
considerably lowering the Net Present Value. In this talk, we delve into
cash flow and project scheduling strategies to mitigate late payment
impacts and enhancing project resilience, presenting a distributionally
robust risk-averse model that minimizes the financing cost by accurately
estimating the amount and timing of the expenses and revenues throughout
the project life cycle and foreseeing possible cost overruns and cash
flow fluctuations. Joint work with Oncu Hazir.

The next talk in our series will be:
Céline Swennenhuis (ALGO, TU Eindhoven) | December 13 | A Subexponential
Time Algorithm for Makespan Scheduling of Unit Jobs with Precedence
Constraints.

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

With kind regards

Zdenek, Mike and Guohua

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

**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] Internship in France: Benders decomposition for robust assembly line balancing

An internship on Benders decomposition for robust assembly line balancing is proposed to master students in Operations Research, from February to August 2024.

Please find more details (including contacts) in the pdf file:

https://www.lamsade.dauphine.fr/~arossi/internship.pdf

Best regards,


Prof. André Rossi

Co-Head of MIDO department (Mathematics & Computer Science)

LAMSADE UMR CNRS 7243

Université Paris Dauphine - PSL

Place du Maréchal de Lattre de Tassigny

75016 PARIS

http://www.lamsade.dauphine.fr/~arossi/

Office P628 - Tel: +33 1 44 05 47 24

**********************************************************
*
* 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 24, 2023

[DMANET] CPAIOR 2024 - Submission Deadline Extended

NEW PAPER SUBMISSION DEADLINES:
Abstracts: December 4, 2023 (AoE: anywhere on Earth)
Full papers: December 11, 2023 (AoE)

****** This call can be seen online: https://sites.google.com/view/cpaior2024/call-for-papers ******

The 21st International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR 2024) will be held in Uppsala, Sweden, from May 28 to May 31, 2024. Full information is at https://sites.google.com/view/cpaior2024/.

The aim of the conference is to promote a space where researchers from Constraint Programming (CP), Artificial Intelligence (AI), and Operations Research (OR) present innovative techniques, new applications, and original cutting-edge ideas, thereby encouraging researchers from one area to learn from the others. Of particular interest to the conference are papers that integrate concepts and methodologies from these different fields, either proposing interesting new techniques for complex/practical problems or expanding our theoretical insights and cross-field understanding. However, high-quality original papers from a single area are welcome when also relevant to the other communities involved. The conference also strongly encourages regular papers or experience reports showcasing CP/AI/OR techniques on challenging real-world applications.

The program committee invites submissions that include, but are far from limited to, the following topics:
New methodologies in the interface between predictive and prescriptive pipelines, such as machine learning techniques applied to tackle optimization problems and, conversely, CP/OR techniques to address AI and machine learning tasks.
Novel relaxation and inference methods based on constraint propagation, polyhedral techniques/cutting planes, convex/second-order conic optimization, graph-based algorithms, dynamic programming, and decision diagrams for optimization.
New search perspectives involving enumeration/branch-and-bound strategies, innovative decomposition techniques (e.g., based on column generation/Benders), intelligent backtracking, incomplete search, and learning-based heuristics.
Advanced integrated methods that expose new model transformations, communication strategies across MIP/CP/SAT solvers, distributed solution techniques, and solver selection (e.g., portfolio approaches).
Innovative models and applications of CP/AI/OR techniques.
Implementation or evaluation of CP/AI/OR techniques and optimization systems.

Submissions are of two types: regular papers (submitted for publication and presentation) and extended abstracts (submitted for presentation only). The conference will recognize a distinguished paper award and a student paper award.

Instructions for Regular Papers

Regular papers present original unpublished work and can be of two types:
long papers (at most 15 pages plus references)
short papers (at most 8 pages plus references)

Both long and short papers will undergo rigorous review and are subject to the same criteria of quality. Both types are also eligible for the distinguished paper or student paper award. Short papers are particularly encouraged for interesting and novel work in progress, for which the practical or theoretical relevance is not yet fully identified.

The conference proceedings will be published in the Springer Lecture Notes in Computer Science (LNCS) series <https://www.springer.com/gp/computer-science/lncs>. All regular papers should be prepared and submitted in the format used for that series (LNCS instructions <https://www.springer.com/gp/computer-science/lncs/conference-proceedings-guidelines?referer=www.springer.de&countryChanged=true>).

Submission schedule for regular papers (both long and short):
Abstracts: December 4, 2023 (AoE: anywhere on Earth)
Full papers: December 11, 2023 (AoE)
Rebuttal phase: January 15 – 18, 2024 (AoE)
Notification: February 1, 2024

Instructions for Extended Abstracts

Extended abstracts should be one or two pages in length and may present preliminary work or work already published in other outlets. The extended abstracts are submitted for presentation only (if accepted), and will not be formally published in the LNCS conference volume. A collection of the accepted extended abstracts will be published on the conference website. A submission representing work submitted or published in another outlet should state that outlet. Extended abstracts will be reviewed to ensure appropriateness for the conference.

Submission schedule for extended abstracts:
Extended abstracts: March 6, 2024 (AoE)
Notification: April 3, 2024

Submission Process

All regular papers and extended abstracts are to be submitted electronically in PDF format by following the instructions at EasyChair: https://easychair.org/conferences/?conf=cpaior2024.

For any queries on the submission process, please contact the Program Chair, Bistra Dilkina, at cpaior2024@gmail.com <mailto:cpaior2024@gmail.com>.

Looking forward to seeing you in Uppsala!

---------------------------------------------------------
Andreína Francisco, PhD
CPAIOR Publicity Chair
Assistant Professor in Artificial Intelligence

Division of Computing Science
Department of Information Technology
Uppsala University, Sweden
---------------------------------------------------------


**********************************************************
*
* 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 Stream "OR IN PORT OPERATIONS" - EURO 2024 Copenhagen

OR IN PORT OPERATIONS Stream (EURO 2024)


33 rd European Conference on Operational Research

Copenhagen, Denmark, 30 th June - 3 rd July, 2024

https:// euro2024cph.dk//

ANNOUNCEMENT AND CALL FOR ABSTRACTS:

You are invited to take part in the OR in Port Operations stream in the 33 rd European Conference on Operational Research (Copenhagen, Denmark). This stream welcomes presentations of operations research applications related to port and hinterland transport operations. Researchers, academics, and practitioners in any branch of operations research, e.g., mathematical modelling, heuristics, decision analysis, etc., are invited to submit abstracts to the following sessions.

SESSIONS AND ORGANIZER CONTACT:

- Seaside Planning (code: 67ab9c5d). Frank Meisel, meisel@bwl.uni-kiel.de

- Port Hinterland Transport (code: 5be716c8). Zhaojie Xue, zjxue@szu.edu.cn and Jintao You, youjintao@163.com

- Sustainable Freight Transportation (code: ee4b361b). Claudia Caballini, claudia.caballini@polito.it and Mahnam Saeednia, m.saeednia@tudelft.nl

- Machine Learning and Optimization in Ports (code: 4751597b). Frederik Schulte, f.schulte@tudelft.nl

- Energy Management in Ports and Shipping (code: 12b59882). Cagatay Iris, c.iris@liverpool.ac.uk

- Container Stacking and Yard Planning (code: 95df285a). Christopher Expósito, cexposit@ull.edu.es

- Port Network Design (code: 06adb394). Eduardo Lalla, e.a.lalla@utwente.nl , Rosa G. González, rgonzalez@uandes.cl

For submitting to a session within this stream, you have to ins ert the code accompanying the title. For additional information, you can contact the corresponding session chair.

IMPORTANT DATES:

Due date for abstract submissions: March 3 rd , 2024.

Registration system open: November 5 th , 2024.

Early registration deadline: March 24 th , 2024.

Author final registration deadline: April 21 st , 2024.

Submission link: https://www.euro-online.org/conf/euro33/

POST-CONFERENCE PUBLICATION

Selected papers will be invited to submit an extended version of their work to a post-conference special issue in the International Transactions of Operations Research.

STREAM CHAIRS:

Eduardo Lalla-Ruiz, University of Twente, The Netherlands ( e.a.lalla@utwente.nl ).

Rosa G. González-Ramírez, University of los Andes, Chile ( rgonzalez@uandes.cl ).

We look forward to seeing you in Copenhagen in June 2024!


Rosa Guadalupe González Ramírez
Profesora Asociada Ordinaria
Facultad de Ingeniería y Ciencias Aplicadas
Av. Mons. Álvaro del Portillo 12.455
Las Condes, Santiago, Chile
Teléfono: +56 2 2618 2129
http://www.uandes.cl/

Compromiso UANDES: Imprime solo lo necesario y cuidemos nuestra casa común.


**********************************************************
*
* 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 Diagrams 2024

*** Call for Papers: Diagrams 2024 ***

14th International Conference on the Theory and Application of Diagrams
September 27 – October 1, 2024
University of Münster, Germany
www.diagrams-conference.org/2024<http://www.diagrams-conference.org/2024>

*** Highlights ***

- Proceedings published by Springer
- Graduate Symposium
- Three Tracks: Main, Philosophy, and Psychology and Education
- Best Paper and Best Student Paper awards
- Keynote speakers: Mateja Jamnik, Catarina Dutilh Novaes and Barbara Tversky
*****************************************************************
The Diagrams conference provides a united forum for all researchers with an interest in the study of diagrams. The conference fosters multi-disciplinarity and allows researchers from areas such as computer science, mathematics, psychology, philosophy, history (of science, art, etc.), education research, and more to meet and share their perspectives on the theory and application of diagrams.
Authors can submit to the conference through different tracks: Main track, Philosophy track and Psychology & Education track. Please submit to the track that fits the main contribution of your research best.
For information about the topics of interest for each track, see:
http://www.diagrams-conference.org/2024/index.php/calls/main-track/
http://www.diagrams-conference.org/2024/index.php/calls/philosophy/
http://www.diagrams-conference.org/2024/index.php/calls/psychology-and-education/

*****************************************************************
SUBMISSION
We invite submissions for peer review in the following submission categories:
- Long Papers (16 pages),
- Short Papers (8 pages),
- Posters (4 pages – this is both a maximum and minimum requirement),
- Abstracts, i.e. non-archival contributions (3 pages).

Submission date: March 1, 2024.
At least one author of each accepted submission is expected to attend the conference to present their research and respond to questions presented by delegates. Multiple submissions are accepted.
Long Papers, Short Papers and Posters will be published in the conference proceedings. The proceedings will be published by Springer shortly before the conference. Abstracts will not be included in the published proceedings but will be made available on the conference web site. Abstracts allow for conference presentations without the need to publish a paper.
More details, including formatting instructions and all important dates, can be found at https://diagrams-conference.org/2024.
*****************************************************************


________________________________
Mikkel Willum Johansen
Associate professor
Department of Science Education
University of Copenhagen
Tlf: (+45) 28 72 84 41

**********************************************************
*
* 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 23, 2023

[DMANET] Reminder: Call for submissions to the special issue in NACO for POP23

Dear Colleagues,

We organize a special issue in the journal Numerical Algebra, Control and Optimization (NACO, www.aimsciences.org/naco ):

Title: "Recent advances in polynomial optimization theory and methods"
Submission deadline: December 31, 2023. (Now extended to January 31, 2024)
The submission instructions for this special issue can be found at

homepages.laas.fr/henrion/pop23/Special-Issue-POP2023.pdf

We look forward to your submissions to this special issue. Please let us know if you have any questions.

Thank you very much!

Best regards,

Jiawang Nie on behalf of
Didier Henrion,
Monique Laurent,
Victor Magron,
Edouard Pauwels,
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] Second Announcement: CG Challenge 2024

Dear colleagues,

We are happy to announce the Sixth Computational Geometry Challenge,
as part of CG Week in Athens, Greece, June 10-14, 2024.

As in previous years, the objective will be to compute good solutions
to instances of a difficult geometric optimization problem.
The specific problem chosen for the 2024 Challenge is
Maximum Polygon Packing, as follows.

Description
Given a convex region, P, in the plane, and a collection
of simple polygons, Q_1,…, Q_n, each Q_i with a respective value of c_i,
the task is to find a subset S of {1,…,n} and a feasible
packing within P of the polygons Q_i (without rotation) for i in S.

Objective
Maximize the total value \sum_{i\in S} c_i of the packed polygons.

Motivation
Optimal packing problems have an extensive history in Computational
Geometry.
They are also relevant in many practical contexts.

Even the one-dimensional version of the problem (the Knapsack Problem)
is NP-hard; furthermore, some geometric variants have been shown to be
∃R-complete [1], which most likely implies that they are not in the
class NP.

Details of the competition (such as benchmark instances, data formats,
specific constraints on feasible packings, such as integer coordinates,
as well as rules for submission and evaluation) will be announced in the
coming weeks. Appropriate steps will be undertaken (e.g., by restricting
the classes of feasible subsets) to ensure straightforward, automated
verification of solutions, but also ensure original algorithmic
contributions.

The contributors with the most outstanding solutions will be recognized
at CG Week 2024 and invited to present their results, both at the event
and in the proceedings.

We are looking forward to your contributions and welcome questions
and comments!

Instances
A large number and variety of input polygonal regions P will be
provided for the competition. These will be released at a later time.
(See below.)

Credit
The underlying problem was suggested by Mikkel Abrahamsen, Copenhagen.

References
[1] M. Abrahamsen, T. Miltzow and N. Seiferth,
"Framework for ER-Completeness of Two-Dimensional Packing Problems,"
2020 IEEE 61st Annual Symposium on Foundations of Computer Science
(FOCS), 2020,
pp. 1014-1021, doi: 10.1109/FOCS46700.2020.00098.

Challenge Team
Sándor Fekete, Phillip Keldenich, Dominik Krupke, Stefan Schirra

Advisory Board
Bill Cook, Andreas Fabri, Dan Halperin, Michael Kerber,
Philipp Kindermann, Joe Mitchell, Kevin Verbeek

Timeline
A first batch of test instances will be released in late July 2023;
the actual benchmark instances for the Challenge will be released
in late September. The contest will close in early 2024.

• First test instances: July 31, 2023
• Contest instances: September 29, 2023
• Contest Closes: January 22, 2024
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] PhD studentship, University of Birmingham (theory of co-evolution)

Dear colleagues,

Applications are invited for a PhD studentship on Theory of Evolutionary
Computation in the School of Computer Science at the University of
Birmingham (UK).

Co-evolutionary algorithms are heuristic optimisation techniques,
mimicking biological principles of natural selection, e.g. for
minimax/robust optimisation and learning game playing strategies. Such
algorithms have been successfully applied to various industrial
optimisation domains. However, the theoretical understanding of these
methods has been limited.

The successful candidate will contribute, together with other project
team members and international academic and industrial partners, towards
developing the theoretical foundation necessary for the design of
efficient and reliable co-evolutionary algorithms. The PhD position is
associated with the UKRI Turing AI Acceleration Fellowship project
"Rigorous Time-Complexity Analysis of co-Evolutionary Algorithms",
providing generous travel allowance, computing facilities etc.

The ideal candidate will have a strong background in either mathematics
or computer science. The studentship covers UK "home student" rates.

To apply, please see

https://www.birmingham.ac.uk/schools/computer-science/postgraduate-research/applying-for-phd-in-computer-science.aspx

The official closing date is December 1st 2023, however please feel free
to contact me after this time.

Best wishes,
Professor Per Kristian Lehre
School of Computer Science
University of Birmingham, UK
http://www.cs.bham.ac.uk/~lehrepk
@pklehre on Twitter

**********************************************************
*
* 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, November 22, 2023

[DMANET] PhD position at WU Vienna, Austria

Applications are invited for a PhD position at the Research Institute for Supply Chain Management at WU (Vienna University of Economics and Business). The position is available from February 1, 2024, for 30h/week. The appointment is for 3 years.
You will actively collaborate on an exciting third-party funded research project. The project addresses optimization problems on strategical, tactical, and operational levels for deploying sustainable distribution modes such as cargo bikes, robots or walking couriers in a multi-echelon setting. The project is a collaboration with EM Normandie (France).

What to expect
-Active collaboration in an exciting research project in an international research environment
-Teamwork: You will be working to advance research in your field together with an international team of researchers
-Building up a network: You can create your own professional network for the future
-The possibility of attending international scientific workshops and conferences.

What you have to offer
-Academic degree: You have a diploma/master's degree in business computing, mathematics, computer science or a related field that qualifies you for enrollment in a doctoral program at WU.
-Strong knowledge of Operations Research (E.g. thesis written in Operations Research or a strongly related topic)
-Excellent Programming language skills (e.g. in C, C++, Python …)
-Interest in sustainable transportation
-Proficiency in English

What we offer you
-Inspiring campus life with over 2,400 employees in research, teaching, and administration and approximately 21,500 students
-A modern campus with spectacular architecture in the heart of Vienna
-Excellent accessibility by public transportation
-Meaningful work in an open-minded, inclusive, and family-friendly environment
-Flexible working hours
-A wide range of benefits, from an in-house medical officer to athletic activities and a meal allowance to a variety of employee discounts

The minimum monthly gross salary amounts to €2,464.80 (14 times per year). This salary may be adjusted based on job-related prior work experience. In addition, we offer a wide range of attractive social benefits.
For further information about this position, please contact Vera Hemmelmayr: vera.hemmelmayr@wu.ac.at
Applications can be submitted by December 13, 2023
www.wu.ac.at/jobs (ID 1960)
We are looking forward to hearing from you!
**********************************************************
*
* 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] Final Call for Papers: 40th SoCG in Athens, Greece

Final CALL FOR PAPERS: 40TH SOCG

The 40th International Symposium on Computational Geometry (SoCG 2024) is planned to be held in Athens, Greece, June 11–14 2024, as part of the Computational Geometry (CG) Week. We invite high quality submissions that describe original research on computational problems in a geometric and/or topological setting. Topics of interest include, but are not limited to:
• Design, analysis, and implementation of geometric algorithms and data structures;
• Computational complexity of geometric problems;
• Implementation and experimental evaluation of geometric algorithms and heuristics, including mathematical, numerical, and algebraic aspects;
• Discrete and combinatorial geometry;
• Computational topology, topological data analysis, and topological combinatorics;
• Applications of computational geometry or topology in any field.


IMPORTANT DATES

• 24 November 2023: Abstracts due (23:59 AoE (anywhere on Earth))
• 01 December 2023: Papers due (23:59 AoE (anywhere on Earth))
• 05 February 2024: Notification of acceptance/rejection
• mid March 2024: Final versions of accepted papers due
• 11–14 June 2024: Symposium

SoCG 2024 conference web page: http://socg24.athenarc.gr/socg.html

SoCG 2024 HotCRP submission webpage: https://socg24.hotcrp.com/


CODE OF CONDUCT

SoCG is dedicated to providing an environment that is free from harassment, bullying, discrimination, and retaliation for all participants. All attendees, speakers, sponsors, and volunteers at our conference are required to agree with the CG Week code of conduct.

A person found in violation of these standards can be barred from attendance. This includes violations and sanctions that were established by other academic or professional institutions as the outcome of a formal enquiry.

If an author has a conflict of such nature with a potential reviewer, and the author has sufficient grounds to believe that the review would be negatively biased, then the author is asked to declare this conflict in HotCRP. You are also welcome to contact a SoCG SafeTOC advocate who will treat any supporting information confidentially. For a list of SoCG advocates with contact information, please refer to CG Week Code of Conduct.


SUBMISSION GUIDELINES

— 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. 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. 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, discrete differential geometry or topology, 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 and 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.

— Double Blind and PC submissions —
This year's SoCG will employ a lightweight double-blind reviewing process, and will allow PC members (other than the PC chairs) to submit to the conference as well. Submissions should not reveal the identity of the authors in any way. In particular, authors' names, affiliations, and email addresses should not appear at the beginning or in the body of the submission. Authors should ensure that any references to their own related work is in the third person (e.g., not "We build on our previous work ..." but rather "We build on the work of ..."). Particular care needs to be taken if there is any accompanying software or data, which needs to be linked anonymously (for example, via a DropBox folder or Anonymous GitHub (https://anonymous.4open.science/), perhaps with a subset of synthetic data if the real data is not anonymized). Upon registering a submission, the authors will declare conflicts of interest with PC members, as well as listing email address or domain level conflicts (i.e. "Jeff M. Phillips (University of Utah)", "All (Freie Universität Berlin)") of other professional or personal conflicts. The purpose of lightweight double-blind reviewing is to help PC members and external reviewers come to an initial judgment about the paper without bias, not to make it impossible for them to discover the authors if they were to try. Authors should feel free to disseminate their ideas or draft versions of their paper as they normally would. For example, authors may post drafts of their papers on the web, submit them to arXiv, and give talks on their research ideas. We encourage authors with further questions on double-blind reviewing to contact the PC chairs, or to see the more detailed discussion in the proposal (https://computational-geometry.org/documents/Double_blind_proposal.pdf) that preceded the vote to move to double blind.

— Format —
Submissions must be formatted in accordance with the LIPIcs proceedings guidelines (https://www.dagstuhl.de/en/publications/lipics). Authors must use the LaTeX class file socg-lipics-v2021.cls(https://computational-geometry.org/guidelines/socg-lipics-v2021.cls; use the one updated in 2022) (version 0.9), with the option "anonymous"; note that the cls file is a wrapper around the standard LIPIcs class. The LIPIcs style and instructions are available here (https://submission.dagstuhl.de/series/details/5#author); the class file is available here (https://computational-geometry.org/guidelines/socg-lipics-v2021.cls; note these were updated in 2022), and instructions on how to use it are available here (https://computational-geometry.org/guidelines/linecount_2022_09_19.pdf). Submissions must not exceed 500 lines, excluding front matter (title), references, and a clearly marked appendix (further described below), but including all other lines (in abstract, algorithms, tables, captions, etc.). The class files provide line counting which should be accurate in most cases. Authors should refrain from putting excessive amounts of text in parts in which lines are not counted automatically. If authors need constructs that contain uncounted lines of text, they should compensate for this by reducing the final line count accordingly. It is the sole responsibility of the authors not to exceed 500 lines even if some lines are not counted automatically.

— Contents of the submission —
Papers should be submitted in the form of an extended abstract, which begins with the title of the paper, 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.

— Appendix and additional data —
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 and subreviewers 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.

— Previous or simultaneous submission —
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. In particular, submissions of papers that have appeared or will be submitted to EuroCG are allowed, since EuroCG does not publish formal proceedings, while submissions of papers that have appeared in CCCG are not allowed. 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.

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

— Guidelines for reviewers —
The guidelines are available here (https://computational-geometry.org/guidelines/socg-reviewing.pdf).


ACCEPTED PAPERS

— Presentation, awards, and special issues —
An author of each accepted paper will be expected to attend the symposium and present the paper (approximately 20 minutes). The format of both attendance and presentation will be clarified closer to the event. Awards will be given for the best paper and for the best student presentation. 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. As in the previous years, the authors of the best paper will be invited to submit an extended version of their paper to the Journal of the ACM.

— Format —
Final proceedings versions of accepted papers must respect the same formatting constraints as the submissions (LIPIcs proceedings format https://submission.dagstuhl.de/series/details/5#author with socg-lipics-v2021 https://computational-geometry.org/guidelines/socg-lipics-v2021.cls; 500-line limit, excluding front matter and references), but must not comprise any appendix. 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.


PROGRAM COMMITTEE

• Peyman Afshani, Aarhus University, Denmark
• Hee-Kap Ahn, Pohang University of Science and Technology, South Korea
• Boris Aronov, New York University, USA
• Sayan Bandyapadhyay, Portland State University, USA
• Gill Barequet, Technion - Israel Inst. of Technology, Israel
• Karl Bringmann, Universität des Saarlandes, Germany
• Maike Buchin, Ruhr-Universität Bochum, Germany
• Tamal Dey, Purdue University, USA
• Omrit Filtser, Open University of Israel, Israel
• Sariel Har-Peled, University of Illinois, Urbana-Champaign, USA
• Meng He, Dalhousie University, Canada
• Michael Hoffmann, Eidgenössische Technische Hochschule Zürich, Switzerland
• Chaya Keller, Ariel University, Israel
• Clement Maria, INRIA, France
• David Mount, University of Maryland, USA
• Wolfgang Mulzer, Freie Universität Berlin, Germany (co-chair)
• Steve Oudot, INRIA, France
• Dömötör Pálvölgyi, Eötvös Loránd University, Hungary
• Evanthia Papadopoulou, Università della Svizzera italiana, Switzerland
• Salman Parsa, DePaul University, USA
• Zuzana Patáková, Univerzita Karlova, Czech Republic
• Jeff M. Philips, University of Utah, USA (co-chair)
• Benjamin Raichel, University of Texas at Dallas, USA
• Lena Schlipf, University of Tübingen, Germany
• Melanie Schmidt, Heinrich Heine University Düsseldorf, Germany
• Micha Sharir, Tel Aviv University, Israel
• Rodrigo Silveira, Universitat Politècnica de Catalunya, Spain
• Andrew Suk, University of California, San Diego, USA
• Subhash Suri, University of California, Santa Barbara, USA
• Martin Tancer, Univerzita Karlova, Czech Republic
• Yufei Tao, The Chinese University of Hong Kong, China
• Csaba D. Tóth, California State University Northridge, USA
• Birgit Vogtenhuber, Technische Universität Graz, Austria

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