Theory Announcements: May 2013

Friday, May 31, 2013

Second Call For Papers: ISAAC 2013

CALL FOR PAPERS

ISAAC 2013

The 24th International Symposium on Algorithms and Computation

December 16-18, 2013

The University of Hong Kong, Hong Kong

http://www.cs.hku.hk/isaac2013/

The 24th International Symposium on Algorithms and Computation (ISAAC 2013)

will be held in Hong Kong, December 16-18, 2013. The symposium is intended

to provide a forum for researchers working in algorithms and theory of

computation. Papers presenting original research in the areas of algorithms

and theory of computation are sought. Papers in relevant applied areas are

also welcome.

INVITED SPEAKERS

Muthu Muthukrishnan, Rutgers University, USA.

Moni Naor, Weizmann Institute of Science, Israel.

Important Dates

Submission deadline: June 15, 2013 (23:59 Honolulu Time)

Notification date: August 31, 2013

Final version due: September 21, 2013

Publication

The proceedings will be published by Springer-Verlag in the LNCS series.

Selected papers will be invited to special issues of Algorithmica and

International Journal of Computational Geometry and Applications.

Paper Submission

The submission should contain a scholarly exposition of ideas, techniques, and

results, including motivation and a comparison with related work. The main

text, including title, abstract, and references, should not exceed 11 pages in

LNCS style. An optional appendix should be used to provide proof details that

do not fit in the main text. Submitted papers must describe unpublished work.

Authors should not submit papers with the same results or essentially the same

results that are accepted or published or under review by a conference with

refereed proceedings or a journal. Only electronic submission will be allowed

and only pdf files will be accepted. It will be done via Easychair:

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

At least one author of an accepted paper is expected to present the paper at

the conference as a registered participant.

Awards

A Best Paper and a Best Student Paper may be awarded. A paper is eligible for

the Best Student Paper Award 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 the Best Student Paper Award" in the abstract.

Conference Co-chairs

Chung-Keung Poon, City University of Hong Kong, Hong Kong

Hing-Fung Ting, University of Hong Kong, Hong Kong

Program Co-chairs

Leizhen Cai, Chinese University of Hong Kong, Hong Kong

Siu-Wing Cheng, Hong Kong University of Science and Technology, Hong Kong

Tak-Wah Lam, University of Hong Kong, Hong Kong

Program Committee

Pankaj Agarwal, Duke University, USA

Hee-Kap Ahn, POSTECH, South Korea

Boris Aronov, Polytechnic Institute of NYU, USA

Therese Biedl, University of Waterloo, Canada

Hubert Chan, University of Hong Kong, Hong Kong

Jianer Chen, Texas A&M University, USA

Xi Chen, Columbia University, USA

Pavol Hell, Simon Fraser University, Canada

Wing-Kai Hon, National Tsinghua University, Taiwan

Jesper Jansson, Kyoto University, Japan

Ming-Yang Kao, Northwestern University, USA

Stefan Kratsch, Technische Universitat Berlin, Germany

Stefan Langerman, Universite Libre de Bruxelles, Belgium

Lap-Chi Lau, Chinese University of Hong Kong, Hong Kong

James Lee, University of Washington, USA

Jian Li, Tsinghua University, China

Hsueh-l Lu, National Taiwan University, Taiwan

Julian Mestre, University of Sydney, Australia

Pat Morin, Carleton University, Canada

Benjamin Moseley, Toyota Institute of Technology at Chicago, USA

Evanthia Papadopoulou, Universita della Svizerra italiana, Switzerland

Christophe Paul, CNRS, LIRMM, France

Rajeev Raman, University of Leicester, UK

Kunihiko Sadakane, National Institute of Informatics, Japan

Rob van Stee, Max Planck lnstitute for lnformatics, Germany

Wing-Kin Sung, National University of Singapore, Singapore

Jan Arne Telle, University of Bergen, Norway

Hing Fung Ting, University of Hong Kong, Hong Kong

Antoine Vigneron, King Abdullah University of Science and Technology, Saudi Arabia

Lusheng Wang, City University of Hong Kong, Hong Kong

Yajun Wang, Microsoft Research Asia, China

Prudence Wong, University of Liverpool, UK

Yitong Yin, Nanking University, China

Neal Young, University of California, Riverside, USA

Shengyu Zhang, Chinese University of Hong Kong, Hong Kong

Eighth International Workshop on Algorithms and Computation (WALCOM 2014), February 13-15, 2014, Indian Institute of Technology, Madras, Chennai, India

Eighth International Workshop on Algorithms and Computation (WALCOM 2014), February 13-15, 2014, Indian Institute of Technology, Madras, Chennai, India
-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------

Call for papers
============

Authors are invited to submit papers describing original research of theoretical or practical significance to algorithms and computation. Papers should not exceed 12 pages for long papers and 6 pages for short papers in LNCS style. Papers must be labeled as either long or short and prepared using LaTeX/LaTeX2e. If the authors feel that more details are essential to substantiate the main claim of the paper, they may include a clearly marked appendix that will be read at the discretion of the program committee. Only electronic submission will be allowed. Submitted papers must describe work not previously published. They must not be submitted simultaneously to another conference with refereed proceedings or to a journal.

SCOPE

The range of topics within the scope of WALCOM 2014 includes (but is not limited to):
Approximation Algorithms | Combinatorial Algorithms | Combinatorial Optimization | Computational Biology | Computational Complexity | Computational Geometry | Data Structures | Discrete Geometry | Experimental Algorithm Methodologies | Graph Algorithms | Graph Drawing | Parallel and Distributed Algorithms | Parameterized Complexity | Network Optimization | Online Algorithms | Randomized Algorithms | String Algorithms.

PROCEEDINGS

The previous proceedings of accepted papers was published in the Lecture Notes in Computer Science (volume 7748), Springer.

IMPORTANT DATES

Paper Submission: September 3, 2013, 11:59 PM pacific time.
Notification of Acceptance: October 29, 2013.
Camera-ready Version: November 15, 2013.
Workshop: February 13-15, 2014.

STEERING COMMITTEE

