Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
1 | Viktor Fredslund-Hansen, Shay Mozes, Christian Wulff-Nilsen |
Truly Subquadratic Exact Distance Oracles with Constant Query Time for Planar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 32nd International Symposium on Algorithms and Computation, ISAAC 2021, December 6-8, 2021, Fukuoka, Japan., pp. 25:1-25:12, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-214-3. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Massimo Equi, Tuukka Norri, Jarno Alanko, Bastien Cazaux, Alexandru I. Tomescu, Veli Mäkinen |
Algorithms and Complexity on Indexing Elastic Founder Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 32nd International Symposium on Algorithms and Computation, ISAAC 2021, December 6-8, 2021, Fukuoka, Japan., pp. 20:1-20:18, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-214-3. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Sam Barr, Therese Biedl |
Efficiently Partitioning the Edges of a 1-Planar Graph into a Planar Graph and a Forest. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 32nd International Symposium on Algorithms and Computation, ISAAC 2021, December 6-8, 2021, Fukuoka, Japan., pp. 16:1-16:15, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-214-3. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Joachim Gudmundsson, Yuan Sha, Fan Yao |
Augmenting Graphs to Minimize the Radius. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 32nd International Symposium on Algorithms and Computation, ISAAC 2021, December 6-8, 2021, Fukuoka, Japan., pp. 45:1-45:20, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-214-3. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Fabian Frei, Edith Hemaspaandra, Jörg Rothe |
Complexity of Stability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 31st International Symposium on Algorithms and Computation, ISAAC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)., pp. 19:1-19:14, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-173-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Adrian Dumitrescu, Anirban Ghosh 0002, Csaba D. Tóth |
Sparse Hop Spanners for Unit Disk Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 31st International Symposium on Algorithms and Computation, ISAAC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)., pp. 57:1-57:17, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-173-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Maciej Duleba, Pawel Gawrychowski, Wojciech Janczewski |
Efficient Labeling for Reachability in Directed Acyclic Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 31st International Symposium on Algorithms and Computation, ISAAC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)., pp. 27:1-27:14, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-173-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Ke Yi 0001 |
Worst-Case Optimal Join Algorithms (Invited Talk). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 31st International Symposium on Algorithms and Computation, ISAAC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)., pp. 2:1-2:1, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-173-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Trung Thanh Nguyen 0004, Jörg Rothe |
Bi-Criteria Approximation Algorithms for Load Balancing on Unrelated Machines with Costs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 31st International Symposium on Algorithms and Computation, ISAAC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)., pp. 14:1-14:14, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-173-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Meng He 0001, J. Ian Munro, Yakov Nekrich, Sebastian Wild, Kaiyu Wu |
Distance Oracles for Interval Graphs via Breadth-First Rank/Select in Succinct Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 31st International Symposium on Algorithms and Computation, ISAAC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)., pp. 25:1-25:18, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-173-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Valentin Bartier, Nicolas Bousquet, Clément Dallard, Kyle Lomer, Amer E. Mouawad |
On Girth and the Parameterized Complexity of Token Sliding and Token Jumping. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 31st International Symposium on Algorithms and Computation, ISAAC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)., pp. 44:1-44:17, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-173-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Jungho Ahn, Eun Jung Kim 0002, Euiwoong Lee |
Towards Constant-Factor Approximation for Chordal / Distance-Hereditary Vertex Deletion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 31st International Symposium on Algorithms and Computation, ISAAC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)., pp. 62:1-62:16, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-173-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Arnaud Casteigts, Anne-Sophie Himmel, Hendrik Molter, Philipp Zschoche |
Finding Temporal Paths Under Waiting Time Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 31st International Symposium on Algorithms and Computation, ISAAC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)., pp. 30:1-30:18, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-173-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Yoshifumi Sakai, Shunsuke Inenaga |
A Reduction of the Dynamic Time Warping Distance to the Longest Increasing Subsequence Length. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 31st International Symposium on Algorithms and Computation, ISAAC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)., pp. 6:1-6:16, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-173-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Philip Bille, Inge Li Gørtz |
Random Access in Persistent Strings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 31st International Symposium on Algorithms and Computation, ISAAC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)., pp. 48:1-48:16, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-173-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | |
Front Matter, Table of Contents, Preface, Conference Organization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 31st International Symposium on Algorithms and Computation, ISAAC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)., pp. 0:1-0:18, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-173-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Martin Koutecký, Johannes Zink 0001 |
Complexity of Scheduling Few Types of Jobs on Related and Unrelated Machines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 31st International Symposium on Algorithms and Computation, ISAAC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)., pp. 18:1-18:17, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-173-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Joep Hamersma, Marc J. van Kreveld, Yushi Uno, Tom C. van der Zanden |
Gourds: A Sliding-Block Puzzle with Turning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 31st International Symposium on Algorithms and Computation, ISAAC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)., pp. 33:1-33:16, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-173-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Nicolas Bousquet, Alice Joffard, Paul Ouvrard |
Linear Transformations Between Dominating Sets in the TAR-Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 31st International Symposium on Algorithms and Computation, ISAAC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)., pp. 37:1-37:14, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-173-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Joachim Gudmundsson, Yuan Sha, Sampson Wong |
Approximating the Packedness of Polygonal Curves. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 31st International Symposium on Algorithms and Computation, ISAAC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)., pp. 9:1-9:15, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-173-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Eunjin Oh 0001 |
Shortest-Path Queries in Geometric Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 31st International Symposium on Algorithms and Computation, ISAAC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)., pp. 52:1-52:15, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-173-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Amihood Amir, Itai Boneh |
Update Query Time Trade-Off for Dynamic Suffix Arrays. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 31st International Symposium on Algorithms and Computation, ISAAC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)., pp. 63:1-63:16, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-173-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Hubie Chen, Bart M. P. Jansen, Karolina Okrasa, Astrid Pieterse, Pawel Rzazewski |
Sparsification Lower Bounds for List H-Coloring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 31st International Symposium on Algorithms and Computation, ISAAC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)., pp. 58:1-58:17, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-173-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Leo Alcock, Sualeh Asif, Jeffrey Bosboom, Josh Brunner, Charlotte Chen, Erik D. Demaine, Rogers Epstein, Adam Hesterberg, Lior Hirschfeld, William Hu, Jayson Lynch, Sarah Scheffler, Lillian Zhang |
Arithmetic Expression Construction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 31st International Symposium on Algorithms and Computation, ISAAC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)., pp. 12:1-12:15, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-173-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Takao Asano, Hiroyuki Umeda |
Cake Cutting: An Envy-Free and Truthful Mechanism with a Small Number of Cuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 31st International Symposium on Algorithms and Computation, ISAAC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)., pp. 15:1-15:16, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-173-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Kristóf Bérczi, Naonori Kakimura, Yusuke Kobayashi 0001 |
Market Pricing for Matroid Rank Valuations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 31st International Symposium on Algorithms and Computation, ISAAC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)., pp. 39:1-39:15, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-173-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Kangsan Kim, Yongho Shin, Hyung-Chan An |
Constant-Factor Approximation Algorithms for the Parity-Constrained Facility Location Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 31st International Symposium on Algorithms and Computation, ISAAC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)., pp. 21:1-21:17, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-173-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Predrag Krnetic, Darya Melnyk, Yuyi Wang 0001, Roger Wattenhofer |
The k-Server Problem with Delays on the Uniform Metric Space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 31st International Symposium on Algorithms and Computation, ISAAC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)., pp. 61:1-61:13, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-173-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Fedor V. Fomin, Petr A. Golovach, Lars Jaffke, Geevarghese Philip, Danil Sagunov |
Diverse Pairs of Matchings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 31st International Symposium on Algorithms and Computation, ISAAC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)., pp. 26:1-26:12, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-173-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Kim Thang Nguyen |
Online Primal-Dual Algorithms with Configuration Linear Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 31st International Symposium on Algorithms and Computation, ISAAC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)., pp. 45:1-45:16, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-173-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Boris Aronov, Jean Cardinal |
Geometric Pattern Matching Reduces to k-SUM. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 31st International Symposium on Algorithms and Computation, ISAAC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)., pp. 32:1-32:9, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-173-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Yixin Cao 0001, Siu-Wing Cheng, Minming Li (eds.) |
31st International Symposium on Algorithms and Computation, ISAAC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-173-3 The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
1 | Sung-Hwan Kim, Hwan-Gue Cho |
Indexing Isodirectional Pointer Sequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 31st International Symposium on Algorithms and Computation, ISAAC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)., pp. 35:1-35:15, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-173-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Haozhou Pang, Mohammad R. Salavatipour |
Approximation Algorithms for Generalized Path Scheduling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 31st International Symposium on Algorithms and Computation, ISAAC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)., pp. 10:1-10:16, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-173-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Walter Kern, Daniël Paulusma |
Contracting to a Longest Path in H-Free Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 31st International Symposium on Algorithms and Computation, ISAAC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)., pp. 22:1-22:18, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-173-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Stefan Funke, Felix Weitbrecht |
Efficiently Computing All Delaunay Triangles Occurring over All Contiguous Subsequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 31st International Symposium on Algorithms and Computation, ISAAC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)., pp. 28:1-28:15, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-173-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Louis Dublois, Tesshu Hanaka, Mehdi Khosravian Ghadikolaei, Michael Lampis, Nikolaos Melissinos |
(In)approximability of Maximum Minimal FVS. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 31st International Symposium on Algorithms and Computation, ISAAC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)., pp. 3:1-3:14, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-173-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Dibyayan Chakraborty, Sandip Das 0001, Florent Foucaud, Harmender Gahlawat, Dimitri Lajou, Bodhayan Roy |
Algorithms and Complexity for Geodetic Sets on Planar and Chordal Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 31st International Symposium on Algorithms and Computation, ISAAC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)., pp. 7:1-7:15, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-173-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Xuangui Huang |
Space Hardness of Solving Structured Linear Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 31st International Symposium on Algorithms and Computation, ISAAC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)., pp. 56:1-56:12, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-173-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Guido Brückner, Ignaz Rutter |
An SPQR-Tree-Like Embedding Representation for Level Planarity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 31st International Symposium on Algorithms and Computation, ISAAC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)., pp. 8:1-8:15, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-173-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Matthias Bentert, Klaus Heeger, Dusan Knop |
Length-Bounded Cuts: Proper Interval Graphs and Structural Parameters. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 31st International Symposium on Algorithms and Computation, ISAAC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)., pp. 36:1-36:14, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-173-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Sang-il Oum |
How to Decompose a Graph into a Tree-Like Structure (Invited Talk). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 31st International Symposium on Algorithms and Computation, ISAAC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)., pp. 1:1-1:1, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-173-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Erik D. Demaine, Justin Kopinsky, Jayson Lynch |
Recursed Is Not Recursive: A Jarring Result. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 31st International Symposium on Algorithms and Computation, ISAAC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)., pp. 50:1-50:15, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-173-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Yuma Tamura, Takehiro Ito, Xiao Zhou 0001 |
Minimization and Parameterized Variants of Vertex Partition Problems on Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 31st International Symposium on Algorithms and Computation, ISAAC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)., pp. 40:1-40:13, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-173-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Peter Bradshaw, Tomás Masarík, Ladislav Stacho |
Flexible List Colorings in Graphs with Special Degeneracy Conditions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 31st International Symposium on Algorithms and Computation, ISAAC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)., pp. 31:1-31:15, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-173-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Thomas Bellitto, Shaohua Li 0005, Karolina Okrasa, Marcin Pilipczuk, Manuel Sorge |
The Complexity of Connectivity Problems in Forbidden-Transition Graphs And Edge-Colored Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 31st International Symposium on Algorithms and Computation, ISAAC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)., pp. 59:1-59:15, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-173-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Kei Uchizawa |
Size, Depth and Energy of Threshold Circuits Computing Parity Function. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 31st International Symposium on Algorithms and Computation, ISAAC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)., pp. 54:1-54:13, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-173-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Anthony Labarre |
Sorting by Prefix Block-Interchanges. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 31st International Symposium on Algorithms and Computation, ISAAC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)., pp. 55:1-55:15, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-173-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Sanjana Dey, Florent Foucaud, Subhas C. Nandy, Arunabha Sen |
Discriminating Codes in Geometric Setups. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 31st International Symposium on Algorithms and Computation, ISAAC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)., pp. 24:1-24:16, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-173-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Dylan Hyatt-Denesik, Mirmahdi Rahgoshay, Mohammad R. Salavatipour |
Approximations for Throughput Maximization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 31st International Symposium on Algorithms and Computation, ISAAC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)., pp. 11:1-11:17, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-173-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Kishen N. Gowda, Aditya Lonkar, Fahad Panolan, Vraj Patel 0001, Saket Saurabh 0001 |
Improved FPT Algorithms for Deletion to Forest-Like Structures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 31st International Symposium on Algorithms and Computation, ISAAC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)., pp. 34:1-34:16, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-173-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Nai-Hui Chia, András Gilyén, Han-Hsuan Lin, Seth Lloyd, Ewin Tang, Chunhao Wang |
Quantum-Inspired Algorithms for Solving Low-Rank Linear Equation Systems with Logarithmic Dependence on the Dimension. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 31st International Symposium on Algorithms and Computation, ISAAC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)., pp. 47:1-47:17, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-173-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Mark de Berg, Aleksandar Markovic 0001, Seeun William Umboh |
The Online Broadcast Range-Assignment Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 31st International Symposium on Algorithms and Computation, ISAAC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)., pp. 60:1-60:15, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-173-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Marc J. van Kreveld, Tillmann Miltzow, Tim Ophelders, Willem Sonke, Jordi L. Vermeulen |
Between Shapes, Using the Hausdorff Distance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 31st International Symposium on Algorithms and Computation, ISAAC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)., pp. 13:1-13:16, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-173-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Richard Santiago, Yuichi Yoshida |
Weakly Submodular Function Maximization Using Local Submodularity Ratio. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 31st International Symposium on Algorithms and Computation, ISAAC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)., pp. 64:1-64:17, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-173-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Loukas Georgiadis, Evangelos Kosinas |
Linear-Time Algorithms for Computing Twinless Strong Articulation Points and Related Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 31st International Symposium on Algorithms and Computation, ISAAC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)., pp. 38:1-38:16, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-173-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Tomohiro Koana, Christian Komusiewicz, Frank Sommer |
Computing Dense and Sparse Subgraphs of Weakly Closed Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 31st International Symposium on Algorithms and Computation, ISAAC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)., pp. 20:1-20:17, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-173-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Angel A. Cantu, Austin Luchsinger, Robert T. Schweller, Tim Wylie |
Signal Passing Self-Assembly Simulates Tile Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 31st International Symposium on Algorithms and Computation, ISAAC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)., pp. 53:1-53:17, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-173-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Qilong Feng, Zhen Zhang 0025, Ziyun Huang, Jinhui Xu 0001, Jianxin Wang 0001 |
A Unified Framework of FPT Approximation Algorithms for Clustering Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 31st International Symposium on Algorithms and Computation, ISAAC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)., pp. 5:1-5:17, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-173-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Pedro Montealegre 0001, Diego Ramírez-Romero, Ivan Rapaport |
Shared vs Private Randomness in Distributed Interactive Proofs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 31st International Symposium on Algorithms and Computation, ISAAC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)., pp. 51:1-51:13, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-173-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Bartlomiej Dudek 0001, Pawel Gawrychowski |
Counting 4-Patterns in Permutations Is Equivalent to Counting 4-Cycles in Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 31st International Symposium on Algorithms and Computation, ISAAC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)., pp. 23:1-23:18, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-173-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | William L. Holland, Anthony Wirth, Justin Zobel |
Recency Queries with Succinct Representation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 31st International Symposium on Algorithms and Computation, ISAAC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)., pp. 49:1-49:14, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-173-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Nikhil Kumar 0001 |
Multicommodity Flows in Planar Graphs with Demands on Faces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 31st International Symposium on Algorithms and Computation, ISAAC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)., pp. 41:1-41:11, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-173-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Ke Chen 0011, Adrian Dumitrescu |
Multiparty Selection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 31st International Symposium on Algorithms and Computation, ISAAC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)., pp. 42:1-42:13, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-173-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Anadi Agrawal, Pawel Gawrychowski |
A Faster Subquadratic Algorithm for the Longest Common Increasing Subsequence Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 31st International Symposium on Algorithms and Computation, ISAAC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)., pp. 4:1-4:12, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-173-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Wolfgang Mulzer, Max Willert |
Compact Routing in Unit Disk Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 31st International Symposium on Algorithms and Computation, ISAAC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)., pp. 16:1-16:14, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-173-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Till Fluschnik, Rolf Niedermeier, Carsten Schubert, Philipp Zschoche |
Multistage s-t Path: Confronting Similarity with Dissimilarity in Temporal Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 31st International Symposium on Algorithms and Computation, ISAAC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)., pp. 43:1-43:16, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-173-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Umang Bhaskar, Gunjan Kumar |
Partial Function Extension with Applications to Learning and Property Testing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 31st International Symposium on Algorithms and Computation, ISAAC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)., pp. 46:1-46:16, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-173-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Josh Brunner, Erik D. Demaine, Dylan H. Hendrickson, Julian Wellman |
Complexity of Retrograde and Helpmate Chess Problems: Even Cooperative Chess Is Hard. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 31st International Symposium on Algorithms and Computation, ISAAC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)., pp. 17:1-17:14, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-173-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Kentaro Sumigawa, Sankardeep Chakraborty, Kunihiko Sadakane, Srinivasa Rao Satti |
Enumerating Range Modes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 31st International Symposium on Algorithms and Computation, ISAAC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)., pp. 29:1-29:16, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-173-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Taku Onodera, Tetsuo Shibuya |
Wear Leveling Revisited. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 31st International Symposium on Algorithms and Computation, ISAAC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)., pp. 65:1-65:17, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-173-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Rahul Jain 0015, Raghunath Tewari |
Reachability in High Treewidth 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. 12:1-12: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 | Rolf Fagerberg, David Hammer, Ulrich Meyer 0001 |
On Optimal Balance in B-Trees: What Does It Cost to Stay in Perfect Shape? ![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. 35:1-35: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 | Oscar Defrain, Lhouari Nourine |
Neighborhood Inclusions for Minimal Dominating Sets Enumeration: Linear and Polynomial Delay Algorithms in P7-Free and P8-Free Chordal 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. 63:1-63: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 | Ahad N. Zehmakan |
Two Phase Transitions in Two-Way Bootstrap Percolation. ![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. 5:1-5: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 | Fabian Frei, Koichi Wada 0001 |
Efficient Circuit Simulation in MapReduce. ![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. 52:1-52: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 | Gordon Hoi, Frank Stephan 0001 |
Measure and Conquer for Max Hamming Distance XSAT. ![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. 15:1-15: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 | Hugo Alves Akitaya, Maike Buchin, Leonie Ryvkin, Jérôme Urhausen |
The k-Fréchet Distance: How to Walk Your Dog While Teleporting. ![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. 50:1-50: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 | Esther Galby, Paloma T. Lima, Bernard Ries |
Blocking Dominating Sets for H-Free Graphs via Edge Contractions. ![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. 21:1-21: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 | Xin Han, Yasushi Kawase, Kazuhisa Makino, Haruki Yokomaku |
Online Knapsack Problems with a Resource Buffer. ![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. 28:1-28: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 | Pinyan Lu, Guochuan Zhang (eds.) |
30th International Symposium on Algorithms and Computation, ISAAC 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-130-6 The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
1 | Akanksha Agrawal 0001, Sudeshna Kolay, Jayakrishnan Madathil, Saket Saurabh 0001 |
Parameterized Complexity Classification of Deletion to List Matrix-Partition for Low-Order Matrices. ![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. 41:1-41: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 | Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
An Improved Data Structure for Left-Right Maximal Generic Words 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. 40:1-40: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 | Isaac Goldstein, Moshe Lewenstein, Ely Porat |
On the Hardness of Set Disjointness and Set Intersection with Bounded Universe. ![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. 7:1-7: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 | Graham Cormode, Chris Hickey |
Efficient Interactive Proofs for Linear Algebra. ![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. 48:1-48: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 | Luca Becchetti, Emilio Cruciani, Francesco Pasquale, Sara Rizzo |
Step-By-Step Community Detection in Volume-Regular 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. 20:1-20:23, 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 | Ziyun Huang, Qilong Feng, Jianxin Wang 0001, Jinhui Xu 0001 |
Small Candidate Set for Translational Pattern Search. ![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. 26:1-26: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 | John Iacono, Ben Karsin, Grigorios Koumoutsos |
External Memory Planar Point Location with Fast Updates. ![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. 58:1-58: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 | Matthew Kahle, Minghao Tian, Yusu Wang 0001 |
Local Cliques in ER-Perturbed Random 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. 29:1-29: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 | Sang Won Bae |
Minimum-Width Double-Strip and Parallelogram Annulus. ![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. 25:1-25: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 | Robert Bredereck, Klaus Heeger, Dusan Knop, Rolf Niedermeier |
Parameterized Complexity of Stable Roommates with Ties and Incomplete Lists Through the Lens of Graph Parameters. ![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. 44:1-44: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 | Alessio Mazzetto, Andrea Pietracaprina, Geppino Pucci |
Accurate MapReduce Algorithms for k-Median and k-Means in General Metric Spaces. ![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. 34:1-34: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 | Ruben Brokkelkamp, Sven C. Polak, Guido Schäfer, Yllka Velaj |
Approximate Pricing in Networks: How to Boost the Betweenness and Revenue of a Node. ![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. 13:1-13: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 | Alexander S. Kulikov, Ivan Mikhailin, Andrey Mokhov, Vladimir V. Podolskii |
Complexity of Linear Operators. ![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. 17:1-17: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 | Panagiotis Charalampopoulos, Tomasz Kociumaka, Manal Mohamed 0001, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
Internal Dictionary Matching. ![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. 22:1-22: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 | Vikraman Arvind, Abhranil Chatterjee 0001, Rajit Datta, Partha Mukhopadhyay |
On Explicit Branching Programs for the Rectangular Determinant and Permanent Polynomials. ![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. 38:1-38: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 | Sándor Kisfaludi-Bak, Dániel Marx, Tom C. van der Zanden |
How Does Object Fatness Impact the Complexity of Packing in d 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. 36:1-36: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 | Moses Ganardi, Danny Hucke, Markus Lohrey, Tatiana Starikovskaya |
Sliding Window Property Testing for Regular Languages. ![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. 6:1-6: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 | |
Front Matter, Table of Contents, Preface, Symposium Organization. ![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. 0:1-0: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 | Abdolhamid Ghodselahi, Fabian Kuhn, Volker Turau |
Concurrent Distributed Serving with Mobile Servers. ![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. 53:1-53: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 |
|