Theory Announcements: June 2016

Thursday, June 30, 2016

[DMANET] IWOCA 2016 - Call for Participation

CALL FOR PARTICIPATION
***********************************
27th International Workshop on Combinatorial Algorithms (IWOCA 2016)

Helsinki, Finland, August 17–19, 2016

http://iwoca2016.cs.helsinki.fi/ <http://iwoca2016.cs.helsinki.fi/>

**Early registration deadline July 1st**

PROGRAM

August 17 (Wednesday)

8:30-8:55 Registration

8:55-9:00 Welcome

09:00-09:50 Invited talk: Leslie Anne Goldberg
Approximately counting list H-colourings

9:50-10:40 Session 1: Computational complexity

Guillaume Ducoffe, Sylvain Legay and Nicolas Nisse. On the complexity of computing the tree-breadth

Martin Böhm and Pavel Veselý. Online Chromatic Number is PSPACE-Complete

10:40-11:00 Coffee break

11:00-12:40 Session 2: Computational geometry

Radoslav Fulek. Bounded embeddings of graphs in the plane

Stefan Funke, Filip Krumpe and Sabine Storandt. Crushing Balls Efficiently

Prosenjit Bose, Jean-Lou De Carufel, Alina Shaikhet and Michiel Smid. Essential Constraints of Edge-Constrained Proximity Graphs

Ahmad Biniaz, Prosenjit Bose, Anil Maheshwari and Michiel Smid. Plane Bichromatic Trees of Low Degree

12:40-14:20 Lunch break

14:20-16:00 Session 3: Networks

Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi and Luca Versari. Directing Road Networks in Each Feasible Way

Gennaro Cordasco, Luisa Gargano, Adele Rescigno and Ugo Vaccaro. Evangelism in Social Networks

Gianlorenzo D'Angelo, Mattia D'Emidio and Daniele Frigioni. Distance Queries in Large-Scale Fully Dynamic Complex Networks

Yuya Higashikawa, Siu-Wing Cheng, Tsunehiko Kameda, Naoki Katoh and Shun Saburi. Minimax Regret 1-Median Problem in Dynamic Path Networks

16:00-16:20 Coffee break

16:20-17:35 Session 4: Enumeration

Tiziana Calamoneri, Mattia Gastaldello, Arnaud Mary, Marie-France Sagot and Blerina Sinaimeri. On Maximal Chain Subgraphs and Covers of Bipartite Graphs

Max Alekseyev. Weighted de Bruijn Graphs for the Menage Problem and Its Generalizations

Haruka Mizuta, Takehiro Ito and Xiao Zhou. Reconfiguration of Steiner Trees in an Unweighted Graph

August 18 (Thursday)

09:00-10:40 Session 1: Online algorithms

Joan Boyar, Lene M. Favrholdt, Christian Kudahl and Jesper W. Mikkelsen. Weighted Online Problems with Advice

Yuta Fujishige, Michitaro Nakamura, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda. Finding gapped palindromes online

Jhoirene Clemente, Christian Kudahl, Dennis Komm and Juraj Hromkovič. Advice Complexity of the Online Search Problem

Takuya Takagi, Shunsuke Inenaga, Kunihiko Sadakane and Hiroki Arimura. Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing

10:40-11:00 Coffee break

11:00-12:40 Session 2: Algorithmic graph theory

Hassan Aboueisha, Shahid Hussain, Vadim Lozin, Jerome Monnot, Bernard Ries and Viktor Zamaraev. A boundary property for upper domination

Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau, Klaus Jansen, Kim-Manuel Klein,
Michael Lampis, Mathieu Liedloff, Jerome Monnot and Vangelis Paschos. Upper Domination: Complexity and Approximation

Konrad Kazimierz Dabrowski, Vadim Lozin and Daniel Paulusma. Well-quasi-ordering versus clique-width: new results on bigenic classes

Xujin Chen, Zhuo Diao, Xiaodong Hu and Zhongzheng Tang. Sufficient Conditions for Tuza's Conjecture on Packing and Covering Triangles

12:40-14:20 Lunch break

14:20-16:00 Invited talk: Giuseppe F. Italiano
2-Connectivity Problems in Directed Graphs

14:20-16:00 Session 3: Dynamic programming

Aravind N. R., Subrahmanyam Kalyanasundaram and Anjeneya Swami Kare. Linear Time Algorithms for Happy Vertex Coloring Problems for Trees

Pawel Gawrychowski and Łukasz Zatorski. Speeding up dynamic programming in the line-constrained k-median

16:00-16:20 Coffee break

16:20-17:10 Open problems session

18:00 Meet at excursion

20:00 Dinner at Walhalla on Suomenlinna

23:00 Transportation back to the city

August 19 (Friday)

09:00-10:40 Session 1: Combinatorial algorithms

Guillaume Blin, Marie Gasparoux, Sebastian Ordyniak and Alexandru Popa. SOBRA - Shielding Optimization for BRAchytherapy

Piotr Wojciechowski and K. Subramani. A bit-scaling algorithm for integer feasibility in UTVPI constraints

Markus Chimani, Ivo Hedtke and Tilo Wiedera. Limits of Greedy Approximation Algorithms for the Maximum Planar Subgraph Problem

Robert Benkoczi, Ram Dahal and Daya Gaur. Exact Algorithms For Weighted Coloring In Special Classes of Tree and Cactus Graphs

10:40-11:00 Coffee break

11:00-12:40 Session 2: Graph algorithms

Petr Golovach, Dieter Kratsch, Daniel Paulusma and Anthony Stewart. Finding Cactus Roots in Polynomial Time

Peter Damaschke. Computing Giant Graph Diameters

Martin Fürer. Faster Computation of Path-Width

Peter Damaschke. The Solution Space of Sorting with Recurring Comparison Faults

12:40-14:20 Lunch break

14:20-16:00 Invited talk: Petteri Kaski
Polynomial representations in algorithm design

14:20-16:00 Session 3: Combinatorics

Adrian Dumitrescu, Ritankar Mandal and Csaba Toth. Monotone paths in geometric triangulations

Andreas Baertschi, Barbara Geissmann, Daniel Graf, Tomas Hruz, Paolo Penna and Thomas Tschager. On computing the total displacement number via weighted Motzkin paths

16:00-16:20 Coffee break

16:20-17:10 Session 4: Probabilistics

Kaushik Sarkar, Charles J. Colbourn, Annalisa De Bonis and Ugo Vaccaro. Partial Covering Arrays: Algorithms and Asymptotics

Moritz von Looz and Henning Meyerhenke. Querying Probabilistic Neighborhoods in Spatial Data Sets Efficiently

17:10-17:15 Closing remarks

Welcome!

**********************************************************
*
* 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 at Goethe University

Applications are invited for a postdoc position in discrete mathematics at Goethe University Frankfurt, Germany.

This is a fixed term appointment, starting 1.10.2016 and terminating 30.09.2020.

The position comes with teaching duties (8 hours/week, mathematics for computer science) and other tasks in the context of the university's strategic initiative "Starker Start ins Studium".

For details and the official announcement see
https://www.uni-frankfurt.de/61944777/Starker-Start-ins-Studium1

Applicants should detail their teaching experience, their level of proficiency in German and their research interests.

Wednesday, June 29, 2016

[DMANET] Final CFP: ICDIM 2016

Eleventh International Conference on Digital Information Management
(ICDIM 2016)
Porto, Portugal
September 19-21, 2016
(www.icdim.org)
Technically and financially co-sponsored by IEEE Technology Engineering
Management Society
Proceedings will be indexed in IEEE Xplore

Following the successful earlier conferences at Bangalore (2006), Lyon
(2007), London (2008), Michigan (2009) , Thunder Bay (2010), Melbourne
(2011), Macau (2012), Islamabad (2013) Thailand (2014) and Jeju (2015)
the eleventh event is being organized at Porto in Portugal in 2016. The
International Conference on Digital Information Management is a
multi-subdomain conference on digital information management, science
and technology. The principal aim of this conference is to bring people
in academia, research laboratories and industry together, and offer a
collaborative platform to address the emerging issues and solutions in
digital information science and technology. The ICDIM intends to bridge
the gap between different areas of digital information management,
science and technology. This forum will address a large number of themes
and issues. The conference will feature original research and industrial
papers on the theory, design and implementation of digital information
systems, as well as demonstrations, tutorials, workshops and industrial
presentations.

The 11th International Conference on Digital Information Management will
be held during September 19-21, 2016 at Porto in Portugal.

The topics in ICDIM 2016 include but are not confined to the following
areas.