Kyung-Yong Chwa (KAIST, Korea)
Costas S. Iliopoulos (King's College London, UK)
M. Kaykobad (BUET, Bangladesh)
Petra Mutzel (TU Dortmund, Germany)
Shin-ichi Nakano (Gunma University, Japan)
Subhas Chandra Nandy (ISI Kolkata, India)
Takao Nishizeki (Tohoku University, Japan)
Md. Saidur Rahman (BUET, Bangladesh)
C. Pandu Rangan (IIT Madras, India)

PROGRAM COMMITTEE

Hee-Kap Ahn, Pohang University of Science and Technology, Gyeongbuk, Korea
V. Arvind, Institute of Mathematical Sciences, Chennai, India
Amitabha Bagchi, Indian Institute of Technology, Delhi, India
Giuseppe Di Battista, Third University of Rome, Italy
Arijit Bishnu, Indian Statistical Institute, Kolkata, India
Franz.J.Brandenburg, University of Passau, Germany
Sumit Ganguly, Indian Institute of Technology, Kanpur, India
Subir Kumar Ghosh, Tata Institute of Fundamental Research, Mumbai, India
Sathish Govindarajan, Indian Institute of Science, Bangalore, India
Shuji Kijima, Graduate School of ISEE, Kyushu University, Fukuoka, Japan
Ramesh Krishnamurti, Simon Fraser University, Burnaby, British Columbia
Giuseppe Liotta, University of Perugia, Italy
Leonidas Palios, University of Ioannina, Greece
Rina Panigrahy, Microsoft Research, Mountain View, United States
Rossella Petreschi, Sapienza University of Rome, Italy
Sheung-Hung Poon, National Tsing Hua University, Hsinchu, Taiwan
Sudebkumar Prasant Pal (PC Co-Chair), Indian Institute of Technology, Kharagpur, India
Sohel Rahman, Bangladesh University of Engg. & Technology, Dhaka, Bangladesh
Rajeev Raman, University of Leicester, England
Abhiram Ranade, Indian Institute of Technology, Bombay, India
C. Pandu Rangan, Indian Institute of Technology, Madras, India
Kunihiko Sadakane (PC Co-Chair), National Institute of Informatics, Tokyo, Japan
Nicola Santoro, School of Computer Science, Carleton University, Ottawa, Canada
Jayalal Sarma, Indian Institute of Technology, Madras, India
Saket Saurabh, Institute of Mathematical Sciences, Chennai, India
Shakhar Smorodinsky, Ben-Gurion University, Be'er Sheva, Israel
Takeshi Tokuyama, Tohoku University, Sendai, Japan
Peter Widmayer, ETH Zurich, Switzerland
Hsu-Chun Yen, National Taiwan University, Taipei, Taiwan

ORGANIZING COMMITTEE

N.S. Narayanaswamy, Indian Institute of Technology Madras, India
Sasanka Roy, Chennai Mathematical Institute, India
R. Krithika (student organizer), Indian Institute of Technology Madras, India

WALCOM 2014 website

http://walcom2014.iitm.ac.in

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

Pre-Workshop School on Algorithms and Combinatorics
=============================================

The school is being organized for PhD students and teachers in computer science and discrete mathematics during February 10-11, 2014. This school is organized jointly by IIT Madras and TIFR Mumbai. The confirmed speakers of the school from Switzerland and India will be put up soon.
Registration

There is no registration fee for the school. Arrangements will be made for speakers and 25 selected participants to stay in IITM guest house/hostels in the IIT Madras campus. All participants will be provided boarding and lodging free of cost.
Purpose

The school is aimed at fulfilling two purposes: (i) as a pre-conference school for WALCOM 2014, (ii) as an Indo-Swiss School, 2014
Organizing committee

John Augustine (Co-Convener), IITM
Subir Ghosh (Co-Convener), TIFR
Emo Welzl, ETH, Zurich
B.V. Raghavendra Rao, IITM
Swami Sarvottamananda, RKMVU
Partha Goswami, Calcutta University

Further Details

Contact Professor Subir Ghosh (Email: ghosh@tifr.res.in).

[DMANET] Call for Papers: ISAAC 2013

CALL FOR PAPERS
ISAAC 2013
The 24th International Symposium on Algorithms and Computation
December 16-18, 2013
The University of Hong Kong, Hong Kong
http://www.cs.hku.hk/isaac2013/

The 24th International Symposium on Algorithms and Computation (ISAAC 2013)
will be held in Hong Kong, December 16-18, 2013. The symposium is intended
to provide a forum for researchers working in algorithms and theory of
computation. Papers presenting original research in the areas of algorithms
and theory of computation are sought. Papers in relevant applied areas are
also welcome.

INVITED SPEAKERS
Muthu Muthukrishnan, Rutgers University, USA.
Moni Naor, Weizmann Institute of Science, Israel.

Important Dates
Submission deadline: June 15, 2013 (23:59 Honolulu Time)
Notification date: August 31, 2013
Final version due: September 21, 2013

Publication
The proceedings will be published by Springer-Verlag in the LNCS series.
Selected papers will be invited to special issues of Algorithmica and
International Journal of Computational Geometry and Applications.

Paper Submission
The submission should contain a scholarly exposition of ideas,
techniques, and
results, including motivation and a comparison with related work. The main
text, including title, abstract, and references, should not exceed 11
pages in
LNCS style. An optional appendix should be used to provide proof details
that
do not fit in the main text. Submitted papers must describe unpublished
work.
Authors should not submit papers with the same results or essentially
the same
results that are accepted or published or under review by a conference with
refereed proceedings or a journal. Only electronic submission will be
allowed
and only pdf files will be accepted. It will be done via Easychair:
https://www.easychair.org/conferences/?conf=isaac2013

At least one author of an accepted paper is expected to present the paper at
the conference as a registered participant.

Awards
A Best Paper and a Best Student Paper may be awarded. A paper is
eligible for
the Best Student Paper Award 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 the Best Student Paper Award" in the abstract.

Conference Co-chairs
Chung-Keung Poon, City University of Hong Kong, Hong Kong
Hing-Fung Ting, University of Hong Kong, Hong Kong

Program Co-chairs
Leizhen Cai, Chinese University of Hong Kong, Hong Kong
Siu-Wing Cheng, Hong Kong University of Science and Technology, Hong Kong
Tak-Wah Lam, University of Hong Kong, Hong Kong

Program Committee
Pankaj Agarwal, Duke University, USA
Hee-Kap Ahn, POSTECH, South Korea
Boris Aronov, Polytechnic Institute of NYU, USA
Therese Biedl, University of Waterloo, Canada
Hubert Chan, University of Hong Kong, Hong Kong
Jianer Chen, Texas A&M University, USA
Xi Chen, Columbia University, USA
Pavol Hell, Simon Fraser University, Canada
Wing-Kai Hon, National Tsinghua University, Taiwan
Jesper Jansson, Kyoto University, Japan
Ming-Yang Kao, Northwestern University, USA
Stefan Kratsch, Technische Universitat Berlin, Germany
Stefan Langerman, Universite Libre de Bruxelles, Belgium
Lap-Chi Lau, Chinese University of Hong Kong, Hong Kong
James Lee, University of Washington, USA
Jian Li, Tsinghua University, China
Hsueh-l Lu, National Taiwan University, Taiwan
Julian Mestre, University of Sydney, Australia
Pat Morin, Carleton University, Canada
Benjamin Moseley, Toyota Institute of Technology at Chicago, USA
Evanthia Papadopoulou, Universita della Svizerra italiana, Switzerland
Christophe Paul, CNRS, LIRMM, France
Rajeev Raman, University of Leicester, UK
Kunihiko Sadakane, National Institute of Informatics, Japan
Rob van Stee, Max Planck lnstitute for lnformatics, Germany
Wing-Kin Sung, National University of Singapore, Singapore
Jan Arne Telle, University of Bergen, Norway
Hing Fung Ting, University of Hong Kong, Hong Kong
Antoine Vigneron, King Abdullah University of Science and Technology,
Saudi Arabia
Lusheng Wang, City University of Hong Kong, Hong Kong
Yajun Wang, Microsoft Research Asia, China
Prudence Wong, University of Liverpool, UK
Yitong Yin, Nanking University, China
Neal Young, University of California, Riverside, USA
Shengyu Zhang, Chinese University of Hong Kong, Hong Kong

**********************************************************
*
* 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] Summerschool: Order and Geometry (2nd announcement)

Call for participation
======================================================================

Summerschool: Order and Geometry

August 7 to 10, 2013

Doellnsee, nearby Berlin

http://www3.math.tu-berlin.de/MDS/summerschool13.html

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

The purpose of the summer school is to give an introductory overview
of some new developments in the area, to present current research
directions, and to give students working in this or related fields the
opportunity to meet and to get to know each other.

