Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
1 | Ragesh Jaiswal, Amit Kumar 0001 |
Clustering What Matters in Constrained Settings: Improved Outlier to Outlier-Free Reductions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 34th International Symposium on Algorithms and Computation, ISAAC 2023, December 3-6, 2023, Kyoto, Japan, pp. 41:1-41:16, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-289-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Hugo A. Akitaya, Maike Buchin, Majid Mirzanezhad, Leonie Ryvkin, Carola Wenk |
Realizability of Free Spaces of Curves. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 34th International Symposium on Algorithms and Computation, ISAAC 2023, December 3-6, 2023, Kyoto, Japan, pp. 3:1-3:20, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-289-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | |
Front Matter, Table of Contents, Preface, Conference Organization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 34th International Symposium on Algorithms and Computation, ISAAC 2023, December 3-6, 2023, Kyoto, Japan, pp. 0:1-0:16, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-289-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Yusuke Kobayashi 0001, Ryoga Mahara, Tamás Schwarcz |
Reconfiguration of the Union of Arborescences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 34th International Symposium on Algorithms and Computation, ISAAC 2023, December 3-6, 2023, Kyoto, Japan, pp. 48:1-48:14, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-289-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | David Eppstein, Daniel Frishberg |
Rapid Mixing for the Hardcore Glauber Dynamics and Other Markov Chains in Bounded-Treewidth Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 34th International Symposium on Algorithms and Computation, ISAAC 2023, December 3-6, 2023, Kyoto, Japan, pp. 30:1-30:13, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-289-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Neeldhara Misra, Harshil Mittal, Saket Saurabh 0001, Dhara Thakkar |
On the Complexity of the Eigenvalue Deletion Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 34th International Symposium on Algorithms and Computation, ISAAC 2023, December 3-6, 2023, Kyoto, Japan, pp. 53:1-53:17, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-289-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Giulia Bernardini 0001, Gabriele Fici, Pawel Gawrychowski, Solon P. Pissis |
Substring Complexity in Sublinear Space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 34th International Symposium on Algorithms and Computation, ISAAC 2023, December 3-6, 2023, Kyoto, Japan, pp. 12:1-12:19, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-289-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Joachim Gudmundsson, Yuan Sha |
Shortest Beer Path Queries in Digraphs with Bounded Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 34th International Symposium on Algorithms and Computation, ISAAC 2023, December 3-6, 2023, Kyoto, Japan, pp. 35:1-35:17, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-289-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Anubhav Dhar, Soumita Hait, Sudeshna Kolay |
Efficient Algorithms for Euclidean Steiner Minimal Tree on Near-Convex Terminal Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 34th International Symposium on Algorithms and Computation, ISAAC 2023, December 3-6, 2023, Kyoto, Japan, pp. 25:1-25:17, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-289-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Alessio Conte, Roberto Grossi, Giulia Punzi, Takeaki Uno |
A Compact DAG for Storing and Searching Maximal Common Subsequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 34th International Symposium on Algorithms and Computation, ISAAC 2023, December 3-6, 2023, Kyoto, Japan, pp. 21:1-21:15, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-289-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Petr Gregor, Torsten Mütze, Namrata |
Pattern-Avoiding Binary Trees - Generation, Counting, and Bijections. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 34th International Symposium on Algorithms and Computation, ISAAC 2023, December 3-6, 2023, Kyoto, Japan, pp. 33:1-33:19, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-289-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Walter Didimo, Michael Kaufmann 0001, Giuseppe Liotta, Giacomo Ortali, Maurizio Patrignani |
Rectilinear-Upward Planarity Testing of Digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 34th International Symposium on Algorithms and Computation, ISAAC 2023, December 3-6, 2023, Kyoto, Japan, pp. 26:1-26:20, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-289-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Ben Jourdan, Peter Macgregor, He Sun 0001 |
Is the Algorithmic Kadison-Singer Problem Hard? ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 34th International Symposium on Algorithms and Computation, ISAAC 2023, December 3-6, 2023, Kyoto, Japan, pp. 43:1-43:18, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-289-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Duncan Adamson, Pamela Fleischmann, Annika Huch, Tore Koß, Florin Manea, Dirk Nowotka |
k-Universality of Regular Languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 34th International Symposium on Algorithms and Computation, ISAAC 2023, December 3-6, 2023, Kyoto, Japan, pp. 4:1-4:21, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-289-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Diptarka Chakraborty, Sanjana Dey |
Matrix Completion: Approximating the Minimum Diameter. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 34th International Symposium on Algorithms and Computation, ISAAC 2023, December 3-6, 2023, Kyoto, Japan, pp. 17:1-17:19, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-289-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Benjamin Bergougnoux, Jakub Gajarský, Grzegorz Guspiel, Petr Hlinený, Filip Pokrývka, Marek Sokolowski 0001 |
Sparse Graphs of Twin-Width 2 Have Bounded Tree-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 34th International Symposium on Algorithms and Computation, ISAAC 2023, December 3-6, 2023, Kyoto, Japan, pp. 11:1-11:13, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-289-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Sebastian Berndt 0001, Hauke Brinkop, Klaus Jansen, Matthias Mnich, Tobias Stamm |
New Support Size Bounds for Integer Programming, Applied to Makespan Minimization on Uniformly Related Machines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 34th International Symposium on Algorithms and Computation, ISAAC 2023, December 3-6, 2023, Kyoto, Japan, pp. 13:1-13:18, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-289-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Matthias Englert, Nicolaos Matsakis, Pavel Veselý 0001 |
Approximation Guarantees for Shortest Superstrings: Simpler and Better. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 34th International Symposium on Algorithms and Computation, ISAAC 2023, December 3-6, 2023, Kyoto, Japan, pp. 29:1-29:17, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-289-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Mong-Jen Kao |
Improved Approximation Algorithm for Capacitated Facility Location with Uniform Facility Cost. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 34th International Symposium on Algorithms and Computation, ISAAC 2023, December 3-6, 2023, Kyoto, Japan, pp. 45:1-45:14, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-289-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Nicola Cotumaccio |
Prefix Sorting DFAs: A Recursive Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 34th International Symposium on Algorithms and Computation, ISAAC 2023, December 3-6, 2023, Kyoto, Japan, pp. 22:1-22:15, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-289-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Sampriti Roy, Yadu Vasudev |
Testing Properties of Distributions in the Streaming Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 34th International Symposium on Algorithms and Computation, ISAAC 2023, December 3-6, 2023, Kyoto, Japan, pp. 56:1-56:17, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-289-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Ting-Yu Kuo, Yu-Han Chen, Andrea Frosini, Sun-Yuan Hsieh, Shi-Chun Tsai, Mong-Jen Kao |
On Min-Max Graph Balancing with Strict Negative Correlation Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 34th International Symposium on Algorithms and Computation, ISAAC 2023, December 3-6, 2023, Kyoto, Japan, pp. 50:1-50:15, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-289-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Frank Kammer, Johannes Meintrup |
Succinct Planar Encoding with Minor Operations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 34th International Symposium on Algorithms and Computation, ISAAC 2023, December 3-6, 2023, Kyoto, Japan, pp. 44:1-44:18, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-289-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Michaela Borzechowski, Patrick Schnider, Simon Weber 0001 |
An FPT Algorithm for Splitting a Necklace Among Two Thieves. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 34th International Symposium on Algorithms and Computation, ISAAC 2023, December 3-6, 2023, Kyoto, Japan, pp. 15:1-15:14, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-289-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Grzegorz Gutowski, Konstanty Junosza-Szaniawski, Felix Klesen, Pawel Rzazewski, Alexander Wolff 0001, Johannes Zink 0001 |
Coloring and Recognizing Mixed Interval Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 34th International Symposium on Algorithms and Computation, ISAAC 2023, December 3-6, 2023, Kyoto, Japan, pp. 36:1-36:14, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-289-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Jannis Blauth, Meike Neuwohner, Luise Puhlmann, Jens Vygen |
Improved Guarantees for the a Priori TSP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 34th International Symposium on Algorithms and Computation, ISAAC 2023, December 3-6, 2023, Kyoto, Japan, pp. 14:1-14:16, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-289-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Evripidis Bampis, Alexander V. Kononov, Giorgio Lucarelli, Fanny Pascual |
Non-Clairvoyant Makespan Minimization Scheduling with Predictions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 34th International Symposium on Algorithms and Computation, ISAAC 2023, December 3-6, 2023, Kyoto, Japan, pp. 9:1-9:15, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-289-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Henk Alkema, Mark de Berg |
Geometric TSP on Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 34th International Symposium on Algorithms and Computation, ISAAC 2023, December 3-6, 2023, Kyoto, Japan, pp. 6:1-6:19, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-289-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Hovhannes A. Harutyunyan, Kamran Koupayi, Denis Pankratov |
Temporal Separators with Deadlines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 34th International Symposium on Algorithms and Computation, ISAAC 2023, December 3-6, 2023, Kyoto, Japan, pp. 38:1-38:19, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-289-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Mark de Berg, Leyla Biabani, Morteza Monemizadeh, Leonidas Theocharous |
Clustering in Polygonal Domains. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 34th International Symposium on Algorithms and Computation, ISAAC 2023, December 3-6, 2023, Kyoto, Japan, pp. 23:1-23:15, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-289-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Nicolas El Maalouly, Raphael Steiner, Lasse Wulf |
Exact Matching: Correct Parity and FPT Parameterized by Independence Number. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 34th International Symposium on Algorithms and Computation, ISAAC 2023, December 3-6, 2023, Kyoto, Japan, pp. 28:1-28:18, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-289-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Virginia Ardévol Martínez, Romeo Rizzi, Florian Sikora, Stéphane Vialette |
Recognizing Unit Multiple Intervals Is Hard. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 34th International Symposium on Algorithms and Computation, ISAAC 2023, December 3-6, 2023, Kyoto, Japan, pp. 8:1-8:18, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-289-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Huairui Chu, Bingkai Lin |
FPT Approximation Using Treewidth: Capacitated Vertex Cover, Target Set Selection and Vector Dominating Set. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 34th International Symposium on Algorithms and Computation, ISAAC 2023, December 3-6, 2023, Kyoto, Japan, pp. 19:1-19:20, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-289-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Shuai Shao 0001, Stanislav Zivný |
A Strongly Polynomial-Time Algorithm for Weighted General Factors with Three Feasible Degrees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 34th International Symposium on Algorithms and Computation, ISAAC 2023, December 3-6, 2023, Kyoto, Japan, pp. 57:1-57:17, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-289-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Joydeep Mukherjee, Tamojit Saha |
Connected Vertex Cover on AT-Free Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 34th International Symposium on Algorithms and Computation, ISAAC 2023, December 3-6, 2023, Kyoto, Japan, pp. 54:1-54:12, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-289-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Gabriel Bathie, Tomasz Kociumaka, Tatiana Starikovskaya |
Small-Space Algorithms for the Online Language Distance Problem for Palindromes and Squares. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 34th International Symposium on Algorithms and Computation, ISAAC 2023, December 3-6, 2023, Kyoto, Japan, pp. 10:1-10:17, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-289-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Satoru Iwata 0001, Naonori Kakimura (eds.) |
34th International Symposium on Algorithms and Computation, ISAAC 2023, December 3-6, 2023, Kyoto, Japan ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-289-1 The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP BibTeX RDF |
|
1 | Kazuyuki Amano |
Depth-Three Circuits for Inner Product and Majority Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 34th International Symposium on Algorithms and Computation, ISAAC 2023, December 3-6, 2023, Kyoto, Japan, pp. 7:1-7:16, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-289-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Seok-Hee Hong 0001 |
Faithful Graph Drawing (Invited Talk). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 34th International Symposium on Algorithms and Computation, ISAAC 2023, December 3-6, 2023, Kyoto, Japan, pp. 2:1-2:1, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-289-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Lars Jaffke, Paloma T. Lima, Roohani Sharma |
Structural Parameterizations of b-Coloring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 34th International Symposium on Algorithms and Computation, ISAAC 2023, December 3-6, 2023, Kyoto, Japan, pp. 40:1-40:14, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-289-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Jingbang Chen, Meng He 0001, J. Ian Munro, Richard Peng, Kaiyu Wu, Daniel J. Zhang |
Distance Queries over Dynamic Interval Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 34th International Symposium on Algorithms and Computation, ISAAC 2023, December 3-6, 2023, Kyoto, Japan, pp. 18:1-18:19, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-289-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Shuichi Hirahara, Dana Moshkovitz |
Regularization of Low Error PCPs and an Application to MCSP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 34th International Symposium on Algorithms and Computation, ISAAC 2023, December 3-6, 2023, Kyoto, Japan, pp. 39:1-39:16, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-289-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Cornelius Brand, Alexandra Lassota |
Fast Convolutions for Near-Convex Sequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 34th International Symposium on Algorithms and Computation, ISAAC 2023, December 3-6, 2023, Kyoto, Japan, pp. 16:1-16:16, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-289-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Supartha Podder, Penghui Yao, Zekun Ye |
On the Fine-Grained Query Complexity of Symmetric Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 34th International Symposium on Algorithms and Computation, ISAAC 2023, December 3-6, 2023, Kyoto, Japan, pp. 55:1-55:18, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-289-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Joachim Gudmundsson, Zijin Huang, André van Renssen, Sampson Wong |
Computing a Subtrajectory Cluster from c-Packed Trajectories. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 34th International Symposium on Algorithms and Computation, ISAAC 2023, December 3-6, 2023, Kyoto, Japan, pp. 34:1-34:15, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-289-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Edith Elkind |
Group Fairness: From Multiwinner Voting to Participatory Budgeting (Invited Talk). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 34th International Symposium on Algorithms and Computation, ISAAC 2023, December 3-6, 2023, Kyoto, Japan, pp. 1:1-1:3, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-289-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Yusuke Kobayashi 0001, Takashi Noguchi |
An Approximation Algorithm for Two-Edge-Connected Subgraph Problem via Triangle-Free Two-Edge-Cover. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 34th International Symposium on Algorithms and Computation, ISAAC 2023, December 3-6, 2023, Kyoto, Japan, pp. 49:1-49:10, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-289-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Mark de Berg, Andrés López Martínez, Frits C. R. Spieksma |
Finding Diverse Minimum s-t Cuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 34th International Symposium on Algorithms and Computation, ISAAC 2023, December 3-6, 2023, Kyoto, Japan, pp. 24:1-24:17, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-289-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Bart M. P. Jansen, Jari J. H. de Kroon, Michal Wlodarczyk 0001 |
Single-Exponential FPT Algorithms for Enumerating Secluded ℱ-Free Subgraphs and Deleting to Scattered Graph Classes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 34th International Symposium on Algorithms and Computation, ISAAC 2023, December 3-6, 2023, Kyoto, Japan, pp. 42:1-42:18, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-289-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Giannos Stamoulis |
Computing Paths of Large Rank in Planar Frameworks Deterministically. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 34th International Symposium on Algorithms and Computation, ISAAC 2023, December 3-6, 2023, Kyoto, Japan, pp. 32:1-32:15, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-289-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Kei Kimura, Kazuhisa Makino |
A Combinatorial Certifying Algorithm for Linear Programming Problems with Gainfree Leontief Substitution Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 34th International Symposium on Algorithms and Computation, ISAAC 2023, December 3-6, 2023, Kyoto, Japan, pp. 47:1-47:17, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-289-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Bodo Manthey, Jesse van Rhijn |
Improved Smoothed Analysis of 2-Opt for the Euclidean TSP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 34th International Symposium on Algorithms and Computation, ISAAC 2023, December 3-6, 2023, Kyoto, Japan, pp. 52:1-52:16, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-289-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Yann Disser, Nils Mosis |
A Unified Worst Case for Classical Simplex and Policy Iteration Pivot Rules. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 34th International Symposium on Algorithms and Computation, ISAAC 2023, December 3-6, 2023, Kyoto, Japan, pp. 27:1-27:17, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-289-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Liana Khazaliya, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani, Kirill Simonov |
The st-Planar Edge Completion Problem Is Fixed-Parameter Tractable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 34th International Symposium on Algorithms and Computation, ISAAC 2023, December 3-6, 2023, Kyoto, Japan, pp. 46:1-46:13, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-289-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Carl Feghali, Felicia Lucke, Daniël Paulusma, Bernard Ries |
Matching Cuts in Graphs of High Girth and H-Free Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 34th International Symposium on Algorithms and Computation, ISAAC 2023, December 3-6, 2023, Kyoto, Japan, pp. 31:1-31:16, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-289-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Tesshu Hanaka, Hirotaka Ono 0001, Kunihiko Sadakane, Kosuke Sugiyama |
Shortest Beer Path Queries Based on Graph Decomposition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 34th International Symposium on Algorithms and Computation, ISAAC 2023, December 3-6, 2023, Kyoto, Japan, pp. 37:1-37:20, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-289-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Jungho Ahn, Jinha Kim, O-joung Kwon |
Unified Almost Linear Kernels for Generalized Covering and Packing Problems on Nowhere Dense Classes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 34th International Symposium on Algorithms and Computation, ISAAC 2023, December 3-6, 2023, Kyoto, Japan, pp. 5:1-5:19, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-289-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Gang Liu, Haitao Wang 0001 |
On the Line-Separable Unit-Disk Coverage and Related Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 34th International Symposium on Algorithms and Computation, ISAAC 2023, December 3-6, 2023, Kyoto, Japan, pp. 51:1-51:14, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-289-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Tomer Cohen, Ariel Kulik, Hadas Shachnai |
Improved Approximation for Two-Dimensional Vector Multiple Knapsack. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 34th International Symposium on Algorithms and Computation, ISAAC 2023, December 3-6, 2023, Kyoto, Japan, pp. 20:1-20:17, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-289-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Paul W. Lapey, Aaron Williams |
Pop & Push: Ordered Tree Iteration in ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 33rd International Symposium on Algorithms and Computation, ISAAC 2022, December 19-21, 2022, Seoul, Korea., pp. 53:1-53:16, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-258-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Sung-Hwan Kim, Hwan-Gue Cho |
Simple Order-Isomorphic Matching Index with Expected Compact Space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 33rd International Symposium on Algorithms and Computation, ISAAC 2022, December 19-21, 2022, Seoul, Korea., pp. 61:1-61:17, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-258-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Yusuke Kobayashi 0001, Ryoga Mahara |
Proportional Allocation of Indivisible Goods up to the Least Valued Good on Average. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 33rd International Symposium on Algorithms and Computation, ISAAC 2022, December 19-21, 2022, Seoul, Korea., pp. 55:1-55:13, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-258-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Michael A. Bekos, Giordano Da Lozzo, Petr Hlinený, Michael Kaufmann 0001 |
Graph Product Structure for h-Framed Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 33rd International Symposium on Algorithms and Computation, ISAAC 2022, December 19-21, 2022, Seoul, Korea., pp. 23:1-23:15, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-258-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Xiangyu Guo, Kelin Luo, Shi Li 0001, Yuhao Zhang 0001 |
Minimizing the Maximum Flow Time in the Online Food Delivery Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 33rd International Symposium on Algorithms and Computation, ISAAC 2022, December 19-21, 2022, Seoul, Korea., pp. 33:1-33:18, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-258-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Frank Kammer, Johannes Meintrup |
Space-Efficient Graph Coarsening with Applications to Succinct Planar Encodings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 33rd International Symposium on Algorithms and Computation, ISAAC 2022, December 19-21, 2022, Seoul, Korea., pp. 62:1-62:15, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-258-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Yossi Azar, Eldad Peretz, Noam Touitou |
Distortion-Oblivious Algorithms for Scheduling on Multiple Machines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 33rd International Symposium on Algorithms and Computation, ISAAC 2022, December 19-21, 2022, Seoul, Korea., pp. 16:1-16:18, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-258-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Benjamin Qi |
On Maximizing Sums of Non-Monotone Submodular and Linear Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 33rd International Symposium on Algorithms and Computation, ISAAC 2022, December 19-21, 2022, Seoul, Korea., pp. 41:1-41:16, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-258-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Narmina Baghirova, Carolina Lucía Gonzalez, Bernard Ries, David Schindl |
Locally Checkable Problems Parameterized by Clique-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 33rd International Symposium on Algorithms and Computation, ISAAC 2022, December 19-21, 2022, Seoul, Korea., pp. 31:1-31:20, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-258-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Rathish Das, John Iacono, Yakov Nekrich |
External-Memory Dictionaries with Worst-Case Update Cost. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 33rd International Symposium on Algorithms and Computation, ISAAC 2022, December 19-21, 2022, Seoul, Korea., pp. 21:1-21:13, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-258-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Eunou Lee |
Optimizing Quantum Circuit Parameters via SDP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 33rd International Symposium on Algorithms and Computation, ISAAC 2022, December 19-21, 2022, Seoul, Korea., pp. 48:1-48:16, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-258-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Ta-Wei Tu |
Subquadratic Weighted Matroid Intersection Under Rank Oracles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 33rd International Symposium on Algorithms and Computation, ISAAC 2022, December 19-21, 2022, Seoul, Korea., pp. 63:1-63:14, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-258-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Jianqi Zhou, Peihua Li, Jiong Guo |
Parameterized Approximation Algorithms for TSP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 33rd International Symposium on Algorithms and Computation, ISAAC 2022, December 19-21, 2022, Seoul, Korea., pp. 50:1-50:16, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-258-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Kunihiko Sadakane |
Succinct Representations of Graphs (Invited Talk). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 33rd International Symposium on Algorithms and Computation, ISAAC 2022, December 19-21, 2022, Seoul, Korea., pp. 1:1-1:1, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-258-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Dibyayan Chakraborty, Antoine Dailly, Sandip Das 0001, Florent Foucaud, Harmender Gahlawat, Subir Kumar Ghosh |
Complexity and Algorithms for ISOMETRIC PATH COVER on Chordal Graphs and Beyond. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 33rd International Symposium on Algorithms and Computation, ISAAC 2022, December 19-21, 2022, Seoul, Korea., pp. 12:1-12:17, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-258-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Jan Dreier, Nikolas Mählmann, Amer E. Mouawad, Sebastian Siebertz, Alexandre Vigny |
Combinatorial and Algorithmic Aspects of Monadic Stability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 33rd International Symposium on Algorithms and Computation, ISAAC 2022, December 19-21, 2022, Seoul, Korea., pp. 11:1-11:17, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-258-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Sujoy Bhore, Fabian Klute, Maarten Löffler, Martin Nöllenburg, Soeren Terziadis, Anaïs Villedieu |
Minimum Link Fencing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 33rd International Symposium on Algorithms and Computation, ISAAC 2022, December 19-21, 2022, Seoul, Korea., pp. 34:1-34:14, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-258-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Prosenjit Bose, Jean-Lou De Carufel, Thomas C. Shermer |
Pursuit-Evasion in Graphs: Zombies, Lazy Zombies and a Survivor. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 33rd International Symposium on Algorithms and Computation, ISAAC 2022, December 19-21, 2022, Seoul, Korea., pp. 56:1-56:13, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-258-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Artur Ignatiev, Ivan Mihajlin, Alexander Smal |
Super-Cubic Lower Bound for Generalized Karchmer-Wigderson Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 33rd International Symposium on Algorithms and Computation, ISAAC 2022, December 19-21, 2022, Seoul, Korea., pp. 66:1-66:18, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-258-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Vladimir V. Podolskii, Nikolay V. Proskurin |
Polynomial Threshold Functions for Decision Lists. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 33rd International Symposium on Algorithms and Computation, ISAAC 2022, December 19-21, 2022, Seoul, Korea., pp. 52:1-52:12, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-258-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Konstantinos Georgiou, Nikos Giachoudis, Evangelos Kranakis |
Evacuation from a Disk for Robots with Asymmetric Communication. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 33rd International Symposium on Algorithms and Computation, ISAAC 2022, December 19-21, 2022, Seoul, Korea., pp. 19:1-19:16, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-258-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Rathish Das, Meng He 0001, Eitan Kondratovsky, J. Ian Munro, Anurag Murty Naredla, Kaiyu Wu |
Shortest Beer Path Queries in Interval Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 33rd International Symposium on Algorithms and Computation, ISAAC 2022, December 19-21, 2022, Seoul, Korea., pp. 59:1-59:17, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-258-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Pankaj K. Agarwal, Tzvika Geft, Dan Halperin, Erin Taylor 0002 |
Multi-Robot Motion Planning for Unit Discs with Revolving Areas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 33rd International Symposium on Algorithms and Computation, ISAAC 2022, December 19-21, 2022, Seoul, Korea., pp. 35:1-35:20, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-258-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Tatsuya Gima, Yota Otachi |
Extended MSO Model Checking via Small Vertex Integrity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 33rd International Symposium on Algorithms and Computation, ISAAC 2022, December 19-21, 2022, Seoul, Korea., pp. 20:1-20:15, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-258-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Shay Mozes, Nathan Wallheimer, Oren Weimann |
Improved Compression of the Okamura-Seymour Metric. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 33rd International Symposium on Algorithms and Computation, ISAAC 2022, December 19-21, 2022, Seoul, Korea., pp. 27:1-27:19, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-258-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Lisa Hellerstein, Thomas Lidbetter, R. Teal Witter |
A Local Search Algorithm for the Min-Sum Submodular Cover Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 33rd International Symposium on Algorithms and Computation, ISAAC 2022, December 19-21, 2022, Seoul, Korea., pp. 3:1-3:13, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-258-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Maciej Skorski |
Entropy Matters: Understanding Performance of Sparse Random Embeddings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 33rd International Symposium on Algorithms and Computation, ISAAC 2022, December 19-21, 2022, Seoul, Korea., pp. 18:1-18:18, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-258-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Kushagra Chatterjee, Prajakta Nimbhorkar |
Popular Edges with Critical Nodes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 33rd International Symposium on Algorithms and Computation, ISAAC 2022, December 19-21, 2022, Seoul, Korea., pp. 54:1-54:14, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-258-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Akanksha Agrawal 0001, Soumita Hait, Amer E. Mouawad |
On Finding Short Reconfiguration Sequences Between Independent Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 33rd International Symposium on Algorithms and Computation, ISAAC 2022, December 19-21, 2022, Seoul, Korea., pp. 39:1-39:14, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-258-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Kazuyuki Amano |
Integer Complexity and Mixed Binary-Ternary Representation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 33rd International Symposium on Algorithms and Computation, ISAAC 2022, December 19-21, 2022, Seoul, Korea., pp. 29:1-29:16, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-258-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Lily Chung, Erik D. Demaine, Dylan H. Hendrickson, Jayson Lynch |
Lower Bounds on Retroactive Data Structures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 33rd International Symposium on Algorithms and Computation, ISAAC 2022, December 19-21, 2022, Seoul, Korea., pp. 32:1-32:12, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-258-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Sungmin Kim, Sang-Ki Ko, Yo-Sub Han |
Simon's Congruence Pattern Matching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 33rd International Symposium on Algorithms and Computation, ISAAC 2022, December 19-21, 2022, Seoul, Korea., pp. 60:1-60:17, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-258-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Kyle Fox, Thomas Stanley |
Computation of Cycle Bases in Surface Embedded Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 33rd International Symposium on Algorithms and Computation, ISAAC 2022, December 19-21, 2022, Seoul, Korea., pp. 13:1-13:13, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-258-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Sabine Storandt |
Algorithms for Landmark Hub Labeling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 33rd International Symposium on Algorithms and Computation, ISAAC 2022, December 19-21, 2022, Seoul, Korea., pp. 5:1-5:17, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-258-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Naoto Ohsaka |
On the Parameterized Intractability of Determinant Maximization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 33rd International Symposium on Algorithms and Computation, ISAAC 2022, December 19-21, 2022, Seoul, Korea., pp. 46:1-46:16, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-258-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Julián Mestre, Sergey Pupyrev |
Approximating the Minimum Logarithmic Arrangement Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 33rd International Symposium on Algorithms and Computation, ISAAC 2022, December 19-21, 2022, Seoul, Korea., pp. 7:1-7:15, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-258-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Zachary Friggstad, Ramin Mousavi |
Bi-Criteria Approximation Algorithms for Bounded-Degree Subset TSP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 33rd International Symposium on Algorithms and Computation, ISAAC 2022, December 19-21, 2022, Seoul, Korea., pp. 8:1-8:17, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-258-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Soichiro Fujii, Yuni Iwamasa, Kei Kimura, Akira Suzuki |
Algorithms for Coloring Reconfiguration Under Recolorability Digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 33rd International Symposium on Algorithms and Computation, ISAAC 2022, December 19-21, 2022, Seoul, Korea., pp. 4:1-4:19, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-258-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Miriam Münch, Ignaz Rutter, Peter Stumpf |
Partial and Simultaneous Transitive Orientations via Modular Decompositions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 33rd International Symposium on Algorithms and Computation, ISAAC 2022, December 19-21, 2022, Seoul, Korea., pp. 51:1-51:16, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-258-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Junbin Fang, Dominique Unruh, Jun Yan, Dehua Zhou |
How to Base Security on the Perfect/Statistical Binding Property of Quantum Bit Commitment? ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 33rd International Symposium on Algorithms and Computation, ISAAC 2022, December 19-21, 2022, Seoul, Korea., pp. 26:1-26:12, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-258-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Nairen Cao, Jeremy T. Fineman, Shi Li 0001, Julián Mestre, Katina Russell, Seeun William Umboh |
Nested Active-Time Scheduling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 33rd International Symposium on Algorithms and Computation, ISAAC 2022, December 19-21, 2022, Seoul, Korea., pp. 36:1-36:16, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-258-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|