Information Retrieval
Data Grids, Data and Information Quality
Big Data Management
Temporal and Spatial Databases
Data Warehouses and Data Mining
Web Mining including Web Intelligence and Web 3.0
E-Learning, eCommerce, e-Business and e-Government
Natural Language Processing
XML and other extensible languages
Web Metrics and its applications
Enterprise Computing
Semantic Web, Ontologies and Rules
Human-Computer Interaction
Artificial Intelligence and Decision Support Systems
Knowledge Management
Ubiquitous Systems
Peer to Peer Data Management
Interoperability
Mobile Data Management
Data Models for Production Systems and Services
Data Exchange issues and Supply Chain
Data Life Cycle in Products and Processes
Case Studies on Data Management, Monitoring and Analysis
Security and Access Control
Information Content Security
Mobile, Ad Hoc and Sensor Network Security
Distributed information systems
Information visualization
Web services
Quality of Service Issues
Multimedia and Interactive Multimedia
Image Analysis and Image Processing
Video Search and Video Mining
Cloud Computing

Workshops

ICDIM 2016 has the following co-located workshops

Fifth Workshop on Emerging Problem- specific Crowdsourcing Technologies
Fifth Workshop on Advanced Techniques on Data Analytics and Data
Visualization
Fourth IEEE International Workshop on Data Management
Second Workshop on Internet of Things
Second Workshop on Big Data Mining
Second Workshop on Cluster Computing
Second Workshop on Intelligent Information Systems

Proceedings

- All the accepted papers will appear in the proceedings published by
IEEE.
- All papers will be fully indexed by IEEE Xplore.
- All the ICDIM papers are indexed by DBLP.

Modified version of the selected papers will appear in the special
issues of the following peer reviewed journals.

