Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revisionPrevious revision
Next revision
Previous revision
waac2019 [2019-09-19] – [Schedule] Svetlana Selivanovawaac2019 [2019-10-04] (current) – [List of Accepted Papers] Martin Ziegler
Line 1: Line 1:
 ====== The 22nd Korea-Japan Joint Workshop on Algorithms and Computation ====== ====== The 22nd Korea-Japan Joint Workshop on Algorithms and Computation ======
 +
 +{{ ::waac_logo.png?nolink&200|}}
  
 This annual workshop has a long tradition of scientific collaboration and academic friendship This annual workshop has a long tradition of scientific collaboration and academic friendship
Line 6: Line 8:
 ===== October 4~5, 2019, KAIST, Daejeon, Republic of Korea ===== ===== October 4~5, 2019, KAIST, Daejeon, Republic of Korea =====
  
 +{{http://kaist.theoryofcomputation.asia/_media/img_0016.jpg|http://kaist.theoryofcomputation.asia/_media/img_0016x.jpg}}
 ===== Objectives ===== ===== Objectives =====
-The aim of this workshop is to provide a forum for researchers working on algorithms and the theory of computation, to promote the exchange of recent results, to foster new collaborations among researchers. Historically, the workshop has established for the purpose of collaboration of researchers of Korea and Japan; however, participation from any country is welcome.+The aim of this workshop is to provide a forum for researchers working on algorithms and the theory of computation, to promote the exchange of recent results, to foster new collaborations among researchers. Historically, the workshop has been established for the purpose of collaboration of researchers of Korea and Japan; however, participation from any country is welcome.
  
 The workshop is organized by the Special Interest Group on Algorithms (SIGAL) of the Information Processing Society of Japan and the Special Interest Group on Theoretical Computer Science (SIGTCS) of the Korean Institute of Information Scientists and Engineers (KIISE). The workshop is organized by the Special Interest Group on Algorithms (SIGAL) of the Information Processing Society of Japan and the Special Interest Group on Theoretical Computer Science (SIGTCS) of the Korean Institute of Information Scientists and Engineers (KIISE).
Line 27: Line 30:
  
 Prof. [[http://www.tcs.mi.i.nagoya-u.ac.jp/~ono/index-e.html|Hirotaka Ono]], Nagoya University. Prof. [[http://www.tcs.mi.i.nagoya-u.ac.jp/~ono/index-e.html|Hirotaka Ono]], Nagoya University.
 +
 +//Algorithms  for Distance Constrained Labeling//
 +
 +Distance constrained labeling problems, e.g., L(p, q)-labeling and
 +(p, q)-total labeling, are concerned with labeling on vertices of graphs,
 +which are originally motivated by the frequency assignment. The upper bounds
 +on the labeling numbers and the time complexity of finding a minimum labeling
 +are intensively and extensively studied. In this talk, we introduce several
 +results on algorithms for distance constrained labeling problems.
 ===== Submission [Call for Papers] ===== ===== Submission [Call for Papers] =====
 Authors are invited to submit papers up to 8 pages in English via the [[https://easychair.org/conferences/?conf=waac2019|EasyChair submission system]] no later than <del>**August 26, 2019**</del> **August 31, 2019**. Authors are invited to submit papers up to 8 pages in English via the [[https://easychair.org/conferences/?conf=waac2019|EasyChair submission system]] no later than <del>**August 26, 2019**</del> **August 31, 2019**.
Line 43: Line 55:
  
 Early registration: September 20, 2019 Early registration: September 20, 2019
 +
 +German [[https://www.facebook.com/GermanEmbassySeoul/photos/pcb.2414451678669137/2414450672002571|Octoberfest in Korea]]: Oct 3-5, 2019
  
 Conference: October 4~5, 2019 Conference: October 4~5, 2019
Line 60: Line 74:
  
 ===== Venue ===== ===== Venue =====
-The workshop takes place in the Matrix Hall, 2nd floor [[https://kis.kaist.ac.kr/index.php?mid=KI_Building | KI Building]] (Building numberE4) on [[www.kaist.ac.kr | KAIST]]'s Main Campus in Daejeon.+**ImportantWorkshop venue has changed**:
  
 +The workshop takes place in 
 +Chung Kunmo Conference Hall (정근모컨퍼런스홀), 5th floor, Academic Cultural Complex (학술문화관) (E9 Building), [[www.kaist.ac.kr | KAIST]] Main Campus, Daejeon
  
   * Address: KAIST, 291 Daehak-ro, Yuseong-gu, Daejeon 34141, Republic of Korea   * Address: KAIST, 291 Daehak-ro, Yuseong-gu, Daejeon 34141, Republic of Korea
-  * See also the venue in [[https://goo.gl/maps/TNCCE6Qf8RrRBdaS8 | Google Map]]+  * See also the venue in [[https://goo.gl/maps/af4yqCYBKV1mL3nt7 | Google Map]]
  
-{{:ki_building.png?800|}}+It is the easiest to get to the conference hall when you enter the building from south and take an elevator to the 5th floor. 
 + 
 +{{ :waac2019_conf_hall.png?800 |}}
  
  
Line 116: Line 134:
  
 ===== List of Accepted Papers ===== ===== List of Accepted Papers =====
 +
 +{{ ::waac2019extendedabstracts.pdf |Extended Abstracts (password-protected)}}
  
   * Tetsuo Asano, Naoki Katoh and Takeshi Tokuyama “Near-unit distance embedding of points in the plane and space”   * Tetsuo Asano, Naoki Katoh and Takeshi Tokuyama “Near-unit distance embedding of points in the plane and space”
-  * Hyunwoo Lee, Martin Ziegler, Willem Fouche, Donghyun Lim, Sewon Park and Matthias Schröder “Randomized Computation of Continuous DataIs Brownian Motion Strongly Computable?”+  * Hyunwoo Lee, Martin Ziegler, Willem Fouche, Donghyun Lim, Sewon Park and Matthias Schröder “Random Sampling of Continuous ObjectsCan we Computably Generate Brownian Motions?”
   * Xinhu Lan, Aleksandar Shurbevski and Hiroshi Nagamochi “A Routing Problem in Warehouse Graphs”   * Xinhu Lan, Aleksandar Shurbevski and Hiroshi Nagamochi “A Routing Problem in Warehouse Graphs”
   * Ryota Yonekura, Hidefumi Hiraishi and Hiroshi Imai “BDD of Eulerian Subgraphs and Computation of the Ising Partition Function”   * Ryota Yonekura, Hidefumi Hiraishi and Hiroshi Imai “BDD of Eulerian Subgraphs and Computation of the Ising Partition Function”
Line 130: Line 150:
   * Holger Thies and Florian Steinberg “Computable analysis and verified exact real computation in Coq (Extended Abstract)”   * Holger Thies and Florian Steinberg “Computable analysis and verified exact real computation in Coq (Extended Abstract)”
   * Donghyun Lim “Solving the Game of Har-mo-ny by Heuristics”   * Donghyun Lim “Solving the Game of Har-mo-ny by Heuristics”
- 
  
  
Line 142: Line 161:
 9.50-10.00 Welcome address 9.50-10.00 Welcome address
  
-10.00-11.00 Invited talk: Hirotaka Ono (//Title: TBA//)+10.00-11.00 **Invited talk:** Hirotaka Ono//Algorithms  for Distance Constrained Labeling//
  
 11.00-11.30 //Coffee break// 11.00-11.30 //Coffee break//
Line 153: Line 172:
 12.30-14.00 //Lunch break// 12.30-14.00 //Lunch break//
  
-14.00-14.30 Tetsuo Asano, Naoki Katoh and Takeshi Tokuyama. //Near-unit distance embedding of points in the plane and space// +14.00-14.30 Tetsuo Asano, Naoki Katoh and Takeshi Tokuyama. //Near-unit distance embedding of points in the plane and space//
  
 14.30-15.00 Sung Gwan Park, Amihood Amir, Gad M. Landau and Kunsoo Park. //A New Generalized Matching Problem Based on Cartesian Trees// 14.30-15.00 Sung Gwan Park, Amihood Amir, Gad M. Landau and Kunsoo Park. //A New Generalized Matching Problem Based on Cartesian Trees//
  
-15.00-15.30 Yusuke Sawada, Yonghwan Kim and Yoshiaki Katayama. //A Self-optimizing Three Nodes Routing Algorithm based on local information in Virtual Grid Networks//+15.00-15.30   Yusuke Sawada, Yonghwan Kim and Yoshiaki Katayama. //A Self-optimizing Three Nodes Routing Algorithm based on local information in Virtual Grid Networks// 
  
 15.30-16.00 //Coffee break 15.30-16.00 //Coffee break
Line 182: Line 201:
 // //
  
-11.30-12.00 Hyunwoo Lee, Martin Ziegler, Willem Fouche, Donghyun Lim, Sewon Park and Matthias Schröder. //Randomized Computation of Continuous DataIs Brownian Motion Strongly Computable?//+11.30-12.00 Hyunwoo Lee, Martin Ziegler, Willem Fouche, Donghyun Lim, Sewon Park and Matthias Schröder. //Random Sampling of Continuous ObjectsCan we Computably Generate Brownian Motions?//
  
 12.00-12.30 Ivan Adrian Koswara, Gleb Pogudin, Svetlana Selivanova and Martin Ziegler. //Computational Complexity of Real Matrix Powering 12.00-12.30 Ivan Adrian Koswara, Gleb Pogudin, Svetlana Selivanova and Martin Ziegler. //Computational Complexity of Real Matrix Powering
Line 188: Line 207:
  
 12.30 Conference closing 12.30 Conference closing
- 
 ===== Contact ===== ===== Contact =====
 E-mail: waac2019@theoryofcomputation.asia E-mail: waac2019@theoryofcomputation.asia
  
 ===== Previous WAACs ===== ===== Previous WAACs =====
-  * WAAC 2018: August 26–27, 2018, Fukuoka, Japan +  * [[http://www.fc.inf.kyushu-u.ac.jp/waac2018/|WAAC 2018]]: August 26–27, 2018, Fukuoka, Japan 
-  * WAAC 2017: August 25–26, 2017, Seoul, Korea +  * [[http://isa.hanyang.ac.kr/waac2017.html|WAAC 2017]]: August 25–26, 2017, Seoul, Korea 
-  * WAAC 2016: August 30-31, 2016, Hakodate, Japan +  * [[http://dopal.cs.uec.ac.jp/waac16/index.html|WAAC 2016]]: August 30-31, 2016, Hakodate, Japan 
-  * WAAC 2015: August 21-22, 2015, Songdo Convensia, Incheon, Korea +  * [[http://waac-15.appspot.com/index.html|WAAC 2015]]: August 21-22, 2015, Songdo Convensia, Incheon, Korea 
-  * WAAC 2014: July 13-15, 2014, Okinawa Convention Center, Ginowan, Japan +  * [[http://dopal.cs.uec.ac.jp/waac14/|WAAC 2014]]: July 13-15, 2014, Okinawa Convention Center, Ginowan, Japan 
-  * WAAC 2013: July 12-13, 2013, Kyonggi University, Suwon, Korea +  * [[http://waac13.appspot.com/|WAAC 2013]]: July 12-13, 2013, Kyonggi University, Suwon, Korea 
-  * WAAC 2012: July 10-11, 2012, National Institute of Informatics, Tokyo, Japan+  * [[http://research.nii.ac.jp/~uno/WAAC2012/|WAAC 2012]]: July 10-11, 2012, National Institute of Informatics, Tokyo, Japan
   * WAAC 2011: July 8-9, 2011, Hanwha Resort, Busan, Korea   * WAAC 2011: July 8-9, 2011, Hanwha Resort, Busan, Korea
   * WAAC 2010: July 23-24, 2010, Kanazawa Culture Hall, Kanazawa, Ishikawa, Japan   * WAAC 2010: July 23-24, 2010, Kanazawa Culture Hall, Kanazawa, Ishikawa, Japan
Line 205: Line 223:
   * WAAC 2008: July 19-20, 2008, Fukuoka, Japan   * WAAC 2008: July 19-20, 2008, Fukuoka, Japan
   * WAAC 2007: August 9-10, 2007, at Chonnam National University, Gwangju, Korea   * WAAC 2007: August 9-10, 2007, at Chonnam National University, Gwangju, Korea
-  * WAAC 2006: July 4-5, 2006, at Hokkaido University, Sapporo, Japan+  * [[http://www-or.amp.i.kyoto-u.ac.jp/waac06/|WAAC 2006]]: July 4-5, 2006, at Hokkaido University, Sapporo, Japan
   * WAAC 2005: August 12-13, 2005, at Ewha Womans University, Seoul, Korea   * WAAC 2005: August 12-13, 2005, at Ewha Womans University, Seoul, Korea
-  * WAAC 2003: July 3-4, 2003, at Sendai City Information & Industry Plaza, Sendai, Japan+  * [[http://www.dais.is.tohoku.ac.jp/~shioura/meeting/waac03/|WAAC 2003]]: July 3-4, 2003, at Sendai City Information & Industry Plaza, Sendai, Japan
   * WAAC 2001: June 28-29, 2001, at Pusan National University, Pusan, Korea   * WAAC 2001: June 28-29, 2001, at Pusan National University, Pusan, Korea
   * WAAC 2000: July 21-22, 2000, at University of Tokyo, Tokyo, Japan   * WAAC 2000: July 21-22, 2000, at University of Tokyo, Tokyo, Japan