The school is addressed to advanced undergraduate and graduate
students of Mathematics or Computer Science with interest in partially
ordered sets and discrete geometry. Basic knowledge in discrete
mathematics is assumed. The summerschool will be followed by a workshop
on the same topic (http://page.math.tu-berlin.de/~felsner/workshop.html).
Participants of the sommerschool are encouraged to stay in Berlin
for the workshop.

The summerschool is organized within the Research Training Group
"Methods for Discrete Structures".

The summer school consists of four courses.

William T. Trotter, (Georgia Tech, Atlanta)
Posets, Graphs and Geometry: Links and Applications

Piotr Micek, (Jagellonian Univ., Krakow)
Coloring intersection graphs

Rom Pinchasi, (Technion, Haifa)
Applications of Duality and Euler's formula in plane geometry

Gwenael Joret, (Universite Libre de Bruxelles)
Entropy of partial orders

In addition to the lectures, exercises will be solved in small groups
with solution sessions in the evenings. The language of the school is
English.

The summer school will take place at Doellnsee, a picturesque lake in a
natural reserve 60 km northeast of Berlin. The costs per participant
are EURO 150 and include transportation between Döllnsee and Berlin
and full board during the summer school.

The number of participants is limited to about 25. Applications can be
submitted using the form on the summer school website until June 15, 2013.

If you have any further questions, please contact the organizers via

summerschool2013@math.tu-berlin.de

Stefan Felsner

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

Thursday, May 30, 2013

>> Call for Participation - ICDCS 2013 (IEEE 33rd Intl. Conf. on Distributed Computing Systems) in Philadelphia, July 8-11, 2013 <<<

********************************************************************
We apologize in advance if you receive multiple copies of this CFP.

Please disseminate CFP to your colleagues that might be interested.
********************************************************************

---------------------------------------------------------------------
CALL FOR PARTICIPATION

ICDCS 2013
The 33rd International Conference on Distributed Computing Systems
Philadelphia, USA, July 8-11, 2013
http://www.temple.edu/cis/icdcs2013

Sponsored by
IEEE Computer Society Technical Committee on Distributed Processing
---------------------------------------------------------------------

ICDCS 2013 will feature:

--------------------------------
KEYNOTE TALKS
--------------------------------

* "Research vs. Innovation"
Dr. Kai Li, Princeton University

* "Rethinking Eventual Consistency"
Dr. Philip A. Bernstein, Microsoft Research

--------------------------------
PANEL SESSION
--------------------------------

* "Is my Toaster Lying? Security, Privacy and Trust Issues in Internet
of Things"
Organized by Dr. Krishna Kant, NSF

--------------------------------
TUTORIAL
--------------------------------

* GENI Tutorial.
Organized by Mark Berman.
More information available at:
http://groups.geni.net/geni/wiki/Tutorials/ICDCS2013

--------------------------------
TECHNICAL SESSIONS
--------------------------------

* 18 tracks, 61 full papers

* Major topics include:

A1: Monitoring & Diagnostics
B1: Caching
A2: Scheduling & Optimization
B2: System Security
A3: Energy Management
B3: Data Structures
A4: Localization
B4: Replication & Byzantine Fault Tolerance
A5: Online Social Networks
B5: Think Globally, Act Locally
A6: Data Dissemination
B6: Data-Center Economics
A7: Networking
B7: Parallel Data Processing
A8: Resource Provisioning & Load Balancing
B8: Thwarting Adversaries
A9: Network Security
B9: Theory

--------------------------------
WORKSHOPS
--------------------------------

* Workshop on Assurance in Distributed Systems and Networks (ADSN 2013)
* Workshop on Wireless Ad hoc and Sensor Networking (WWASN 2013)
* Workshop on Resource Management of Cloud Computing (CCRM 2013)
* Workshop on Network Forensics, Security and Privacy (NFSP 2013)
* Workshop on Hot Topics in Peer-to-peer computing and Online Social
Networking (HotPOST 2013)
* Workshop on Mobile Cloud and Social Computing (MCSC 2013)
* Workshop on Cyber-Physical Networking Systems (CPNS 2013)
* Workshop on Data Center Performance (DCPerf 2013)

--------------------------------
TRAVEL & REGISTRATION
--------------------------------
* Registration available at:
https://www.icdcs-registration.com/icdcs13/

* Hotel reservations (special rate) available at:
http://www.temple.edu/cis/icdcs2013/hotel.html

Note: Deadline for special rate is June 7

* Visa issue instructions can be found in
http://www.temple.edu/cis/icdcs2013/hotel.html

--------------------------------
ORGANIZING COMMITTEE
--------------------------------

* General Chair
Jie Wu, Temple University, USA

* Program Chair
John Douceur, Microsoft Research, USA

* Program Vice-Chairs
Faith Ellen, University of Toronto, Canada
Cristina Nita-Rotaru, Purdue University, USA
Roy Friedman, Technion, Israel
Yu-Chee Tseng, National Chiao-Tung University, Taiwan
David Du, University of Minnesota, USA
Manuel Costa, MSR-Cambridge, UK
Jon Howell, MSR-Redmond, USA
Aleksandar Kuzmanovic, Northwestern University, USA
Ricardo Bianchini, Rutgers University, USA
Krishna Kant, National Science Foundation, USA
Zhi-Li Zhang, University of Minnesota, USA

* Workshop Co-Chairs
Hai Jin, Huazhong University of Science and Technology, China
Ivan Stojmenovic, University of Ottawa, Canada

* Awards Co-Chairs
Matt Mutka, Michigan State University, USA
Mukesh Singhal, UC-Merced, USA
Wei Zhao, University of Macau, Macau

* Local Chair
Chiu C. Tan, Temple University, USA

* Registration Chair
Carrie Stein, The Ohio State University, USA

* Finance Chair
Dong Xuan, The Ohio State University, USA

* Publicity Co-Chairs
Leszek T. Lilien, Western Michigan University, USA
Pedro M. Ruiz, University of Murcia, Spain
Guojun Wang, Central South University, China

* Publication Co-Chairs
Feng Li IUPUI, USA

* International Liaison Co-Chairs
Chita Das, Penn State University, USA
Michel Raynal, IRISA-IFSIC, France
Makoto Takizawa, Seikei University, Japan

* TCDP Chair
Jiannong Cao, Hong Kong Polytechnic University, Hong Kong

* Steering Committee Chair
Xiaodong Zhang, The Ohio State University, USA

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

Wednesday, May 29, 2013

[DMANET] Two Positions for Research Associates at HSU Hamburg

The Chair of Applied Mathematics at Helmut Schmidt University /
University of the Federal Armed Forces Hamburg, Prof. Dr. Armin
Fügenschuh, invites applications for two Research Associates (E-13
TVöD, between 3186 and 4598 EUR/month). The position involves research
in mixed-integer linear and nonlinear programming with applications to
industrial problems and teaching of mathematics for engineering
students (in German). Further details can be found at URL

http://www.hsu-hh.de/am/index_iJTQW5dHKiCXs7gi.html

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

[DMANET] IPEC 2013 Call for Papers (Parameterized and Exact Computation)

IPEC 2013

The 8th International Symposium on Parameterized and Exact Computation
Sophia Antipolis, France, September 4-6, 2013
http://www.kr.tuwien.ac.at/ipec2013/

The 8th International Symposium on Parameterized and Exact Computation (IPEC 2013) covers research in all aspects of parameterized/exact algorithms and complexity. Papers presenting original research in the area are sought, including but not limited to: new techniques for the design and analysis of parameterized and exact algorithms, fixed-parameter tractability results, parameterized complexity theory, relationship between parameterized complexity and traditional complexity classifications, applications of parameterized and exact computation, and implementation issues of parameterized and exact algorithms. In particular, studies on parameterized and exact computations for real-world applications and algorithmic engineering are especially encouraged.

IPEC 2013 will be part of ALGO 2013, which also hosts ESA 2013 and a number of more specialized conferences and workshops. ALGO 2013 will take place September 2-6, 2013, Sophia Antipolis, France

Authors are invited to submit an extended abstract in English no longer than 12 pages (excluding references and appendices) using at least 11-point font, in LNCS-style, describing original unpublished research. Simultaneous submission to other conferences with published proceedings is not permitted. Additional details as necessary may be included in a clearly marked appendix that will be read at the discretion of the program committee. Authors must submit their papers electronically. A detailed description of the electronic submission process is available at the symposium website. Program committee members (except the co-chairs) are allowed to submit papers.

Accepted papers will be published in the symposium proceedings in the Springer series Lecture Notes in Computer Science. Authors of accepted papers are expected to present their work at the symposium, and to incorporate the comments from the program committee.

The program committee may award an Excellent Student Paper Award to one or more papers accepted to the symposium. A paper is eligible for the award if all authors are students at the time of submission, where a student is someone who has not been awarded a PhD before the paper submission deadline.

SPECIAL ISSUE OF ALGORITHMICA

Selected papers of IPEC 2013 will be invited for a special issue of Algorithmica.

EATCS-IPEC NERODE PRIZE 2013

The 2013 EATCS-IPEC Nerode Prize for outstanding papers in the area of multivariate algorithmics will be awarded during IPEC 2013 to Chris Calabro, Russell Impagliazzo, Valentine Kabanets, Ramamohan Paturi, and Francis Zane. One of the awardees will give an invited talk at IPEC 2013.
http://eatcs.org/images/awards/nerode13-laudatio.pdf

INVITED TALK

Ramamohan Paturi: "Exact Complexity and Satisfiability"

INVITED TUTORIALS

Marek Cygan: "Graph Problems Parameterized by Treewidth"

Daniel Lokshtanov: "Efficient Computation of Representative Sets with Applications in Parameterized and Exact Algorithms"

IMPORTANT DATES

Abstract Submission: June 12, 2013
Paper Submission: June 15, 2013
Notification of Acceptance: 13 July, 2013
Final Version: 19 August, 2013
Symposium: September 4-6, 2013

PROGRAM COMMITTEE

Faisal Abu-Khzam
Andreas Björklund
Rod Downey
Mike Fellows
Serge Gaspers
Gregory Gutin (co-chair)
Pinar Heggernes
Eun Jung Kim
Christian Komusiewicz
Daniel Lokshtanov
Venkatesh Raman
Peter Rossmanith
Stefan Szeider (co-chair)
Anders Yeo
**********************************************************
*
* 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/
*
**********************************************************

IPEC 2013 Call for Papers (Parameterized and Exact Computation)

[DMANET] PADABS2013, Deadline Extension

Call for Papers
1st Workshop on Parallel and Distributed Agent-Based Simulations

August 26th, 2013, Aachen (Germany), jointly with Euro-Par 2013
http://www.padabs.org
Submission deadline: June 10th, 2013
EasyChair Submission Site:
https://www.easychair.org/conferences/?conf=padabs2013

Organizers
• Vittorio Scarano (Università di Salerno, Italy), chair
• Gennaro Cordasco (Seconda Università di Napoli, Italy),
• Rosario De Chiara (Poste Italiane, Italy),
• Ugo Erra (Università della Basilicata, Italy)

Program Committee
• Maria Chli (Aston University, United Kingdom)
• Claudio Cioffi-Revilla (George Mason University, USA)
• Biagio Cosenza (University of Innsbruck, Austria)
• Nick Collier (Argonne National Laboratory, USA)
• Rosaria Conte (CNR, Italy)
• Andrew Evans, (University of Leeds, United Kingdom)
• Bernardino Frola (The MathWorks, Cambridge, UK)
• Nicola Lettieri (Università del Sannio e ISFOL, Italy)
• Sean Luke (George Mason University, USA)
• Michael North (Argonne National Laboratory, USA)
• Mario Paolucci (CNR, Italy)
• Paul Richmond (The University of Sheffield, United Kingdom)
• Arnold Rosenberg (Northeastern University, USA)
• Michela Taufer (University of Delaware, USA)

Objectives of the Workshop
Agent-Based Simulation Models are an increasingly popular tool for research and
management in many fields such as ecology, economics, sociology, etc..
In some fields, such as social sciences, these models are seen as a
key instrument
to the generative approach, essential for understanding complex social
phenomena.
But also in policy-making, biology, military simulations, control of
mobile robots
and economics, the relevance and effectiveness of Agent-Based
Simulation Models is
recently recognized.
Computer science community has responded to the need for platforms
that can help
the development and testing of new models in each specific field by
providing tools,
libraries and frameworks that speed up and make massive simulations possible.

The key objective of this First Workshop on Parallel and Distributed
Agent-Based
Simulations is to bring together the researchers that are interested
in getting
more performances from their simulations, by using synchronized, many-core
simulations (e.g., GPUs), strongly coupled, parallel simulations (e.g. MPI) and
loosely coupled, distributed simulations (distributed heterogeneous setting).
Several frameworks have been recently developed and are active in this field.
They range from the GPU-Manycore approach, to Parallel, to Distributed
simulation
environments. In the first category, you can find FLAME GPU, that
allows also non
GPU specialists to harness the GPUs performance for real time simulation and
visualization. For tightly-coupled, large computing clusters and supercomputers
a very popular framework is Repast for High Performance Computing (REPAST-HPC),
a C++-based modeling system. On the distributed side, recent work on
Distributed Mason, allows non specialists to use heterogeneous hardware and
software in local area networks for enlarging the size and speeding up the
simulation of complex Agent-Based models.

Topics of interest
• Frameworks for parallel/distributed ABSs.
• Case studies of ABSs in parallel/distributed settings, with an emphasis
on the technical implementation, architectural choices and their
impact on performances
• Benchmark parallel/distributed ABSs
• Debugging parallel/distributed ABSs
• Formal methods and algorithms for ABSs in parallel/distributed models
• Load Balancing algorithms, techniques and frameworks
• Management and deployment of parallel/distributed ABSs
• Visualization of parallel/distributed ABSs

Paper submission
The papers will be presented in the regular format (10 pages LNCS format,
5 pages for short papers) and will be reviewed, anonymously by at least 2
reviewers of the Program Committee. Acceptance as regular/short papers will
depend upon scientific value, originality and relevance to the Workshop theme.

Euro-Par Workshops Proceedings will be published by Springer in the Lecture
Notes for Computer Science series after the Workshops. Submissions and
reviewing
will be through EasyChair at
https://www.easychair.org/conferences/?conf=padabs2013 .

Important Dates
• June 10th 2013, Submission deadline
• July 8th, 2013: Authors notification
• August 26th, 2013: Workshop
• October 3rd, 2013: Camera-ready papers due

Contact information:
• Vittorio Scarano: vitsca@dia.unisa.it
• Ugo Erra: ugo.erra@unibas.it
• Gennaro Cordasco: gennaro.cordasco@unina2.it
• Rosario De Chiara: dechia24@posteitaliane.it

Gennaro Cordasco

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

[DMANET] Call for work-in-progress (WIP) papers - SustainIT 2013 (deadline June 20)

-------------------------------------------------------------------
*** Our apologies if you receive multiple copies of this e-mail ***
-------------------------------------------------------------------

CALL FOR WORK-IN-PROGRESS (WIP) PAPERS

The Third IFIP Conference on

Sustainable Internet and ICT for Sustainability
(SustainIT 2013)

http://www.dicgim.unipa.it/networks/sustainit2013

October 30-31, 2013
Palermo, Sicily, Italy

- Technically sponsored by the IFIP TC6 WG 6.3 (Performance of Communication Systems)

- Technically co-sponsored by IEEE TCCC (Technical Committee on Computer Communications)
- In cooperation with IEEE TSGCC (Technical Subcommittee on Green Communications and Computing)
- Supported by EINS: The Network of Excellence in Internet Science

------------------------------------------------------------------------
**** WIP Paper Submission Deadline --- JUNE 20, 2013 ****
------------------------------------------------------------------------

SCOPE AND OVERVIEW
------------------------------------------------------------------------

SustainIT 2012 invites Work in Progress (WIP) papers showing innovative and original research in the areas of Sustainable Internet and ICT for Sustainability. Submissions from both industry and academia are strongly encouraged. WIP papers are expected to report on early and emerging results and bring about novel research questions, approaches, and directions. The specific aim of the WiP session is to provide a forum for timely presentation, discussion and feedback for novel, controversial, and thought provoking ideas. All selected papers will be presented as posters in a special conference session. In addition, all selected papers will be included in the conference proceedings.

For this special session we solicit original papers addressing both theoretical and practical aspects of energy-awareness for Internet-based systems, and the design of ICT solutions for eco-sustainability. Topics of interest include but are not limited to:

- Green Internet
- Power-aware Internet applications
- Energy-efficient network architecture and protocols
- Green wireless networking
- Energy-efficient network technologies
- Cross-layer optimization for green networking
- Standards and metrics for green communications
- Energy-efficient management of network resources
- Energy efficiency in data centres
- Energy efficiency, Quality of Service, and reliability
- Algorithms for reduced power, energy and heat
- Data processing in smart energy systems
- ICT for energy efficiency in smart homes and buildings
- ICT for sustainable smart cities
- ICT for sustainable transports and logistics
- ICT for green mobility
- ICT for energy efficiency in industrial environments
- ICT for smart grids
- Security and privacy in ICT for energy systems
- Sustainability achievements due to ICT-based optimization
- Energy consumption measurements, models, and monitoring tools
- Measurement and evaluation of the Internet sustainability
- Test-bed and prototype implementations

PAPER SUBMISSION
------------------------------------------------------------------------

All submissions must describe original research, not published or currently under review for another workshop, conference, or journal. WIP papers are expected to present early or ongoing research activities. Novel approaches and preliminary results are especially appreciated.

Papers must be submitted electronically in PDF format through EDAS. Manuscripts must be formatted in accordance with the IEEE Computer Society author guidelines (http://edas.info/newPaper.php?c=14317). Manuscripts must be limited to 5 pages, single spacing, double column, and must STRICTLY adhere to the template format. Detailed instructions for manuscript preparation and submission are available on the conference website (http://www.dicgim.unipa.it/networks/sustainit2013/submission.html).

Submission implies the willingness of, at least, one author to register and attend the conference to present the paper. The organizers reserve the right to exclude a paper from distribution after the conference if the paper is not presented at the conference.

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

- Paper submission deadline: June 20, 2013
- Acceptance notification: July 15, 2013
- Camera-ready version due: July 30, 2013

FOR MORE INFORMATION
------------------------------------------------------------------------

For questions about the demonstration submission and review process, please contact

Raffaele Bruno, IIT-CNR, Italy - raffaele (dot) bruno (at) iit (dot) cnr (dot) it

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

[DMANET] RP'13 Extended Deadline: 10 June 2013

----------------------------------------------------------
R E A C H A B I L I T Y P R O B L E M S 2013

Submission deadline is extended until 10 June 2013
----------------------------------------------------------
The 7th International Workshop on Reachability Problems (RP2013)
(25 - 27 September 2013, University of Uppsala, Sweden)
http://www.it.uu.se/conf/RP2013/

The Department of Information Technology will organize the 7th International
Workshop on Reachability Problems (RP'2013). This event will take place at
Norrlands nation in the heart of central Uppsala, 25 - 27 September 2013.

Papers presenting original contributions related to reachability problems
in different computational models and systems are being sought.
This will also be the occasion to review recent breakthroughs by
renown invited experts and survey emerging trends and emphasize
on key open challenges. Participants are kindly encouraged to discuss
on core scientific issues that need to be further tackled.

The Reachability Workshop is specifically aimed at gathering together
scholars from diverse disciplines and backgrounds interested in
reachability problems that appear in
- Algebraic structures
- Computational models
- Hybrid systems
- Logic and Verification

Invited Speakers:

- Patricia Bouyer-Decitre (Cachan, France)
- Daniel Kroening (Oxford, UK)
- Rupak Majumdar (MPI-SWS, Germany)
- Shaz Qadeer (Microsoft Research Redmond, USA)
- Thomas Schwentick (TU Dortmund University, Germany)

Submissions:

Papers presenting original contributions related to
reachability problems in different computational
models and systems are being sought.

Topics of interest include (but are not limited to):
Reachability for infinite state systems, rewriting
systems; Reachability analysis in counter/ timed/
cellular/ communicating automata; Petri-Nets;
computational aspects of semigroups, groups and
rings; Reachability in dynamical and hybrid systems;
frontiers between decidable and undecidable
reachability problems; complexity and decidability aspects;
predictability in iterative maps and new computational paradigms

Authors are invited to submit a draft of a full paper with
at most 12 pages (in LaTeX, formatted according to LNCS guidelines)
via the conference web page.
Proofs omitted due to space constraints must be put into an
appendix to be read by the program committee members at their discretion.
Submissions deviating from these guidelines risk rejection.
Electronic submissions should be formatted in pdf.
Simultaneous submission to other conferences or workshops
with published proceedings is not allowed.

Important Dates

- Submission deadline (Extended): 10 June 2013
- Notification to authors: 12 July 2013
- Final version: 19 July 2013
- Workshop: 25 - 27 September 2013

Proceedings

The Conference Proceedings will be published
as the volume of the Springer Verlag LNCS
(Lecture Notes in Computer Science) series and
distributed at the Conference. We plan also to publish
selected papers in a special issue of a high quality journal
following the regular referee procedure.

RP2013 Program Committee:

Parosh Aziz Abdulla (co-chair), Uppsala University
Rajeev Alur, University of Pennsylvania
Mohamed Faouzi Atig, Uppsala University
Bernard Boigelot, University of Liege
Ahmed Bouajjani, LIAFA, University Paris Diderot
Krishnendu Chatterjee, Institute of Science and Technology
Giorgio Delzanno, DIBRIS, Università di Genova
Javier Esparza, Technische Universität München
Alain Finkel, ENS Cachan
Pierre Ganty, IMDEA Software Institute
K. Narayan Kumar, Chennai Mathematical Institute
Kim Guldstrand Larsen, Aalborg University
Jerome Leroux, CNRS-LABRI
Richard Mayr, University of Edinburgh
Markus Müller-Olm, Wilhelms-Universität Münster
Andreas Podelski, University of Freiburg
Igor Potapov (co-chair), University of Liverpool
Jean-Francois Raskin, Université Libre de Bruxelles
Ahmed Rezine, Linköping University
James Worrell, Oxford University
Hsu-Chun Yen, National Taiwan University
Gianluigi Zavattaro, Università di Bologna

Organizing Committee:

Parosh Aziz Abdulla (co-chair), Uppsala University
Mohamed Faouzi Atig (co-chair), Uppsala University
Carl Leonardsson, Uppsala University
Igor Potapov (co-chair), University of Liverpool
Jari Stenman, Uppsala University
Othmane Rezine, Uppsala University

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

Tuesday, May 28, 2013

[DMANET] CfP: Special Section on Discrete Mathematics and Its Applications, The IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Call for Papers

The IEICE Transactions on Fundamentals of Electronics, Communications
and Computer Sciences
Special Section on Discrete Mathematics and Its Applications

submit by September 20, 2013, published in June, 2014

The IEICE Transactions on Fundamentals of Electronics, Communications
and Computer Sciences announces a forthcoming Special Section on
Discrete Mathematics and Its Applications to be published in June,
2014. The objective of the special section is to review and promote
recent progress in the field of discrete mathematics and its
applications. Topics of interest include, but are not limited to:
- algorithms, data structures, and computational complexity
- graphs, networks, and matroids
- combinatorial optimization
- parallel and distributed algorithms
- discrete geometry, computational geometry, and computational algebra
- coding theory and mathematical foundations of cryptography
- probabilistic and number theoretic algorithms
- linear programming and mathematical programming
- computational biology and bioinformatics
- Petri nets and concurrent systems
- applications of discrete mathematics
- algorithm engineering
- quantum computation, quantum algorithm, and quantum cryptography

For further detail, please visit
www.cs.gunma-u.ac.jp/~amano/data/cfp_dm_e.pdf .

--
Yoshio Okamoto, Assoc. Prof. <okamotoy@uec.ac.jp>
Dept. of Communication Engineering and Informatics
University of Electro-Communications
Chofugaoka 1-5-1, Chofu, Tokyo 182-8585
**********************************************************
*
* 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

Applications are invited for a

Postdoc position
(full-time, up to 3 years, "TVL-E-13")

at Goethe University Frankfurt, starting 1 Oct 2013.

The application deadline is June 12th, 2013.

The positions are funded by the ERC starting grant "Phase transitions and computational complexity". Further details can be found at
http://www.math.uni-frankfurt.de/~hetteric/erc/

Applicants should have an interest in at least one of

- probabilistic combinatorics (particularly the study of random discrete structures)
- discrete algorithms (particularly Markov Chain Monte Carlo) and computational complexity
- information theory
- mathematical statistical mechanics

For the official announcement (in German) please refer to
http://www.uni-frankfurt.de/org/ltg/praes/pr_k/service/pa/Stellenmarkt/Oeffentliche_Stellenangebote/Akademische_und_Wissenschaftliche_MitarbeiterInnen/Fachbereiche/FB_12/index.html

Applications should be sent to

Amin Coja-Oghlan
FB 12 / Institut fur Mathematik
Postfach 111932 / Fach 187
60054 Frankfurt
Germany
acoghlan@math.uni-frankfurt.de
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

Monday, May 27, 2013

[DMANET] 4th Cargese Workshop on Combinatorial Optimization (Sep 30th - Oct 5th, 2013)

*******************************************************************************
4th Cargese Workshop on Combinatorial Optimization : Submodularity

Cargese, Corsica (France)

September 30th - October 5th

http://www.iasi.cnr.it/~ventura/Cargese13/Overview.html

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

AIM:

The yearly Cargese workshop aims to bring together researchers in
combinatorial optimization around a chosen topic of current interest.
It is intended to be a forum for the exchange of recent developments
and powerful tools, with an emphasis on theory. Other goals include:
the promotion of interactions between participants and discussion of
open problems. There are morning and afternoon sessions. Morning
sessions are dedicated to longer survey-type talks or open problems.
The afternoon sessions are dedicated to discussions as well as shorter
talks on related topics.

VENUE:

The 4th Cargese Workshop on Combinatorial Optimization will take place
at IESC Cargese, Corsica (France).

SCOPE:

This fourth edition will focus on aspects of submodularity, e.g.:

- applications to machine learning
- submodularity in the context of approximation algorithms
- approximating / learning submodular functions
- combinatorial properties
- submodular flows

DISTINGUISHED SPEAKERS:

Francis Bach (ENS Paris, France)
Satoru Iwata (Tokyo University, Japan)
Tom McCormick (British Columbia, Canada)
Seffi Naor (Technion, Israel)

PARTICIPATION:

The workshop will have about 70 participants, including PhD students
and postdocs. The participation of the previous Cargese workshops was
restricted to invited researchers. For this fourth edition, we
encourage researchers interested in the workshop and who did not
receive a direct invitation, to submit a contributed talk on this
year's topic. Authors are kindly invited to submit an abstract (max. 2
pages) with a description of the work they would like to present : cwco2013@gmail.com
.

Deadline for submission : May 31st (11:59 pm CET).
Notification of acceptance : June 24th.

ORGANIZING COMMITTEE:

Samuel Fiorini (ULB, Brussels, Belgium)
Gianpaolo Oriolo (Università di Tor Vergata, Rome, Italy)
Gautier Stauffer (Grenoble INP, France)
Paolo Ventura (IASI, Rome, Italy)

STEERING COMMITTEE:

Friedrich Eisenbrand (EPFL, Switzerland)
Michel Goemans (MIT, USA)
Monique Laurent (CWI, Netherland)
R. Ravi (CMU, USA)
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

Friday, May 24, 2013

from Nisheeth Vishnoi: 33rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS)

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

33rd IARCS Annual Conference on
Foundations of Software Technology and Theoretical Computer Science (FSTTCS)
December 10-14, 2013
IIT Guwahati, India

Scope
----------

Authors are invited to submit papers presenting original and
unpublished research in any area of Theoretical Computer Science or
Foundational aspects of Software Technology. Representative areas
include, but are not limited to:

* Algorithms and data structures, including randomized,
approximations, distributed, geometric, online, streaming,
fixed-parameter and graph algorithms

* Computational complexity, including circuits, communication, proof
and structural complexity, pseudorandomness, PCPs and
inapproximability

* Combinatorial optimization, game theory and mechanism design,
quantum computing, computational biology, cryptography and security

* Automata and formal languages

* Concurrent, timed and hybrid systems

* Logic in computer science, including finite model theory, modal and
temporal logics, specification, verification, and synthesis

* Programming languages, including semantics, types, program analysis
and correctness

Important Dates
------------------------

Abstract submission deadline: July 8, 2013
Paper Submission deadline: July 15, 2013
Notification to authors: September 16, 2013
Final version due: October 14, 2013
Conference: December 12-14, 2013
Workshops: December 10-11, 2013

Program Committee
-----------------------------

Manindra Agrawal (IIT Kanpur)
Arnab Bhattacharyya (DIMACS,Rutgers and IISc, Bangalore)
Elisa Celis (Xerox Research Centre India)
Anupam Gupta (CMU)
Prahladh Harsha (TIFR, Mumbai)
Swastik Kopparty (Rutgers)
Meena Mahajan (IMSc, Chennai)
Raghu Meka (IAS, Princeton and DIMACS, Rutgers)
Yogish Sabharwal (IBM Research India)
C. Seshadhri (Sandia National Lab, CA)
Ola Svensson (EPFL)
Madhur Tulsiani (TTI, Chicago)
Laszlo Vegh (London School of Economics)
Thomas Vidick (MIT)
David Williamson (Cornell)
Nisheeth Vishnoi (Microsoft Research India, Co-Chair)

Mohamed Faouzi Atig (Uppsala, Sweden)
Roberto Bruni (Pisa, Italy)
Arnaud Carayol (Institut Gaspard-Monge, France)
Anuj Dawar (Cambridge, UK)
Laurent Doyen (ENS Cachan)
Deepak D'Souza (IISc, Bangalore)
Deepak Garg (Max Planck, Germany)
Dan Ghica (Birmingham, UK)
Hugo Gimbert (LaBRI)
Ugo Dal Lago (Bologna, Italy)
Ranko Lazic (Warwick, UK)
Gopalan Nadathur (Minnesota, USA)
K. Narayan Kumar (CMI, Chennai)
R. Ramanujam (IMSc, Chennai)
Szymon Torunczyk (Warsaw, Poland)
Anil Seth (IIT Kanpur, Co-Chair)

Submissions
-------------------

Submissions will be in electronic form via the EasyChair site
(www.easychair.org/conferences/?conf=fsttcs2013) and are restricted to
12 pdf pages using the LIPIcs LaTeX style file (see
drops.dagstuhl.de/styles/lipics/lipics-authors.tgz). Proofs omitted
due to space constraints must be put into an appendix to be read by
the PC members/reviewers at their
discretion. Accepted papers will be published as the proceedings of
the conference in the Leibniz International Proceedings in Informatics
(LIPIcs) (see www.dagstuhl.de/en/publications/lipics) as a free, open,
electronic archive with access to all. Authors will retain full rights
over their work. Concurrent submission to other conferences or
journals is not acceptable.

For an accepted paper to be included in the proceedings, one of the
authors must commit to presenting the paper at the conference.

Poster Session for Ph.D. Students
--------------------------------------------------
There will be a poster session for doctoral students. There will be a
separate evaluation process for this and the deadline for submission is
Sept. 23, 2013 and notification by Oct. 14, 2013. These will not be
included in the proceedings. Details to be posted on the conference
webpage.

------------------
Conference Website: http://www.fsttcs.org/

Thursday, May 23, 2013

[DMANET] Call for Papers: ISAAC 2013

CALL FOR PAPERS
ISAAC 2013
The 24th International Symposium on Algorithms and Computation
December 16-18, 2013
The University of Hong Kong, Hong Kong
http://www.cs.hku.hk/isaac2013/

The 24th International Symposium on Algorithms and Computation (ISAAC 2013)
will be held in Hong Kong, December 16-18, 2013. The symposium is intended
to provide a forum for researchers working in algorithms and theory of
computation. Papers presenting original research in the areas of algorithms
and theory of computation are sought. Papers in relevant applied areas are
also welcome.

INVITED SPEAKERS
Muthu Muthukrishnan, Rutgers University, USA.
Moni Naor, Weizmann Institute of Science, Israel.

Important Dates
Submission deadline: June 15, 2013 (23:59 Honolulu Time)
Notification date: August 31, 2013
Final version due: September 21, 2013

Publication
The proceedings will be published by Springer-Verlag in the LNCS series.
Selected papers will be invited to special issues of Algorithmica and
International Journal of Computational Geometry and Applications.

Paper Submission
The submission should contain a scholarly exposition of ideas,
techniques, and
results, including motivation and a comparison with related work. The main
text, including title, abstract, and references, should not exceed 11
pages in
LNCS style. An optional appendix should be used to provide proof details
that
do not fit in the main text. Submitted papers must describe unpublished
work.
Authors should not submit papers with the same results or essentially
the same
results that are accepted or published or under review by a conference with
refereed proceedings or a journal. Only electronic submission will be
allowed
and only pdf files will be accepted. It will be done via Easychair:
https://www.easychair.org/conferences/?conf=isaac2013

At least one author of an accepted paper is expected to present the
paper at
the conference as a registered participant.

Awards
A Best Paper and a Best Student Paper may be awarded. A paper is
eligible for
the Best Student Paper Award 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 the Best Student Paper Award" in the abstract.

Conference Co-chairs
Chung-Keung Poon, City University of Hong Kong, Hong Kong
Hing-Fung Ting, University of Hong Kong, Hong Kong

Program Co-chairs
Leizhen Cai, Chinese University of Hong Kong, Hong Kong
Siu-Wing Cheng, Hong Kong University of Science and Technology, Hong Kong
Tak-Wah Lam, University of Hong Kong, Hong Kong

Program Committee
Pankaj Agarwal, Duke University, USA
Hee-Kap Ahn, POSTECH, South Korea
Boris Aronov, Polytechnic Institute of NYU, USA
Therese Biedl, University of Waterloo, Canada
Hubert Chan, University of Hong Kong, Hong Kong
Jianer Chen, Texas A&M University, USA
Xi Chen, Columbia University, USA
Pavol Hell, Simon Fraser University, Canada
Wing-Kai Hon, National Tsinghua University, Taiwan
Jesper Jansson, Kyoto University, Japan
Ming-Yang Kao, Northwestern University, USA
Stefan Kratsch, Technische Universitat Berlin, Germany
Stefan Langerman, Universite Libre de Bruxelles, Belgium
Lap-Chi Lau, Chinese University of Hong Kong, Hong Kong
James Lee, University of Washington, USA
Jian Li, Tsinghua University, China
Hsueh-l Lu, National Taiwan University, Taiwan
Julian Mestre, University of Sydney, Australia
Pat Morin, Carleton University, Canada
Benjamin Moseley, Toyota Institute of Technology at Chicago, USA
Evanthia Papadopoulou, Universita della Svizerra italiana, Switzerland
Christophe Paul, CNRS, LIRMM, France
Rajeev Raman, University of Leicester, UK
Kunihiko Sadakane, National Institute of Informatics, Japan
Rob van Stee, Max Planck lnstitute for lnformatics, Germany
Wing-Kin Sung, National University of Singapore, Singapore
Jan Arne Telle, University of Bergen, Norway
Hing Fung Ting, University of Hong Kong, Hong Kong
Antoine Vigneron, King Abdullah University of Science and Technology,
Saudi Arabia
Lusheng Wang, City University of Hong Kong, Hong Kong
Yajun Wang, Microsoft Research Asia, China
Prudence Wong, University of Liverpool, UK
Yitong Yin, Nanking University, China
Neal Young, University of California, Riverside, USA
Shengyu Zhang, Chinese University of Hong Kong, Hong Kong

**********************************************************
*
* 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] SAT 2013 early registration reminder

