Thursday, June 11, 2015

[DMANET] ISAAC 2015 - Final Call for Papers

ISAAC 2015

The 26th International Symposium on Algorithms and Computation

December 9-11, 2015, Nagoya, Japan


Submission deadline: June 19, 2015




The 26th International Symposium on Algorithms and Computation (ISAAC 2015)

will be held in Nagoya, Japan during December 9-11, 2015. 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

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


TOPICS OF INTEREST include (but are not limited to):


Algorithmic game theory

Algorithms and Data structures

Approximation algorithms

Combinatorial optimization

Computational biology

Computational complexity

Computational geometry


Experimental algorithms

Graph drawing and Graph algorithms

Internet algorithms

Online algorithms

Quantum computing

Randomized algorithms

Parallel and Distributed algorithms



Constantinos Daskalakis (MIT)
Ravindran Kannan (Microsoft Research India)
Thomas Rothvoss (University of Washington)



Conference Co-Chairs:

Tomio Hirata (Nagoya University, Japan)

Ken-ichi Kawarabayashi (NII, Japan)

Program Committee:

Sang Won Bae (Kyonggi U, Korea)

Mark de Berg (TU Eindhoven, the Netherlands)

Hubert Chan (HKU, Hong Kong)

Kai-Min Chung (Academia Sinica, Taiwan)

Adrian Dumitrescu (U Wisconsin-Milwaukee, USA)

Khaled Elbassioni (Masdar Institute, UAE, co-chair)

Amr Elmasry (Alexandria U, Egypt)

Xin Han (Dalian U Technology, China)

Seok-Hee Hong (U Sydney, Australia)

Tsan-Sheng Hsu (Academia Sinica, Taiwan)

Zhiyi Huang (HKU, Hong Kong)

Naonori Kakimura (U Tokyo, Japan)

Shuji Kijima (Kyushu U, Japan)

Tamas Kiraly (Eotvos U, Hungary)

Yusuke Kobayashi(U Tokyo, Japan)

Michal Koucky (Charles U, Czech Republic)

Michael Lampis (U Paris Dauphine, France)

Meena Mahajan (IMS, India)

Kazuhisa Makino (Kyoto U, Japan, co-chair)

Julian Mestre (U Sydney, Australia)

Danupon Nanongkai (KTH Royal Ins. Tech, Sweden)

Konstantinos Panagiotou (U. Munich, Germany)

Periklis Papakonstantinou (Tsinghua U, China)

Seth Pettie (U Michigan, USA)

Saurabh Ray (NYUAD, UAE)

Thomas Sauerwald (U Cambridge, UK)

Saket Saurabh (IMS, India)

Jeong Seop Sim (Inha U, Korea)

Rahul Shah (Louisiana State U, USA)

Rene Sitters (VU Amsterdam, the Netherlands)

Rob van Stee (U Leicester, UK)

Chaitanaya Swamy (U Waterloo, Canada)

Hing-Fung Ting (HKU, Hong Kong)

Yuichi Yoshida (NII, Japan)

Guochuan Zhang (Zhejiang U, China)



Submission due / June 19, 2015

Notification / August 31, 2015

Final version / September 21, 2015



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:

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

as a registered participant.



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.



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.



This conference is sponsored by Kayamori Foundation of Information Science
Advancement, Nagoya

University, Grant-in-Aid for Scientific Research on Innovative Areas
"Exploring the limits of

computation (ELC)", "JST ERATO Kawarabayashi Large Graph Project and "JST
CREST Foundations

of Innovative Algorithms for Big Data".

Additional details can be found in the conference web page:


Khaled Elbassioni,

Masdar Institute

* Contributions to be spread via DMANET are submitted to
* 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.