dmanet@zpr.uni-koeln.de
To subscribe or unsubscribe via the World Wide Web, visit
http://www.zaik.uni-koeln.de/mailman/listinfo/dmanet
or, via email, send a message with subject or body 'help' to
dmanet-request@zpr.uni-koeln.de
You can reach the person managing the list at
dmanet-owner@zpr.uni-koeln.de
When replying, please edit your Subject line so it is more specific
than "Re: Contents of dmanet digest..."
Today's Topics:
1. CS faculty positions at UIUC (Erickson, Jeff G)
2. EvoCOP 2016 last CFP: Extended deadline (Nov. 11) + Special
Issue in JoH (José Francisco Chicano García)
3. ICALP 2016 Call for Papers (Irene Finocchi)
4. Mixed Integer Programming Workshop (MIP 2016): First
announcement (Kati Wolter)
----------------------------------------------------------------------
Message: 1
Date: Mon, 2 Nov 2015 17:45:38 +0000
From: "Erickson, Jeff G" <jeffe@illinois.edu>
To: "dmanet@zpr.uni-koeln.de" <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] CS faculty positions at UIUC
Message-ID: <E8962E6E-DBB1-4F2D-A492-BA87E552535B@cs.uiuc.edu>
Content-Type: text/plain; charset="us-ascii"
The Department of Computer Science (CS) at the University of Illinois at Urbana-Champaign invites applications for faculty positions at all levels and in all areas of CS, but with particular emphasis in the areas of architecture, bioinformatics and genomics, computer systems (including trustworthy computing, distributed, cloud, mobile, and OS), data systems, machine learning, parallel and high-performance computing, privacy and security, programming languages, and THEORETICAL COMPUTER SCIENCE. Applications are encouraged from candidates whose research programs are in traditional as well as in nontraditional and interdisciplinary areas of computer science. The department is engaged in exciting new and expanding programs for research, education, and professional development, with strong ties to industry. Applications are being accepted now. For more information and to apply, please visit: http://cs.illinois.edu/faculty-positions. In order to ensure full consideration, applications must be received by January 8, 2016.
The University of Illinois conducts criminal background checks on all job candidates upon acceptance of a contingent offer.
Illinois is an EEO Employer/Vet/Disable (www.inclusiveillinois.illinois.edu) and committed to a family-friendly environment (http://provost.illinois.edu/worklife/index.html).
----
I am the chair of the recruiting committee; please feel free to contact me directly with any questions.
-- Jeff
------------------------------
Message: 2
Date: Tue, 3 Nov 2015 00:51:38 +0100
From: José Francisco Chicano García <chicano@lcc.uma.es>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] EvoCOP 2016 last CFP: Extended deadline (Nov. 11) +
Special Issue in JoH
Message-ID: <063798D4-6321-4677-88B2-0389414F5794@lcc.uma.es>
Content-Type: text/plain; charset=us-ascii
*********************************************************************************************
EvoCOP 2016 - The 16th European Conference on
Evolutionary Computation in Combinatorial Optimisation
http://www.evostar.org/2016/cfp_evocop.php
March 30 - April 01, 2016
Porto, Portugal
Part of Evo* 2016 (http://www.evostar.org)
*********************************************************************************************
The 16th European Conference on Evolutionary Computation in Combinatorial Optimisation is a multidisciplinary conference that brings together researchers working on metaheuristics for solving difficult combinatorial optimisation problems appearing in various industrial, economic, and scientific domains. Prominent examples of metaheuristics include: evolutionary algorithms, simulated annealing, tabu search, scatter search and path relinking, memetic algorithms, ant colony and bee colony optimisation, particle swarm optimisation, variable neighbourhood search, iterated local search, greedy randomized adaptive search procedures, estimation of distribution algorithms, and hyperheuristics. Successfully solved problems include scheduling, timetabling, network design, transportation and distribution problems, vehicle routing, travelling salesman, graph problems, satisfiability, energy optimisation problems, packing problems, and planning problems.
The EvoCOP 2016 conference will be held in the city of Porto, Portugal. It will be held in conjunction with EuroGP (the 19th European Conference on Genetic Programming), EvoMUSART (5th European conference on evolutionary and biologically inspired music, sound, art and design) and EvoApplications (specialist events on a range of evolutionary computation topics and applications), in a joint event collectively known as Evo*.
**** Areas of Interest and Contributions ****
Topics of interest include, but are not limited to:
Applications of metaheuristics to combinatorial optimisation problems
Novel application domains for metaheuristic optimisation methods
Representation techniques
Neighbourhoods and efficient algorithms for searching them
Variation operators for stochastic search methods
Constraint-handling techniques
Hybrid methods and hybridization techniques
Parallelization
Theoretical developments
Search space and landscape analyses
Comparisons between different (also exact) techniques
Metaheuristics and machine learning
Ant colony optimisation
Artificial immune systems
Genetic programming and Genetic algorithms
(Meta-)heuristics
Scatter search
Particle swarm optimisation
Tabu search, iterated local search and variable neighbourhood search
Memetic algorithms
Hyper-heuristics and autonomous search
Estimation of distribution algorithms
String processing
Scheduling and timetabling
Network design
Vehicle routing
Graph problems
Satisfiability
Packing and cutting problems
Energy optimisation problems
Practical solving of NP-hard problems
Mixed integer programming
Multi-objective optimisation
Grid computing
Combinatorial optimisation
Nature and Bio-inspired methods
Quantum computing and quantum annealing
Optimisation in Cloud computing
Search-based software engineering
**** Publication Details ****
All accepted papers will be presented orally at the conference and printed in the proceedings published by Springer in the LNCS series (see LNCS volumes 2037, 2279, 2611, 3004, 3448, 3906, 4446, 4972, 5482, 6022, 6622, 7245, 7832, 8600 and 9026 for the previous proceedings).
**** Submission Details ****
Submissions must be original and not published elsewhere. The submissions will be peer reviewed by members of the program committee. The authors of accepted papers will have to improve their paper on the basis of the reviewers comments and will be asked to send a camera ready version of their manuscripts. At least one author of each accepted work has to register for the conference, attend the conference and present the work.
The reviewing process will be double-blind, please omit information about the authors in the submitted paper. Submit your manuscript in Springer LNCS format.
* Page limit: 16 pages
* Submission link: http://myreview.csregistry.org/evocop16/
**** Special Issue ****
The authors of selected papers accepted for the conference will be invited to submit an extended version of the paper to a Special Issue in Journal of Heuristics (Springer). The Special Issue will be tentatively published in autumn 2017.
**** Important Dates ****
Submission deadline: November 11, 2015 (extended)
EVO* event: March 30 - April 01, 2016
**** EvoCOP Programme Chairs ****
Francisco Chicano
University of Malaga, Spain
chicano(at)lcc.uma.es
Bin Hu
Austrian Institute of Technology, Austria
bin.hu(at)ait.ac.at
------------------------------
Message: 3
Date: Tue, 3 Nov 2015 10:51:01 +0100
From: Irene Finocchi <finocchi@di.uniroma1.it>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] ICALP 2016 Call for Papers
Message-ID:
<CA+iZuiXgjwh8VQdEgdcziLRipqF-w9_a+OyjTT1cytX_Yrmpuw@mail.gmail.com>
Content-Type: text/plain; charset=UTF-8
ICALP 2016
http://www.easyconferences.eu/icalp2016/
The 43rd International Colloquium on Automata, Languages, and Programming
(ICALP) will take place in Rome, Italy, on July 11-15, 2016.
ICALP is the main conference and annual meeting of the European Association
for Theoretical Computer Science (EATCS). As usual, ICALP will be preceded
by a series of workshops, which will take place on July 11.
Important dates
---------------
Submission deadline: Wednesday, February 17, 2016, 23:59 PST (Pacific
Standard Time, UTC-8)
Author notification: April 15, 2016
Final manuscript due: April 30, 2016
Deadlines are firm; late submissions will not be considered.
Proceedings
-----------
ICALP proceedings are published in the Leibniz International Proceedings in
Informatics (LIPIcs) series. This is a series of high-quality conference
proceedings across all fields in informatics established in cooperation
with Schloss Dagstuhl - Leibniz Center for Informatics. LIPIcs volumes are
published according to the principle of Open Access, i.e., they are
available online and free of charge.
Invited Speakers
=================
Subhash Khot (New York University, USA)
Marta Z. Kwiatkowska (University of Oxford, UK)
Xavier Leroy (INRIA, France)
Devavrat Shah (MIT, USA)
Topics
======
Papers presenting original research on all aspects of theoretical computer
science are sought. Typical but not exclusive topics of interest are:
Track A: Algorithms, Complexity and Games
-----------------------------------------
* Algorithmic Game Theory
* Approximation Algorithms
* Combinatorial Optimization
* Combinatorics in Computer Science
* Computational Biology
* Computational Complexity
* Computational Geometry
* Cryptography
* Data Structures
* Design and Analysis of Algorithms
* Machine Learning
* Parallel, Distributed and External Memory Computing
* Randomness in Computation
* Quantum Computing
Track B: Logic, Semantics, Automata and Theory of Programming
-------------------------------------------------------------
* Algebraic and Categorical Models
* Automata, Games, and Formal Languages
* Emerging and Non-standard Models of Computation
* Databases, Semi-Structured Data and Finite Model Theory
* Principles and Semantics of Programming Languages
* Logic in Computer Science, Theorem Proving and Model Checking
* Models of Concurrent, Distributed, and Mobile Systems
* Models of Reactive, Hybrid and Stochastic Systems
* Program Analysis and Transformation
* Specification, Refinement, Verification and Synthesis
* Type Systems and Theory, Typed Calculi
Track C: Foundations of Networked Computation:
Models, Algorithms and Information Management
------------------------------------------------------
* Algorithmic Aspects of Networks and Networking
* Formal Methods for Network Information Management
* Foundations of Privacy, Trust and Reputation in Networks
* Mobile and Wireless Networks and Communication
* Network Economics and Incentive-Based Computing Related to Networks
* Networks of Low Capability Devices
* Network Mining and Analysis
* Overlay Networks and P2P Systems
* Specification, Semantics, Synchronization of Networked Systems
* Theory of Security in Networks
Submission Guidelines
--------------------
Authors are invited to submit an extended abstract of no more than 12
pages, excluding references, in the LIPIcs style (
http://www.dagstuhl.de/en/publications/lipics/instructions-for-authors/)
presenting original research on the theory of Computer Science. The usage
of pdflatex and the LIPIcs style file (see
http://11011110.livejournal.com/300115.html for some formatting tricks) are
mandatory: papers that deviate significantly from the required format may
be rejected without consideration of merit.
All submissions will be electronic via EasyChair:
https://easychair.org/conferences/?conf=icalp2016
Submissions should be made to the appropriate track of the conference. No
prior publication or simultaneous submission to other publication outlets
(either a conference or a journal) is allowed.
All the technical details necessary for a proper scientific evaluation of a
submission must be included in the 12-page submission or in a
clearly-labelled appendix, to be consulted at the discretion of program
committee members.
Should I submit my paper to Track A or Track C?
------------------------------------------------
While the scope of Tracks A and B are generally well understood given their
long history, the situation for Track C may be less obvious. In particular,
some clarifications may be helpful regarding areas of potential overlap,
especially between Tracks A and C.
The aim for Track C is to be the leading venue for theory papers truly
motivated by networking applications, and/or proposing theoretical results
relevant to real networking, certified analytically, but not necessarily
tested practically. The motivation for the track was the lack of good
venues for theory papers motivated by applications in networking. On the
one hand, the good networking conferences typically ask for extended
experiments and/or simulations, while the TCS community is hardly able to
do such experiments or simulations. On the other hand, the good conferences
on algorithms tend to judge a paper based only on its technical difficulty
and on its significance from an algorithmic perspective, which may not be
the same as when judging the paper from the perspective of impact on
networks.
Several areas of algorithmic study of interest to track C have a broad
overlap with track A. Graph algorithmics can belong in either, though if
the work is not linked to networking, it is more appropriate in track A.
Algorithmic game theory is another area of major overlap. Aspects involving
complexity, the computation of equilibria and approximations, belong more
in Track A, while results with applications in auctions, networks and some
aspects of mechanism design belong in Track C.
Finally, it should be noted that algorithms and complexity of
message-passing based distributed computing belong squarely in track C,
while certain other aspects of distributed computing do not fall under its
scope.
Best Paper Awards
-----------------
As in previous editions of ICALP, there will be best paper and best student
paper awards for each track of the conference. In order to be eligible for
a best student paper award, a paper should be authored only by students and
should be marked as such upon submission.
Committees
==========
Track A: Algorithms, complexity, and games
------------------------------------------
Yuval Rabani (The Hebrew University of Jerusalem, Israel, Chair)
Susanne Albers (TU Munchen, Germany)
Andris Ambainis (University of Latvia, Latvia)
Per Austrin (KTH Royal Institute of Technology, Sweden)
Harry Buhrman (Centrum Wiskunde & Informatica, Netherlands)
Elisa Celis (EPFL, Switzerland)
Nicolo' Cesa-Bianchi (University of Milano, Italy)
Marek Cygan (University of Warsaw, Poland)
Ilias Diakonikolas (University of Edinburgh, Scotland)
Josep Diaz (University Polytechnica de Catalunya, Spain)
Benjamin Doerr (Ecole Polytechnique, France)
Dimitris Fotakis (NTUA, Greece)
Anna Gal (University of Texas at Austin, USA)
Cyril Gavoille (University of Bordeaux, France)
Fabrizio Grandoni (USI, Switzerland)
Iftach Haitner (Tel Aviv University, Israel)
Monika Henzinger (University of Vienna, Austria)
Rahul Jain (National University of Singapore, Singapore)
Ken-Ichi Kawarabayashi (National Institute of Informatics, Japan)
Piotr Krysta (University of Liverpool, UK)
Francois Le Gall (University of Tokyo, Japan)
Stefano Leonardi (Sapienza University of Rome, Italy)
Jian Li (Tsinghua University, China)
Nutan Limaye (Indian Institute of Technology, India)
Satya Lokam (Microsoft Research, India)
Raghu Meka (UCLA, USA)
Lorenzo Orecchia (Boston University, USA)
Rotem Oshman (Tel Aviv University, Israel)
Giuseppe Persiano (University of Salerno, Italy)
Nikhil Srivastava (University of California, Berkeley, USA)
Mikkel Thorup (University of Copenhagen, Denmark)
Dominique Unruh (University of Tartu, Estonia)
Justin Ward (University of Warwick, UK)
Track B: Logic, semantics, automata and theory of Programming
-------------------------------------------------------------
Davide Sangiorgi (University of Bologna, Italy, Chair)
Parosh Aziz Abdulla (University of Uppsala, Sweden)
Tomas Brazdil (Masaryk University, Czech Republic)
Arnaud Carayol (CNRS, Marne-La-Vallee, France)
Taolue Chen (University of Oxford, UK)
Silvia Crafa (University of Padova, Italy)
Loris D'Antoni (University of Pennsylvania, USA)
Pedro D'Argenio (Universidad Nacional de Cordoba, Argentina)
Yuxin Deng (East China Normal University, Shanghai, China)
Maribel Fernandez (King's College London, UK)
Matthew Hague (University of London, UK)
Anna Ingolfsdottir (Reykjavik University, Iceland)
Jarkko Kari (University of Turku, Finland)
Joost-Pieter Katoen (Aachen University, Germany)
Barbara Konig (University Duisburg-Essen, Germany)
Bartek Klin (University of Warsaw, Poland)
Parthasarathy Madhusudan (University of Illinois, USA)
Massimo Merro (University of Verona, Italy)
Stephan Merz (Inria Nancy, France)
Madhavan Mukund (Chennai Mathematical Institute, India)
Filip Murlak (University of Warsaw, Poland)
Aleksandar Nanevski (Madrid Institute of Advanced Studies, Spain)
C.-H. Luke Ong (University of Oxford, UK)
Jorge A. Perez (University of Groningen, Netherlands)
Damien Pous (ENS de Lyon, France)
Jakob Rehof (TU Dortmund, Germany)
Tachio Terauchi (JAIST, Japan)
Track C: Foundations of networked computation:
Models, algorithms and information management
------------------------------------------------------
Michael Mitzenmacher (Harvard University, USA, Chair)
Luca Becchetti (Sapienza University of Rome, Italy)
Shuchi Chawla (University of Wisconsin - Madison, USA)
Krishnendu Chatterjee (IST, Austria)
Lap Chi Lau (Chinese University Hong Kong/Waterloo)
Flavio Chierichetti (Sapienza University of Rome, Italy)
Graham Cormode (University of Warwick, UK)
Edith Elkind (University of Oxford, UK)
Keren-Censor Hillel (Technion, Israel)
Martin Hoefer (MPI, Germany)
Valerie King (University of Victoria, Canada)
Marc LeLarge (INRIA, France)
Katrina Liggett (Caltech, USA)
Cris Moore (Santa Fe Institute, USA)
Thomas Moscibroda (Microsoft Research, China)
Rasmus Pagh (ITU, Denmark)
Rajmohan Rajaraman (Northeastern University, USA)
Aaron Roth (University of Pennsylvania, USA)
Justin Thaler (Yahoo Labs, USA)
Udi Wieder (VMware Research, USA)
------------------------------
Message: 4
Date: Tue, 3 Nov 2015 14:03:10 +0100
From: "Kati Wolter" <wolter@zib.de>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] Mixed Integer Programming Workshop (MIP 2016): First
announcement
Message-ID: <67dd5ef6c72be5d3548bb166f02d2458.squirrel@imap.zib.de>
Content-Type: text/plain;charset=iso-8859-1
*** MIXED INTEGER PROGRAMMING WORKSHOP: FIRST ANNOUNCEMENT ***
We are pleased to announce that the 2016 workshop in Mixed Integer
Programming (MIP 2016) will be held May 23rd-26th at the University of
Miami, in Coral Gables, FL. The 2016 Mixed Integer Programming workshop
will be the thirteenth in a series of annual workshops held in North
America designed to bring the integer programming community together to
discuss very recent developments in the field. The workshop consists of a
single track of invited talks and features a poster session that provides
an additional opportunity to share and discuss recent research in MIP.
Registration details, a list of confirmed speakers, a call for
participation in the poster session, and information about student travel
awards will be made in a subsequent announcement. Please see the workshop
website at https://sites.google.com/site/mipworkshop2016/ for updates.
Program Committee
- Alberto Del Pia (chair), University of Wisconsin-Madison
- Sanjeeb Dash, IBM Research
- Fatma Kilinc-Karzan, Carnegie Mellon University
- Dan Steffy, Oakland University
- Kati Wolter, MOSEK ApS
Local Committee
- Tallys Yunes, University of Miami
- Hari Natarajan, University of Miami
------------------------------
Subject: Digest Footer
_______________________________________________
dmanet mailing list
dmanet@zpr.uni-koeln.de
http://www.zaik.uni-koeln.de/mailman/listinfo/dmanet
------------------------------
End of dmanet Digest, Vol 93, Issue 2
*************************************
No comments:
Post a Comment