[ We apologize if you receive multiple copies of this message. ]
-------------------------------------------------------------------------

Sixteenth International Conference on
THEORY AND APPLICATIONS OF SATISFIABILITY TESTING
--- SAT 2013 ---

Helsinki, Finland, July 8-12, 2013
http://sat2013.cs.helsinki.fi/

***** EARLY REGISTRATION DEADLINE: May 27, 2013 *****
Early registration fees: 150 EUR for students
320 EUR regular

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

SAT 2013 CONFERENCE HIGHLIGHTS
==============================

-Three high-quality INVITED TALKS:
+Albert Atserias:
"The Proof-Search Problem between Bounded-Width Resolution and
Bounded-Degree Semi-Algebraic Proofs"
+Edmund M. Clarke:
"Turing's Computable Real Numbers and Why They Are Still Important
Today"
+Peter Stuckey:
"There are no CNF problems"

-Around 30 SCIENTIFIC TALKS on SAT 2013 accepted papers, see full list
below.

-WORKSHOPS:
SMT 2013: 1th International Workshop on Satisfiability Modulo Theories
PoS 2013: 4th International Workshop on Pragmatics of SAT
QBF 2013: International Workshop on Quantified Boolean Formulas

-COMPETITIONS AND SYSTEM EVALUATIONS:
SAT Competition 2013
Configurable SAT Solver Challenge 2013
Max-SAT Evaluation 2013
SMT-EVAL 2013
QBF Gallery 2013

