Differences
This shows you the differences between two versions of the page.
Both sides previous revisionPrevious revisionNext revision | Previous revisionNext revisionBoth sides next revision | ||
waac2019 [2019-09-23] – [Venue] Sewon Park | waac2019 [2019-10-04] – [October 4~5, 2019, KAIST, Daejeon, Republic of Korea] 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 ====== | ||
+ | |||
+ | {{ :: | ||
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:// | ||
===== Objectives ===== | ===== Objectives ===== | ||
- | The aim of this workshop is to provide a forum for researchers working on algorithms and the theory of computation, | + | The aim of this workshop is to provide a forum for researchers working on algorithms and the theory of computation, |
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:// | Prof. [[http:// | ||
+ | |||
+ | // | ||
+ | |||
+ | 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:// | Authors are invited to submit papers up to 8 pages in English via the [[https:// | ||
Line 43: | Line 55: | ||
Early registration: | Early registration: | ||
+ | |||
+ | German [[https:// | ||
Conference: October 4~5, 2019 | Conference: October 4~5, 2019 | ||
Line 63: | Line 77: | ||
The workshop takes place in | The workshop takes place in | ||
- | Chung Kunmo Conference Hall, 5th floor, Academic Cultural Complex (E9 Building), [[www.kaist.ac.kr | KAIST]] Main Campus, Daejeon | + | Chung Kunmo Conference Hall (정근모컨퍼런스홀), 5th floor, Academic Cultural Complex |
* 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:// | * See also the venue in [[https:// | ||
+ | |||
+ | 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. | ||
{{ : | {{ : | ||
Line 120: | Line 136: | ||
* 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 | + | * Hyunwoo Lee, Martin Ziegler, Willem Fouche, Donghyun Lim, Sewon Park and Matthias Schröder “Random Sampling |
* 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 132: | Line 148: | ||
* 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 144: | Line 159: | ||
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 |
11.00-11.30 //Coffee break// | 11.00-11.30 //Coffee break// | ||
Line 184: | Line 199: | ||
// | // | ||
- | 11.30-12.00 Hyunwoo Lee, Martin Ziegler, Willem Fouche, Donghyun Lim, Sewon Park and Matthias Schröder. //Randomized Computation | + | 11.30-12.00 Hyunwoo Lee, Martin Ziegler, Willem Fouche, Donghyun Lim, Sewon Park and Matthias Schröder. //Random Sampling |
12.00-12.30 Ivan Adrian Koswara, Gleb Pogudin, Svetlana Selivanova and Martin Ziegler. // | 12.00-12.30 Ivan Adrian Koswara, Gleb Pogudin, Svetlana Selivanova and Martin Ziegler. // | ||
Line 190: | Line 205: | ||
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:// |
- | * WAAC 2017: August 25–26, 2017, Seoul, Korea | + | * [[http:// |
- | * WAAC 2016: August 30-31, 2016, Hakodate, Japan | + | * [[http:// |
- | * WAAC 2015: August 21-22, 2015, Songdo Convensia, Incheon, Korea | + | * [[http:// |
- | * WAAC 2014: July 13-15, 2014, Okinawa Convention Center, Ginowan, Japan | + | * [[http:// |
- | * WAAC 2013: July 12-13, 2013, Kyonggi University, Suwon, Korea | + | * [[http:// |
- | * WAAC 2012: July 10-11, 2012, National Institute of Informatics, | + | * [[http:// |
* 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 207: | Line 221: | ||
* 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:// |
* 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:// |
* 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 |