{"id":22,"date":"2018-02-12T16:40:57","date_gmt":"2018-02-12T08:40:57","guid":{"rendered":"http:\/\/140.114.54.13\/isaac2018\/?page_id=22"},"modified":"2018-12-08T00:51:43","modified_gmt":"2018-12-07T16:51:43","slug":"program","status":"publish","type":"page","link":"https:\/\/isaac2018.ee.ntu.edu.tw\/index.php\/program\/","title":{"rendered":"Program"},"content":{"rendered":"
Workshop on Frontiers of Combinatorial Optimization & Geometric Computing<\/strong><\/h5>\n
at Hotel Royal Chiaohsi<\/strong><\/h5>\n

 <\/p>\n

\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0Sunday, December 16, 2018<\/strong><\/h5>\n\n\n\n\n\n\n\n\n\n\n\n\n
09:00 – 09:30<\/td>\nRegistration<\/b><\/td>\n<\/tr>\n
09:30 – 10:30<\/td>\nKurt Mehlhorn (Max Planck, Germany)<\/b>
\nReflections on the Interplay of Theory and Practice<\/em><\/td>\n<\/tr>\n
10:30 – 11:00<\/td>\nCoffee\/Tea Break<\/b><\/td>\n<\/tr>\n
11:00 – 12:00<\/td>\nTetsuo Asano (JAIST, Japan)<\/b>
\nThree unsolved problems<\/em>\n<\/td>\n<\/tr>\n
12:00 – 14:00<\/td>\nLunch<\/b><\/td>\n<\/tr>\n
14:00 – 15:00<\/td>\nRobert E. Tarjan (Princeton University, USA)<\/b>
\nConcurrent Connected Components<\/em>\n<\/td>\n<\/tr>\n
15:00 – 15:30<\/td>\nCoffee\/Tea Break<\/b><\/td>\n<\/tr>\n
15:30 – 16:30<\/td>\nJ. Ian Munro (University of Waterloo, Canada)<\/b>
\nFast Stable Sorting, Adapting to Existing Runs<\/em>\n<\/td>\n<\/tr>\n
16:30 – 17:30<\/td>\nPanel Discussion
\nChair: D.T. Lee (Academia Sinica, Taiwan)<\/b>\n<\/td>\n<\/tr>\n
18:00 – 20:00<\/td>\nWelcome Reception of ISAAC 2018<\/b>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

 <\/p>\n

The 29th International Symposium on Algorithms and Computation (ISAAC 2018)<\/strong><\/h5>\n
at Hotel Royal Chiaohsi<\/strong><\/h5>\n

 <\/p>\n

\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0Monday, December 17, 2018<\/strong><\/h5>\n\n\n\n\n\n\n\n\n\n\n
08:30 – 09:00<\/td>\nRegistration<\/b><\/td>\n<\/tr>\n
09:00 – 10:00<\/td>\nKeynote Speech: Shang-Hua Teng (University of Southern California)<\/b>
\nGoing Beyond Traditional Characterizations in the Age of Big Data and Network Sciences<\/em><\/td>\n<\/tr>\n
10:00 – 10:20<\/td>\nCoffee\/Tea Break<\/b>\n<\/td>\n<\/tr>\n
10:20 – 12:00<\/td>\nSession 1A | Session 1B<\/b>\n<\/td>\n<\/tr>\n
12:00 – 13:30<\/td>\nLunch<\/b>\n<\/td>\n<\/tr>\n
13:30 – 15:10<\/td>\nSession 2A | Session 2B<\/b><\/td>\n<\/tr>\n
15:10 – 15:40<\/td>\nCoffee\/Tea Break<\/b>\n<\/td>\n<\/tr>\n
15:40 – 17:20<\/td>\nSession 3A | Session 3B<\/b><\/td>\n<\/tr>\n

\n<\/tbody>\n\n\n<\/table>\n\n\n \n\n\n

\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0Tuesday, December 18, 2018<\/strong><\/h5>\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n
08:30 - 09:00<\/td>\n\n\n\n\nRegistration<\/b><\/td>\n\n\n<\/tr>\n\n\n\n\n
09:00 - 10:00<\/td>\n\n\n\n\nKeynote Speech: Clifford Stein (Columbia University)<\/b><\/br>\nApproximate Matchings in Massive Graphs via Local Structure<\/em><\/td>\n\n\n<\/tr>\n\n\n\n\n
10:00 - 10:20<\/td>\n\n\n\n\nCoffee\/Tea Break<\/b>\n<\/td>\n\n\n<\/tr>\n\n\n\n\n
10:20 - 12:00<\/td>\n\n\n\n\nSession 4A | Session 4B<\/b>\n<\/td>\n\n\n<\/tr>\n\n\n\n\n
12:00 - 13:30<\/td>\n\n\n\n\nLunch<\/b><\/td>\n\n\n<\/tr>\n\n\n\n\n
13:30 - 15:10<\/td>\n\n\n\n\nSession 5A | Session 5B<\/b><\/td>\n\n\n<\/tr>\n\n\n\n\n
15:10 - 15:40<\/td>\n\n\n\n\nCoffee\/Tea Break<\/b>\n<\/td>\n\n\n<\/tr>\n\n\n\n\n
15:40 - 16:55<\/td>\n\n\n\n\nSession 6A | Session 6B<\/b><\/td>\n\n\n<\/tr>\n\n\n\n\n
17:00 - 18:00<\/td>\n\n\n\n\nThe Open Problem Session<\/br>\nCo-Chairs: S\u00e1ndor Fekete and Luca Trevisan<\/b><\/td>\n\n\n<\/tr>\n\n\n\n\n
18:30 - 21:00<\/td>\n\n\n\n\nConference Banquet<\/b>\n<\/td>\n\n\n<\/tr>\n\n\n<\/tbody>\n\n\n<\/table>\n\n\n \n\n\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0Wednesday, December 19, 2018<\/strong><\/h5>\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n
08:30 - 09:00<\/td>\n\n\n\n\nRegistration<\/b><\/td>\n\n\n<\/tr>\n\n\n\n\n
09:00 - 09:30<\/td>\n\n\n\n\nBest Paper Award Presentation<\/b><\/td>\n\n\n<\/tr>\n\n\n\n\n
09:30 - 10:00<\/td>\n\n\n\n\nBest Student Paper Award Presentation<\/b>\n<\/td>\n\n\n<\/tr>\n\n\n\n\n
10:00 - 10:20<\/td>\n\n\n\n\nCoffee\/Tea Break<\/b>\n<\/td>\n\n\n<\/tr>\n\n\n\n\n
10:20 - 12:00<\/td>\n\n\n\n\nSession 7A | Session 7B<\/b>\n<\/td>\n\n\n<\/tr>\n\n\n\n\n
12:00 - 13:30<\/td>\n\n\n\n\nLunch<\/b><\/td>\n\n\n<\/tr>\n\n\n\n\n
13:30 - 15:10<\/td>\n\n\n\n\nSession 8A | Session 8B<\/b><\/td>\n\n\n<\/tr>\n\n\n\n\n
15:10 - 15:40<\/td>\n\n\n\n\nCoffee\/Tea Break<\/b>\n<\/td>\n\n\n<\/tr>\n\n\n\n\n
15:40 - 17:20<\/td>\n\n\n\n\nSession 9A | Session 9B<\/b><\/td>\n\n\n<\/tr>\n\n\n\n\n
17:20 - 17:30<\/td>\n\n\n\n\nClosing<\/b><\/td>\n\n\n<\/tr>\n\n\n<\/tbody>\n\n\n<\/table>\n\n\n \n\n\n\n
Session 1A [Graph Algorithms]<\/strong><\/h6>\n\n\n\n\n
    \n\n\n
  • \n\n\n
    Tereza Klimo\u0161ov\u00e1, Josef Mal\u00edk, Tom\u00e1\u0161 Masa\u0159\u00edk, Jana Novotn\u00e1, Dani\u00ebl Paulusma, and Veronika Sl\u00edvov\u00e1. Colouring (P_r + P_s )-Free Graphs<\/em><\/strong><\/h6>\n\n\n<\/li>\n\n\n\n\n
  • \n\n\n
    Guillaume Ducoffe and Alexandru Popa. The use of a pruned modular decomposition for Maximum Matching algorithms on some graph classes<\/em><\/strong><\/h6>\n\n\n<\/li>\n\n\n\n\n
  • \n\n\n
    Davide Bil\u00f2 and Kleitos Papadopoulos. A Novel Algorithm for the All-Best-Swap-Edge Problem on Tree Spanners<\/em><\/strong><\/h6>\n\n\n<\/li>\n\n\n\n\n
  • \n\n\n
    Kazuhiro Kurita, Kunihiro Wasa, Hiroki Arimura and Takeaki Uno. Efficient Enumeration of Dominating Sets for Sparse Graphs<\/em><\/strong><\/h6>\n\n\n<\/li>\n\n\n<\/ul>\n\n\n\n\n\n
    Session 1B [Complexity]<\/strong><\/h6>\n\n\n\n\n
      \n\n\n
    • \n\n\n
      Md Lutfar Rahman and Thomas Watson. Complexity of Unordered CNF Games<\/em><\/strong><\/h6>\n\n\n<\/li>\n\n\n\n\n
    • \n\n\n
      Kenneth Hoover, Russell Impagliazzo, Ivan Mikhailin, and Alexander Smal. Half-duplex communication complexity<\/em><\/strong><\/h6>\n\n\n<\/li>\n\n\n\n\n
    • \n\n\n
      Takashi Ishizuka and Naoyuki Kamiyama. On the Complexity of Stable Fractional Hypergraph Matching<\/em><\/strong><\/h6>\n\n\n<\/li>\n\n\n\n\n
    • \n\n\n
      Matthew P. Johnson. Deciding the Closure of Inconsistent Rooted Triples is NP-Complete<\/em><\/strong><\/h6>\n\n\n<\/li>\n\n\n<\/ul>\n\n\n\n\n\n
      Session 2A [Graph Algorithms]<\/strong><\/h6>\n\n\n\n\n
        \n\n\n
      • \n\n\n
        Johanna E. Prei\u00dfer and Jens M. Schmidt. Computing Vertex-Disjoint Paths in Large Graphs using MAOs<\/em><\/strong><\/h6>\n\n\n<\/li>\n\n\n\n\n
      • \n\n\n
        Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, and Naoki Katoh. An $O(n^2\\log^2 n)$ Time Algorithm for Minmax Regret Minsum Sink on Path Networks<\/em><\/strong><\/h6>\n\n\n<\/li>\n\n\n\n\n
      • \n\n\n
        Delia Garijo, Alberto Marquez, Natalia Rodr\u00edguez, and Rodrigo Silveira. Computing optimal shortcuts for networks<\/em><\/strong><\/h6>\n\n\n<\/li>\n\n\n\n\n
      • \n\n\n
        Georgia Avarikioti, Yuyi Wang, and Roger Wattenhofer. Algorithmic Channel Design<\/em><\/strong><\/h6>\n\n\n<\/li>\n\n\n<\/ul>\n\n\n\n\n\n
        Session 2B [Fixed Parameter Tractable algorithms]<\/strong><\/h6>\n\n\n\n\n
          \n\n\n
        • \n\n\n
          Andreas Bj\u00f6rklund, Thore Husfeldt, Petteri Kaski, and Mikko Koivisto. Counting connected subgraphs with maximum-degree-aware sieving<\/em><\/strong><\/h6>\n\n\n<\/li>\n\n\n\n\n
        • \n\n\n
          Pavel Dvo\u0159\u00e1k, Du\u0161an Knop, and Tom\u00e1\u0161 Toufar. Target Set Selection in Dense Graph Classes<\/em><\/strong><\/h6>\n\n\n<\/li>\n\n\n\n\n
        • \n\n\n
          Andreas Bj\u00f6rklund and Thore Husfeldt. Counting Shortest Two Disjoint Paths in Cubic Planar Graphs with an NC Algorithm<\/em><\/strong><\/h6>\n\n\n<\/li>\n\n\n\n\n
        • \n\n\n
          Eun Jung Kim, Maria Serna, and Dimitrios Thilikos. Data-compression for Parametrized Counting Problems on Sparse graphs<\/em><\/strong><\/h6>\n\n\n<\/li>\n\n\n<\/ul>\n\n\n\n\n\n
          Session 3A [Parallel and distributed algorithms]<\/strong><\/h6>\n\n\n\n\n
            \n\n\n
          • \n\n\n
            Samir Datta, Raghav Kulkarni, Ashish Kumar, and Anish Mukherjee. Planar Maximum Matching: Towards a Parallel Algorithm<\/em><\/strong><\/h6>\n\n\n<\/li>\n\n\n\n\n
          • \n\n\n
            Andrzej Czygrinow, Wojciech Wawrzyniak, Marcin Witkowski, and Michal Hanckowiak. Distributed approximation algorithms for the Minimum Dominating Set in $K_h$-minor-free graphs<\/em><\/strong><\/h6>\n\n\n<\/li>\n\n\n\n\n
          • \n\n\n
            Cody Geary, Pierre-\u00e9tienne Meunier, Nicolas Schabanel, and Shinnosuke Seki. Proving the Turing Universality of Oritatami Co-Transcriptional Folding<\/em><\/strong><\/h6>\n\n\n<\/li>\n\n\n<\/ul>\n\n\n\n\n\n
            Session 3B [Fixed Parameter Tractable algorithms]<\/strong><\/h6>\n\n\n\n\n
              \n\n\n
            • \n\n\n
              Jiehua Chen, Hendrik Molter, Manuel Sorge, and Ondrej Suchy. Cluster Editing in Multi-Layer and Temporal Graphs<\/em><\/strong><\/h6>\n\n\n<\/li>\n\n\n\n\n
            • \n\n\n
              Arijit Bishnu, Arijit Ghosh, Sudeshna Kolay, Gopinath Mishra, and Saket Saurabh. Parameterized Query Complexity of Hitting Set using Stability of Sunflowers<\/em><\/strong><\/h6>\n\n\n<\/li>\n\n\n\n\n
            • \n\n\n
              Pankaj Agarwal, Haim Kaplan, Geva Kipper, Wolfgang Mulzer, G\u00fcnter Rote, Micha Sharir, and Allen Xiao. Approximate Minimum-Weight Partial Matching under Translation<\/em><\/strong><\/h6>\n\n\n<\/li>\n\n\n\n\n
            • \n\n\n
              Tatsuya Akutsu, Jesper Jansson, Ruiming Li, Atsuhiro Takasu, and Takeyuki Tamura. New and Improved Algorithms for Unordered Tree Inclusion<\/em><\/strong><\/h6>\n\n\n<\/li>\n\n\n<\/ul>\n\n\n\n\n\n
              Session 4A [Graph theory]<\/strong><\/h6>\n\n\n\n\n
                \n\n\n
              • \n\n\n
                Patrizio Angelini, Michael Bekos, Michael Kaufmann, Maximilian Pfister, and Torsten Ueckerdt. Beyond-Planarity: Tur\u00e1n-type Results for Non-Planar Bipartite Graphs<\/em><\/strong><\/h6>\n\n\n<\/li>\n\n\n\n\n
              • \n\n\n
                Yen-Ting Chen, Meng-Tsung Tsai, and Shi-Chun Tsai. A Dichotomy Result for Cyclic-Order Traversing Games<\/em><\/strong><\/h6>\n\n\n<\/li>\n\n\n\n\n
              • \n\n\n
                Guillaume Ducoffe and Alexandru Popa. The b-Matching problem in distance-hereditary graphs and beyond<\/em><\/strong><\/h6>\n\n\n<\/li>\n\n\n\n\n
              • \n\n\n
                Qilong Feng, Guanlan Tan, Senmin Zhu, Jianxin Wang, and Bin Fu. New Algorithms for Edge Induced K\\\"{o}nig-Egerv\\'{a}ry Subgraph Based on Gallai-Edmonds Decomposition<\/em><\/strong><\/h6>\n\n\n<\/li>\n\n\n<\/ul>\n\n\n\n\n\n
                Session 4B [Combinatorial Optimization]<\/strong><\/h6>\n\n\n\n\n
                  \n\n\n
                • \n\n\n
                  Michael Matheny and Jeff Phillips. Computing Approximate Statistical Discrepancy<\/em><\/strong><\/h6>\n\n\n<\/li>\n\n\n\n\n
                • \n\n\n
                  Alfonso Cevallos, Friedrich Eisenbrand, and Sarah Maria Morell. Diversity maximization in doubling metrics<\/em><\/strong><\/h6>\n\n\n<\/li>\n\n\n\n\n
                • \n\n\n
                  Nader Bshouty and Waseem Makhoul. On Polynomial time Constructions of Minimum Height Decision Tree<\/em><\/strong><\/h6>\n\n\n<\/li>\n\n\n\n\n
                • \n\n\n
                  Priyanka Mukhopadhyay and Divesh Aggarwal. Improved algorithms for the Shortest Vector Problem and the Closest Vector Problem in the infinity norm<\/em><\/strong><\/h6>\n\n\n<\/li>\n\n\n<\/ul>\n\n\n\n\n\n
                  Session 5A [Graph theory and Drawing]<\/strong><\/h6>\n\n\n\n\n
                    \n\n\n
                  • \n\n\n
                    Matthias Bentert, Alexander Dittmann, Leon Kellerhals, Andr\u00e9 Nichterlein, and Rolf Niedermeier. An Adaptive Version of Brandes' Algorithm for Betweenness Centrality<\/em><\/strong><\/h6>\n\n\n<\/li>\n\n\n\n\n
                  • \n\n\n
                    Hiroki Osawa, Akira Suzuki, Takehiro Ito, and Xiao Zhou. Algorithms for Coloring Reconfiguration under Recolorability Constraints<\/em><\/strong><\/h6>\n\n\n<\/li>\n\n\n\n\n
                  • \n\n\n
                    On-Hei Solomon Lo and Jens M. Schmidt. A Cut Tree Representation for Pendant Pairs<\/em><\/strong><\/h6>\n\n\n<\/li>\n\n\n\n\n
                  • \n\n\n
                    Emilio Di Giacomo, Peter Eades, Giuseppe Liotta, Henk Meijer, and Fabrizio Montecchiani. Polyline Drawings with Topological Constraints<\/em><\/strong><\/h6>\n\n\n<\/li>\n\n\n<\/ul>\n\n\n\n\n\n
                    Session 5B [Approximation Algorithms]<\/strong><\/h6>\n\n\n\n\n
                      \n\n\n
                    • \n\n\n
                      Davide Bil\u00f2. Almost optimal algorithms for diameter-optimally augmenting trees<\/em><\/strong><\/h6>\n\n\n<\/li>\n\n\n\n\n
                    • \n\n\n
                      Giordano Da Lozzo and Ignaz Rutter. Approximation Algorithms for Facial Cycles in Planar Embeddings<\/em><\/strong><\/h6>\n\n\n<\/li>\n\n\n\n\n
                    • \n\n\n
                      Adam Kunysz. An Algorithm for the Maximum Weight Strongly Stable Matching Problem<\/em><\/strong><\/h6>\n\n\n<\/li>\n\n\n\n\n
                    • \n\n\n
                      Eunpyeong Hong and Mong-Jen Kao. Approximation Algorithm for Vertex Cover with Submodular-Type Covering Constraints<\/em><\/strong><\/h6>\n\n\n<\/li>\n\n\n<\/ul>\n\n\n\n\n\n
                      Session 6A [Combinatorial Optimization]<\/strong><\/h6>\n\n\n\n\n
                        \n\n\n
                      • \n\n\n
                        David Gleich, Nate Veldt, and Anthony Wirth. Correlation Clustering Generalized<\/em><\/strong><\/h6>\n\n\n<\/li>\n\n\n\n\n
                      • \n\n\n
                        Annette Ficker, Thomas Erlebach, Matus Mihalak, and Frits Spieksma. Partitioning Vectors into Quadruples: Worst-Case Analysis of a Matching-Based Algorithm<\/em><\/strong><\/h6>\n\n\n<\/li>\n\n\n\n\n
                      • \n\n\n
                        Johannes Bl\u00f6mer, Sascha Brauer, and Kathrin Bujna. Coresets for Fuzzy K-Means with Applications<\/em><\/strong><\/h6>\n\n\n<\/li>\n\n\n<\/ul>\n\n\n\n\n\n
                        Session 6B [Online Algorithms]<\/strong><\/h6>\n\n\n\n\n
                          \n\n\n
                        • \n\n\n
                          Martin Farach-Colton, Meng Li, and Meng-Tsung Tsai. Streaming Algorithms for Planar Convex Hulls<\/em><\/strong><\/h6>\n\n\n<\/li>\n\n\n\n\n
                        • \n\n\n
                          S\u00e9bastien Bouchard, Yoann Dieudonne, Andrzej Pelc, and Franck Petit. Deterministic Treasure Hunt in the Plane with Angular Hints<\/em><\/strong><\/h6>\n\n\n<\/li>\n\n\n\n\n
                        • \n\n\n
                          Quirijn Bouts, Thom Castermans, Arthur van Goethem, Marc van Kreveld, and Wouter Meulemans. Competitive Searching for a Line on a Line Arrangement<\/em><\/strong><\/h6>\n\n\n<\/li>\n\n\n<\/ul>\n\n\n\n\n\n
                          Best Paper Award<\/strong><\/h6>\n\n\n\n\n
                            \n\n\n
                          • \n\n\n
                            Andreas Bj\u00f6rklund. Exploiting Sparseness for Bipartite Hamiltonicity<\/em><\/strong><\/h6>\n\n\n<\/li>\n\n\n<\/ul>\n\n\n\n\n\n
                            Best Student Paper Award<\/strong><\/h6>\n\n\n\n\n
                              \n\n\n
                            • \n\n\n
                              Ahad N. Zehmakan. Opinion Forming in Erd\u0151s\u2013R\u00e9nyi Random Graph and Expanders<\/em><\/strong><\/h6>\n\n\n<\/li>\n\n\n<\/ul>\n\n\n\n\n\n
                              Session 7A [Computational Geometry]<\/strong><\/h6>\n\n\n\n\n
                                \n\n\n
                              • \n\n\n
                                Sariel Har-Peled, Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir, and Max Willert. Stabbing Pairwise Intersecting Disks by Five Points<\/em><\/strong><\/h6>\n\n\n<\/li>\n\n\n\n\n
                              • \n\n\n
                                Eunjin Oh. Point Location in Incremental Planar Subdivisions<\/em><\/strong><\/h6>\n\n\n<\/li>\n\n\n\n\n
                              • \n\n\n
                                Vahideh Keikha, Mees van de Kerkhof, Marc Van Kreveld, Irina Kostitsyna, Maarten L\u00f6ffler, Frank Staals, J\u00e9r\u00f4me Urhausen, Jordi L. Vermeulen, and Lionov Wiratma. Convex partial transversals of planar regions<\/em><\/strong><\/h6>\n\n\n<\/li>\n\n\n\n\n
                              • \n\n\n
                                Patrick Schnider and Alexander Pilz. Extending the centerpoint theorem to multiple points<\/em><\/strong><\/h6>\n\n\n<\/li>\n\n\n<\/ul>\n\n\n\n\n\n
                                Session 7B [Data Structures]<\/strong><\/h6>\n\n\n\n\n
                                  \n\n\n
                                • \n\n\n
                                  Ran Ben Basat, Seungbum Jo, Srinivasa Rao Satti, and Shubham Ugare. Approximate Query Processing over Static Sets and Sliding Windows<\/em><\/strong><\/h6>\n\n\n<\/li>\n\n\n\n\n
                                • \n\n\n
                                  Parinya Chalermsook, Mayank Goswami, Laszlo Kozma, Kurt Mehlhorn, and Thatchaphol Saranurak. Multi-finger binary search trees<\/em><\/strong><\/h6>\n\n\n<\/li>\n\n\n\n\n
                                • \n\n\n
                                  Ivona Bezakova and Andrew Searns. On Counting Oracles for Path Problems<\/em><\/strong><\/h6>\n\n\n<\/li>\n\n\n\n\n
                                • \n\n\n
                                  Hiroshi Hirai and Yuni Iwamasa. Reconstructing phylogenetic tree from multipartite quartet system<\/em><\/strong><\/h6>\n\n\n<\/li>\n\n\n<\/ul>\n\n\n\n\n\n
                                  Session 8A [Computational Geometry]<\/strong><\/h6>\n\n\n\n\n
                                    \n\n\n
                                  • \n\n\n
                                    Elena Arseneva, Man Kwun Chiu, Matias Korman, Aleksandar Markovic, Yoshio Okamoto, Aur\u00e9lien Ooms, Andr\u00e9 van Renssen, and Marcel Roeloffzen. Rectilinear Link Diameter and Radius in a Rectilinear Polygonal Domain<\/em><\/strong><\/h6>\n\n\n<\/li>\n\n\n\n\n
                                  • \n\n\n
                                    Eunjin Oh. Minimizing Distance-to-Sight in Polygonal Domains<\/em><\/strong><\/h6>\n\n\n<\/li>\n\n\n\n\n
                                  • \n\n\n
                                    Franz Aurenhammer, Michael Steinkogler, and Rolf Klein. Partially Walking a Polygon<\/em><\/strong><\/h6>\n\n\n<\/li>\n\n\n\n\n
                                  • \n\n\n
                                    Timothy Chan, Thomas C. Van Dijk, Krzysztof Fleszar, Joachim Spoerhase, and Alexander Wolff. Stabbing Rectangles by Line Segments \u2013 How Decomposition Reduces the Shallow-Cell Complexity<\/em><\/strong><\/h6>\n\n\n<\/li>\n\n\n<\/ul>\n\n\n\n\n\n
                                    Session 8B [Online Algorithms]<\/strong><\/h6>\n\n\n\n\n
                                      \n\n\n
                                    • \n\n\n
                                      Xingwu Liu, Zhida Pan, Yuyi Wang, and Roger Wattenhofer. Impatient Online Matching<\/em><\/strong><\/h6>\n\n\n<\/li>\n\n\n\n\n
                                    • \n\n\n
                                      Siu-Wing Cheng and Lie Yan. Extensions of Self-Improving Sorters<\/em><\/strong><\/h6>\n\n\n<\/li>\n\n\n\n\n
                                    • \n\n\n
                                      Kelin Luo, Thomas Erlebach, and Yinfeng Xu. Online Scheduling of Car-Sharing Requests between Two Locations with Many Cars and Flexible Advance Bookings<\/em><\/strong><\/h6>\n\n\n<\/li>\n\n\n\n\n
                                    • \n\n\n
                                      Martin Hoefer and Lisa Wilhelmi. Packing Returning Secretaries<\/em><\/strong><\/h6>\n\n\n<\/li>\n\n\n<\/ul>\n\n\n\n\n\n
                                      Session 9A [Data Structures]<\/strong><\/h6>\n\n\n\n\n
                                        \n\n\n
                                      • \n\n\n
                                        Frank Kammer and Andrej Sajenko. A Space-Optimal c-Color Choice Dictionary<\/em><\/strong><\/h6>\n\n\n<\/li>\n\n\n\n\n
                                      • \n\n\n
                                        Ian Munro and Kaiyu Wu. Succinct Data Structures for Chordal Graphs<\/em><\/strong><\/h6>\n\n\n<\/li>\n\n\n\n\n
                                      • \n\n\n
                                        Travis Gagie, Meng He, and Gonzalo Navarro. Tree Path Majority Data Structures<\/em><\/strong><\/h6>\n\n\n<\/li>\n\n\n\n\n
                                      • \n\n\n
                                        Seungbum Jo and Srinivasa Rao Satti. Encoding two-dimensional range top-k queries revisited<\/em><\/strong><\/h6>\n\n\n<\/li>\n\n\n<\/ul>\n\n\n\n\n\n
                                        Session 9B [Approximation Algorithms]<\/strong><\/h6>\n\n\n\n\n
                                          \n\n\n
                                        • \n\n\n
                                          Tomasz Kociumaka, Ritu Kundu, Manal Mohamed, and Solon Pissis. Longest Unbordered Factor in Quasilinear Time<\/em><\/strong><\/h6>\n\n\n<\/li>\n\n\n\n\n
                                        • \n\n\n
                                          Jian-Jia Chen, Nikhil Bansal, Samarjit Chakraborty, and Georg von der Br\u00fcggen. Packing Sporadic Real-Time Tasks on Identical Multiprocessor Systems<\/em><\/strong><\/h6>\n\n\n<\/li>\n\n\n\n\n
                                        • \n\n\n
                                          Galia Shabtai, Dan Raz, and Yuval Shavitt. A relaxed FPTAS for Chance-Constrained Knapsack<\/em><\/strong><\/h6>\n\n\n<\/li>\n\n\n\n\n
                                        • \n\n\n
                                          Dimitris Fotakis, Laurent Gourves, Claire Mathieu, and Abhinav Srivastav. Covering Clients with Types and Budgets<\/em><\/strong><\/h6>\n\n\n<\/li>\n\n\n<\/ul>\n\n\n<\/p>\n","protected":false},"excerpt":{"rendered":"

                                          Workshop on Frontiers of Combinatorial Optimization &#0 […]<\/p>\n","protected":false},"author":1,"featured_media":0,"parent":0,"menu_order":5,"comment_status":"closed","ping_status":"closed","template":"","meta":[],"_links":{"self":[{"href":"https:\/\/isaac2018.ee.ntu.edu.tw\/index.php\/wp-json\/wp\/v2\/pages\/22"}],"collection":[{"href":"https:\/\/isaac2018.ee.ntu.edu.tw\/index.php\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/isaac2018.ee.ntu.edu.tw\/index.php\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/isaac2018.ee.ntu.edu.tw\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/isaac2018.ee.ntu.edu.tw\/index.php\/wp-json\/wp\/v2\/comments?post=22"}],"version-history":[{"count":23,"href":"https:\/\/isaac2018.ee.ntu.edu.tw\/index.php\/wp-json\/wp\/v2\/pages\/22\/revisions"}],"predecessor-version":[{"id":693,"href":"https:\/\/isaac2018.ee.ntu.edu.tw\/index.php\/wp-json\/wp\/v2\/pages\/22\/revisions\/693"}],"wp:attachment":[{"href":"https:\/\/isaac2018.ee.ntu.edu.tw\/index.php\/wp-json\/wp\/v2\/media?parent=22"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}