DMANET: DISCRETE MATHEMATICS AND ALGORITHMS: dmanet Digest, Vol 98, Issue 10

Send dmanet mailing list submissions to
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. IWOCA 2016 - Second Call for Papers (Martin Milanič)
2. SSBSE 2016: Call for Papers! (Sarro, Federica)
3. 2nd CFP - RANDOM / APPROX (Kim-Manuel Klein)

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

Message: 1
Date: Mon, 11 Apr 2016 13:35:58 +0200
From: Martin Milanič <martin.milanic@upr.si>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] IWOCA 2016 - Second Call for Papers
Message-ID: <570B8C1E.4080206@upr.si>
Content-Type: text/plain; charset=utf-8; format=flowed

=====================================================================
Second Call for Papers
=====================================================================

27th International Workshop on Combinatorial Algorithms (IWOCA 2016)
Helsinki, Finland, 17-19 August 2016
http://iwoca2016.cs.helsinki.fi

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

IWOCA 2016 continues the long and well-established tradition of
encouraging high-quality research in theoretical computer science and
providing an opportunity to bring together specialists and young
researchers working in the area. The scientific program will include
three invited lectures covering the areas of main interest, accepted
contributed talks, posters, and an open problem session.

This year we will also have a best student paper award, sponsored by the
EATCS.

INVITED SPEAKERS:
Leslie Anne Goldberg (Oxford University)
Giuseppe F. Italiano (University of Rome "Tor Vergata")
Petteri Kaski (Aalto University)

SCOPE:
We solicit high-quality papers in the broad area of combinatorial
algorithms. Topics include (but are not restricted to): Algorithms and
Data Structures (including sequential, parallel, distributed,
approximation, probabilistic, randomised, and on-line algorithms);
Algorithms on Graphs and Strings; Applications (bioinformatics, music
analysis, networking, and others); Combinatorics on Words; Combinatorial
Enumeration; Combinatorial Optimization; Complexity Theory;
Computational Biology; Compression and Information Retrieval;
Cryptography and Information Security; Decompositions and Combinatorial
Designs; Discrete and Computational Geometry; Graph Drawing and
Labelling; Graph Theory

PROCEEDINGS AND SPECIAL ISSUE:
The conference proceedings with invited papers and accepted contributed
papers will be published as a volume of the Springer-Verlag Lecture
Notes in Computer Science (LNCS) series. There will be a special issue
of the journal Theory of Computing Systems with papers from the conference.

SUBMISSIONS:
Authors are invited to submit an extended abstract of no more than 12
pages in LNCS style, including references. A clearly marked Appendix can
be included, which will be read at the referees' discretion. All
submissions have to be made via the EasyChair page for the conference.
No simultaneous submission to other conferences with published
proceedings is allowed, and submitted papers should not be under review
by a journal during the whole refereeing process. At least one author of
each accepted paper will be expected to attend the conference and
present the paper.

VENUE:
The conference will take place in the center of Helsinki, which is
perennially listed amongst the world's most liveable cities. Helsinki is
easily reachable by plane from anywhere in Europe.

IMPORTANT DATES:
Abstract submission: 25 April, 2016 (anywhere on earth)
Paper submission (FIRM): 2 May, 2016 (anywhere on earth)
Notification: 3 June, 2016
Conference: 17-19 August, 2016
Invitations to special issue: 31 August, 2016