SAT 2013 ACCEPTED PAPERS
========================

Gilles Audemard, Jean-Marie Lagniez and Laurent Simon:
On Improving SAT Engines for Incremental SAT Solving with
Assumptions.

Anton Belov, Norbert Manthey and Joao Marques-Silva:
Parallel MUS Extraction.

Olaf Beyersdorff:
The Complexity of Theorem Proving in Autoepistemic Logic.

Uwe Bubeck and Hans Kleine Büning:
Nested Boolean Functions as Models for Quantified Boolean Formulas.

Alessandro Cimatti, Alberto Griggio, Bastiaan Joost Schaafsma and
Roberto Sebastiani:
A Modular Approach to MaxSAT Modulo Theories.

Jessica Davies and Fahiem Bacchus:
Exploiting the Power of MIPs Solvers in Maxsat.

Ronald de Haan, Iyad Kanj and Stefan Szeider:
Local Backbones.

Johannes Dellert, Christian Zielke and Michael Kaufmann:
MUStICCa: MUS Extraction with Interactive Choice of Candidates
(Tool paper).

Marcelo Finger, Carla Gomes, Ronan Le Bras and Bart Selman:
Solutions for Hard and Soft Constraints Using Optimized
Probabilistic Satisfiability.

Hiroshi Fujita, Miyuki Koshimura and Ryuzo Hasegawa:
SCSat: A Soft Constraint Guided SAT Solver (Tool paper).

