Dear all,
We have 2 industry PhD positions available at The University of Adelaide, Australia, in partnership with SEAS-NVE, Denmark. Due to the existing travel ban to Australia, these positions are open to both international and domestic students who are currently onshore in Australia. Please contact me directly by replying to this email if you are interested and eligible.
UAiPhD is an innovative 4-year program, which includes completion of mandatory 6-month industry placement. We offer
* $10K p.a. top-up scholarship (total of $38K p.a. stipend tax-free) plus $5K research allowance p.a.
* $9K extra stipend during industry placement and two-way economy airfare to Denmark
You will be primarily based in the beautiful North Terrace campus at the heart of Adelaide city during your PhD. You will be a part of a multi-disciplinary project called "Flexibility Aggregator Simulation Platform (FRESNO)" at the intersection of the power system (electricity market), optimisation and game theory. Candidates with a degree (preferably a master's degree) in electrical engineering, computer science, operations research, and applied mathematics are highly encouraged to contact me directly.
Link to FRESNO A project description: shorturl.at/ktNT4<http://shorturl.at/ktNT4>
Link to FRESNO C project description: shorturl.at/adWX8
Application deadline: 15 January 2021 or as soon as the positions are filled (we will evaluate applications as we receive and let you know the outcome)
PhD start date: by 31 March 2021
About the School of Electrical and Electronic Engineering<http://www.eleceng.adelaide.edu.au/>: The University of Adelaide continuously ranks among the world's top 1% of universities (between 100 to 150 in different ranking systems) and the University has the highest volume of commercial research agreements of all Australian universities. As a school, we are consistently ranked well above world standards (highest rating) in Australia's national research evaluation framework by the Australian Research Council. In 2020 ARWU rankings, the school is ranked 42nd in the world and top in Australia in the subject area of Electrical & Electronic Engineering. In particular, the electric power system research group has made a reputation of excellence over the years in Australia and internationally, and collaborate with various industry and government organisations.
Best Regards,
Ali Pourmousavi Kani | Lecturer | School of Electrical and Electronic Engineering | University of Adelaide
T: +61 8 8313-8311 | E: a.pourm@adelaide.edu.au<mailto:a.pourm@adelaide.edu.au> | W: https://researchers.adelaide.edu.au/profile/a.pourm
The organiser of the Adelaide Power System Summer School (APSSS) | W: https://www.theapsss.com/
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Tuesday, November 24, 2020
[DMANET] Open Call: [Algorithms, MDPI] Special Issue on Algorithms in Computational Biology
We are pleased to announce the launch of new Special Issue dedicated to
"Algorithms in Computational
Biology"(https://www.mdpi.com/journal/algorithms/special_issues/computational-biology)
in the journal Algorithms, an *EI-*, *ESCI-*, and *Scopus-indexed* open
access journal.
"Algorithms in Computational
Biology"(https://www.mdpi.com/journal/algorithms/special_issues/computational-biology)
in the journal Algorithms, an *EI-*, *ESCI-*, and *Scopus-indexed* open
access journal.
The aim of this Special Issue is to present state-of-the-art algorithmic
innovations that allow facing the computational bottlenecks of -omics
data analysis. This includes a variety of methods, such as discrete
algorithms on sequences, trees and graphs, data structures and
compressed data structures, parallel computing, combinatorial and
sampling approaches, heuristics and parameterized algorithms, data
mining, and machine learning techniques.
The submission deadline is 31 March 2021. Papers will be published on
an ongoing basis, so you can submit your paper at any point before the
deadline. For any questions, please feel free to contact Ms. Alina Chen
(alina.chen@mdpi.com).
Algorithms (ISSN 1999-4893) is a peer-reviewed open access journal which
provides an advanced forum for studies related to algorithms and their
applications, and is Open Access since 2008, and is since then rising
steadily in the ranks
(https://www.journalindicators.com/indicators/journal/21100199795). It
is ranking Q2 in the category "Computer Science, Theory & Methods", and
it has received it's increased 2020 CiteScore 2.20, and CiteScoreTracker
2020 is 2.70 now (https://www.scopus.com/sourceid/21100199795).
We look forward to receiving your submission.
Best regards,
Ms. Alina Chen/MDPI
Section Managing Editor
E-Mail: alina.chen@mdpi.com
MDPI Branch Office, Wuhan
Skype: live:a70ca49eff100a5b
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] Postdoc position, computational social choice & algorithmic game theory, TU Berlin
A postdoc position in computational social choice and/or algorithmic game theory at TU Berlin in Germany is available.
The position is for 2.5 years and the start date is flexible (early 2021 preferred).
For more details, see https://www.algo.tu-berlin.de/positions
The deadline for applications is December 10th, 2020.
Please forward this email to anyone who might be interested, and please get in touch (brill@tu-berlin.de<mailto:brill@tu-berlin.de>) in case you have any questions.
Best,
Markus
—
Prof. Dr. Markus Brill
http://www.algo.tu-berlin.de/brill
**********************************************************
*
* 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/
*
**********************************************************
The position is for 2.5 years and the start date is flexible (early 2021 preferred).
For more details, see https://www.algo.tu-berlin.de/positions
The deadline for applications is December 10th, 2020.
Please forward this email to anyone who might be interested, and please get in touch (brill@tu-berlin.de<mailto:brill@tu-berlin.de>) in case you have any questions.
Best,
Markus
—
Prof. Dr. Markus Brill
http://www.algo.tu-berlin.de/brill
**********************************************************
*
* 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] IEEE PerCom 2021 - WiP: Call for Work in Progress Papers
[Apologies if you receive multiple copies of this message]
================================================================
CALL FOR Work in Progress Papers
******************************************************************
The 19th International Conference on Pervasive Computing and
Communications (PerCom 2021), March 22-26, 2021
in Kassel, Germany.
http://www.percom.org
******************************************************************
The Work in Progress (WiP) session provides an opportunity to present and discuss new challenges and visions, showcase early research results, and explore novel research directions. The specific aim of the WiP session is to provide a forum for timely presentation, discussion and feedback for novel, controversial, and thought-provoking ideas. Contributions are solicited in all areas of pervasive computing research and applications. Papers are expected to report on early or ongoing research on any aspect of pervasive computing and communications. Preliminary experimental results are appreciated.
All selected papers will be presented as posters in a special conference session, or, in the case the conference is held online, as 5 minute talks. Papers will be included in PerCom Workshops proceedings to be published by IEEE and included in the IEEE Xplore digital library. The WiP Chairs and the WiP Program Committee will also select the best WiP contribution based on submissions and presentations.
TOPICS OF INTEREST INCLUDE, but are not limited to:
* Advances in pervasive systems and infrastructures: middleware systems and services; data engineering for pervasive computing; clouds, fog and edge computing; integrations of smartphones in pervasive experiences; applications of device-to-device coordination
* Theories, models, and algorithms: context modeling and reasoning; adaptive computing; activity and emotion recognition; programming paradigms; applied machine learning; deep machine learning; federated learning; casual learning; cognitive computing; complex networks; spatio-temporal modeling techniques
* Domain-specific challenges and novel applications: urban/mobile crowdsensing & intelligence; PerCom for healthcare and well-being; cyber-physical PerCom; smart homes and virtual assistants; innovative PerCom applications (e.g., sports analytics, crime prevention, pervasive nowcasting)
* Intersections of PerCom with: opportunistic networks; IoT and sensor systems; RFID systems; pervasive data science, cyber physical systems
New techniques for user-level concerns: participatory and social sensing; trust, security, and privacy; user interface, interaction, and persuasion; online and offline social networking and pervasive computing
* Technological innovations: architectures, protocols, and technologies for pervasive communications; energy-harvesting, self-powered, or battery-less systems; mobile and wearable systems; smart devices and environments; positioning and tracking technologies; wireless crowd-recharging; device-free human sensingsal submission requirements, please send an email to percomworkshops@gmail.com.
SUBMISSION GUIDELINES
Authors are requested to submit original, unpublished manuscripts in standard IEEE proceedings format (two-column format with a 4-page limit including figures, tables, and references) in PDF format that include contact information of all the authors. The submitted manuscripts will be reviewed by the WiP Technical Program Committee. The authors of accepted papers will present their work during the main conference and must register for the conference (at least one author must have a full registration).
All manuscripts must be registered and submitted through the EDAS submission site: https://edas.info/newPaper.php?c=27739
IMPORTANT DATES:
* Submission Deadline: December 15, 2020
* Notification of Acceptance: January 17, 2021
* Camera Ready Deadline: February 5, 2021
For further information about the Work in Progress portion of the program, please contact the WiP Co-Chairs Ella Peltonen (ella.peltonen@oulu.fi) and Octav Chipara (octav-chipara@uiowa.edu).
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
================================================================
CALL FOR Work in Progress Papers
******************************************************************
The 19th International Conference on Pervasive Computing and
Communications (PerCom 2021), March 22-26, 2021
in Kassel, Germany.
http://www.percom.org
******************************************************************
The Work in Progress (WiP) session provides an opportunity to present and discuss new challenges and visions, showcase early research results, and explore novel research directions. The specific aim of the WiP session is to provide a forum for timely presentation, discussion and feedback for novel, controversial, and thought-provoking ideas. Contributions are solicited in all areas of pervasive computing research and applications. Papers are expected to report on early or ongoing research on any aspect of pervasive computing and communications. Preliminary experimental results are appreciated.
All selected papers will be presented as posters in a special conference session, or, in the case the conference is held online, as 5 minute talks. Papers will be included in PerCom Workshops proceedings to be published by IEEE and included in the IEEE Xplore digital library. The WiP Chairs and the WiP Program Committee will also select the best WiP contribution based on submissions and presentations.
TOPICS OF INTEREST INCLUDE, but are not limited to:
* Advances in pervasive systems and infrastructures: middleware systems and services; data engineering for pervasive computing; clouds, fog and edge computing; integrations of smartphones in pervasive experiences; applications of device-to-device coordination
* Theories, models, and algorithms: context modeling and reasoning; adaptive computing; activity and emotion recognition; programming paradigms; applied machine learning; deep machine learning; federated learning; casual learning; cognitive computing; complex networks; spatio-temporal modeling techniques
* Domain-specific challenges and novel applications: urban/mobile crowdsensing & intelligence; PerCom for healthcare and well-being; cyber-physical PerCom; smart homes and virtual assistants; innovative PerCom applications (e.g., sports analytics, crime prevention, pervasive nowcasting)
* Intersections of PerCom with: opportunistic networks; IoT and sensor systems; RFID systems; pervasive data science, cyber physical systems
New techniques for user-level concerns: participatory and social sensing; trust, security, and privacy; user interface, interaction, and persuasion; online and offline social networking and pervasive computing
* Technological innovations: architectures, protocols, and technologies for pervasive communications; energy-harvesting, self-powered, or battery-less systems; mobile and wearable systems; smart devices and environments; positioning and tracking technologies; wireless crowd-recharging; device-free human sensingsal submission requirements, please send an email to percomworkshops@gmail.com.
SUBMISSION GUIDELINES
Authors are requested to submit original, unpublished manuscripts in standard IEEE proceedings format (two-column format with a 4-page limit including figures, tables, and references) in PDF format that include contact information of all the authors. The submitted manuscripts will be reviewed by the WiP Technical Program Committee. The authors of accepted papers will present their work during the main conference and must register for the conference (at least one author must have a full registration).
All manuscripts must be registered and submitted through the EDAS submission site: https://edas.info/newPaper.php?c=27739
IMPORTANT DATES:
* Submission Deadline: December 15, 2020
* Notification of Acceptance: January 17, 2021
* Camera Ready Deadline: February 5, 2021
For further information about the Work in Progress portion of the program, please contact the WiP Co-Chairs Ella Peltonen (ella.peltonen@oulu.fi) and Octav Chipara (octav-chipara@uiowa.edu).
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] Session on "Discrete-continuous stochastic optimal control and space-time design" - EURO 2021 Athens (call for abstracts)
Dear Colleagues,
At the upcoming EURO 2021 conference to be held in Athens, July 11-14, 2021 ( https://euro2021athens.com ) there will be a session on
At the upcoming EURO 2021 conference to be held in Athens, July 11-14, 2021 ( https://euro2021athens.com ) there will be a session on
" Discrete-continuous stochastic optimal control and space-time design " .
The session is an element of the stream on "Combinatorial Optimization" .
Contributions to this session are invited related to all OR aspects and methods of optimization and (stochastic) optimal control on generalized design, research and travel in all states of matter within dimensionally extended space-time. O ptimization and optimal control will be employed in choice and design of approaches, notions and concepts, in handling of data and of ill-posed inverse problems, in modeling and decision making. The aspects and methods will address reality (actuality) as well as potentiality. Given the nature of that vast dimensions, optimization and optimal control will be hybrid, e.g., continuous and discrete (combinatorial). The session shall contribute to a unifying of theories in all due respect. Real-world examples and applications helpful to humanity and to all "times and lives" will be high-lighted with their beauty. Along with OR , all Sciences, Medicine, Engineering and the Arts are welcome to our subject.
Herewith I am glad to invite you to participate at EURO 2021 and submit an abstract to this session.
To submit your abstract, please visit https://www.euro-online.org/conf/euro31/ and use the Code : 416ab39b.
In order to submit an abstract, you need to have a EURO account. If you do not have one, please visit https://www.euro-online.org/web/pages/1/home and sign up.
Abstracts: max. 1500 characters; submission deadline: February 28, 2021.
Looking forward to seeing you in Athens at EURO 2021!
Warmest regards,
Gerhard-Wilhelm Weber
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] Postdoc position and PhD position at the University of Birmingham (R. Montgomery)
In connection with the ERC grant 'Spanning Subgraphs in Graphs',
applications are sought for a Research Fellow in Combinatorics and a PhD
student to work with Richard Montgomery at the University of Birmingham.
The postdoctoral position is initially for 2 years, with possible
extension once in post.
The closing date for applications is 20th December 2020. More details
can be found at
https://www.jobs.ac.uk/job/CCQ676/research-fellow-in-combinatorics
The closing date for applications to the PhD studentship is 31st
December 2020. More details can be found at
https://www.findaphd.com/phds/project/extremal-and-probabilistic-combinatorics/?p126118
Informal enquiries welcome to R.H.Montgomery@bham.ac.uk
Richard Montgomery
**********************************************************
*
* 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/
*
**********************************************************
applications are sought for a Research Fellow in Combinatorics and a PhD
student to work with Richard Montgomery at the University of Birmingham.
The postdoctoral position is initially for 2 years, with possible
extension once in post.
The closing date for applications is 20th December 2020. More details
can be found at
https://www.jobs.ac.uk/job/CCQ676/research-fellow-in-combinatorics
The closing date for applications to the PhD studentship is 31st
December 2020. More details can be found at
https://www.findaphd.com/phds/project/extremal-and-probabilistic-combinatorics/?p126118
Informal enquiries welcome to R.H.Montgomery@bham.ac.uk
Richard Montgomery
**********************************************************
*
* 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] IPEC 2020 call for participation
Dear All,
We invite you to take part in the 15th International Symposium on
Parameterized and Exact Computation (IPEC 2020) which will take place
virtually on 15-17th December 2020, roughly 8am-noon CET / 3pm-7pm HKT. We
will use the Airmeet.com platform for the conference.
The registration is free, but mandatory. To register, go to:
https://algo2020.comp.polyu.edu.hk/registration.html
The registration closes on 1st December 2020 AoE.
The tentative program of the conference can be found at:
https://algo2020.comp.polyu.edu.hk/ipec-program.html
The program features:
* an award ceremony of the EATCS-IPEC Nerode Price (
https://eatcs.org/index.php/nerode-prize)
* a tutorial by Yoichi Iwata
* an award ceremony of PACE 2020 (https://pacechallenge.org/2020/)
* four blocks of talks of 6 contributed papers each
* presentations of the two Best Paper Award winners.
During each block of 90 minutes, for every of 6 contributed papers for this
block we schedule a 5-minute talk followed by up to 5-minute discussion and
change of speaker. The remaining 30 minutes are devoted to more relaxed
discussion on the papers. Longer talks on contributed papers will be
available as recordings on the conference webpage.
Best regards,
Marcin Pilipczuk
**********************************************************
*
* 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/
*
**********************************************************
We invite you to take part in the 15th International Symposium on
Parameterized and Exact Computation (IPEC 2020) which will take place
virtually on 15-17th December 2020, roughly 8am-noon CET / 3pm-7pm HKT. We
will use the Airmeet.com platform for the conference.
The registration is free, but mandatory. To register, go to:
https://algo2020.comp.polyu.edu.hk/registration.html
The registration closes on 1st December 2020 AoE.
The tentative program of the conference can be found at:
https://algo2020.comp.polyu.edu.hk/ipec-program.html
The program features:
* an award ceremony of the EATCS-IPEC Nerode Price (
https://eatcs.org/index.php/nerode-prize)
* a tutorial by Yoichi Iwata
* an award ceremony of PACE 2020 (https://pacechallenge.org/2020/)
* four blocks of talks of 6 contributed papers each
* presentations of the two Best Paper Award winners.
During each block of 90 minutes, for every of 6 contributed papers for this
block we schedule a 5-minute talk followed by up to 5-minute discussion and
change of speaker. The remaining 30 minutes are devoted to more relaxed
discussion on the papers. Longer talks on contributed papers will be
available as recordings on the conference webpage.
Best regards,
Marcin Pilipczuk
**********************************************************
*
* 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 23, 2020
[DMANET] IGAFIT Algorithmic Colloquium - 2pm CET, November 26: Fully Online Matching by Zhiyi Huang
On the 26th of November 2020 we will have the next IGAFIT Algorithmic
Colloquium on "Fully Online Matching" given by Zhiyi Huang (University of
Hong Kong). The seminar will take place at 14:00 CET (local time in central
Europe), and will be followed by a discussion session. We would like to
invite you to take part in the event including the networking session. This
new event aims to integrate the European algorithmic community and keep it
connected during the times of the pandemic. The meeting will be held using
Airmeet platform and to attend please go to
https://www.airmeet.com/e/b28eee00-2dc9-11eb-939d-636c2b17ea0b. You can
find more information about the talk on IGAFIT web page:
http://igafit.mimuw.edu.pl/?page_id=483786.
Colloquium on "Fully Online Matching" given by Zhiyi Huang (University of
Hong Kong). The seminar will take place at 14:00 CET (local time in central
Europe), and will be followed by a discussion session. We would like to
invite you to take part in the event including the networking session. This
new event aims to integrate the European algorithmic community and keep it
connected during the times of the pandemic. The meeting will be held using
Airmeet platform and to attend please go to
https://www.airmeet.com/e/b28eee00-2dc9-11eb-939d-636c2b17ea0b. You can
find more information about the talk on IGAFIT web page:
http://igafit.mimuw.edu.pl/?page_id=483786.
We invite you to take part in the event. Please advertise broadly and bring
your students/postdocs as well.
The details of the talk are given below.
November 26, 2020, 14:00 CET
Zhiyi Huang (University of Hong Kong)
Title: Fully Online Matching
Abstract: Motivated by applications such as ride sharing, we introduce a
fully online model of maximum cardinality matching in which all vertices
arrive and depart online. On the arrival of a vertex, its edges to
previously-arrived vertices are revealed. The vertex can be matched anytime
before its departure, which is after all its neighbors' arrivals. This
fully online matching model generalizes the online bipartite matching model
which only considers bipartite graphs and assumes one side of the vertices
to be offline.
We generalize the Ranking and Water-Filling algorithms to fully online
matching and its fractional relaxation respectively. The former is
0.521-competitive in general graphs, and 0.567-competitive in bipartite
graphs, and the latter is 0.585 competitive in both cases. Further, we
prove that fully online matching is strictly harder than online bipartite
matching, because no online algorithm can be 0.6317 <(1-1/e)-competitive in
fully online matching even for bipartite graphs. Finally, we introduce new
algorithms that are strictly better than Ranking and Water-Filling in fully
online matching.
Organization Committee:
Nikhil Bansal
Artur Czumaj
Andreas Feldmann
Adi Rosén
Eva Rotenberg
Piotr Sankowski
Christian Sohler
**********************************************************
*
* 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 Computer Science at the University of Warwick
----------------------------------------------------------------------------------------------------------
Assistant Professor opening in Computer Science at the University of Warwick
https://warwick.ac.uk/dimap/cs-assistant-prof-2021
----------------------------------------------------------------------------------------------------------
We are looking for enthusiastic researchers to make a major contribution
to the Department of Computer Science (https://warwick.ac.uk/dcs/) at
the University of Warwick activities in research and teaching.
This is an opportunity to join one of the UK's most prominent Computer
Science departments, widely recognized for its excellence in Theoretical
Computer Science (https://warwick.ac.uk/dcs/research/focs/) and Discrete
Mathematics (https://warwick.ac.uk/dimap), and to be part of an exciting
time of growth in the Department.
The applicants are expected to hold a PhD or equivalent in Computer
Science or a related discipline (and Theory candidates are welcome to
apply). They should have an outstanding academic record, and show clear
promise of developing a career in academia. They should have a strong
commitment to undergraduate and postgraduate education.
Informal inquires can be addressed to the Head of Department, Prof.
Ranko Lazic (https://warwick.ac.uk/dcs/people/Ranko_Lazic/), or to any
member of the Computer Science Department (e.g., to the Theory group
members, see https://warwick.ac.uk/dcs/research/focs/people/).
Closing date: November 30, 2020.
It is expected that interviews will take place in January 2021.
For more details and links to the application form, see this link:
https://warwick.ac.uk/fac/sci/dcs/jobs/
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Assistant Professor opening in Computer Science at the University of Warwick
https://warwick.ac.uk/dimap/cs-assistant-prof-2021
----------------------------------------------------------------------------------------------------------
We are looking for enthusiastic researchers to make a major contribution
to the Department of Computer Science (https://warwick.ac.uk/dcs/) at
the University of Warwick activities in research and teaching.
This is an opportunity to join one of the UK's most prominent Computer
Science departments, widely recognized for its excellence in Theoretical
Computer Science (https://warwick.ac.uk/dcs/research/focs/) and Discrete
Mathematics (https://warwick.ac.uk/dimap), and to be part of an exciting
time of growth in the Department.
The applicants are expected to hold a PhD or equivalent in Computer
Science or a related discipline (and Theory candidates are welcome to
apply). They should have an outstanding academic record, and show clear
promise of developing a career in academia. They should have a strong
commitment to undergraduate and postgraduate education.
Informal inquires can be addressed to the Head of Department, Prof.
Ranko Lazic (https://warwick.ac.uk/dcs/people/Ranko_Lazic/), or to any
member of the Computer Science Department (e.g., to the Theory group
members, see https://warwick.ac.uk/dcs/research/focs/people/).
Closing date: November 30, 2020.
It is expected that interviews will take place in January 2021.
For more details and links to the application form, see this link:
https://warwick.ac.uk/fac/sci/dcs/jobs/
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] EURO 2021 - Call for sessions - Stream on Heuristic Optimization
EURO 2021, the 31st European Conference on Operational Research
Athens, Greece, 11-14 July 2021 (https://euro2021athens.com/)
=======================================
"Heuristic Optimization" Stream
"Discrete Optimization Algorithms" Area
=======================================
Athens, Greece, 11-14 July 2021 (https://euro2021athens.com/)
=======================================
"Heuristic Optimization" Stream
"Discrete Optimization Algorithms" Area
=======================================
We invite proposals for sessions on topics associated with the Stream
"Heuristic Optimization" within the Area "Discrete Optimization
Algorithms". Manifestations of interest, with the topic to be addressed
by the session and name(s) of the potential organizer(s), should be sent
to both:
alexander.brownlee@stir.ac.uk and
nadarajen.veerapen@univ-lille.fr
Ideally these should be received before 18 December 2020.
After acceptance of the topic, session organizers will be contacted with
additional information regarding the abstract submission process. The
Abstract Submission Deadline itself is 28 February 2021.
=======================================
Stream Organizers:
Alexander Brownlee, University of Stirling, UK
Nadarajen Veerapen, University of Lille, France
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] IEEE PerCom PhD Forum 2021: Call for Papers
-------------------------------------------------------------------------
CALL FOR PAPERS ON IEEE PERCOM PHD FORUM
Submission deadline: December 18, 2020
-------------------------------------------------------------------------
| PhD Forum on Pervasive Computing and Communications
| IEEE PerCom 2021
| March 22-26 2021
| http://www.percom.org/call_for_phd_forum_papers
Call for PhD Forum Contributions
# PHD FORUM ON PERVASIVE COMPUTING AND COMMUNICATIONS
The Fourteenth Ph.D. Forum on Pervasive Computing and Communication will be hosted by PerCom 2021 (virtual with synchronous zoom meeting). The Forum provides an excellent opportunity for Ph.D. students to present their dissertation research, including work in progress, to the wider pervasive computing and communication community. This meeting offers an opportunity to share experiences with other Ph.D. students and meet with accomplished international researchers and obtain feedback from them.
# PHD FORUM FORMAT
The Forum will be organized as a co-located PerCom event attended by experts in pervasive computing and communication, and will be supplemented by a one-minute-madness session plus a poster session during the main conference, so as to facilitate extended interaction opportunities between Ph.D. student participants and researchers from academia, industry, and government. During the workshop, senior members of the community will be present to provide constructive technical comments to each attendee. The Forum will provide a working environment for students to refine and practice their presentations, helping them to improve communication skills. Special recognition will be given to the most innovative and/or most promising research project(s) presented at the Ph.D. Forum based on the pitch talk, the presented poster and the discussions with the participants during the poster session.
# PAPER SUBMISSION AND PUBLICATION
Ph.D. students are invited to submit two-page extended abstracts in English that describe their current research and potential contributions to innovative theory, algorithm development, and applications in pervasive computing and communications. The abstract should include the author's name, affiliation and email address. The name of the supervisor should be marked ("supervised by ...") on the paper, under the author's name. Submissions must be in PDF format, be no more than two pages in length (all inclusive) and adhere to the IEEE two-column conference format (the same format used for paper submissions to PerCom 2021). Submissions that are substantially similar to presentations from a previous Ph.D. Forum are not allowed. Submissions will be reviewed by the Ph.D. Forum Technical Program Committee to ensure quality and relevance. In case of acceptance, the length of the camera-ready paper will be limited to two pages. Accepted abstracts will appear in the conference's works!
hop proceedings and will be indexed by DBLP and the IEEE digital library.
All manuscripts must be registered and submitted through the EDAS submission site: https://edas.info/N27738
# PARTICIPATION
Authors of accepted submissions are expected to participate in the Ph.D. Forum, deliver an elevator pitch for their work, and present their poster at the PerCom 2021 conference. Standard PerCom 2021 registration fees apply. Participants who are current full-time students are eligible for the student registration fee. US-based students can apply for an NSF travel grant (when details are available they will be published on the PerCom web site).
# IMPORTANT DATES
Extended abstract submission deadline: December 18, 2020
Notification of acceptance: January 15, 2021
Camera-ready paper due: February 5, 2021
Conference Dates: March 22 - 26, 2021
# PHD FORUM CHAIRS
Antinisca Di Marco, University of L'Aquila, Italy
Qin (Christine) Lv, University of Colorado Boulder, USA
For further information about the forum, please contact the co-chairs at percomphdforum2021-chairs@edas.info
**********************************************************
*
* 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/
*
**********************************************************
CALL FOR PAPERS ON IEEE PERCOM PHD FORUM
Submission deadline: December 18, 2020
-------------------------------------------------------------------------
| PhD Forum on Pervasive Computing and Communications
| IEEE PerCom 2021
| March 22-26 2021
| http://www.percom.org/call_for_phd_forum_papers
Call for PhD Forum Contributions
# PHD FORUM ON PERVASIVE COMPUTING AND COMMUNICATIONS
The Fourteenth Ph.D. Forum on Pervasive Computing and Communication will be hosted by PerCom 2021 (virtual with synchronous zoom meeting). The Forum provides an excellent opportunity for Ph.D. students to present their dissertation research, including work in progress, to the wider pervasive computing and communication community. This meeting offers an opportunity to share experiences with other Ph.D. students and meet with accomplished international researchers and obtain feedback from them.
# PHD FORUM FORMAT
The Forum will be organized as a co-located PerCom event attended by experts in pervasive computing and communication, and will be supplemented by a one-minute-madness session plus a poster session during the main conference, so as to facilitate extended interaction opportunities between Ph.D. student participants and researchers from academia, industry, and government. During the workshop, senior members of the community will be present to provide constructive technical comments to each attendee. The Forum will provide a working environment for students to refine and practice their presentations, helping them to improve communication skills. Special recognition will be given to the most innovative and/or most promising research project(s) presented at the Ph.D. Forum based on the pitch talk, the presented poster and the discussions with the participants during the poster session.
# PAPER SUBMISSION AND PUBLICATION
Ph.D. students are invited to submit two-page extended abstracts in English that describe their current research and potential contributions to innovative theory, algorithm development, and applications in pervasive computing and communications. The abstract should include the author's name, affiliation and email address. The name of the supervisor should be marked ("supervised by ...") on the paper, under the author's name. Submissions must be in PDF format, be no more than two pages in length (all inclusive) and adhere to the IEEE two-column conference format (the same format used for paper submissions to PerCom 2021). Submissions that are substantially similar to presentations from a previous Ph.D. Forum are not allowed. Submissions will be reviewed by the Ph.D. Forum Technical Program Committee to ensure quality and relevance. In case of acceptance, the length of the camera-ready paper will be limited to two pages. Accepted abstracts will appear in the conference's works!
hop proceedings and will be indexed by DBLP and the IEEE digital library.
All manuscripts must be registered and submitted through the EDAS submission site: https://edas.info/N27738
# PARTICIPATION
Authors of accepted submissions are expected to participate in the Ph.D. Forum, deliver an elevator pitch for their work, and present their poster at the PerCom 2021 conference. Standard PerCom 2021 registration fees apply. Participants who are current full-time students are eligible for the student registration fee. US-based students can apply for an NSF travel grant (when details are available they will be published on the PerCom web site).
# IMPORTANT DATES
Extended abstract submission deadline: December 18, 2020
Notification of acceptance: January 15, 2021
Camera-ready paper due: February 5, 2021
Conference Dates: March 22 - 26, 2021
# PHD FORUM CHAIRS
Antinisca Di Marco, University of L'Aquila, Italy
Qin (Christine) Lv, University of Colorado Boulder, USA
For further information about the forum, please contact the co-chairs at percomphdforum2021-chairs@edas.info
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] 2 Open PhD Positions on Network Algorithms in Vienna
Dear all,
we currently have two open PhD positions at the University of Vienna,
shared by the research group of Monika Henzinger and my group.
For more information, see below, and/or contact Monika or me directly.
Many thanks for distributing the email to interested students and
colleagues!
Monika and Stefan
== 8< ===
We are looking for two highly motivated and bright PhD students with a
strong expertise and interest in graph and network algorithms in
particular, and in theoretical computer science in general, to join our
team around our project on "Fast Algorithms for a Reactive Network Layer".
Traditionally and still today, communication networks are operated in a
rather static and conservative manner. This has good reasons: communication
networks constitute a critical infrastructure of our digital society, and
dynamic optimizations always come with risks of instabilities or even
outages. However, it is also known that in principle
a more dynamic network operation can greatly improve the efficiency of
networks: empirical studies show that communication traffic contains much
structure, i.e., it is bursty and skewed. More dynamic network operations
are also useful to support adaptive policy changes, service relocations, or
emerging "self-driving networks". This project is motivated by the desire
to leverage the benefits of more flexible network operations but without
sacrificing the reliability guarantees of more conservative operations. In
fact, we believe that a more adaptive network operation can even improve
the dependability of a network.
We aim to lay the theoretical and algorithmic foundations of more adaptive
networks, using algorithmic tools from dynamic graph algorithms,
approximation algorithms, online algorithms and distributed algorithms. In
addition to our theoretical contributions, we also aim to show the
practical importance of our approaches (possibly in collaboration with an
Internet Service Provider).
The positions are 30h/week and shared by the research groups "Theory and
Applications of Algorithms", led by Univ.-Prof. Dr. Monika Henzinger, and
"Communication Technologies", led by Univ.-Prof. Dr. Stefan Schmid. Both
research groups are internationally well-known and received ERC grants in
the past.
For more information, please contact Prof. Henzinger and Prof. Schmid by
email.
The application submission is handled online under
https://personalwesen.univie.ac.at/en/jobs-recruiting/job-center/ but you
can also submit your application material by an email addressed to both
professors.
--
Stefan Schmid
Professor, Computer Science
University of Vienna, Austria
Research Group: https://ct.cs.univie.ac.at/
Personal: https://www.univie.ac.at/ct/stefan/
**********************************************************
*
* 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, Optimisation, AI in health - Lille University, january 1st, 2021
Dear all,
Applications are invited for a 2-year postdoctoral fellow to begin on January 1, 2021 .
The position will be co-supervised by Pr. Clarisse Dhaenens, computer Science, Pr. Vincent Sobanski, internal medicine and Pr. Grégoire Ficheur, medical informatics.
The postdoc is part of a research cluster from I-Site ULNE ( [ http://www.isite-ulne.fr/index.php/en/home/ | http://www.isite-ulne.fr/index.php/en/home/ ] ).
She/He will be hosted in the CRIStAL labs (computer science Lab - [ https://www.cristal.univ-lille.fr/ | https://www.cristal.univ-lille.fr/ ] - Univ. Lille, CNRS, Centrale Lille)
and is financed by Lille metropole (MEL - [ https://www.lillemetropole.fr/ | https://www.lillemetropole.fr/ ] )
She/He will also work actively with the INCLUDE team at the Lille University Hospital (health data warehouse project - [ https://include-project.chru-lille.fr/en/the-team/ | https://include-project.chru-lille.fr/en/the-team/ ] ), the METRICS team (ULR 2694, Lille University Hospital), and the INFINITE team (INSERM U1286, Lille University Hospital - [ http://lille-inflammation-research.org/en/workpackages/861-wp3-en | http://lille-inflammation-research.org/en/workpackages/861-wp3-en ] ).
The applicant should have a PhD in Computer Science. The ideal candidate would have expertise in one or more of the following areas:
Operations research, Combinatorial Optimization, Data Mining (clustering, bi-clustering), optimization approaches, textual analysis…
An interest or an experience about health domain will be appreciated.
The position is open to candidates of any nationality and selection will be based upon the candidate's research record and potential.
Application material will be submitted by e-mail to [ mailto:clarisse.dhaenens@univ-lille.fr | clarisse.dhaenens@univ-lille.fr ] before December 1rst 2020 , and include (in a single PDF file)
- Cover letter
- CV
- 2 reference letters
- Research statement
Project objectives
The objective of this project is to use a biclustering approach to combine two different and complementary data sources in order to better characterize endotypes of chronic inflammatory diseases:
• Build a "word embedding" type representation based on BERT modeling (Bidirectional Encoder Representations from Transformers, Devlin 2018) from textual concepts present in medical letters from a computerized patient records database
• Filter a set of characteristics unrelated to the type of diagnosis that may be found among the interests of patients
• Build clusters by the biclustering method, based on (i) the identified signs, (ii) on the previously constructed embedding and / or (iii) on the variables from a local complete database
• Compare the clusters obtained using these different approaches, in particular with regard to the concordance on the grouping of patients as well as on the clinical relevance of the subgroups identified.
Do not hesitate to contact us to have more details.
A complete description of the projet can be sent if required.
Sincerely,
---
Clarisse Dhaenens
Vice présidente recherche : Sciences et Technologies
Université de Lille
[ mailto:clarisse.dhaenens@univ-lille1.fr | clarisse.dhaenens-flipo@univ-lille.fr ] | [ http://cristal.univ-lille.fr/ | cristal.univ-lille.fr/~dhaenens ]
Siège : 42, rue Paul Duez - 59800 Lille
CRIStAL : Bureau S3.03 - Bât. ESPRIT - 59655 Villeneuve d'Ascq
Tél : +33 (0)3 28 77 85 82
!! Nouvelles publications !!
A Biclustering Method for Heterogeneous and Temporal Medical Data
[ https://ieeexplore.ieee.org/abstract/document/9055135 | https://ieeexplore.ieee.org/abstract/document/9055135 ]
The detection of hospitalized patients at risk of testing positive to multi-drug resistant bacteria using MOCA-I, a rule-based "white-box" classification algorithm for medical data
[ https://www.sciencedirect.com/science/article/abs/pii/S1386505620301465?via%3Dihub | https://www.sciencedirect.com/science/article/abs/pii/S1386505620301465?via%3Dihub ]
**********************************************************
*
* 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 21, 2020
[DMANET] Fields institute program on geometric constraint systems
Registration is open for all activities at the January-June 2021 thematic
program on geometric constraint systems, framework rigidity and distance
geometry.
To find out more please visit the website,
http://www.fields.utoronto.ca/activities/20-21/constraint.
The major activities are:
Winter school on geometric constraint systems, January 11-22
Workshop on progress and open problems in rigidity theory, February 22-26
Workshop on the geometry of circle packings, April 12-16
Workshop on distance geometry, semi-definite programming and applications,
May 10-14
Workshop on real algebraic geometry and algorithms for geometric constraint
systems, June 14-18
All activities will be available online with free registration and a number
of the events are accepting contributed talks.
We hope to see many of you there.
Best wishes
Tony Nixon (on behalf of the organising committee.)
**********************************************************
*
* 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/
*
**********************************************************
program on geometric constraint systems, framework rigidity and distance
geometry.
To find out more please visit the website,
http://www.fields.utoronto.ca/activities/20-21/constraint.
The major activities are:
Winter school on geometric constraint systems, January 11-22
Workshop on progress and open problems in rigidity theory, February 22-26
Workshop on the geometry of circle packings, April 12-16
Workshop on distance geometry, semi-definite programming and applications,
May 10-14
Workshop on real algebraic geometry and algorithms for geometric constraint
systems, June 14-18
All activities will be available online with free registration and a number
of the events are accepting contributed talks.
We hope to see many of you there.
Best wishes
Tony Nixon (on behalf of the organising committee.)
**********************************************************
*
* 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] Theory Positions at Stony Brook
Theory Positions at Stony Brook
Stony Brook University's Department of Computer Science invites applicants for multiple tenure-track/tenured faculty positions at the Assistant, Associate, and Full Professor levels with an expected starting date of Fall 2021. Exceptionally qualified junior and senior candidates in all areas of Computer Science are invited to apply. Candidates in theoretical computer science are particularly encouraged from the areas of (1) quantum computing/information science; (2) algorithms and complexity theory; and (3) theory of machine learning.
**********************************************************
*
* 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] ADT 2021 - Preliminary Call for Papers
ADT 2021 - PRELIMINARY CALL FOR PAPERS
The 7th International Conference on Algorithmic Decision Theory - ADT 2021
Institute de Recherche en Informatique de Toulouse (IRIT)
and University of Toulouse 1 Capitole
October 28 - 30, 2021 (to be confirmed), Toulouse, France
https://www.irit.fr/ADT2021
-----------------------------------------------------
AIM AND SCOPE
-----------------------------------------------------
The ADT 2021 conference focus is on algorithmic decision theory broadly
defined, seeking to bring together researchers and practitioners coming from
diverse areas of Computer Science, Economics and Operations Research in order
to improve the theory and practice of modern decision support. The conference
topics include research in Algorithms, Argumentation Theory, Artificial
Intelligence, Computational Social Choice, Database Systems, Decision Analysis,
Discrete Mathematics, Game Theory, Machine Learning and Adversarial Machine
Learning, Matching, Multi-agent Systems, Multiple Criteria Decision Aiding,
Networks, Optimization, Preference Modelling, Risk Analysis and Adversarial
Risk Analysis, and Utility Theory.
ADT 2021 provides a multi-disciplinary forum for sharing knowledge in this area
with a special focus on algorithmic issues in Decision Theory, continuing the
tradition of the first six editions of the International Conference on
Algorithmic Decision Theory (ADT 2009 Venice, ADT 2011 Rutgers, ADT 2013
Brussels, ADT 2015 Lexington, ADT 2017 Luxembourg, ADT 2019 Durham NC) which
brought together researchers and practitioners from diverse areas of computer
science, economics, and operations research from around the globe.
-----------------------------------------------------
IMPORTANT DATES
-----------------------------------------------------
Title and abstract submission: April 23, 2021 (AoE)
Full paper submission: April 30, 2021 (AoE)
Notification: July 12, 2021
Final version of accepted papers: August 2, 2021
Conference dates: October 28 - 30, 2021 (to be confirmed)
-----------------------------------------------------
PROGRAM COMMITTEE CO-CHAIRS
-----------------------------------------------------
Dimitris Fotakis, National Technical University of Athens, Greece
David Rios Insua, ICMAT-CSIC, Spain
-----------------------------------------------------
ORGANIZING COMMITTEE
-----------------------------------------------------
Umberto Grandi, Universite Toulouse 1 Capitole and IRIT, France (chair)
Sylvie Doutre, Universite Toulouse 1 Capitole and IRIT, France
Laurent Perrussel, Universite Toulouse 1 Capitole and IRIT, France
Pascale Zarate, Universite Toulouse 1 Capitole and IRIT, France
-----------------------------------------------------
CONFERENCE VENUE
-----------------------------------------------------
ADT 2021 will be held at the Institute de Recherche en Informatique de Toulouse
(IRIT), Universite Toulouse 1 Capitole, Toulouse, France.
-----------------------------------------------------
SUBMISSIONS
-----------------------------------------------------
Submissions are invited on significant, original and previously unpublished
research on all aspects of Algorithmic Decision Theory. Papers must be at most
15 pages long in the LNCS format (including references). The formal proceedings
of ADT 2021 will be published by Springer Verlag in the Lecture Notes in
Artificial Intelligence (LNAI) series ( http://www.springer.com/lncs ).
ADT 2021 will not accept any paper that, at the time of submission, is under
review for, has already been published in, or has already been accepted for
publication in, a journal or another venue with formally published proceedings.
All papers will be peer-reviewed by a double-blind procedure. Therefore, papers
must be submitted anonymously as pdf documents via the EasyChair system:
https://easychair.org/conferences/?conf=adt2021
To accommodate the publishing traditions of different fields, ADT 2021 will
accept two types of submissions:
Submissions with full text in the proceedings: Papers of this type will be
accepted for either oral or poster presentation, or both. Each accepted paper
of this type will be allocated at most 15 pages in the proceedings and there
will be no distinction between papers accepted for oral or poster presentation
in the conference proceedings.
Submissions with one-page abstract in the proceedings: Papers of this type will
be accepted for either oral or poster presentation, or both. Each accepted
paper of this type will appear as a one-page abstract in the proceedings, along
with a URL pointing to the full paper. This option is available to accommodate
subsequent publication in journals that would not consider results that have
been published in preliminary form in conference proceedings.
**********************************************************
*
* 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/
*
**********************************************************
The 7th International Conference on Algorithmic Decision Theory - ADT 2021
Institute de Recherche en Informatique de Toulouse (IRIT)
and University of Toulouse 1 Capitole
October 28 - 30, 2021 (to be confirmed), Toulouse, France
https://www.irit.fr/ADT2021
-----------------------------------------------------
AIM AND SCOPE
-----------------------------------------------------
The ADT 2021 conference focus is on algorithmic decision theory broadly
defined, seeking to bring together researchers and practitioners coming from
diverse areas of Computer Science, Economics and Operations Research in order
to improve the theory and practice of modern decision support. The conference
topics include research in Algorithms, Argumentation Theory, Artificial
Intelligence, Computational Social Choice, Database Systems, Decision Analysis,
Discrete Mathematics, Game Theory, Machine Learning and Adversarial Machine
Learning, Matching, Multi-agent Systems, Multiple Criteria Decision Aiding,
Networks, Optimization, Preference Modelling, Risk Analysis and Adversarial
Risk Analysis, and Utility Theory.
ADT 2021 provides a multi-disciplinary forum for sharing knowledge in this area
with a special focus on algorithmic issues in Decision Theory, continuing the
tradition of the first six editions of the International Conference on
Algorithmic Decision Theory (ADT 2009 Venice, ADT 2011 Rutgers, ADT 2013
Brussels, ADT 2015 Lexington, ADT 2017 Luxembourg, ADT 2019 Durham NC) which
brought together researchers and practitioners from diverse areas of computer
science, economics, and operations research from around the globe.
-----------------------------------------------------
IMPORTANT DATES
-----------------------------------------------------
Title and abstract submission: April 23, 2021 (AoE)
Full paper submission: April 30, 2021 (AoE)
Notification: July 12, 2021
Final version of accepted papers: August 2, 2021
Conference dates: October 28 - 30, 2021 (to be confirmed)
-----------------------------------------------------
PROGRAM COMMITTEE CO-CHAIRS
-----------------------------------------------------
Dimitris Fotakis, National Technical University of Athens, Greece
David Rios Insua, ICMAT-CSIC, Spain
-----------------------------------------------------
ORGANIZING COMMITTEE
-----------------------------------------------------
Umberto Grandi, Universite Toulouse 1 Capitole and IRIT, France (chair)
Sylvie Doutre, Universite Toulouse 1 Capitole and IRIT, France
Laurent Perrussel, Universite Toulouse 1 Capitole and IRIT, France
Pascale Zarate, Universite Toulouse 1 Capitole and IRIT, France
-----------------------------------------------------
CONFERENCE VENUE
-----------------------------------------------------
ADT 2021 will be held at the Institute de Recherche en Informatique de Toulouse
(IRIT), Universite Toulouse 1 Capitole, Toulouse, France.
-----------------------------------------------------
SUBMISSIONS
-----------------------------------------------------
Submissions are invited on significant, original and previously unpublished
research on all aspects of Algorithmic Decision Theory. Papers must be at most
15 pages long in the LNCS format (including references). The formal proceedings
of ADT 2021 will be published by Springer Verlag in the Lecture Notes in
Artificial Intelligence (LNAI) series ( http://www.springer.com/lncs ).
ADT 2021 will not accept any paper that, at the time of submission, is under
review for, has already been published in, or has already been accepted for
publication in, a journal or another venue with formally published proceedings.
All papers will be peer-reviewed by a double-blind procedure. Therefore, papers
must be submitted anonymously as pdf documents via the EasyChair system:
https://easychair.org/conferences/?conf=adt2021
To accommodate the publishing traditions of different fields, ADT 2021 will
accept two types of submissions:
Submissions with full text in the proceedings: Papers of this type will be
accepted for either oral or poster presentation, or both. Each accepted paper
of this type will be allocated at most 15 pages in the proceedings and there
will be no distinction between papers accepted for oral or poster presentation
in the conference proceedings.
Submissions with one-page abstract in the proceedings: Papers of this type will
be accepted for either oral or poster presentation, or both. Each accepted
paper of this type will appear as a one-page abstract in the proceedings, along
with a URL pointing to the full paper. This option is available to accommodate
subsequent publication in journals that would not consider results that have
been published in preliminary form in conference proceedings.
**********************************************************
*
* 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 20, 2020
[DMANET] Faculty positions in Industrial and Operations Engineering, University of Michigan
The Department of Industrial and Operations Engineering at the University
of Michigan invites applications and nominations for faculty positions
beginning September 2021.
of Michigan invites applications and nominations for faculty positions
beginning September 2021.
We seek outstanding candidates for faculty positions at the rank of
assistant professor. Our department is highly multidisciplinary, with a
balance of theoretical and methodological research and applied research
interests. From a methodological perspective, we will be considering
candidates in all areas related to Industrial and Operations Engineering,
including Operations Research, Ergonomics, Data Science, and related
disciplines. The many application areas in the department include business
operations, health and human safety, energy and sustainability, mobility
and transportation, public policy, manufacturing, and robotics. Candidates
must have, or be near completion of a Ph.D., and must demonstrate a strong
commitment to high-quality research and evidence of teaching potential.
Please submit your application to the following:
http://ioe-2.engin.umich.edu/fac_search/application.php
Candidates should provide (i) a current C.V., (ii) a list of at least three
references, and three summary statements of up to two pages each
describing, respectively: (iii) career teaching plans; (iv) research plans;
and (v) activities, contributions, or plans related to supporting
diversity, equity, and inclusion. For candidates with prior teaching
experience, please provide (vi) a summary of course (teaching) evaluations.
Candidates should also have their references send three letters of
recommendation to us directly at IOEFacultySearch@umich.edu.
Applications will be reviewed on a rolling basis until appointments are
finalized. For full consideration, candidates are encouraged to apply
before December 15, 2020.
Michigan Engineering's vision is to be the world's preeminent college of
engineering serving the common good. This global outlook, leadership focus,
and service commitment permeate our culture. Our vision is supported by a
mission and values that, together, provide the framework for all that we
do. Information about our vision, mission, and values can be found at:
http://strategicvision.engin.umich.edu/.
We seek faculty members who commit to excellence in graduate and
undergraduate education, will develop impactful, productive and novel
research programs, and will contribute to the department's goal of
eliminating systemic racism and sexism by embracing our culture of
Diversity, Equity and Inclusion (DEI). We are especially interested in
candidates who can build collaborative ties with other departments within
the College of Engineering and the University. The University of Michigan
is responsive to the needs of dual career families.
If you have any questions regarding the web application submittal process
or other inquiries, please contact Akosua Dow, akosuad@umich.edu.
The University of Michigan is a non-discriminatory, affirmative action
employer.
**********************************************************
*
* 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] Make the Transition: Third Computational Geometry Challenge Opens!
Dear colleagues,
Can you make the transition from a given starting configuration to a desired target arrangement?
That is the central question of the Third Computational Geometry Challenge!
The contest opens at midnight UTC, November 20, 2020.
Submissions will be accepted until February 15, 2021, AOE.
All details can now be found at
https://cgshop.ibr.cs.tu-bs.de/competition/cg-shop-2021/
We are looking forward to your contributions and welcome questions and comments!
Challenge Team:
Sándor Fekete, Phillip Keldenich, Dominik Krupke, Joe Mitchell
Advisory Board:
Bill Cook, Andreas Fabri, Michael Kerber, Philipp Kindermann, Kevin Verbeek
------------------------------------------------------------------------------------------
The Challenge is part of CG Week in Buffalo, USA, June 7-11, 2021.
The specific problem chosen for the 2021 Challenge is „Coordinated Motion Planning",
as follows. (See the website
https://cgshop.ibr.cs.tu-bs.de/competition/cg-shop-2021/#problem-description
for illustrations and animations.)
Given a set of n axis-aligned unit-square „robots" in the plane,
a set S = {s_1,…,s_n} of n non-overlapping „start" pixels of the integer grid,
and a set T = {t_1,…,t_n} of n non-overlapping „target" pixels of the integer grid.
During each unit of time, robots can move (at unit speed) in direction north/south/east/west
to adjacent pixels, provided they stay disjoint from all other robots.
(This condition has to be satisfied at all times, not just when robots are at pixel positions.
For example, if there are robots at each of the adjacent pixels (x,y) and (x+1,y),
then the robot at (x,y) can move east into position (x+1,y) only if the robot
at (x+1,y) moves east at the same time, so the two robots remain in contact,
during the movement, but never overlap.)
In addition, there may be a set of obstacles, consisting of a number of blocked pixels
that cannot be used by robots.
The task is to compute a feasible set of trajectories for all robots i that moves each of
them from s_i to t_i.
We will run the challenge in two separate categories, with the two following objective functions:
(A) minimize the makespan, i.e., the time until all robots have reached their destinations;
(B) minimize the overall energy, i.e., the total distance traveled by all robots.
The problem is motivated by questions of multi-object motion planning, such as robot navigation
and air traffic control. Even the version considered in the Challenge is known to be NP-complete;
see [1], and [2] for an illustrating video.
Details of the competition (such as benchmark instances, data formats, and rules for
submission and evaluation) will be announced in coming weeks; see the timeline below.
The contributors with the most outstanding solutions will be recognized at CG Week
and invited to present their results, both at the event and in the proceedings.
Timeline:
------------
- November 20, 2020: Release of instances, detailed rules, start of contest
- February 15, 2021: Contest closes, winners are invited to submit an abstract
for the SoCG proceedings by early March
- March 1, 2021: First version of proceedings abstracts due for screening and editing
- March 15, 2021: Feedback on abstracts, notification of acceptance,
details of final revision
- March 31, 2021: Final versions due
References:
----------------
[1] E.D. Demaine, S.P. Fekete, P. Keldenich, H. Meijer, C. Scheffer.
Coordinated Motion Planning: Reconfiguring a Swarm of Labeled Robots with Bounded Stretch.
SIAM Journal on Computing, Vol. 48, No. 6, pp. 1727-1762, 2019
[2] A.T. Becker, S.P. Fekete, P. Keldenich, M. Konitzny, L. Lin, C. Scheffer.
Coordinated Motion Planning: The Video.
In: Proceedings of the 34th International Symposium on Computational Geometry (SoCG 2018), pp. 74:1-74:6.
https://www.ibr.cs.tu-bs.de/users/fekete/Videos/CoordinatedMotionPlanning.mp4
**********************************************************
*
* 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] A word from the machine room
Dear colleagues,
you might have noticed a delay in recent dmanet-emails. We had to move our servers to a different building, which led to an "unforeseen" downtime of two days. Everything should be running again now.
I apologise for any inconvenience. Thank you for using dmanet, we are very happy to offer this service to the community!
Best regards,
Frederik von Heymann (current dmanet admin)
**********************************************************
*
* 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] PACE 2021 Call for Participation
We are happy to announce the sixth iteration of PACE, the Parameterized
Algorithms and Computational Experiments Challenge. The goals of PACE as
well as official reports for past challenges can be found on our
website: https://pacechallenge.org/.
Algorithms and Computational Experiments Challenge. The goals of PACE as
well as official reports for past challenges can be found on our
website: https://pacechallenge.org/.
This year, the challenge is on Cluster Editing:
* Input: An undirected graph
* Output: A cluster editing set of minimum cardinality.Here, a cluster
editing set is a set of edge modifications (addition or deletion) that
transforms the graph into a cluster graph (each connected component is a
clique)
** Tracks
------------------------------------------------------------
Three tracks are planned:
*Exact:* Compute a cluster editing set of minimum cardinality. You have
30 minutes per instance. Contestants are ranked by number of instances
solved and time required. Detailed ranking method will be published online.
*Heuristic:* Compute some cluster editing set of decent cardinality. You
have 10 minutes per instance. Contestants are ranked by quality of
results and time required. Detailed ranking method will be published online.
*Kernelization:* Compute an equivalent smaller instance. You have 5
minutes per instance. Contestants are ranked by size of the returned
instance. Detailed ranking method will be published online.Detailed
instructions and public instances will be published later (see Timeline
below)
** Prizes
------------------------------------------------------------
Thanks to the generous sponsoring of the NETWORKS project
(http://thenetworkcenter.nl/) prize money is available for the winners
of the competition.
** Timeline
------------------------------------------------------------
* October 22nd, 2020: Announcement of the challenge (Problem)
* November 20th, 2020: Announcement of the tracks and additional information
* December 16th, 2020: Public instances are available
* TBA / March 2021: Submission via optil.io is open (for testing and
unofficial, auxiliary leaderboard)
* TBA / May/June 2021 (AOE): Submission of the final version (solver
description due two weeks after the source code)
* TBA / July 2021: Announcement of the results
* TBA / September 6-10, 2021: Award ceremony at the International
Symposium on Parameterized and Exact Computation (IPEC 2021)
** Program Committee
------------------------------------------------------------
* André Nichterlein (mailto:andre.nichterlein@tu-berlin.de) (chair)
(Technische Universität Berlin)
* Leon Kellerhals (Technische Universität Berlin)
* Tomohiro Koana (Technische Universität Berlin)
* Philipp Zschoche (Technische Universität Berlin)
** Steering Committee
------------------------------------------------------------
* Édouard Bonnet (LIP, ENS Lyon)
* Holger Dell (Goethe University Frankfurt and IT University of Copenhagen)
* Johannes Fichte (Technische Universität Dresden)
* Markus Hecher (Technische Universität Wien)
* Bart M. P. Jansen (chair) (Eindhoven University of Technology)
* Petteri Kaski (Aalto University)
* Łukasz Kowalik (University of Warsaw)
* Marcin Pilipczuk (University of Warsaw)
* Manuel Sorge (Technische Universität Wien)
**********************************************************
*
* 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/
*
**********************************************************
Subscribe to:
Posts (Atom)
Posts