PROGRAM COMMITTEE:
Golnaz Badkobeh (Warwick University)
Hideo Bannai (Kyushu University)
Petra Berenbrink (Simon Fraser University)
Christina Boucher (Colorado State University)
Charles Colbourn (Arizona State University)
Vida Dujmovic (University of Ottawa)
Travis Gagie (University of Helsinki)
Roberto Grossi (University of Pisa)
Pinar Heggernes (University of Bergen)
Seok-Hee Hong (University of Sydney)
Costas S. Iliopoulos (King's College London)
Ralf Klasing (CNRS Bordeaux)
Jan Kratochvil (Charles University)
Daniela Kühn (Birmingham University)
Jesper Jansson (Kyoto University)
Zsuzsanna Lipták (University of Verona)
Veli Mäkinen (University of Helsinki, co-chair)
Martin Milanič (University of Primorska)
Petra Mutzel (TU Dortmund)
Christophe Paul (CNRS Montpellier)
Solon Pissis (King's College London)
Simon J. Puglisi (University of Helsinki, co-chair)
Michiel Smid (Carleton University)
Jukka Suomela (Aalto University)
Tatiana Starikovskaya (University of Bristol)
Kavitha Telikepalli (Tata Institute of Fundamental Research)
Alexandru Tomescu (University of Helsinki)
Stéphane Vialette (Université Paris-Est)
Dorothea Wagner (Karlsruhe Institute of Technology)
Oren Weimann (University of Haifa)
Sue Whitesides (University of Victoria)
Christos Zaroliagis (University of Patras)

OPEN PROBLEMS CHAIRS:
Gabriele Fici (University of Palermo)
Oliver Schaudt (University of Köln)

ORGANIZING COMMITTEE:
Veli Mäkinen (University of Helsinki)
Simon J. Puglisi (University of Helsinki)
Leena Salmela (University of Helsinki)
Alexandru Tomescu (University of Helsinki)
Daniel Valenzuela (University of Helsinki)

STEERING COMMITTEE:
Costas Iliopoulos (King's College London, UK)
Mirka Miller (University of Newcastle, Australia)
Bill Smyth (McMaster University, Canada)

The conference is organized by the Department of Computer Science of the
University of Helsinki, in cooperation with the EATCS (European
Association for Theoretical Computer Science) and HIIT (Helsinki
Institute for Information Technology).

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

Message: 2
Date: Mon, 11 Apr 2016 11:44:37 +0000
From: "Sarro, Federica" <f.sarro@ucl.ac.uk>
To: "dmanet@zpr.uni-koeln.de" <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] SSBSE 2016: Call for Papers!
Message-ID: <D8C0F48C-F597-4DC7-97EC-7010292345AD@live.ucl.ac.uk>
Content-Type: text/plain; charset="Windows-1252"

Dear Colleague,

SSBSE 2016 is the eight edition of the annual symposium dedicated to Search-Based Software Engineering (SBSE), http://ssbse.org/2016/.

SBSE is the application of meta-heuristic optimization techniques to various software engineering problems, ranging from requirements engineering to software testing and maintenance.

Please consider to contribute to and/or forward to the appropriate groups the following opportunity to submit and publish original scientific results to SSBSE 2016.

Don't forget that the deadline for the submission of the abstract of your research paper is tomorrow, while the full paper submission is due a week later!

Best Regards,
Federica Sarro

********************************************************************************
SSBSE 2016
8th International Symposium on Search Based Software Engineering (SSBSE)
October 8-10, 2016 - Raleigh, North Carolina, USA
http://ssbse.org/2016/
********************************************************************************

---------------------
SSBSE 2016
---------------------
We are pleased to announce SSBSE 2016, the eight edition of the annual symposium dedicated to Search-Based Software Engineering (SBSE),
to be held in Raleigh, North Carolina, USA.
Search-based Software Engineering (SBSE) is the application of meta-heuristic optimisation techniques to various software engineering problems,
ranging from requirements engineering to software testing and maintenance.
The symposium builds on the flourishing interest in SBSE and provides a welcoming forum for discussion and dissemination that will strengthen
the rapidly-growing international SBSE community.
We invite contributions of different forms in this call for papers as follows:

----------------------
RESEARCH PAPER TRACK
----------------------
We invite the submission of high quality papers describing novel and original work in all areas of Search-Based Software Engineering
including, but not limited to, applications of SBSE to novel problems, theoretical analyses of search algorithms for software engineering,
rigorous empirical evaluations of SBSE techniques, and reports of industrial experiences.
SSBSE welcomes not only applications from throughout the software engineering lifecycle but also a broad range of search methods
ranging from exact Operational Research techniques to nature-inspired algorithms and simulated annealing.
We particularly encourage papers that report on software engineering applications to which SBSE has not been applied before.
Research papers must have up to 15 pages in length, including all text, figures, references and appendices.
The SSBSE Research Paper Track performs double-blind review of all submissions
(i.e., authors will not be identified to reviewers and reviewers will not be identified to authors).
Please consult the submission information page to prepare your manuscript for double-blind process.

----------------------
SHORT PAPER TRACK
----------------------
We invite short papers presenting new ideas, tools, experience reports, or novel techniques and ideas, which will be included in the proceedings
and presented at the symposium. Papers submitted to this track should not exceed 6 pages in length using the regular symposium format.

----------------------
GRADUATE STUDENT TRACK
----------------------
We invite students to submit papers to a special Graduate Student track.
This track gives students the opportunity to showcase their SBSE research and receive feedback from senior members of the SBSE community.
Papers submitted to this track should not exceed 6 pages in length using the regular symposium format.
To be eligible, papers should be primarily the work of students currently registered on a doctoral or master program that have not yet completed their studies.
The paper may have co-authors who are not students but the student author is expected to present the paper at the symposium.

----------------------
SBSE CHALLENGE TRACK
----------------------
We challenge everyone interested in SBSE to apply tools, techniques, and algorithms to our selected problems. We want you to apply your SBSE expertise
to do interesting things to or with the software and uncover interesting things related to it. The best competition entries will be awarded special prizes.
Challenge papers should not exceed 6 pages in length using the regular symposium format.
More details about the challenge are available on the website (http://ssbse.org/2016/).

---------------------
FORMAT AND SUBMISSION
---------------------
Papers must not have been previously published, or be in consideration for, any journal, book, or other conference.
Papers will be evaluated by members of the program committee based on their originality, technical soundness and presentation quality.
Submissions must conform to Springer's LNCS format (http://www.springer.com/lncs).
In addition to those instructions, please consider that SSBSE is performing double-blind review of all submissions, but those for the SBSE Challenge Track.
Further information on paper formatting and submission are available on the symposium website.
If a paper is accepted, at least one author is expected to attend the symposium and to present the paper.
In case of a student paper, the first (student) author is expected to attend and present the paper.

-----------------------
CONFERENCE PROCEEDINGS
-----------------------
Accepted papers will be published in a volume of the Springer Lecture Notes in Computer Science series (LNCS).

---------------------
BEST PAPER AWARDS AND TRAVEL GRANTS
---------------------
Research and Student papers accepted for presentation at SSBSE 2016 will be considered for prizes.
More details about prizes and travel grants will be announced on the website (http://ssbse.org/2016/).

-----------------------------
SPECIAL ISSUE FOR BEST PAPERS
-----------------------------
The authors of best selected symposium papers will be invited to submit extended versions of their papers for a special section
in the International Journal of Information and Software Technology (IST).

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

RESEARCH PAPERS TRACK

Abstract submission April 13, 2016
Paper Submission April 20, 2016
Notification May 31, 2016

SHORT PAPER TRACK, GRADUATE STUDENT TRACK, SBSE CHALLENGE TRACK

Paper Submission May 16, 2016
Notification June 10, 2016
Camera Ready June 15, 2016

------------------------------
CONTACT INFORMATION:
To contact the program chairs, please email: Federica Sarro <f.sarro@ucl.ac.uk<mailto:f.sarro@ucl.ac.uk>> and Kalyan Deb <kdeb@egr.msu.edu<mailto:kdeb@egr.msu.edu>>
------------------------------

--------------------------------
VENUE - RALEIGH, North Carolina, USA
--------------------------------
The event will be held at the Holiday Inn Raleigh Downtown, 320 Hillsborough Street, Raleigh, North Carolina 27603
(http://www.hiraleighdowntown.com)

SSBSE 2016 will be collocated with 32nd IEEE Conference on Software Maintenance and Evolution (ICSME2016).

--------------------
ORGANISING COMMITTEE
--------------------

GENERAL CHAIR
Marouane Kessentini, University of Michigan, United States of America

PROGRAM CHAIRS
Kalyanmoy Deb, Michigan State University, United States of America
Federica Sarro, University College London, United Kingdom

GRADUATE STUDENT TRACK CHAIR
Thelma Elita Colanzi Lopes, State University of Maringa, Brazil
Ali Ouni, Osaka University, Japan

SBSE CHALLENGE TRACK CHAIR
Leandro L. Minku, University of Leicester, United Kingdom
Tanja E.J. Vos, Polytechnical University of Valencia, Spain

PUBLICITY CHAIR
Yuanyuan Zhang, University College London, United Kingdom

WEB CHAIR
Wiem Mkaouer, University of Michigan, United States of America

-----------------
PROGRAM COMMITTEE
-----------------
Alessandra Gorla, IMDEA Software Institute
Andrea Arcuri, Scienta – University of Luxembourg
Arilo Dias-Neto – Federal University of Amazonas
Chris Simon, University of the West of England
Claire Le Goues, Carnegie Mellon University
Dongsun Kim, University of Luxembourg
Francisco Chicano, University of Málaga
Gregory Gay, University of South Carolina
Giuliano Antoniol, École Polytechnique de Montréal
Gordon Fraser, University of Sheffield
Houari A. Sahraoui, University of Montreal
Jerffeson Teixeira de Souza, State University of Ceara
Jerry Swan, University of York
John Clark, University of York
Juan Pablo Galeotti, University of Buenos Aires
Justyna Petke, University College London
Lars Grunske, University of Stuttgart
Marcio Barros , Universidade Federal do Estado do Rio de Janeiro
Mark Harman, University College London
Marc Roper, University of Strathclyde
Myra Cohen, University of Nebraska
Nadia Alshahwan, J.P. Morgan
Paolo Tonella, Fondazione Bruno Kessler
Phil McMinn, University of Sheffield
Raluca Lefticaru, University of Bucharest
Shaukat Ali, Simula Research Laboratory
Shin Yoo, Korea Advanced Institute of Science and Technology
Tim Menzies, NC State University
Yuanyaun Zhang, University College London
Zheng Li, Beijing University of Chemical Technology

-----------------
STEERING COMMITTEE
-----------------
Andrea Arcuri, Scienta, Norway, and University of Luxembourg (until 2018)
Claire Le Goues, Carnegie Mellon University, USA (until 2017)
David White, University College London, UK (until 2016)
Federica Sarro, University College London, UK (until 2018)
Gordon Fraser, University of Sheffield, UK (until 2018, second consecutive term)
Jerffeson Souza, University of the state of Ceara, Brazil (until 2017, second consecutive term)
Marcio de Oliveira Barros, Federal University of the state of Rio de Janeiro, Brazil (until 2017)
Mark Harman, University College London, UK (SC Chair) (until 2016, second consecutive term)
Shin Yoo, Korea Advanced Institute of Science and Technology, Korea (until 2018)
Yuanyuan Zhang, University College London, UK (until 2016)
CfPs SSBSE 2016: http://www0.cs.ucl.ac.uk/staff/F.Sarro/CFPs/SSBSE2016.pdf

--
Dr. Federica Sarro
Senior Research Associate
CREST, Department of Computer Science
University College London
Malet Place, London, WC1E 6BT, UK
http://www0.cs.ucl.ac.uk/staff/F.Sarro/

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

Message: 3
Date: Mon, 11 Apr 2016 15:16:19 +0200
From: Kim-Manuel Klein <kmk@informatik.uni-kiel.de>
To: Dmanet <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] 2nd CFP - RANDOM / APPROX
Message-ID: <50f2db627934d296372cf047483f5e3a@informatik.uni-kiel.de>
Content-Type: text/plain; charset=UTF-8; format=flowed

RANDOM 2016 The 20th International Workshop on Randomization and
Computation
and
APPROX 2016 The 19th International Workshop on Approximation Algorithms
for Combinatorial Optimization Problems

http://cui.unige.ch/tcs/random-approx/

September 7-9, 2016
Institut Henri Poincaré, Paris

CFP - CALL FOR PAPERS
SCOPE:

The 20th International Workshop on Randomization and Computation
(RANDOM'2016) and the 19th International Workshop on Approximation
Algorithms for Combinatorial Optimization Problems (APPROX'2016) will
be held on September 7-9, 2016 at the Institut Henri Poincaré, Paris,
organized by IRIF (CNRS and Université Paris Diderot).
RANDOM'2016 focuses on applications of randomness to computational and
combinatorial problems while APPROX'2016 focuses on algorithmic and
complexity theoretic issues relevant to the development of efficient
approximate solutions to computationally difficult problems.

TOPICS:
Papers are solicited in all research areas related to randomization and
approximation, including but not limited to:

RANDOM:

* design and analysis of randomized algorithms
* randomized complexity theory
* pseudorandomness and derandomization
* random combinatorial structures
* random walks/Markov chains
* expander graphs and randomness extractors
* probabilistic proof systems
* random projections and embeddings
* error-correcting codes
* average-case analysis
* property testing
* computational learning theory

APPROX

* approximation algorithms
* hardness of approximation
* small space, sub-linear time and streaming algorithms online
algorithms
* approaches that go beyond worst case analysis
* distributed and parallel approximation
* embeddings and metric space methods
* mathematical programming methods
* spectral methods
* combinatorial optimization in graphs and networks
* algorithmic game theory, mechanism design and economics
* computational geometric problems
* approximate learning

IMPORTANT DATES:
Submissions deadline: TUESDAY, APRIL 19 , 2016
Notifications: Wednesday, June 22 ,2016
Camera ready: Friday, July 1, 2016

SUBMISSIONS:
Abstract Format: Electronic submissions are solicited. Please consult
the following servers:
For submission of APPROX papers:
http://www.easychair.org/conferences/?conf=approx2016 [1]
For submission of RANDOM papers:
http://www.easychair.org/conferences/?conf=random2016 [2]
Note: You will be asked to login using an EasyChair account.
Instructions on how to register for such an account are available at the
submission servers (you may also have an old account from a previous
conference submission).
The submission must be received by 15:00 (PDT) of April 19 for your
submission to be considered.
Submission Format: Submissions should start with the title of the paper,
each author's name, affiliation, and e-mail address, followed by a brief
abstract of the results to be presented. This should then be followed by
a technical exposition on single-spaced pages on letter-size paper,
using reasonable margins and at least 11-point font. The first 10 pages
should contain the main ideas and techniques used to achieve the results
including motivation and a clear comparison with related work (not
including the references). There is no page limit but any material
beyond the first 10 pages will be read at the sole discretion of the
program committee.
Simultaneous submission to other conferences with published proceedings
is not allowed.

PROCEEDINGS:
Accepted papers will be published in the online proceedings of the
conference in the Leibniz International Proceedings in Informatics
(LIPIcs) series, based at Schloss Dagstuhl. This guarantees perennial,
free and easy electronic access, while the authors retain the rights
over their work.

PROGRAM CHAIRS:
RANDOM
Chris Umans - Caltech email: umans@cms.caltech.edu
APPROX
Claire Matthieu – (CNRS and ENS Paris)
email: clairemmathieu@gmail.com
WORKSHOP CHAIRS:
José Rolim - University of Geneva
e-mail: jose.rolim@unige.ch
Klaus Jansen - University of Kiel
e-mail: kj@informatik.uni-kiel.de

PROGRAM COMMITTEES:
RANDOM 2016:
Chris Umans (Caltech, Chair)
Mahdi Cheraghchi (Imperial College, London)
Elena Grigorescu (Purdue)
Neeraj Kayal (MSR Bangalore)
Adam Klivans (Austin)
Swastik Kopparty (Rutgers)
Ravi Kumar (Google)
Dana Moshkovitz (MIT)
Ashwin Nayak (Waterloo)
Ryan O'Donnell (CMU)
Asaf Shapira (Tel Aviv)
Ronen Shaltiel (Haifa)
Alexander Sherstov (UCLA)
Thomas Thierauf (Aalen)
Eric Vigoda (Georgia Tech)

APPROX 2016:
Claire Mathieu (CNRS and ENS Paris, Chair)
Anna Adamaszek (University of Copenhagen)
Shiri Chechik (Tel-Aviv University)
Anne Driemel (TU Eindhoven)
Lee-Ad Gottlieb (Ariel University)
Varun Kanade (University of Oxford)
Nitish Korula (Google Research)
Stefano Leonardi (Sapienza University of Rome)
Daniel Lokshtanov (University of Bergen)
Nicole Megow (TU Munich)
Tobias Moemke (Saarland University)
Shayan Oveis Gharan (University of Washington)
Debmalya Panigrahi (Duke University)
Richard Georgia Peng (Institute of Technology)
Ely Bar Porat (Ilan University)
Adi Rosén (CNRS and Université Paris Diderot)
Adrian Vetta (McGill University)
Rico Zenklusen (ETH Zurich)