Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
1 | R. Inkulu, Sanjiv Kapoor |
Approximate Euclidean Shortest Paths in Polygonal Domains. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 30th International Symposium on Algorithms and Computation, ISAAC 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China., pp. 11:1-11:17, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-130-6. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Dominik Scheder, Shuyang Tang, Jiaheng Zhang |
Searching for Cryptogenography Upper Bounds via Sum of Square Programming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 30th International Symposium on Algorithms and Computation, ISAAC 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China., pp. 31:1-31:12, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-130-6. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Susanne Albers, Leon Ladewig |
New Results for the k-Secretary Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 30th International Symposium on Algorithms and Computation, ISAAC 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China., pp. 18:1-18:19, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-130-6. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Amotz Bar-Noy, Toni Böhnlein, Zvi Lotker, David Peleg, Dror Rawitz |
The Generalized Microscopic Image Reconstruction Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 30th International Symposium on Algorithms and Computation, ISAAC 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China., pp. 42:1-42:15, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-130-6. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Narthana S. Epa, Junhao Gan, Anthony Wirth |
Result-Sensitive Binary Search with Noisy Information. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 30th International Symposium on Algorithms and Computation, ISAAC 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China., pp. 60:1-60:15, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-130-6. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | David Naori, Danny Raz |
Online Multidimensional Packing Problems in the Random-Order Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 30th International Symposium on Algorithms and Computation, ISAAC 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China., pp. 10:1-10:15, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-130-6. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Philip Dasler, David M. Mount |
Online Algorithms for Warehouse Management. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 30th International Symposium on Algorithms and Computation, ISAAC 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China., pp. 56:1-56:21, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-130-6. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Christophe Crespelle, Carl Feghali, Petr A. Golovach |
Cyclability in Graph Classes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 30th International Symposium on Algorithms and Computation, ISAAC 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China., pp. 16:1-16:13, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-130-6. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Yong Chen 0002, Randy Goebel, Bing Su, Weitian Tong, Yao Xu, An Zhang 0001 |
A 21/16-Approximation for the Minimum 3-Path Partition Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 30th International Symposium on Algorithms and Computation, ISAAC 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China., pp. 46:1-46:20, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-130-6. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Paola Flocchini, Ryan Killick, Evangelos Kranakis, Nicola Santoro, Masafumi Yamashita |
Gathering and Election by Mobile Robots in a Continuous Cycle. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 30th International Symposium on Algorithms and Computation, ISAAC 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China., pp. 8:1-8:19, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-130-6. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Amotz Bar-Noy, Keerti Choudhary, David Peleg, Dror Rawitz |
Efficiently Realizing Interval Sequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 30th International Symposium on Algorithms and Computation, ISAAC 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China., pp. 47:1-47:15, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-130-6. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Mark de Berg, Sándor Kisfaludi-Bak, Mehran Mehr |
On One-Round Discrete Voronoi Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 30th International Symposium on Algorithms and Computation, ISAAC 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China., pp. 37:1-37:17, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-130-6. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Serge Gaspers, Joshua Lau |
Minimizing and Computing the Inverse Geodesic Length on Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 30th International Symposium on Algorithms and Computation, ISAAC 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China., pp. 59:1-59:19, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-130-6. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Vikrant Ashvinkumar, Joachim Gudmundsson, Christos Levcopoulos, Bengt J. Nilsson, André van Renssen |
Local Routing in Sparse and Lightweight Geometric Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 30th International Symposium on Algorithms and Computation, ISAAC 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China., pp. 30:1-30:13, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-130-6. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Marcin Bienkowski, Lukasz Jez, Pawel Schmidt |
Slaying Hydrae: Improved Bounds for Generalized k-Server in Uniform Metrics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 30th International Symposium on Algorithms and Computation, ISAAC 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China., pp. 14:1-14:14, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-130-6. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Hugo A. Akitaya, Maike Buchin, Bernhard Kilgus, Stef Sijben, Carola Wenk |
Distance Measures for Embedded Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 30th International Symposium on Algorithms and Computation, ISAAC 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China., pp. 55:1-55:15, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-130-6. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Kyle Fox, Xinyi Li |
Approximating the Geometric Edit Distance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 30th International Symposium on Algorithms and Computation, ISAAC 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China., pp. 23:1-23:16, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-130-6. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Yasuaki Kobayashi, Koki Suetsugu, Hideki Tsuiki, Ryuhei Uehara |
On the Complexity of Lattice Puzzles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 30th International Symposium on Algorithms and Computation, ISAAC 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China., pp. 32:1-32:12, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-130-6. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | David Eppstein, Michael T. Goodrich, James A. Liu, Pedro Matias 0001 |
Tracking Paths in Planar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 30th International Symposium on Algorithms and Computation, ISAAC 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China., pp. 54:1-54:17, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-130-6. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Kazuya Haraguchi, Hiroshi Nagamochi |
A Polynomial-Delay Algorithm for Enumerating Connectors Under Various Connectivity Conditions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 30th International Symposium on Algorithms and Computation, ISAAC 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China., pp. 3:1-3:15, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-130-6. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Pál András Papp, Roger Wattenhofer |
Stabilization Time in Minority Processes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 30th International Symposium on Algorithms and Computation, ISAAC 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China., pp. 43:1-43:19, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-130-6. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Koki Hamada, Shuichi Miyazaki, Hiroki Yanagisawa |
Strategy-Proof Approximation Algorithms for the Stable Marriage Problem with Ties and Incomplete Lists. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 30th International Symposium on Algorithms and Computation, ISAAC 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China., pp. 9:1-9:14, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-130-6. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Lorenzo De Stefani |
The I/O Complexity of Hybrid Algorithms for Square Matrix Multiplication. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 30th International Symposium on Algorithms and Computation, ISAAC 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China., pp. 33:1-33:16, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-130-6. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Hicham El-Zein, Meng He 0001, J. Ian Munro, Yakov Nekrich, Bryce Sandlund |
On Approximate Range Mode and Range Selection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 30th International Symposium on Algorithms and Computation, ISAAC 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China., pp. 57:1-57:14, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-130-6. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Édouard Bonnet, Nicolas Bousquet, Stéphan Thomassé, Rémi Watrigant |
When Maximum Stable Set Can Be Solved in FPT Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 30th International Symposium on Algorithms and Computation, ISAAC 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China., pp. 49:1-49:22, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-130-6. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Gill Barequet, Evanthia Papadopoulou, Martin Suderland |
Unbounded Regions of High-Order Voronoi Diagrams of Lines and Segments in Higher Dimensions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 30th International Symposium on Algorithms and Computation, ISAAC 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China., pp. 62:1-62:15, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-130-6. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Yixin Cao 0001, Zhifeng Wang, Guozhen Rong, Jianxin Wang 0001 |
Graph Searches and Their End Vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 30th International Symposium on Algorithms and Computation, ISAAC 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China., pp. 1:1-1:18, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-130-6. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Barbara Geissmann, Stefano Leucci 0001, Chih-Hung Liu 0001, Paolo Penna, Guido Proietti |
Dual-Mode Greedy Algorithms Can Save Energy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 30th International Symposium on Algorithms and Computation, ISAAC 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China., pp. 64:1-64:18, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-130-6. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Anup Bhattacharya, Arijit Bishnu, Arijit Ghosh, Gopinath Mishra |
Triangle Estimation Using Tripartite Independent Set Queries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 30th International Symposium on Algorithms and Computation, ISAAC 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China., pp. 19:1-19:17, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-130-6. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Meng He 0001, Serikzhan Kazi |
Path and Ancestor Queries over Trees with Multidimensional Weight Vectors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 30th International Symposium on Algorithms and Computation, ISAAC 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China., pp. 45:1-45:17, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-130-6. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Binay Bhattacharya, Sandip Das 0001, Subhadeep Ranjan Dev |
The Weighted k-Center Problem in Trees for Fixed k. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 30th International Symposium on Algorithms and Computation, ISAAC 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China., pp. 27:1-27:11, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-130-6. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Wei Chen 0013, Binghui Peng |
On Adaptivity Gaps of Influence Maximization Under the Independent Cascade Model with Full-Adoption Feedback. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 30th International Symposium on Algorithms and Computation, ISAAC 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China., pp. 24:1-24:19, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-130-6. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Philip Bille, Pawel Gawrychowski, Inge Li Gørtz, Gad M. Landau, Oren Weimann |
Top Tree Compression of Tries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 30th International Symposium on Algorithms and Computation, ISAAC 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China., pp. 4:1-4:18, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-130-6. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Kim Thang Nguyen |
A Competitive Algorithm for Random-Order Stochastic Virtual Circuit Routing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 30th International Symposium on Algorithms and Computation, ISAAC 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China., pp. 39:1-39:12, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-130-6. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Nader H. Bshouty |
Lower Bound for Non-Adaptive Estimation of the Number of Defective Items. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 30th International Symposium on Algorithms and Computation, ISAAC 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China., pp. 2:1-2:9, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-130-6. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Qilong Feng, Zhen Zhang 0025, Ziyun Huang, Jinhui Xu 0001, Jianxin Wang 0001 |
Improved Algorithms for Clustering with Outliers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 30th International Symposium on Algorithms and Computation, ISAAC 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China., pp. 61:1-61:12, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-130-6. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Nil Mamano, Alon Efrat, David Eppstein, Daniel Frishberg, Michael T. Goodrich, Stephen G. Kobourov, Pedro Matias 0001, Valentin Polishchuk |
New Applications of Nearest-Neighbor Chains: Euclidean TSP and Motorcycle Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 30th International Symposium on Algorithms and Computation, ISAAC 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China., pp. 51:1-51:21, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-130-6. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | J. Ian Munro, Kaiyu Wu |
Succinct Data Structures for Chordal Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 29th International Symposium on Algorithms and Computation, ISAAC 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan, pp. 67:1-67:12, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-094-1. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Eunpyeong Hong, Mong-Jen Kao |
Approximation Algorithm for Vertex Cover with Multiple Covering Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 29th International Symposium on Algorithms and Computation, ISAAC 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan, pp. 43:1-43:11, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-094-1. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | On-Hei Solomon Lo, Jens M. Schmidt |
A Cut Tree Representation for Pendant Pairs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 29th International Symposium on Algorithms and Computation, ISAAC 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan, pp. 38:1-38:9, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-094-1. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Galia Shabtai, Danny Raz, Yuval Shavitt |
A Relaxed FPTAS for Chance-Constrained Knapsack. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 29th International Symposium on Algorithms and Computation, ISAAC 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan, pp. 72:1-72:12, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-094-1. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Matthias Bentert, Alexander Dittmann, Leon Kellerhals, André Nichterlein, Rolf Niedermeier |
An Adaptive Version of Brandes' Algorithm for Betweenness Centrality. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 29th International Symposium on Algorithms and Computation, ISAAC 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan, pp. 36:1-36:13, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-094-1. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Siu-Wing Cheng, Lie Yan |
Extensions of Self-Improving Sorters. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 29th International Symposium on Algorithms and Computation, ISAAC 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan, pp. 63:1-63:12, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-094-1. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Kenneth Hoover, Russell Impagliazzo, Ivan Mihajlin, Alexander V. Smal |
Half-Duplex Communication Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 29th International Symposium on Algorithms and Computation, ISAAC 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan, pp. 10:1-10:12, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-094-1. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Yen-Ting Chen, Meng-Tsung Tsai, Shi-Chun Tsai |
A Dichotomy Result for Cyclic-Order Traversing Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 29th International Symposium on Algorithms and Computation, ISAAC 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan, pp. 29:1-29:13, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-094-1. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Travis Gagie, Meng He 0001, Gonzalo Navarro 0001 |
Tree Path Majority Data Structures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 29th International Symposium on Algorithms and Computation, ISAAC 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan, pp. 68:1-68:12, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-094-1. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Sariel Har-Peled, Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir, Max Willert |
Stabbing Pairwise Intersecting Disks by Five Points. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 29th International Symposium on Algorithms and Computation, ISAAC 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan, pp. 50:1-50:12, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-094-1. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Eunjin Oh 0001 |
Point Location in Incremental Planar Subdivisions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 29th International Symposium on Algorithms and Computation, ISAAC 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan, pp. 51:1-51:12, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-094-1. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Dimitris Fotakis 0001, Laurent Gourvès, Claire Mathieu, Abhinav Srivastav |
Covering Clients with Types and Budgets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 29th International Symposium on Algorithms and Computation, ISAAC 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan, pp. 73:1-73:12, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-094-1. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Tatsuya Akutsu, Jesper Jansson 0001, Ruiming Li, Atsuhiro Takasu, Takeyuki Tamura |
New and Improved Algorithms for Unordered Tree Inclusion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 29th International Symposium on Algorithms and Computation, ISAAC 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan, pp. 27:1-27:12, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-094-1. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Annette M. C. Ficker, Thomas Erlebach, Matús Mihalák, Frits C. R. Spieksma |
Partitioning Vectors into Quadruples: Worst-Case Analysis of a Matching-Based Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 29th International Symposium on Algorithms and Computation, ISAAC 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan, pp. 45:1-45:12, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-094-1. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Hiroshi Hirai 0001, Yuni Iwamasa |
Reconstructing Phylogenetic Tree From Multipartite Quartet System. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 29th International Symposium on Algorithms and Computation, ISAAC 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan, pp. 57:1-57:13, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-094-1. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Quirijn W. Bouts, Thom Castermans, Arthur van Goethem, Marc J. van Kreveld, Wouter Meulemans |
Competitive Searching for a Line on a Line Arrangement. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 29th International Symposium on Algorithms and Computation, ISAAC 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan, pp. 49:1-49:12, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-094-1. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Delia Garijo, Alberto Márquez 0001, Natalia Rodríguez, Rodrigo I. Silveira |
Computing Optimal Shortcuts for Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 29th International Symposium on Algorithms and Computation, ISAAC 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan, pp. 15:1-15:12, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-094-1. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Tomasz Kociumaka, Ritu Kundu, Manal Mohamed 0001, Solon P. Pissis |
Longest Unbordered Factor in Quasilinear Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 29th International Symposium on Algorithms and Computation, ISAAC 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan, pp. 70:1-70:13, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-094-1. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Johanna E. Preißer, Jens M. Schmidt |
Computing Vertex-Disjoint Paths in Large Graphs Using MAOs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 29th International Symposium on Algorithms and Computation, ISAAC 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan, pp. 13:1-13:12, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-094-1. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto |
Counting Connected Subgraphs with Maximum-Degree-Aware Sieving. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 29th International Symposium on Algorithms and Computation, ISAAC 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan, pp. 17:1-17:12, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-094-1. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Jian-Jia Chen, Nikhil Bansal 0001, Samarjit Chakraborty, Georg von der Brüggen |
Packing Sporadic Real-Time Tasks on Identical Multiprocessor Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 29th International Symposium on Algorithms and Computation, ISAAC 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan, pp. 71:1-71:14, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-094-1. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Andreas Björklund |
Exploiting Sparsity for Bipartite Hamiltonicity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 29th International Symposium on Algorithms and Computation, ISAAC 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan, pp. 3:1-3:11, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-094-1. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Johannes Blömer, Sascha Brauer, Kathrin Bujna |
Coresets for Fuzzy K-Means with Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 29th International Symposium on Algorithms and Computation, ISAAC 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan, pp. 46:1-46:12, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-094-1. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Tereza Klimosová, Josef Malík, Tomás Masarík, Jana Novotná 0001, Daniël Paulusma, Veronika Slívová |
Colouring (P_r+P_s)-Free Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 29th International Symposium on Algorithms and Computation, ISAAC 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan, pp. 5:1-5:13, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-094-1. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Hiroki Osawa, Akira Suzuki, Takehiro Ito, Xiao Zhou 0001 |
Algorithms for Coloring Reconfiguration Under Recolorability Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 29th International Symposium on Algorithms and Computation, ISAAC 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan, pp. 37:1-37:13, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-094-1. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Guillaume Ducoffe, Alexandru Popa 0001 |
The Use of a Pruned Modular Decomposition for Maximum Matching Algorithms on Some Graph Classes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 29th International Symposium on Algorithms and Computation, ISAAC 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan, pp. 6:1-6:13, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-094-1. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Shang-Hua Teng |
Going Beyond Traditional Characterizations in the Age of Big Data and Network Sciences (Invited Talk). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 29th International Symposium on Algorithms and Computation, ISAAC 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan, pp. 1:1-1:1, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-094-1. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Sébastien Bouchard, Yoann Dieudonné, Andrzej Pelc, Franck Petit |
Deterministic Treasure Hunt in the Plane with Angular Hints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 29th International Symposium on Algorithms and Computation, ISAAC 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan, pp. 48:1-48:13, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-094-1. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Takashi Ishizuka, Naoyuki Kamiyama |
On the Complexity of Stable Fractional Hypergraph Matching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 29th International Symposium on Algorithms and Computation, ISAAC 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan, pp. 11:1-11:12, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-094-1. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Xingwu Liu, Zhida Pan, Yuyi Wang 0001, Roger Wattenhofer |
Impatient Online Matching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 29th International Symposium on Algorithms and Computation, ISAAC 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan, pp. 62:1-62:12, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-094-1. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Kelin Luo, Thomas Erlebach, Yinfeng Xu |
Online Scheduling of Car-Sharing Requests Between Two Locations with Many Cars and Flexible Advance Bookings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 29th International Symposium on Algorithms and Computation, ISAAC 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan, pp. 64:1-64:13, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-094-1. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Davide Bilò |
Almost Optimal Algorithms for Diameter-Optimally Augmenting Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 29th International Symposium on Algorithms and Computation, ISAAC 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan, pp. 40:1-40:13, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-094-1. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Andrzej Czygrinow, Michal Hanckowiak, Wojciech Wawrzyniak, Marcin Witkowski |
Distributed Approximation Algorithms for the Minimum Dominating Set in K_h-Minor-Free Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 29th International Symposium on Algorithms and Computation, ISAAC 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan, pp. 22:1-22:12, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-094-1. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Parinya Chalermsook, Mayank Goswami 0001, László Kozma 0002, Kurt Mehlhorn, Thatchaphol Saranurak |
Multi-Finger Binary Search Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 29th International Symposium on Algorithms and Computation, ISAAC 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan, pp. 55:1-55:26, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-094-1. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Frank Kammer, Andrej Sajenko |
Simple 2^f-Color Choice Dictionaries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 29th International Symposium on Algorithms and Computation, ISAAC 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan, pp. 66:1-66:12, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-094-1. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Ran Ben-Basat, Seungbum Jo, Srinivasa Rao Satti, Shubham Ugare |
Approximate Query Processing over Static Sets and Sliding Windows. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 29th International Symposium on Algorithms and Computation, ISAAC 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan, pp. 54:1-54:12, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-094-1. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Franz Aurenhammer, Michael Steinkogler, Rolf Klein |
Partially Walking a Polygon. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 29th International Symposium on Algorithms and Computation, ISAAC 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan, pp. 60:1-60:9, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-094-1. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Eun Jung Kim 0002, Maria J. Serna, Dimitrios M. Thilikos |
Data-Compression for Parametrized Counting Problems on Sparse Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 29th International Symposium on Algorithms and Computation, ISAAC 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan, pp. 20:1-20:13, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-094-1. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Martin Hoefer 0001, Lisa Wilhelmi |
Packing Returning Secretaries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 29th International Symposium on Algorithms and Computation, ISAAC 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan, pp. 65:1-65:12, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-094-1. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Patrizio Angelini, Michael A. Bekos, Michael Kaufmann 0001, Maximilian Pfister 0002, Torsten Ueckerdt |
Beyond-Planarity: Turán-Type Results for Non-Planar Bipartite Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 29th International Symposium on Algorithms and Computation, ISAAC 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan, pp. 28:1-28:13, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-094-1. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh |
An O(n^2 log^2 n) Time Algorithm for Minmax Regret Minsum Sink on Path Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 29th International Symposium on Algorithms and Computation, ISAAC 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan, pp. 14:1-14:13, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-094-1. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | |
Front Matter, Table of Contents, Preface, Conference Organization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 29th International Symposium on Algorithms and Computation, ISAAC 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan, pp. 0:i-0:xviii, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-094-1. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Georgia Avarikioti, Yuyi Wang 0001, Roger Wattenhofer |
Algorithmic Channel Design. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 29th International Symposium on Algorithms and Computation, ISAAC 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan, pp. 16:1-16:12, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-094-1. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Nader H. Bshouty, Waseem Makhoul |
On Polynomial Time Constructions of Minimum Height Decision Tree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 29th International Symposium on Algorithms and Computation, ISAAC 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan, pp. 34:1-34:12, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-094-1. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Clifford Stein 0001 |
Approximate Matchings in Massive Graphs via Local Structure (Invited Talk). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 29th International Symposium on Algorithms and Computation, ISAAC 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan, pp. 2:1-2:1, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-094-1. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Ivona Bezáková, Andrew Searns |
On Counting Oracles for Path Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 29th International Symposium on Algorithms and Computation, ISAAC 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan, pp. 56:1-56:12, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-094-1. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Jiehua Chen 0001, Hendrik Molter, Manuel Sorge, Ondrej Suchý |
Cluster Editing in Multi-Layer and Temporal Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 29th International Symposium on Algorithms and Computation, ISAAC 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan, pp. 24:1-24:13, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-094-1. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Wen-Lian Hsu, Der-Tsai Lee, Chung-Shou Liao (eds.) |
29th International Symposium on Algorithms and Computation, ISAAC 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-094-1 The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
1 | Samir Datta, Raghav Kulkarni, Ashish Kumar, Anish Mukherjee 0001 |
Planar Maximum Matching: Towards a Parallel Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 29th International Symposium on Algorithms and Computation, ISAAC 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan, pp. 21:1-21:13, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-094-1. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Arijit Bishnu, Arijit Ghosh, Sudeshna Kolay, Gopinath Mishra, Saket Saurabh 0001 |
Parameterized Query Complexity of Hitting Set Using Stability of Sunflowers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 29th International Symposium on Algorithms and Computation, ISAAC 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan, pp. 25:1-25:12, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-094-1. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Md Lutfar Rahman, Thomas Watson 0001 |
Complexity of Unordered CNF Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 29th International Symposium on Algorithms and Computation, ISAAC 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan, pp. 9:1-9:12, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-094-1. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Matthew P. Johnson 0001 |
Deciding the Closure of Inconsistent Rooted Triples Is NP-Complete. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 29th International Symposium on Algorithms and Computation, ISAAC 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan, pp. 12:1-12:13, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-094-1. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Eunjin Oh 0001 |
Minimizing Distance-to-Sight in Polygonal Domains. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 29th International Symposium on Algorithms and Computation, ISAAC 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan, pp. 59:1-59:12, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-094-1. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Emilio Di Giacomo, Peter Eades, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani |
Polyline Drawings with Topological Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 29th International Symposium on Algorithms and Computation, ISAAC 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan, pp. 39:1-39:13, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-094-1. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Pavel Dvorák, Dusan Knop, Tomás Toufar |
Target Set Selection in Dense Graph Classes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 29th International Symposium on Algorithms and Computation, ISAAC 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan, pp. 18:1-18:13, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-094-1. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Elena Arseneva, Man-Kwun Chiu, Matias Korman, Aleksandar Markovic 0001, Yoshio Okamoto, Aurélien Ooms, André van Renssen, Marcel Roeloffzen |
Rectilinear Link Diameter and Radius in a Rectilinear Polygonal Domain. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 29th International Symposium on Algorithms and Computation, ISAAC 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan, pp. 58:1-58:13, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-094-1. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Guillaume Ducoffe, Alexandru Popa 0001 |
The b-Matching Problem in Distance-Hereditary Graphs and Beyond. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 29th International Symposium on Algorithms and Computation, ISAAC 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan, pp. 30:1-30:13, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-094-1. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Alfonso Cevallos, Friedrich Eisenbrand, Sarah Morell |
Diversity Maximization in Doubling Metrics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 29th International Symposium on Algorithms and Computation, ISAAC 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan, pp. 33:1-33:12, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-094-1. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | David F. Gleich, Nate Veldt, Anthony Wirth |
Correlation Clustering Generalized. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 29th International Symposium on Algorithms and Computation, ISAAC 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan, pp. 44:1-44:13, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-094-1. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Pankaj K. Agarwal, Haim Kaplan, Geva Kipper, Wolfgang Mulzer, Günter Rote, Micha Sharir, Allen Xiao |
Approximate Minimum-Weight Matching with Outliers Under Translation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 29th International Symposium on Algorithms and Computation, ISAAC 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan, pp. 26:1-26:13, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-094-1. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Divesh Aggarwal, Priyanka Mukhopadhyay |
Improved Algorithms for the Shortest Vector Problem and the Closest Vector Problem in the Infinity Norm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 29th International Symposium on Algorithms and Computation, ISAAC 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan, pp. 35:1-35:13, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-094-1. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Cody W. Geary, Pierre-Étienne Meunier, Nicolas Schabanel, Shinnosuke Seki |
Proving the Turing Universality of Oritatami Co-Transcriptional Folding. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 29th International Symposium on Algorithms and Computation, ISAAC 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan, pp. 23:1-23:13, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-094-1. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Alexander Pilz, Patrick Schnider |
Extending the Centerpoint Theorem to Multiple Points. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 29th International Symposium on Algorithms and Computation, ISAAC 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan, pp. 53:1-53:13, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-094-1. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|