1. Journal of Digital Information Management (SCOPUs/EI)
2. Journal of Electrical Systems
3. Recent Advances in Electrical & Electronic Engineering
4. International Journal of Web Applications (IJWA)
5. International Journal of Information Technology and Web Engineering
(IJITWE)
6. International Journal of Emerging Sciences (IJES)
7. International Journal of Grid and High Performance Computing (IJGHPC)
(Scopus and EI Indexed)
8. International Journal of Computational Science and Engineering
(Scopus and EI Indexed)
9. International Journal of Big Data Intelligence
10. International Journal of Applied Decision Sciences (Scopus/EI)
11. International Journal of Management and Decision Making (Scopus/EI)
12 International Journal of Strategic Decision Sciences
13. International Journal of Enterprise Information Systems (Scopus/EI

Important Dates

Full Paper Submission July 10, 2016
Notification of Authors August 1, 2016
Registration Due September 1, 2016
Camera Ready Due September 1, 2016
Workshops/Tutorials/Demos September 20, 2016
Main conference September 19-21, 2016

SUBMISSIONS AT http://www.icdim.org/submission.html

Committee

General Chair

Ramiro Sámano Robles, Instituto Superior de Engenharia do Porto Rua,
Portugal

Program Chairs

Arun Pujari, Central University of Rajasthan, India
Antonio J. Tallón-Ballesteros, University of Seville, Spain

Co-Chairs

Robert Bierwolf, IEEE TEMS, Netherlands
Imran Bajwa, The Islamia University of Bahwalpur, Pakistan
Feliz Lustenberger, Espros Photonics Corporation, Switzerland
Francesco Piccialli, University of Naples "Federico II", Italy

Workshop Chair

Simon Fong, University of Macau, Macau

Email: conference at icdim.org
SUBMISSIONS AT http://www.icdim.org/submission.html
----------------------------------

[DMANET] Short term Visiting Researcher for Distributed Algorithms

===========================================================
Short term Visiting Researcher for Distributed Algorithms
===========================================================

Hamburg University of Technology (Germany) is offering a visiting
academic research fellowship for two months during the period from Oct
to Dec. 2016 for a postdoctoral researcher or a doctoral candidate in
the area of distributed algorithms. The candidate will join the
research group at the Telematics institute. It is expected that the
candidate participates in the project's research on distributed graph
algorithms, in particular "Overlay Structures for Efficient Group
Communication".

Candidates should have an excellent M.S. in computer science or
computer engineering, good English language skills (written and
spoken), demonstrated background in design and analysis of distributed
algorithms. For further information about the research fellowship,
please contact Prof. Volker Turau at Hamburg University of Technology
(http://www.ti5.tuhh.de/). Complete applications including cover
letter, CV, copies of graduate certificates, list of publications, and
a reference letter should be submitted via E-mail in a single file
(format pdf) to Prof. Dr. Volker Turau, Technical University of
Hamburg, Germany, turau(AT)tuhh.de. The deadline is July 31. 2016.

Prof. Dr. Volker Turau
Hamburg University of Technology

Am Schwarzenberg-Campus 3
D-21073 Hamburg
Tel.: (+4940) 42878-3530
Fax: (+4940) 42878-2581
http://www.ti5.tu-harburg.de/staff/turau/
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] Postdoc Position in Discrete Geometry "Geometric Constraints for Polytopes"

===============================================================================
Postdoc Position in Discrete Geometry
"Geometric Constraints for Polytopes"

Postdoctoral position at the Discrete Geometry Group,
Institute of Mathematics, Freie Universität Berlin
Collaborative Research Center "Discretization in Geometry and Dynamics,"
Project A03 "Geometric Constraints for Polytopes"
Position available now, ends June 30, 2020
Salary group: 13 TV-L FU
Job listing code: SFB_TPA03_2016

Setting:
The Discrete Geometry Group is a large research group at the Institute of Mathematics at Freie Universität Berlin, led by Günter M. Ziegler. Our research is concerned with key problems of Discrete Geometry, in particular in the theory of polytopes, as well as with configuration spaces for geometric problems and their topology.
It is active in major Berlin Mathematics research and education projects, among them the Berlin-Munich DFG Collaborative Research Center TR109 "Discretization in Geometry and Dynamics", which has now received funding for its second four year working period, as well as the "Berlin Mathematical School", the joint graduate school of the three major Berlin universities with its English language PhD program, to which the Discrete Geometry group contributes actively. Members of the group have received numerous prizes, ranging from dissertation prizes to a DFG Leibniz Prize, a Communicator Award and an ERC Advanced Grant.

Position:
Postdoctoral research position within project A03 of the DFG Collaborative Research Center TR109 "Discretization in Geometry and Dynamics." Project A03 is led by Günter M. Ziegler and Raman Sanyal (FU Berlin) and Carsten Lange (TU München). The project concerns "Geometric Constraints on Polytopes": It concerns the interaction of major geometric properties of polytopes and their combinatorial data. This research connects polytope theory with ideas and methods from Discrete Differential Geometry.
Project home page: http://www.discretization.de/en/projects/A03/

Required:
- Completed PhD in Mathematics
Desirable:
- Proven expertise and research experience pertinent to the research topics of the project, which center upon Discrete Geometry, with connections to other areas of Geometry, Discrete Mathematics, Topology, and Numerical Analysis.
- Ability and willingness to work in a team
- Programming experience

Application deadline: July 18, 2016
Applications should include application letter, CV, list of publications, and other materials documenting your research experience and interests.
Applications should preferably be sent as PDF documents by Email to
Prof. Günter M. Ziegler (pose@math.fu-berlin.de)
or by mail to
Freie Universität Berlin
Fachbereich Mathematik und Informatik
Institut für Mathematik
c/o Prof. Günter M. Ziegler
Arnimallee 2
14195 Berlin (Dahlem)
Germany

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

[DMANET] postdoc position

PostDoc position.

Applications are invited for a PostDoc in "optimization problems related to
opinion dynamics"

at Samovar/Telecom-SudParis (south of Paris, France).

The position is full-time and can be started as soon as possible for the
applicant.

Applicants should have an excellent PhD degree in operation research,
computer science, mathematics or a related discipline.

The application material should include (1) a CV and list of publications
and (2) the names and contact information of at least two references. The
material must be sent via email, to walid.benameur@telecom-sudparis.eu

Tuesday, June 28, 2016

[DMANET] Call for Papers - The 22nd IEEE Pacific Rim International Symposium on Dependable Computing (PRDC 2017)

CALL FOR PAPERS

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

The 22nd IEEE Pacific Rim International Symposium on Dependable Computing
(PRDC 2017)
Christchurch, New Zealand
January 22-25, 2017
http://prdc.dependability.org/PRDC2017/
********************************************************************************

IEEE PRDC 2017 is the twenty-second event in the series of symposia started
in 1989 that are devoted
to dependable and fault-tolerant computing. PRDC is recognized as the main
event in the Pacific area
that covers many dimensions of dependability and fault tolerance,
encompassing fundamental theoretical
approaches, practical experimental projects, and commercial components and
systems. As applications
of computing systems have permeated into all aspects of daily life, the
dependability of computing system
has become increasingly critical. This symposium provides a forum for
countries around the Pacific Rim and
other areas of the world to exchange ideas for improving the dependability
of computing systems.

"Christchurch City is alive with colour, atmosphere and world-class
attractions,
including the International Antarctic Centre, Orana Park and Willowbank
Wildlife Park.
Christchurch is known internationally as the "Garden City" because of its
spectacular gardens.
Christchurch is also home to a number of excellent cafes, bars and
restaurants.
Many popular destinations such as Kaikoura, Akaroa, Mt Hutt and South
Canterbury are less than two hours drive from Christchurch."
(from NZ tourism guide, http://www.tourism.net.nz/region/christchurch)

Topics of interest include (but not limited to):
- Architecture and System Design for Dependability
- Dependability issues in Computer Networks and the Internet
- Dependability issues in Parallel and Distributed Systems
- Dependability issues in Real-time Systems
- Dependability issues in Databases and Transaction Processing Systems
- Dependability issues in Autonomic Computing
- Dependability Issues in Cloud Computing
- Dependability issues in Cyber-Physical Systems
- Dependability issues in Socio-Technical Systems
- Dependability Measurement, Modeling, Evaluation, and Tools
- Cloud Computing Security and Privacy
- Internet of Things Architectures and Protocols
- Internet of Things Security
- Fault-tolerant Algorithms and Protocols
- Software Defined Networks Architectures and Protocols
- Software and Hardware Reliability
- Self-healing, Self-protecting, and Fault-tolerant Systems
- Safety-Critical Systems and Software
- Reliability in Web Systems and Applications

Paper Submissions

Manuscripts should be submitted in the following categories: Regular Papers
and Practical Experience Reports.
Regular Papers should describe original research (not submitted or
published elsewhere) and be not more than 10 pages
using IEEE format guidelines or 20 pages double-spaced. Practical
Experience Reports(max 6 pages using IEEE format
guidelines or 12 pages double-spaced) should describe an experience or a
case study, such as the design and deployment
of a system or actual failure and recovery field data. The title page
should include a 150-word abstract,
five keywords, authors' names and affiliations, and a line specifying
whether the submission is a Regular Paper
or a Practical Experience Report. The full mailing address, phone, fax, and
email address of the corresponding author should be specified.

All submissions must be made electronically (in PDF format) on the
submission web site.
Papers will be reviewed internationally and selected based on their
originality, significance, relevance, and clarity of presentation.
All accepted papers will be published by IEEE Computer Society Press.
One outstanding paper will be selected to receive the Best Paper Award.

Important Dates

Call for regular papers
Submission deadline: July 15, 2016 (New Deadline with Any Time Zone)
Notification: September 1, 2016

Call for Fast Abstracts
Fast Abstracts are lightly-reviewed 2-page manuscripts in IEEE format
describing unpublished,
in-progress, novel work, opinions or ideas.
The submission deadline is September 10, 2016.

Call for Industry Track Submissions
The Industry Track provides a forum for researchers and practitioners to
present and debate R&D challenges,
practical solutions, case studies, and share field reliability data.
Industry Track submissions should be
a maximum of 6 pages using IEEE format guidelines.
The submission deadline is July 22, 2016.

Call for Posters
The Poster Session provides a forum to present and discuss
works-in-progress with topics related to dependable systems.
A poster paper should use the same format as a regular paper but with a
maximum of 2 pages.
The submission Deadline is September 10, 2016.

General Chair:
Dong Seong Kim, U. of Canterbury, New Zealand

Program Co-Chairs:
Masato Kitakami, Chiba U., Japan
Vijay Varadharajan, Macquarie U., Australia

Fast Abstract Chair:
Paulo R. M. Maciel, Federal U. of Pernambuco , Brazil

Industry Track Chair:
Fumio Machida, NEC, Japan

Poster Chair:
Matthias Galster, U. of Canterbury, New Zealand

Publicity Co-Chairs:
Tatsuhiro Tsuchiya, Osaka University, Japan
Javier Alonso, University of Leon, Spain

Steering Committee:
Yennun Huang, Academia Sinica, Taiwan (Chair)
Leon Alkalai, California Institute of Tech., USA
Takashi Nanya, U of Tyoko, Japan
N. Kanekawa, Hitachi Research Lab., Japan
Jin Song Dong, National U.of Singapore
K. Pattabiraman, U. of British Columbia, Canada
Gernot Heiser, U.of New South Wales, Australia
Sy-Yen Kuo, National Taiwan U., Taiwan
Michael Lyu, Chinese U. of Hong Kong
Zhi Jin, Peking U., China

Publication Chair:
Aniket Mahanti, U. of Auckland, New Zealand
Finance Chair:
Walter Guttmann, U. of Canterbury, New Zealand

Local Arrangement Chair:
Jin Bum Hong, U. of Canterbury, New Zealand

TPC members:
Etienne Andre, Universite Paris, France
Toshiaki Aoki, JAIST, Japan
Masayuki Arai, Nihon University, Japan
Aniello Catiglione, University of Salerno, Italy
Ge-Ming Chiu, National Taiwan U of Science and Technology, Taiwan
Tadashi Dohi, Hiroshima University, Japan
Satoshi Fukumoto, Tokyo Metropolitan University, Japan
Katerina Goseva-Popstojanova, West Virginia U, USA
Zhi Guan, Peking University, China
Masanori Hashimoto, Osaka University, Japan
Naohiro Hayashibara, Kyoto Sangyo University, Japan
Sun-Yuan Hsieh, National Cheng Kung U, Taiwan
Qingpei Hu, Chinese Academy of Sciences, China
Hideyuki Ichihara, Hiroshima City University, Japan
Masashi Imai, Hirosaki University, Japan
Hidetsugu Irie, U of Electro-Communications, Japan
Jianhui Jiang, Tongji University, China
Nobuyasu Kanekawa, Hitachi, Japan
Haruhiko Kaneko, Tokyo Institute of Technology, Japan
Takashi Kitamura, National Institute of Advanced Industrial Science and
Technology, Japan
Kenichi Kourai, Kyushu Institute of Technology, Japan
Sy-Yen Kuo, National Taiwan University, Taiwan
Mikel Larrea, University of the Basque Country, Spain
Huawei Li, Chinese Academy of Sciences, China
Xiaowei Li, Chinese Academy of Sciences, China
Yanfu Li, Ecole Centrale Paris-Supelec, France
Yang Liu, Nanyang Technological University, Singapore
Brendan Mahony, DSTO, Australia
Andrew Martin, Oxford University, UK
Sjouke Mauw, University of Luxembourg, Luxemburg
Hiroshi Nakamura, University of Tokyo, Japan
Alex Orailoglu, UC San Diego, USA
Karthik Pattabiraman, The Uof British Columbia, Canada
Rui Peng, Uof science & technology Beijing, China
Toshinori Sato, Fukuoka University, Japan
Kuo-Feng Ssu, National Cheng Kung University, Taiwan
Ann Tai, WW Technology Group, USA
Dong Tang, Oracle Corporation, USA
Oliver Theel, Carl von Ossietzky U of Oldenburg, Germany
Tatsuhiro Tsuchiya, Osaka University, Japan
Sheng-De Wang, National Taiwan University, Taiwan
Yazhe Wang, Chinese Academy of Sciences, China
Jigang Wu, TianJin Polytechnic University, China
Min Xie, City University of Hong Kong, Hong Kong
Haruo Yokota, Tokyo Institute of Technology, Japan
Ling Yuan, Huazhong U of Sci and Tec, China
Wei Zhang, Hong Kong U of Sci and Tech, Hong Kong
Zheng Zheng, Duke University, USA
Huibiao Zhu, East China Normal University, China

If you have any question, please contact the organizers at
prdc2017@gmail.com

[DMANET] 2nd Call for Papers: COCOA 2016

Call for Papers
https://conference.cs.cityu.edu.hk/cocoa2016/

The 10th Annual International Conference on Combinatorial Optimization and
Applications (COCOA 2016) will be held during December 16-18, 2016 in Hong
Kong SAR, CHINA. Original research papers in the areas of combinatorial
optimization and its applications are solicited. In addition to theoretical
results, we are particularly interested in submissions that report on
experimental and applied research of general algorithmic interest. Special
consideration will be given to research that is motivated by real-world
problems. Experimental and applied papers are expected to show convincingly
the usefulness and efficiency of the algorithms discussed in a practical
setting. The topics include, but are not limited to:

The topics include, but are not limited to:

- Algorithms and Data Structures
- Approximation Algorithms
- Operation Research
- Communication Network Optimization
- Energy Efficient Wireless Sensor Networks
- Optimal Resource Management
- Social Networks
- Complex Network Optimization
- Computational Algebra
- Computational Geometry
- Computational Biology
- Computational Financing
- Computational Game Theory
- Computational Learning Theory
- Computational Number Theory
- Bioinformatics
- Graph Theory
- Graph Search
- Distributed Computational Systems
- Urban Transportation Networks
- Mobile Ad Hoc Networks
- Scheduling

Important Dates

Abstract Submission Due: July 15, 2016 by 11:59:59 PM (anywhere on earth)
Notification of Acceptance: September 1, 2016
Final Version Submission: September 13, 2016
Paper Submission

The submission should contain scholarly exposition of ideas, techniques,
and results, including the motivation and a clear comparison with related
work. The length of the submission should not exceed fifteen pages in LNCS
style. Submitted papers must describe work not previously published. They
must not be submitted simultaneously to any other conference with refereed
proceedings or to journals. We regard the following case as a simultaneous
submission. Submission of drafts which contain essentially the same results
from papers under review in other conferences or journals at the moment of
the submission. Only electronic submission will be allowed via the Springer
Online Conference System.

The submission server is now available at
https://ocs.springer.com/ocs/en/conference/submitpaperto/COCOA2016
Publication

The conference proceedings will be published by Springer-Verlag in the
Lecture Notes in Computer Science series. After the conference, selected
papers will be published in special issues of journals: *Algorithmica,
Theoretical Computer Science, Journal of Combinatorial Optimization*.
Awards

The Best Paper and the Best Student Paper will be awarded. A paper is
eligible for the Best Student Paper if all authors are full-time students
at the time of submission. To indicate that a submission is eligible,
please add the phrase "Eligible for best student paper" as the last
sentence in the "Abstract" field in the web form on the submission server.

*PC members*

Wolfgang Bein (University of Nevada, Las Vegas, United States)

Gruia Calinescu (Illinois Institute of Technology, United States)

Yixin Cao (Hong Kong Polytechnic University, Hong Kong)

Kun-Mao Chao (National Taiwan University, Taiwan)

Vincent Chau (Hong Kong Baptist University, Hong Kong)

Jing Chen (Stony Brook University, United States)

Zhi-Zhong Chen (Tokyo Denki University, Japan)

Xujin Chen (Academy of Mathematics and Systems Science, China)

Ovidiu Daescu (University of Texas at Dallas, United States)

Bhaskar DasGupta (University of Illinois at Chicago, United States)

Thang Dinh (Virginia Commonwealth University, United States)

Zhenhua Duan (Xidian University, China)

Thomas Erlebach (University of Leicester, United Kingdom)

NENG FAN (University of Arizona, United States)

Bin Fu (University of Texas- Rio Grande Valley, United States)

Stanley Fung (University of Leicester, United Kingdom)

Xiaofeng Gao (Shanghai Jiao Tong University, China)

Qianping Gu (Simon Fraser University, Canada)

Juraj Hromkovic (ETH Zurich, Switzerland)

Sun-Yuan Hsieh (National Cheng Kung University, Taiwan)

Hejiao Huang (Harbin Institute of Technology Shenzhen Graduate School,
China)

Kazuo Iwama (Kyoto University, Japan)

Naoki Katoh (Kwansei Gakuin University, Japan)

Jie Li (University of Tsukuba, Japan)

Xiaowen Liu (IUPUI, United States)

Bin Ma (University of Waterloo, Canada)

Mitsunori Ogihara (University of Miami, United States)

Sheung-Hung Poon (Brunei University of Technology, Brunei)

Xian Qiu (Zhejiang University, China)

Xiaowei Wu (The University of Hong Kong, Hong Kong)

Boting Yang (University of Regina, Canada)

Hsu-Chun Yen (National Taiwan University, Taiwan)

Zhao Zhang (Zhejiang Normal University, China)

Fay Zhong (CSUEB, United States)

Yuqing Zhu (California State University, Los Angeles, United States)

[DMANET] INFORMS Computing Society : Call for Nominations: 2016 ICS Student Paper Prize

The INFORMS Computing Society (ICS) Student Paper Award is given
annually to the best paper at the interface of computing and operations
research by a student author, as judged by the award selection
committee. The ICS Student Paper Award is sponsored by the Mica
Fonden.The INFORMS Computing Society (ICS) Student Paper Award is given
annually to the best paper at the interface of computing and operations
research by a student author, as judged by the award selection
committee. The ICS Student Paper Award is sponsored by the Mica Fonden.

Each nominated paper should satisfy the following seven eligibility
criteria:

- the entrant must have been a student on or after January 1, 2016;

- the paper must present original research results;

- the research must have been conducted while the entrant was a
student;

- the paper must be written by the entrant with only minor outside
editorial assistance (one or more advisors may appear as co-authors of
a paper, but the student must be the 'first author');

- the entrant can be a (co-)author in at most one paper submitted to
the competition;

- the paper must not have won a previous ICS Student Paper Award;

- the entrant must be an ICS member in the year the submission is made.
Note that ICS student membership is free if you are an INFORMS Student
Member.

Application Process:

Nominations should be sent electronically to icsstudentpaper@mail.infor
ms.org <icsstudentpaper@mail.informs.org> no later than midnight EDT,
July 15, 2016. The nomination packet should include the following:

- The nominated paper (30 pages or less, 1 inch margins, double spaced,
and 12 point font and in the standard format of INFORMS Journal on
Computing) in pdf;

- an email address and phone number where the entrant can be contacted
in the event they are selected as a finalist;

- letter(s) (in pdf format) signed by all coauthors of the paper and
the entrant attesting that the seven eligibility conditions are met.

The 2016 ICS Student Paper Award Committee members are:

Hande Benson (Drexel University, Chair)

Raghu Pasupathy (Purdue University)

Anna Nagurney (U of Massachusetts Amherst)

https://www.informs.org/Community/ICS/Prizes/Student-Paper-Award
<https://www.informs.org/Community/ICS/Prizes/Student-Paper-Award>
------------------------------
Hande Benson
Associate Professor
Drexel University
Philadelphia PA
------------------------------
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] INFORMS Computing Society : Call for nominations: ICS Prize

The INFORMS Computing Society (ICS) Prize is an annual award for the
best English language paper or group of related papers dealing with
the
Operations Research/Computer Science interface.  The award is
accompanied by a certificate and a $1,000 honorarium.  The award will
be
presented at the ICS Business Meeting that will take place during the
INFORMS Annual Meeting in Nashville November 13-16, 2016.

The goals of the prize are:

     * To promote the development of high-quality work advancing the
state of the art in the operations research/computer science interface;
     * To publicize and reward the contributions of those
authors/researchers who have advanced the state of the art; and
     * To increase the visibility of excellent work in the field.

Conditions for eligibility:

     * Published in the open literature;
     * Pertinent to the interface of operations research and computer
science;
     * Written in English.

Nomination process:

The nomination package should consist of a cover letter and a copy of
each nominated work.  The cover letter should provide the title,
author's name, place and date of publication as well as a
justification
for the nomination.  Self-nominations are allowed but
discouraged.  All
nominations should be submitted electronically to

icsprize@mail.informs.org

by midnight EDT, July 15, 2016.  All submissions will be acknowledged
by
the committee chair.  Hard-to-reproduce works, such as books, may be
submitted in hard copy form to the mailing address below.  In the case
of hard copy submission, three copies of each item in the nomination
packet should be submitted to the chair of the committee, and an e-
mail
indicating a hard copy submission should be sent to

icsprize@mail.informs.org

ICS Prize Awards Committee

Jon Lee, University of Michigan
Jeff Linderoth, University of Wisconsin-Madison
Nick Sahinidis, Carnegie Mellon University (chair)

Nick Sahinidis
John E. Swearingen Professor
Department of Chemical Engineering
Carnegie Mellon University
5000 Forbes Avenue
Pittsburgh, PA 15213
http://archimedes.cheme.cmu.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] IPDPS 2017 - Call for workshops and papers

25 June 2016 Release

IEEE IPDPS 2017 - 31st IEEE International Parallel & Distributed
Processing Symposium
May 29 – June 2, 2017
Buena Vista Palace Hotel
Orlando, Florida USA

-----------------------------
CALL FOR WORKSHOPS - Due 29 July 2016
-----------------------------

WORKSHOPS CHAIR and VICE-CHAIR
Bora Uçar (CNRS and ENS Lyon, France)
Erik Saule (University of North Carolina Charlotte, USA)

WORKSHOPS PROCEEDINGS CHAIR and VICE-CHAIR
Ramachandran Vaidyanathan (Louisiana State University, USA)
Kyle Chard (University of Chicago, USA)

WORKSHOPS COMMITTEE
Olivier Beaumont (Inria Bordeaux Sud-Ouest, France)
Sunita Chandrasekaran (University of Delaware, USA)
Ananth Kalyanaraman (Washington State University, USA)
Chris (CJ) Newburn (Intel, USA)
Cynthia A. Philips (Sandia National Laboratories, USA)
Sivasankaran Rajamanickam (Sandia National Laboratories, USA)
Min Si (Argonne National Laboratory, USA)
Alan Sussman (University of Maryland, USA)
Jesper Larsson Traff (Vienna University of Technology, Austria)

IPDPS 2017 CALL FOR NEW WORKSHOPS
The proposals should contain the following information:

* Description: Provide brief description of the workshop, its scope and
topics; the list of organizers with the confirmed chair(s); the program
committee members (indicate whether the members have been confirmed);
and the important dates.
* Organizers: Provide a short vita of the organizers by listing the
current affiliation, position, and previous experience in organizing
other events including workshops/conferences/panels at IPDPS or other
venues.
* History: If re-running (earlier editions were held somewhere other
than IPDPS), provide general information by listing the name of the
workshop, the hosting conference, year, number of papers submitted,
number of papers accepted, number of attendees; if there were
posters/panels, their numbers and topics (for panels), and URL's of the
existing web pages.
* Targeted papers and audience: Provide information on targeted papers
and audience: (i) Where are the papers from (government labs,
universities, industry); (ii) What is the expected profile of the
participants (speakers + audience)? (iii) How will the workshop be
advertised?
* Format of the workshop: Provide a short overview of the format by
indicating if the workshop (i) will have peer reviewed papers in the
proceedings? (ii) will be half day or full day long? (iii) will have a
keynote talk? If yes, provide a tentative list of speakers; (iv) will
have a panel? If yes, provide the topic and the potential panelists?

WHAT/WHERE TO SUBMIT
The proposals can be submitted using the link:
https://easychair.org/conferences/?conf=ipdpsw2017proposals. Submitted
proposals may not exceed three (3) single-spaced double-column pages
using 10-point size font on 8.5x11 inch pages (IEEE conference style),
including figures, tables, and references.

IPDPS 2017 UPDATE FOR EXISTING IPDPS WORKSHOPS
IPDPS Workshops from the preceding year(s) should apply for renewal. For
more information, please contact the workshops chair at workshops@ipdps.org.

REVIEW OF NEW WORKSHOP PROPOSALS and RENEWALS
All submitted proposals and renewal requests will be reviewed by the
workshops committee. Both new workshop proposals and renewal requests
are due 29 July 2016. Notification of final decisions for new proposals
and renewal requests are expected to be mailed on 2 September 2016.

ABOUT IPDPS WORKSHOPS
Held on the first and last day of the conference, IPDPS workshops
provide an extended forum that allows the IPDPS community an opportunity
to fully explore special topics and to present work that is more
preliminary and cutting-edge or that has more practical content than the
more mature research presented in the main symposium. Each workshop has
its own requirements and schedule for submissions. Workshop papers'
submission dates typically fall after the notification date for main
symposium papers. Proceedings of the workshops are distributed at the
conference and are submitted for inclusion in the IEEE Xplore Digital
Library after the conference.

-----------------------------
CALL FOR PAPERS - Due October 18, 2016
-----------------------------

SCOPE:
Authors are invited to submit manuscripts that present original
unpublished research in all areas of parallel and distributed
processing, including the development of experimental or commercial
systems. Work focusing on emerging technologies and interdisciplinary
work covering multiple IPDPS areas are especially welcome. Topics of
interest include, but are not limited to:

* Parallel and distributed algorithms, focusing on topics such as:
numerical and combinatorial parallel algorithms for analysis, machine
learning and simulation; parallel algorithms for accelerators,
neuromorphic architectures, and other non-traditional systems;
algorithms for cloud computing; power-aware parallel algorithms;
streaming algorithms; domain-specific parallel and distributed
algorithms; performance modeling and analysis of parallel and
distributed algorithms; run-time algorithms and protocols for resource
management, communication and synchronization on parallel and
distributed systems.

* Applications of parallel and distributed computing, including
computational and data-enabled science and engineering, big data
applications, parallel crowd sourcing, large-scale social network
analysis, management of big data, cloud and grid computing, scientific,
biological and medical applications, and mobile computing. Papers
focusing on applications using novel commercial or research
architectures, big data approaches, or discussing scalability toward the
exascale level are encouraged.

* Parallel and distributed architectures, including architectures for
instruction-level and thread-level parallelism; memory technologies and
memory hierarchy architectures; exascale systems designs; data center
architectures; novel big data architectures; special purpose
architectures, including graphics processors, signal processors, network
processors, media accelerators, neuromorphic systems, and other special
purpose processors and accelerators; impact of technology on
architecture; network and interconnect architectures; parallel I/O and
storage systems; power-efficient and green computing systems; resilience
and dependable architectures; and performance modeling and evaluation.

* Parallel and distributed software, including parallel and multicore
programming languages and compilers, runtime systems, operating systems,
resource management including, middleware for supercomputers, grids,
clouds, and data centers, libraries, performance modeling and
evaluation, parallel programming paradigms, and programming environments
and tools. Papers focusing on novel software systems for big data and
exascale systems are encouraged.

Papers that cross the boundaries of the four traditional tracks of IPDPS
(Algorithms, Applications, Architecture and Software) are encouraged and
will receive special attention. During submission, authors can indicate
up to three subject areas that can come from any track.

BEST PAPERS AWARDS:
The program committee will nominate papers for recognition in several
categories including the four conference topic areas as well as best
multidisciplinary paper and will consider other paper attributes that
merit recognition from the conference. The five top best papers will be
selected for presentation and the others will receive honorable mention
in the conference program.

WHAT/WHERE TO SUBMIT:
Submitted manuscripts may not exceed ten (10) single-spaced
double-column pages using 10-point size font on 8.5x11 inch pages (IEEE
conference style), including figures, tables, and references. See style
templates for details:
LaTex Package
http://www.ipdps.org/templates/IEEECS_CPS_LaTeX_Letter_2Col.zip
Word Template http://www.ipdps.org/templates/IEEECS_CPS_8.5x11x2.zip
IPDPS will again require submission of abstracts and registration of
papers one week before the paper submission deadline without any late
exceptions. Files should be submitted by following the instructions
available at the EDAS portal. Authors must ensure that electronically
submitted files are formatted in PDF format for 8.5 x 11 inch paper.
The submission portal will be available by September. Return to this
site to submit your abstract and upload your submission.

REVIEW OF MANUSCRIPTS:
All submitted manuscripts will be reviewed. Submissions will be judged
on correctness, originality, technical strength, significance, potential
impact, quality of presentation, and interest and relevance to the
conference scope. Submitted papers should NOT have appeared in or be
under consideration for another conference, workshop or journal.

Questions may be sent to PC2017@ipdps.org. Abstracts are due October 18,
2016 and full manuscripts must be received by October 23, 2016. This is
a final, hard deadline; to ensure fairness, no extensions will be given.
There will be a one week review feedback and author response period from
November 28th to December 5th. Notification of final decisions will be
mailed by January 8, 2017, and camera-ready papers will be due February
15, 2017.

IMPORTANT DATES
October 18, 2016: Registration of papers with abstracts will be
accepted up to end of day ANYWHERE ON EARTH.
October 23, 2016: Submission of registered papers will be accepted up to
end of day ANYWHERE ON EARTH.
Review feedback to authors......November 28, 2016
Author response to feedback.....December 5, 2016
Author notification.............January 8, 2017
Camera-ready due................February 15, 2017

PROGRAM CHAIR
Marc Snir (University of Illinois at Urbana Champaign, USA)

PROGRAM VICE-CHAIRS
ALGORITHMS:
Pierre Fraigniaud (IRIF, France)
APPLICATIONS:
Robert D. Moser (UT Austin, USA)
ARCHITECTURE:
Hillery Hunter (IBM Research, USA) &
Robert Senger (IBM Research, USA)
SOFTWARE:
Pavan Balaji (Argonne National Laboratory, USA)
MULTIDISCIPLINARY:
Torsten Hoefler (ETH Zurich, Switzerland)

PROGRAM COMMITTEE
(To be announced)

----------------------------------------------------------------------------
...Follow us on Facebook at https://www.facebook.com/IPDPS
...Follow us on Twitter at https://twitter.com/IPDPS
-----------------------------------------------------------------------------
Sponsored by IEEE Computer Society Technical Committee on Parallel
Processing
In cooperation with
ACM SIGARCH,
ACM SIGHPC;
IEEE Computer Society Technical Committee on Computer Architecture, and
IEEE Computer Society Technical Committee on Distributed Processing
-----------------------------------------------------------------------------

[DMANET] Deadline Extension: JSC Special Issue on Symbolic Computation in Software Science

Deadline extension

----------------------------------------
Special issue of the

JOURNAL OF SYMBOLIC COMPUTATION

SYMBOLIC COMPUTATION IN SOFTWARE SCIENCE
----------------------------------------
http://www.risc.jku.at/~tkutsia/organization/jsc-scss-2016.html

Paper submission (extended deadline): August 1, 2016

[DMANET] ALGO 2016 - Call for participation

Call for participation

ALGO 2016
22 - 26 August 2016
Aarhus, Denmark
algo16.au.dk

ALGO is the annual event combining the premier algorithmic conference European Symposium on Algorithms (ESA) with a number of specialized conferences and workshops all related to algorithms and their applications, making ALGO the major European event for researchers, students and practitioners in algorithms. ALGO 2016 will consist of the following conferences and workshops:

· ESA - 24th European Symposium on Algorithms

· ALGOCLOUD - 2nd International Workshop on Algorithmic Aspects of Cloud Computing

· ALGOSENSORS - 12th International Symposium on Algorithms and Experiments for Wireless Sensor Networks

· ATMOS - 16th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems

· IPEC - 11th International Symposium on Parameterized and Exact Computation

· MASSIVE -8th Workshop on Massive Data Algorithmics

· WAOA - 14th Workshop on Approximation and Online Algorithms

· WABI - 16th Workshop on Algorithms in Bioinformatics

ALGO 2016 will be held during 22-26 August 2016 at Aarhus University, Aarhus, Denmark. The event is hosted by the national research center MADALGO affiliated with the Department of Computer Science at Aarhus University and is organized in corporation with the European Association for Theoretical Computer Science (EACTS).

More information on the participating conferences are available at http://algo16.au.dk.

[DMANET] MASSIVE 2016 Call for Papers

===============================
MASSIVE 2016 Call for Papers
===============================

The Eighth Workshop on Massive Data Algorithmics (MASSIVE 2016) will
take place on August 23, 2016 in Aarhus, Denmark as part of ALGO 2016.

http://conferences.au.dk/algo16/massive/

The workshop has no formal proceedings, so work presented at the
workshop can also be (or have been) presented at other conferences.

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

Important Dates:

Submission deadlines:
- Paper submission: July 15, 2016 11:00pm GMT
- Author Notification: July 25, 2016
- Camera-ready version: August 10, 2016

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

Aim and scope:

Tremendous advances in our ability to acquire, store and process data,
as well as the pervasive use of computers in general, have resulted in
a spectacular increase in the amount of data being collected. This
availability of high-quality data has led to major advances in both
science and industry. In general, society is becoming increasingly
data driven, and this trend is likely to continue in the coming years.

The increasing number of applications processing massive data means
that in general focus on algorithm efficiency is increasing. However,
the large size of the data, and/or the small size of many modern
computing devices, also means that issues such as memory hierarchy
architecture often play a crucial role in algorithm efficiency. Thus
the availability of massive data also means many new challenges for
algorithm designers.

The aim of the workshop is to provide a forum for researchers from
both academia and industry interested in algorithms for massive
dataset problems. The scope of the workshop includes both fundamental
algorithmic problems involving massive data, as well as algorithms for
more specialized problems in, e.g., graphics, databases, statistics
and bioinformatics. Topics of interest include, but are not limited
to:

- I/O-efficient algorithms
- Cache-oblivious algorithms
- Memory hierarchy efficient algorithms
- Streaming algorithms
- Sublinear algorithms
- Parallel and distributed algorithms for massive data problems
- Engineering massive data algorithms

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

Paper submission:

We invite submissions of extended abstracts of original research. The
submission should begin with the title of the paper, each author's
name, affiliation, and e-mail address, followed by a succinct
statement of the problems considered, the main results, an explanation
of their significance, and a comparison to past research, all of which
should be easily understood by non-specialists. More technical
developments follow as appropriate. Use 11-point or larger font in
single column format, with one-inch or wider margins all around. You
may include a clearly marked appendix, which will be read at the
discretion of the committee. The submission, excluding title page,
bibliography and appendix, must not exceed 10 pages (authors should
feel free to send submissions that are significantly shorter than 10
pages).

Extended abstract should be submitted through the EasyChair website by
July 15th. The submission page can be found at
https://easychair.org/conferences/?conf=massive2016. Authors will be
notified about acceptance by July 25th. There will be no formal
proceedings, so work presented at the workshop can also be (or have
been) presented at other conferences. An informal collection of the
extended abstracts will be provided to the workshop participants. An
author of each accepted abstract is expected to give a presentation of
the abstract at the workshop.

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

Program committee:

Peyman Afshani (Aarhus University)
Alexandr Andoni (MIT)
Vladimir Braverman (John Hopkins University)
Raphael Clifford (Bristol University)
Graham Cormode (University of Warwick)
Jeremy Fineman (Georgetown University)
Michael Goodrich (University of California at Irvine)
John Iacono (NYU)
Riko Jacob (IT University of Copenhagen)
Paris Koutris (University of Wisconsin-Madison)
Kasper Green Larsen (MADALGO, Aarhus University)
Ulrich Meyer (Goethe University)
Ian Munro (University of Waterloo)
Jelani Nelson (Harvard University)
Jeff M. Phillips (University of Utah)
Ely Porat (Bar-Ilan University)
Nodari Sitchinava (University of Hawaii)
Jeffrey Ullman (Stanford)
Norbert Zeh (Dalhousie University)
Qin Zhang (Indiana University)

Chair: Ke Yi (Hong Kong University of Science and Technology)

Organizing committee:

Lars Arge (Aarhus and MADALGO)
Gerth Stølting Brodal (Aarhus and MADALGO)
Peyman Afshani (Aarhus and MADALGO)
Kasper Green Larsen (Aarhus and MADALGO)
Trine Ji Holmgaard (Aarhus and MADALGO)
===============================

[DMANET] ICNAAM 2016 - symposium "GRAPHS"

LAST CALL FOR PARTICIPATION

Symposium GRAPHS, ICNAAM 2016 (International Conference of Numerical
Analysis and Applied Mathematics 2016),
19-25 September 2016, Rodos Palace Hotel, Rhodes, Greece

Organizer: Vojislav Petrovic (DMI Novi Sad)

Topics:

- scores in graphs and digraphs

- Eulerian and Hamiltonian graphs and digraphs

- planar graphs

- graph factors and decompositions

- graph colorings

- extremal graphs

- graph spectra

- digraphs, tournaments and generalizations

- graph algorithms

Email to vojpet@dmi.uns.ac.rs or vojpet@gmail.com to announce registration.

For further information

vojpet@dmi.uns.ac.rs or vojpet@gmail.com

or visit

http://www.icnaam.org/

Vojislav Petrovic

Monday, June 27, 2016

[DMANET] Bordeaux Graph Workshop BGW2016 - Submissions: One-Week Remaining Reminder - Registrations open - Young Author Prize

*BORDEAUX GRAPH WORKSHOP*

CALL FOR PARTICIPATION - BGW 2016 - http://bgw.labri.fr/2016

*BGW 2016 - November 7-10, 2016*

BGW 2016 is the fourth edition of an international workshop on graph
theory, organized by the LaBRI team Graphes et optimisation.

The aim of this workshop is to gather renowned researchers from the
international graph community for a scientific meeting in a friendly
atmosphere. Its scope includes every field of graph theory.

The scientific program includes invited talks (50 min) and contributed
talks (20 min), selected on the basis of an extended abstract of at most
four pages. To submit an extended abstract, please follow the
instructions to authors:
http://bgw.labri.fr/2016/submissions.php

Registrations are now open:
http://bgw.labri.fr/2016/registration.php

Young Author Prize:
A prize of 1500 euros will be awarded at the conference for the best
contribution of an author (authors) younger than 35 years.

Invited speakers:
Maria Axenovich (Karlsruher Institut fÃ¼r Technologie, Karlsruhe,
Germany)
Csilla BujtÃ¡s (University of Pannonia, VeszprÃ©m, Hungary)
Kathie Cameron (Wilfrid Laurier University, Waterloo, Canada)
Pavol Hell (Simon Fraser University, Burnaby, Canada)
Alexandr Kostochka (University of Illinois, Urbana, USA)
Daniel KrÃ¡Ä¾ (University of Warwick, Coventry, United Kingdom)
Carsten Thomassen (Technical University of Denmark, Copenhagen,
Denmark)

Important dates:
Deadline for abstract submission: *July 3, 2016*
Notification of acceptance: September 7, 2016
Final version: September 25, 2016
Conference: November 7-10, 2016

--
Eric Sopena
on behalf of the organizing committee.
http://bgw.labri.fr/2016/

--
Eric Sopena.
-----------------------------------------------------------------
LaBRI, Université de Bordeaux
351 crs de la Libération, CS 10004, F-33405 Talence cedex, France
Tél. +33 5 40 00 38 71 - Fax. +33 5 40 00 66 69
-----------------------------------------------------------------
IUT de Bordeaux, Département Informatique
15, rue Naudet, CS 10207
33175 GRADIGNAN CEDEX, France
Tél. +33 5 56 84 57 85 - Fax. +33 5 56 84 58 86
-----------------------------------------------------------------

[DMANET] Open position: Lecturer in CS (Permanent) at NUIM Ireland

Contract Type: Permanent

Department: Computer Science
<https://www.maynoothuniversity.ie/computer-science>

Closing Date: Sunday, July 31, 2016

The CS department is theory friendly.

Maynooth University is committed to a strategy in which the primary
University goals of excellent research and scholarship and outstanding
education are interlinked and equally valued.

We are seeking an excellent academic to join our staff as a Lecturer in
Computer Science. Applications are welcome particularly from computer
scientists from the following research areas: Computer Vision, Robotics,
Intelligent Systems, Information Theory, Data Science, Dependable Software
Systems. The person appointed will have a proven record of teaching,
research and publication, appropriate to career stage. He/she will be
expected to make a strong contribution to the teaching programme of the
Department and undertake teaching duties on the Department's undergraduate
and postgraduate programmes as well as the supervision of Master's and PhD
students.

The appointee will be expected to build a strong research profile, that
supports the University's research strategy including affiliating to the
Research Institutes, where appropriate and working with colleagues on
national and international research. The appointee will be expected to
sustain and conduct research, engage in scholarship of quality and
substance and generate publications of international standard.

More details at:
https://www.maynoothuniversity.ie/human-resources/vacancies/lecturer-computer-science-permanent-department-computer-science

--
Dr Philippe Moser
Department of Computer Science
National University of Ireland Maynooth
Maynooth, Co. Kildare
Ireland
--------------------------------------------
Phone: +353-1-708-6347
WWW: http://www.cs.nuim.ie/~pmoser/

[DMANET] CFP - Algorithms MDPI - Special Issue on Parallel Algorithms for Combinatorial Optimization Problems

Call for Papers

MDPI Algorithms Journal

Special Issue on Parallel Algorithms for Combinatorial Optimization Problems
(http://www.mdpi.com/journal/algorithms/special_issues/parallel_algorithms)

Scope

Combinatorial optimization problems model most of the application scenarios
frequently arising in practice. Unfortunately, optimal solutions to these
problems are hard to obtain, with most of them having high computational
complexity. Even in the case of problems admitting polynomial time
solutions, e.g., the classical shortest path problem, the relevant
applications should now work on very large input instances or should cope
with a large number of concurrent users. Thus, faster solution methods are
clearly needed for achieving real time responses for problems previously
considered as easy ones. The same also holds for most heuristic methods or
approximation algorithms that have been proposed for obtaining approximate
solutions for hard optimization problems in acceptable execution times. For
large-scale problems, these techniques are inadequate, and much faster
algorithmic techniques are needed again.

Due to the aforementioned limitations, parallelism has been considered a
means of deriving faster algorithmic solutions. Parallel computation is
virtually ubiquitous nowadays and can be found in all modern computing
platforms. Although the concept of parallel execution is simple, its
application on combinatorial optimization problems is not straightforward,
due to the inherently irregular control flow that the algorithms for this
kind of problem commonly have. In this Special Issue, we solicit
contributions that will propose new methodologies for solving problems in
combinatorial optimization using parallel computation, either in
shared-memory systems (e.g., multi-core/many-core processors, GPUs, etc.) or
in distributed-memory systems (e.g., clusters, cloud architectures, etc.).
Topics of interest include, but are not limited to:

- Parallel exact algorithms: e.g., divide-and-conquer, dynamic programming,
etc.

- Parallel approximation algorithms- Parallel fixed parameter algorithms

- Parallel heuristics/metaheuristics for combinatorial optimization
problems: e.g., local search, simulated annealing, evolutionary computation,
swarm intelligence computation, etc.

- Parallel techniques in integer linear programming: e.g., parallelization
of branch-and-bound, column generation, and cutting plane methods or their
combinations (i.e., branch-and-cut or branch-and-price).

- Parallel algorithms for multi-objective optimization problems.

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

Manuscript submission deadline: June 30, 2016

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

Guest Editor

Dr. Charalampos Konstantopoulos

Department of Informatics

University of Piraeus, Greece (konstant@unipi.gr)

Sunday, June 26, 2016

[DMANET] Assistant Professor positions in Computer Science (University of Warwick)

================================================================
Assistant Professor positions in Computer Science at the University of Warwick
================================================================

Two enthusiastic individuals are sought to make a major contribution to the Department of Computer Science at the University of Warwick (http://www2.warwick.ac.uk/dcs/) activities in research and teaching.

This is an opportunity to join one of the UK's most prominent Computer Science departments 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. 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:
Professor Stephen Jarvis <S.A.Jarvis@warwick.ac.uk>, Computer Science, or to any senior member of the Computer Science Department (e.g., Prof Graham Cormode <G.Cormode@warwick.ac.uk> or Prof Artur Czumaj <A.Czumaj@warwick.ac.uk>).

Closing date: July 8, 2016.

It is expected that interviews will take place in the week commencing July 25, 2016.

Please would all applicants ensure that their referees send a letter of reference by email to Ruth.Cooper@warwick.ac.uk by the closing date.

More details and links to the application forms: http://www.jobs.ac.uk/job/ANW630/assistant-professor-78135-066/

[DMANET] Postdoctoral Position in Combinatorial Optimization at ETH Zurich

The Combinatorial Optimization group at ETH Zurich, headed by Prof. Rico
Zenklusen, has an opening for a Postdoctoral Researcher. The position is
initially for one year with the possibility of extension for a second year.
The starting date is flexible between fall 2016 and spring 2017.

Interests of our research group include exact and approximation algorithms,
polyhedral approaches, and matroid and submodular function optimization. We
are looking for a highly motivated candidate with excellent academic
qualifications and strong communication skills. The candidate should hold
or obtain a PhD in Mathematical Optimization or Theoretical Computer
Science before the start of the appointment.

The Combinatorial Optimization group is part of the Institute for
Operations Research within the Mathematics Department of ETH Zurich. We are
a well-connected research group with strong international visibility. We
offer a very stimulating working environment with a highly competitive
salary and benefits, excellent working conditions in the center of Zurich,
and a low teaching load.

To ensure full consideration, the application should be sent before July
31. Late applications may be considered on a case-by-case basis.

To apply, please upload your application documents online, including a CV,
list of publications, cover letter, and names and contact information of 3
references.

For further information, and to apply online, please visit
https://www.math.ethz.ch/ifor/the-institute/open-positions.html .

Saturday, June 25, 2016

[DMANET] WAAC 2016 Call for Papers

*** Submission deadline extended to July 1 ***

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

The 19th Japan-Korea Joint Workshop on
Algorithms and Computation (WAAC 2016)

August 30–31, 2016
Hakodate, Japan
http://dopal.cs.uec.ac.jp/waac16/
--------------------------------------

The aim of this workshop is to provide a forum for researchers working
on algorithms and the theory of computation, to promote the exchange
of recent results, to foster new collaborations among researchers.
Historically, the workshop has been established for the purpose of
collaboration of researchers of Korea and Japan; however,
participation from any country is welcome.

Topics
* Automata, languages and computability
* Algorithms (combinatorial/graph/geometric/randomized)
* VLSI and parallel algorithms
* Networks and distributed algorithms
* Learning theory and data mining
* Number theory and cryptography
* Graph drawing and visualization
* Computational logic
* Combinatorics and optimization

Invited Speaker
* Heejin Park (Hanyang University)

Important Dates
* Paper submission deadline (extended): July 1, 2016
* Notification of acceptance: July 11, 2016
* Final version submission: July 22, 2016
* Conference: August 30–31, 2016

Authors are invited to submit papers up to 8 pages in English via the
EasyChair submission system no later than July 1, 2016.
https://easychair.org/conferences/?conf=waac2016
The proceedings will be available at the conference site. Since the
proceeding is only distributed at the workshop, the submission of
preliminary material that is to be submitted to or extended material
to appear in other international conferences or journals is allowed
and encouraged.

Page Style and Limit
The paper must be written in English. The camera-ready version must be
printed to fit A4 size sheet. It cannot exceed 8 pages including the
title page. The first page must be in single column style although the
following pages could be in double columns. The first page should
contain the title, authors, affiliations, addresses (including
authors' e-mail addresses), and abstract.

Program Committee
* Takashi Horiyama, co-chair (Saitama University)
* Jun Kawahara (Nara Institute of Science and Technology)
* Akitoshi Kawamura (University of Tokyo)
* Sung-Ryul Kim, co-chair (Konkuk University)
* Inbok Lee (Korea Aerospace University)
* Mun-Kyu Lee (Inha University)
* Yoshio Okamoto (University of Electro-Communications)
* Heejin Park (Hanyang University)

Contact Address and Web Page
waac2016@easychair.org
http://dopal.cs.uec.ac.jp/waac16/
**********************************************************
*
* 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] Last CfP: JSC Special Issue on Symbolic Computation in Software Science

Last Call for Papers

----------------------------------------
Special issue of the

JOURNAL OF SYMBOLIC COMPUTATION

SYMBOLIC COMPUTATION IN SOFTWARE SCIENCE
----------------------------------------
http://www.risc.jku.at/~tkutsia/organization/jsc-scss-2016.html

IMPORTANT DATES
---------
Abstract submission: June 27, 2016
Paper submission: July 11, 2016
Notification: October 17, 2016
Publication: 2017

SCOPE
--------
Symbolic Computation is the science of computing with symbolic objects
(terms, formulae, programs, representations of algebraic objects etc.).
Powerful symbolic algorithms and methods have been developed during the
past decades like computer algebra, theorem proving, automated
reasoning, software verification, model checking, rewriting,
formalization of mathematics, Groebner bases, characteristic sets,
telescoping for recurrence relations, cylindric algebraic decomposition
and other quantifier elimination techniques, etc.

The purpose of this special issue is to promote research on theoretical
and practical aspects of symbolic computation in software science. The
special issue is related to the topics of the International Symposium on
Symbolic Computation in Software Science: SCSS 2014 and SCSS 2016. It
will be published by Elsevier within the Journal of Symbolic Computation.

Participants of the SCSS 2014 and SCSS 2016 symposia, as well as other
authors are invited to submit contributions.

EXAMPLES of TOPICS
-------------------
This special issue solicits papers on all aspects of symbolic
computation and their applications in software sciences. The topics
include, but are not limited to the following:

- automated reasoning
- algorithm (program) synthesis and/or verification
- formal methods for the analysis of network and system security
- termination analysis and complexity analysis of algorithms (programs)
- extraction of specifications from algorithms (programs)
- related theorem proving methods and techniques
- proof carrying code
- generation of inductive assertion for algorithm (programs)
- algorithm (program) transformations
- formalization and computerization of knowledge (maths, medicine,
economy, etc.)
- component-based programming
- computational origami
- query languages (in particular for XML documents)
- semantic web and cloud computing

SUBMISSION GUIDELINES
---------------------
This special issue welcomes original high-quality contributions that
have been neither published in nor simultaneously submitted to any
journals or refereed conferences. Submissions will be peer-reviewed
using the standard refereeing procedure of the Journal of Symbolic
Computation.

Authors of papers presented at the SCSS 2014 and SCSS 2016 symposia are
welcome and encouraged to submit extended and revised versions of their
papers. Furthermore, submissions of papers that are in the scope of
SCSS, but did not appear in SCSS 2014 and SCSS 2016 are welcome as well.

Submitted papers must be in English and include a well written
introduction explicitly addressing the following questions in succinct
and informal manner:

- What is the problem?
- Why is the problem important?
- What has been done so far on the problem?
- What is the main contribution of the paper on the problem?
- Why is the contribution original? (Clarification: The results,
already appeared in the conference paper, will be still counted as an
original result for JSC refereeing process.)
- Why is the contribution non-trivial?
- How is the journal paper different from the conference paper? (For
submissions originated from the papers presented at the symposium.)

The submissions should be complete (since there is no rigid page limit):

- All the related works and issues must be completely and carefully
discussed.
- All the previous relevant JSC papers must be properly cited and
discussed.
- All the theorem must be rigorously proved (no sketch allowed).
- All the important definitions/theorems/algorithms must be illustrated
by well chosen examples.

Submissions originated from the papers presented at the symposium should
address all the feedback from the symposium's referee process and Q/A.

SUBMISSION
--------------------
Please prepare your submission in LaTeX using the JSC document format
from http://www4.ncsu.edu/~hong/jsc.htm
(link to the submission template:
http://www4.ncsu.edu/~hong/jsc/JSC_LaTex_2007_Mar_12.zip.)

Submission is via the EasyChair submission site at
https://easychair.org/conferences/?conf=jscscss2016.

GUEST EDITORS
--------------------
James H. Davenport (University of Bath, UK)
Temur Kutsia (RISC, Johannes Kepler University Linz, Austria)
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] IEEE International Workshop on Foundations of Big Data Computing (BigDF) 2016

*******************************************************************************
CALL FOR PAPERS

IEEE International Workshop on Foundations of Big Data Computing (BigDF)
(To be held in conjunction with HiPC 2016)
December 19, 2016, Hyderabad, India

Workshop Webpage: https://sites.google.com/site/hipcbigdf/
*********************************************************************************

What constitutes a Big Data problem? What application domains are best
suited to
benefit from Big Data analytics and computing? What are the traits and
characteristics of an application that make it suited to exploit Big Data
analytics? How can Big Data systems and frameworks be designed to allow the
integration and analysis of complex data sets? How can research in Big Data
Analytics benefit from the latest advances in supercomputing and High
Performance
Computing (HPC) architectures? The goal of this workshop is to address
questions
like these that are fundamental to the advancement of Big Data computing,
and in
the process, build a diverse research community that has a shared vision to
advance the state of knowledge and discovery through Big Data computing.

Topics of interest include research contributions and innovative methods in
the following areas (but not limited to):

* Scalable tools, techniques and technologies for Big Data analytics
* Algorithms and Programming Models for Big Data
* Big Data applications - Challenges and Solutions
* Scalable Big Data systems, platforms, services, and management
* Big Data toolkits, workflows, metrics, and provenance.

We invite paper submissions that describe original research contributions
in
the area of Big Data computing, and position papers that highlight the
potential challenges and opportunities that arise in Big Data computing.
We also invite short papers that describe work-in-progress original
research.

Regular papers can be up to 8 pages long and short papers can be up to
4 pages long. All submissions will undergo rigorous peer-review by the
technical program committee, and accepted manuscripts will appear in the
workshop proceedings and will be indexed by IEEE digital library. Authors
of the accepted manuscripts will be required to present their work
at the workshop proceedings.

Paper submission link:
https://www.easychair.org/conferences/?conf=hipcbigdf2016

Please visit the workshop webpage for instructions on paper submission and
other details/updates related to the workshop.

Important Dates:

Abstract due: July 24, 2016
Paper submission deadline: August 1, 2016
Notification of acceptance/rejection: September 15, 2016
Camera-ready paper due: October 3, 2016
Author registration deadline: October 16, 2016

Workshop organization:

General Chairs: Madhu Govindaraju (SUNY Binghamton), Saumyadipta Pyne
(CRRao AIMSCS, Hyderabad)
Program Chairs: Dinkar Sitaram (PESIT), Ananth Kalyanaraman (Washington
State University)
Publicity Chairs: Arindam Pal (TCS Research)
Proceedings Chair: Ren Chen, USC (HiPC proceedings chair)
Industry Liaison: Avinash Sabharwal (Accenture, Bangalore)

Technical Program Committee:

Rekha Singhal, TCS Research
Arindam Pal, TCS Research
Mahantesh Halappanavar, Pacific Northwest National Laboratory
Abhinav Vishnu, Pacific Northwest National Laboratory
Yinglong Xia, Huawei Research
Jaroslaw Zola, SUNY Buffalo
Nabanita Das, Indian Statistical Institute
Hui Huang, Google
Sharma Thankachan, Georgia Institute of Technology/University of Central
Florida

Regards,
Dr. Arindam Pal
Research Scientist
Innovation Labs Kolkata
TCS Research
http://www.cse.iitd.ac.in/~arindamp/

Thursday, June 23, 2016

[DMANET] Computing Society : Reminder: ICS Paper Deadline July 1

Just a reminder that the full manuscript deadline for the INFORMS
Computing Society (ICS) conference volume is July 1, 2016. Find out
more on submitting an original research manuscript to the conference
volume at the conference website: http://ie.clemson.edu/ics2017/guide

You may also submit a regular INFORMS style abstracts and
presentations. The presentation submission deadline is August 1, 2016.

The conference itself will take place in Austin, Texas, from January 15
to 17th, 2017. We especially encourage submissions targeting this years
conference theme: Computing for Healthcare Analytics.

Sincerely,

Ned Dimitrov and Burak Eksioglu

--

Matthew Saltzman
Clemson University Math Sciences
mjs AT clemson DOT 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/
*
**********************************************************

Theory Announcements

Thursday, June 30, 2016

[DMANET] IWOCA 2016 - Call for Participation

[DMANET] Postdoc position at Goethe University

Wednesday, June 29, 2016

[DMANET] Final CFP: ICDIM 2016

[DMANET] Short term Visiting Researcher for Distributed Algorithms

[DMANET] Postdoc Position in Discrete Geometry "Geometric Constraints for Polytopes"

[DMANET] postdoc position

Tuesday, June 28, 2016

[DMANET] Call for Papers - The 22nd IEEE Pacific Rim International Symposium on Dependable Computing (PRDC 2017)

[DMANET] 2nd Call for Papers: COCOA 2016

[DMANET] INFORMS Computing Society : Call for Nominations: 2016 ICS Student Paper Prize

[DMANET] INFORMS Computing Society : Call for nominations: ICS Prize

[DMANET] IPDPS 2017 - Call for workshops and papers

[DMANET] Deadline Extension: JSC Special Issue on Symbolic Computation in Software Science

[DMANET] ALGO 2016 - Call for participation

[DMANET] MASSIVE 2016 Call for Papers

[DMANET] ICNAAM 2016 - symposium "GRAPHS"

Monday, June 27, 2016

[DMANET] Bordeaux Graph Workshop BGW2016 - Submissions: One-Week Remaining Reminder - Registrations open - Young Author Prize

[DMANET] Open position: Lecturer in CS (Permanent) at NUIM Ireland

[DMANET] CFP - Algorithms MDPI - Special Issue on Parallel Algorithms for Combinatorial Optimization Problems

Sunday, June 26, 2016

[DMANET] Assistant Professor positions in Computer Science (University of Warwick)

[DMANET] Postdoctoral Position in Combinatorial Optimization at ETH Zurich

Saturday, June 25, 2016

[DMANET] WAAC 2016 Call for Papers

[DMANET] Last CfP: JSC Special Issue on Symbolic Computation in Software Science

[DMANET] IEEE International Workshop on Foundations of Big Data Computing (BigDF) 2016

Thursday, June 23, 2016

[DMANET] Computing Society : Reminder: ICS Paper Deadline July 1

Mailing Lists

Search This Blog

Blog Archive

Thursday, June 30, 2016

Wednesday, June 29, 2016

Tuesday, June 28, 2016

Monday, June 27, 2016

Sunday, June 26, 2016

Saturday, June 25, 2016

Thursday, June 23, 2016

Mailing Lists

Subscribe To

Search This Blog

Blog Archive