Oliver Gableske:
On the Interpolation between Product-Based Message Passing
Heuristics for SAT.

Alexandra Goultiaeva and Fahiem Bacchus:
Recovering and Utilizing Partial Duality in QBF.

Marijn Heule and Stefan Szeider:
A SAT Approach to Clique-Width.

Alexey Ignatiev, Mikolas Janota and Joao Marques-Silva:
Quantified Maximum Satisfiability: A Core-Guided Approach.

Mikolas Janota and Joao Marques-Silva:
On Propositional QBF Expansions and Q-Resolution.

Jan Johannsen:
Exponential Separations in a Hierarchy of Clause Learning Proof
Systems.

Charles Jordan and Lukasz Kaiser:
Experiments with Reduction Finding.

Massimo Lauria:
A rank lower bound for cutting planes proofs of Ramsey's Theorem.

Florian Lonsing, Uwe Egly and Allen Van Gelder:
Efficient Clause Learning for Quantified Boolean Formulas via QBF
Pseudo Unit Propagation.

Norbert Manthey, Tobias Philipp and Christoph Wernhard:
Soundness of Inprocessing in Clause Sharing SAT Solvers.

Jean Marie Lagniez and Armin Biere:
Factoring-Out Assumptions to Speed-Up MUS Extraction.

Ruben Martins, Vasco Manquinho and Inês Lynce:
Community-based Partitioning for MaxSAT Solving.

Andrew Mihal and Steve Teig:
A Constraint Satisfaction Approach for Programmable Logic Detailed
Placement.

Neeldhara Misra, Sebastian Ordyniak, Venkatesh Raman and Stefan
Szeider:
Upper and Lower Bounds for Weak Backdoor Set Detection.

Mordechai Moti Ben-Ari:
LearnSAT: A SAT Solver for Education (Tool paper).

Igor Razgon and Justyna Petke:
Cliquewidth and Knowledge Compilation.

Horst Samulowitz, Chandra Reddy, Ashish Sabharwal and Meinolf
Sellmann:
Snappy: A Simple Algorithm Portfolio (Tool paper).

Carsten Sinz, Markus Iser and Mana Taghdiri:
Minimizing Models for Tseitin-Encoded SAT Instances.

Takehide Soh, Naoyuki Tamura and Mutsunori Banbara:
Scarab: A Rapid Prototyping Tool for SAT-based Constraint
Programming Systems (Tool paper).

Jacobo Toran:
On the resolution complexity of Graph non-Isomorphism.

Siert Wieringa and Keijo Heljanko:
Concurrent clause strengthening.

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

Wednesday, May 22, 2013

[DMANET] HEUREKA 2014 Call (in German)

Sehr geehrte Dame, sehr geehrter Herr,

mit dieser Mail möchte ich Sie auf die folgende Konferenz und den
zugehörigen Call for Papers hinweisen:

HEUREKA 2014
Am 02. und 03. April 2014 findet die nächste HEUREKA Konferenz in Stuttgart
statt. Die HEUREKA sucht forschungs- und anwendungsorientierte Beiträge zu
Entscheidungs- und Optimierungsverfahren aus allen Bereichen des Verkehrs
(Intermodaler Verkehr, Individualverkehr, Öffentlicher Verkehr,
Güterverkehr). Einsendeschluss für die Einreichung von Beiträgen ist der

12. Juli 2013,

weitere Informationen entnehmen Sie bitte der Homepage

http://www.isv.uni-stuttgart.de/vuv/aktuelles/events/heureka2014.html

Abschließend habe ich noch zwei kleine Bitten: Leiten Sie bitte den Call
for Papers auch an Kollegen und/oder Mitarbeiter weiter, von denen Ihnen
aktuelle Aktivitäten aus den genannten Bereichen bekannt sind - und bitte
sehen Sie mir etwaiges "cross-posting" mit einschlägigen Mail-Verteilern
nach. ;-)

Mit freundlichen Grüßen

Dr. Christian Liebchen
Leiter Projekte Bereich Produktion (P.R-SB-B CLi)

S-Bahn Berlin GmbH
Elisabeth-Schwarzhaupt-Platz 1, D-10115 Berlin
Tel. +49 30 297-43934, intern 999-43934
Mobil: 0160 97439833
_________________________________________________________________________________

Der DB-Konzern im Internet >> http://www.deutschebahn.com

Sitz der Gesellschaft: Berlin
Registergericht: Berlin-Charlottenburg, HRB 5 1257
USt-IdNr.: DE 163227325
Geschäftsführer: Peter Buchner (Vorsitzender), Christian Kayser, Karsten
Preißel, Christoph Wachendorf
Vorsitzender des Aufsichtsrates: Dr. Manfred Rudhart

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

[DMANET] PhD/Postdoc position in Theoretical Computer Science at University of Jena

The Chair of Theoretical Computer Science I at University of Jena invites applications for a

PhD student / postdoc position (100%).

The position is part of the project "Average-Case Analysis of Parameterized Problems and Algorithms", funded by the German Research Foundation (DFG). Scope of this project is the average-case behavior of parameterized algorithms. Applicants should have an interest in at least one of the following topics:

-- random structures and algorithms
-- parameterized complexity
-- discrete and distributed algorithms
-- probabilistic and quasirandom methods

The salary scale for the position is full-time TV-L EG 13 with a monthly gross salary between 3270 EUR and 4720 EUR depending on experience and previous position. The first contract will be limited to two years with the possibility of extension for another two years. The position can be started as soon as possible.

Applicants should have an excellent first academic degree in mathematics, computer science or related discipline. Applications should include a detailed CV, a copy of master (or PhD) thesis, a brief statement of research interests, and a list of publications (if applicable). Please also mention one or two references -- preferably one from the thesis advisor. Applicants interested in doing a PhD should also include a list of courses and grades.

Interested candidates should direct their questions and application before June 15, 2013 to Tobias Friedrich (friedrich@uni-jena.de):

Friedrich Schiller University of Jena
Chair of Theoretical Computer Science I
Prof. Dr. Tobias Friedrich
Ernst-Abbe-Platz 2
07743 Jena, Germany
WWW: http://www.theinf.uni-jena.de/
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

Tuesday, May 21, 2013

[DMANET] 2nd Workshop on Optimization in Finance and Risk Management, September 23-24, Fields Institute, Toronto

CALL FOR PARTICIPATION

Dear Colleagues,

We would like to invite you to attend 2nd Industrial-Academic Workshop
on Optimization in Finance and Risk Management, September 23-24, Fields
Institute, Toronto. Information about the workshop is enclosed,
registration and abstract submission are available at the workshop
web-site http://www.optimization-in-finance.ca and
http://www.fields.utoronto.ca/programs/cim/13-14/riskmanagement13/

On behalf of the organizing committee, with best regards,
Oleksandr Romanko
------------------------
Oleksandr Romanko, Ph.D.
Research Analyst, Quantitative Research
Risk Analytics, IBM, Toronto, ON, Canada

===============================================================================
2nd Industrial-Academic Workshop on Optimization in Finance and Risk
Management
===============================================================================
Dates: September 23-24, 2013
Location: Fields Institute, Toronto, Canada
Web-site: http://www.optimization-in-finance.ca
Organizers: Oleksandr Romanko, Antoine Deza, Elkafi Hassini, Kai Huang,
Thomas R. Hurd, Roy H. Kwon, Chi‐Guhn Lee, Jonathan Y. Li
Sponsors: Fields Institute, IBM, University of Toronto, Canadian
Operational Research Society (CORS)
Supporters: McMaster University, Professional Risk Managers'
International Association (PRMIA)
Workshop fee: $40 CAD for students/postdocs, $120 CAD for academia/industry.

The workshop focus is on financial and risk management optimization
models that are aimed for practical implementation and use by risk
managers and finance practitioners. The goal is to bridge academic
research in optimization and financial applications of optimization
techniques.

Tentative Program:
* Distinguished talks by invited academic and industrial speakers
* Contributed talks (25-minute) on recent research advances
* Panel discussion "New Trends and Challenges in Using Optimization to
Improve Decision-Making in Finance and Risk Management - Industrial
Perspective"
* Academia-industry connector and networking event

Invited Speakers:
* Jonathan Briggs (Canada Pension Plan Investment Board)
* Garud Iyengar (Columbia University)
* Alan J. King (IBM Research)
* R. Tyrrell Rockafellar (University of Washington)
* Dan Rosen (R² Financial Technologies)
* Luis Seco (University of Toronto and Sigma Analysis & Management)
* Reha Tütüncü (Goldman Sachs Asset Management)

Submission of contributed talks as well as workshop registration is
available at http://www.optimization-in-finance.ca

Abstract submission deadline for contributed talks is August 1, 2013.

Students/postdocs submitting a contributed talk are eligible for travel
support from Fields Institute
http://www.optimization-in-finance.ca/travel-support/
**********************************************************
*
* 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] 10 PhD + 1 postdoc position in "Discrete Optimization of Technical Systems under Uncertainty"

The DFG Research Training Group "Discrete Optimization of Technical
Systems under Uncertainty" at TU Dortmund invites applications for

10 positions for PhD candidates and 1 postdoc position.

5 PhD positions and the postdoc position start at 1. October 2013 and
the remaining 5 PhD positions start at 1. January 2014. Positions are
within the TV-L E13 German public sector pay scale and are offered at a
90% base. Contracts are given for 1 year and are extended to 3 years
after a successful evaluation at the end of the first year. The postdoc
position is offered for 2 years.

*Research Topics*

Topics of the interdisciplinary research are new approaches for discrete
optimization under uncertainty and their use for the optimization of
artificial systems in particular from the areas logistics, chemical
production techniques and IT systems. One key aspect is the development
of new application oriented methods and the inclusion of human decision
makers as part of the optimization process.

The research program is based on associated projects. An overview of the
research projects can be found under gkdots.tu-dortmund.de. Research is
done in interdisciplinary research groups and is accompanied with a
qualification program offering training in technical and soft skills.
The program is completed by scientific talks of internal researchers and
a short stay at a foreign university or research institute to support
the integration in the internal research community.

*Requirements*

Applicants for the PhD positions should hold an excellent master/diploma
degree in computer science, mathematics, engineering or psychology and
have to be interested in interdisciplinary and application oriented
research. Basic knowledge in optimization and modeling are helpful. Good
English language skills are mandatory. PhD candidates should finish
their dissertation within the time frame of 3 years.

Requirements for the postdoc position are an excellent PhD in one of the
mentioned areas. Applicants at the boundary between computer science and
psychology are of particular interest for the postdoc position. Possible
research areas are interfaces for optimization methods or the
combination of algorithmic and human approaches for optimization.

The Dortmund University of Technology aims to increase the percentage of
women in the involved faculties and therefore applications from women
are particularly welcome.

The same applies to qualified disabled people.

Applications should include the relevant documents (curriculum vitae,
list of publications if available, certificates of academic
qualifications), a reference letter written by a professor and an
accompanying statement mentioning one or two research projects where the
applicant wants to do her or his dissertation. Applications should be
sent within six weeks after announcement to:

Technische Universität Dortmund
Prof. Dr. Peter Buchholz
Fakultät für Informatik
LS Informatik 4
TU Dortmund
D 44221 Dortmund
Tel. 0231 755 4746
Email: peter.buchholz@tu-dortmund.de

Additional information about the research training group and the
research areas can be found under gkdots.tu-dortmund.de.
**********************************************************
*
* 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] Fall School, 02-20 September 2013, TU Graz -- Call for participation

======================================================
Fall School, 02-20 September 2013, TU Graz -- Call for participation
======================================================

We invite you to participate in

---------------------------------------------------------------------------------------------------
Fall School "Phase Transition in Random Discrete Structures"
02-20 September 2013
Graz University of Technology (TU Graz), Austria

http://www.math.tugraz.at/mathb/seminar/2013FallSchool-TUGraz.pdf
---------------------------------------------------------------------------------------------------

SUMMARY:

The phase transition is a phenomenon observed in mathematics and natural
sciences in many different contexts. It deals with a sudden change in
the properties of a large structure caused by altering a critical
parameter. The phase transition in random discrete structures (e.g.
random graphs, random graph processes, random satisfiability problems,
Ising/Potts model, percolation) has captured the attention of many
scientists in recent years.

The goal of the fall school is to provide advanced master students, PhD
students, and early stage postdocs, who are interested in random
discrete structures and related fields, the opportunities

- to learn the state of the art results in the study of the phase
transition in various random discrete structures;
- to understand modern proof techniques that have successfully been
applied to the study of phase transition and its critical behaviour;
- to meet fellow colleagues in their early research career, which
possibly results in their future collaboration.

On top of this scientific and educational achievement, young
participants can experience the research environment of TU Graz as a
candidate place for their future research, and establish contacts with
other participants for their future collaboration. The language of the
school is English.

The fall school is supported by the Austrian Science Fund (FWF) within
the Doctoral Programme "Discrete Mathematics"at TU Graz and by the
European Science Foundation (ESF) within the Research Networking
Programme "Random Geometry of Large Interacting Systems and Statistical
Physics (RGLIS)"

LECTURERS:

The lectures of the fall school will be given by the two experts in the
study of phase transitions in random discrete structures:

-Amin Coja-Oghlan (University of Frankfurt)
- Konstantinos Panagiotou (Ludwig Maximilian University of Munich)

AUDIENCE:

The course is addressed to advanced master students, PhD students, and
early stage postdocs, who are interested in random discrete structures
and related fields. The total number of participants is limited to 35.

There will be a limited amount of scholarships (of max. 500 Euro each)
available for PhD students or for advanced Master students in a field
related to the topics of the school.

APPLICATION:

Applications for participation only, with a short curriculum vitae and
scientific background, should be sent by 5 July 2013 to Sandra Wissler
<sandra.wissler@tugraz.at>

Applications for scholarship and participation, with curriculum vitae,
abstract of thesis, a research statement, and a letter of recommendation
(sent directly by a thesis advisor or a renowned mathematician in the
field), should be sent by 5 July 2013 to Sandra Wissler
<sandra.wissler@tugraz.at>

Applicants will be notified by 15 July 2013.

ORGANIZER:

Mihyun Kang (Graz University of Technology, Austria)

Further Information can be found at
http://www.math.tugraz.at/mathb/seminar/2013FallSchool-TUGraz.pdf
---------------------------------------------------------------------------------------------------

--
Univ.-Prof. Mihyun Kang
Technische Universitaet Graz
Institut fuer Optimierung und Diskrete Mathematik (Math B)
Steyrergasse 30, 8010 Graz, Austria

kang@math.tugraz.at
http://www.math.tugraz.at/~kang/
http://www.math.tugraz.at/mathb/

**********************************************************
*
* 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] New Book

I am sending the message again, now in the plain text format.

New Book

Cell Formation in Industrial Engineering:
Theory, Algorithms and Experiments

Series: Springer Optimization and Its Applications, Vol. 79

Goldengorin Boris, Krushinsky Dmitry, Pardalos Panos M.

2013, XIV, 206 p. 50 illus., 37 illus. in color.

http://www.springer.com/mathematics/computational+science+%26+engineering/
book/978-1-4614-8001-3#

First book to address the cell formation theory and its applications from
the perspective of a development of optimal, flexible, and efficient models
and algorithms for cell formation in group technology.
Addresses new methodologies to solve cell formation problems
Can be used as supplementary text at the graduate and post-graduate levels
in all fields of computational engineering.

This book focuses on a development of optimal, flexible, and efficient models
and algorithms for cell formation in group technology. Its main aim is to provide
a reliable tool that can be used by managers and engineers to design manufacturing
cells based on their own preferences and constraints imposed by a particular
manufacturing system. This tool could potentially lower production costs by
minimizing other costs in a number of areas, thereby increasing profit in a
manufacturing system.

In the volume, the cell formation problem is considered in a systematic and formalized
way, and several models are proposed, both heuristic and exact. The models are based
on general clustering problems, and are flexible enough to allow for various objectives
and constraints. The authors also provide results of numerical experiments involving
both artificial data from academic papers in the field and real manufacturing data to
certify the appropriateness of the models proposed.

The book was intended to suit the broadest possible audience, and thus all algorithmic
details are given in a detailed description with multiple numerical examples and informal
explanations are provided for the theoretical results. In addition to managers and
industrial engineers, this book is intended for academic researchers and students.
It will also be attractive to many theoreticians, since it addresses many open problems
in computer science and bioinformatics.
**********************************************************
*
* 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

Friday, May 31, 2013

Second Call For Papers: ISAAC 2013

Eighth International Workshop on Algorithms and Computation (WALCOM 2014), February 13-15, 2014, Indian Institute of Technology, Madras, Chennai, India

[DMANET] Call for Papers: ISAAC 2013

[DMANET] Summerschool: Order and Geometry (2nd announcement)

Thursday, May 30, 2013

>> Call for Participation - ICDCS 2013 (IEEE 33rd Intl. Conf. on Distributed Computing Systems) in Philadelphia, July 8-11, 2013 <<<

Wednesday, May 29, 2013

[DMANET] Two Positions for Research Associates at HSU Hamburg

[DMANET] IPEC 2013 Call for Papers (Parameterized and Exact Computation)

IPEC 2013 Call for Papers (Parameterized and Exact Computation)

[DMANET] PADABS2013, Deadline Extension

[DMANET] Call for work-in-progress (WIP) papers - SustainIT 2013 (deadline June 20)

[DMANET] RP'13 Extended Deadline: 10 June 2013

Tuesday, May 28, 2013

[DMANET] CfP: Special Section on Discrete Mathematics and Its Applications, The IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

[DMANET] Postdoc position

Monday, May 27, 2013

[DMANET] 4th Cargese Workshop on Combinatorial Optimization (Sep 30th - Oct 5th, 2013)

Friday, May 24, 2013

from Nisheeth Vishnoi: 33rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS)

Thursday, May 23, 2013

[DMANET] Call for Papers: ISAAC 2013

[DMANET] SAT 2013 early registration reminder

Wednesday, May 22, 2013

[DMANET] HEUREKA 2014 Call (in German)

[DMANET] PhD/Postdoc position in Theoretical Computer Science at University of Jena

Tuesday, May 21, 2013

[DMANET] 2nd Workshop on Optimization in Finance and Risk Management, September 23-24, Fields Institute, Toronto

[DMANET] 10 PhD + 1 postdoc position in "Discrete Optimization of Technical Systems under Uncertainty"

[DMANET] Fall School, 02-20 September 2013, TU Graz -- Call for participation

[DMANET] New Book

Mailing Lists

Search This Blog

Blog Archive

Friday, May 31, 2013

Thursday, May 30, 2013

Wednesday, May 29, 2013

Tuesday, May 28, 2013

Monday, May 27, 2013

Friday, May 24, 2013

Thursday, May 23, 2013

Wednesday, May 22, 2013

Tuesday, May 21, 2013

Mailing Lists

Subscribe To

Search This Blog

Blog Archive