Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
1 | Zachary Friggstad, Chaitanya Swamy |
A Constant-Factor Approximation for Directed Latency in Quasi-Polynomial Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 28th Annual European Symposium on Algorithms, ESA 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference)., pp. 52:1-52:20, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-162-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Shichuan Deng, Jian Li 0015, Yuval Rabani |
Approximation Algorithms for Clustering with Dynamic Points. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 28th Annual European Symposium on Algorithms, ESA 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference)., pp. 37:1-37:15, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-162-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Panagiotis Charalampopoulos, Adam Karczmarz |
Single-Source Shortest Paths and Strong Connectivity in Dynamic Planar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 28th Annual European Symposium on Algorithms, ESA 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference)., pp. 31:1-31:23, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-162-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Siddharth Barman, Umang Bhaskar, Anand Krishna, Ranjani G. Sundaram |
Tight Approximation Algorithms for p-Mean Welfare Under Subadditive Valuations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 28th Annual European Symposium on Algorithms, ESA 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference)., pp. 11:1-11:17, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-162-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Ioannis Panagiotas, Bora Uçar |
Engineering Fast Almost Optimal Algorithms for Bipartite Graph Matching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 28th Annual European Symposium on Algorithms, ESA 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference)., pp. 76:1-76:23, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-162-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Bogdan-Adrian Manghiuc, Pan Peng 0001, He Sun 0001 |
Augmenting the Algebraic Connectivity of Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 28th Annual European Symposium on Algorithms, ESA 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference)., pp. 70:1-70:22, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-162-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Fedor V. Fomin, Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos |
An Algorithmic Meta-Theorem for Graph Modification to Planarity and FOL. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 28th Annual European Symposium on Algorithms, ESA 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference)., pp. 51:1-51:17, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-162-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Yossi Azar, Ashish Chiplunkar, Shay Kutten, Noam Touitou |
Set Cover with Delay - Clairvoyance Is Not Required. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 28th Annual European Symposium on Algorithms, ESA 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference)., pp. 8:1-8:21, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-162-7. 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) |
ESA ![In: 28th Annual European Symposium on Algorithms, ESA 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference)., pp. 0:1-0:20, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-162-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Umut A. Acar, Daniel Anderson, Guy E. Blelloch, Laxman Dhulipala, Sam Westrick |
Parallel Batch-Dynamic Trees via Change Propagation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 28th Annual European Symposium on Algorithms, ESA 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference)., pp. 2:1-2:23, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-162-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Johannes Blum 0001, Sabine Storandt |
Lower Bounds and Approximation Algorithms for Search Space Sizes in Contraction Hierarchies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 28th Annual European Symposium on Algorithms, ESA 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference)., pp. 20:1-20:14, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-162-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Man-Kwun Chiu, Matias Korman, Martin Suderland, Takeshi Tokuyama |
Distance Bounds for High Dimensional Consistent Digital Rays and 2-D Partially-Consistent Digital Rays. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 28th Annual European Symposium on Algorithms, ESA 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference)., pp. 34:1-34:22, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-162-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Daniel Bertschinger, Johannes Lengler, Anders Martinsson, Robert Meier, Angelika Steger, Milos Trujic, Emo Welzl |
An Optimal Decentralized (Δ + 1)-Coloring Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 28th Annual European Symposium on Algorithms, ESA 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference)., pp. 17:1-17:12, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-162-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Eduard Eiben, William Lochet |
A Polynomial Kernel for Line Graph Deletion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 28th Annual European Symposium on Algorithms, ESA 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference)., pp. 42:1-42:15, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-162-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Hanlin Ren |
Improved Distance Sensitivity Oracles with Subcubic Preprocessing Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 28th Annual European Symposium on Algorithms, ESA 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference)., pp. 79:1-79:13, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-162-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Amotz Bar-Noy, Keerti Choudhary, Avi Cohen, David Peleg, Dror Rawitz |
Minimum Neighboring Degree Realization in Graphs and Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 28th Annual European Symposium on Algorithms, ESA 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference)., pp. 10:1-10:15, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-162-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Andreas Emil Feldmann, David Saulpic |
Polynomial Time Approximation Schemes for Clustering in Low Highway Dimension Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 28th Annual European Symposium on Algorithms, ESA 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference)., pp. 46:1-46:22, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-162-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Philipp Schepper |
Fine-Grained Complexity of Regular Expression Pattern Matching and Membership. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 28th Annual European Symposium on Algorithms, ESA 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference)., pp. 80:1-80:20, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-162-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Timothy M. Chan, Qizheng He |
More on Change-Making and Related Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 28th Annual European Symposium on Algorithms, ESA 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference)., pp. 29:1-29:14, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-162-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Karthekeyan Chandrasekaran, Elena Grigorescu, Gabriel Istrate, Shubhang Kulkarni, Young-San Lin, Minshen Zhu |
The Maximum Binary Tree Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 28th Annual European Symposium on Algorithms, ESA 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference)., pp. 30:1-30:22, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-162-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Ramtin Afshar, Michael T. Goodrich, Pedro Matias 0001, Martha C. Osegueda |
Reconstructing Biological and Digital Phylogenetic Trees in Parallel. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 28th Annual European Symposium on Algorithms, ESA 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference)., pp. 3:1-3:24, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-162-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Hu Ding |
A Sub-Linear Time Framework for Geometric Optimization with Outliers in High Dimensions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 28th Annual European Symposium on Algorithms, ESA 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference)., pp. 38:1-38:21, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-162-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi 0001, Haruka Mizuta, Paul Ouvrard, Akira Suzuki, Kunihiro Wasa |
Reconfiguration of Spanning Trees with Many or Few Leaves. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 28th Annual European Symposium on Algorithms, ESA 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference)., pp. 24:1-24:15, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-162-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Gary Hoppenworth, Jason W. Bentley, Daniel Gibney, Sharma V. Thankachan |
The Fine-Grained Complexity of Median and Center String Problems Under Edit Distance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 28th Annual European Symposium on Algorithms, ESA 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference)., pp. 61:1-61:19, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-162-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Monika Henzinger, Alexander Noe, Christian Schulz 0003, Darren Strash |
Finding All Global Minimum Cuts in Practice. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 28th Annual European Symposium on Algorithms, ESA 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference)., pp. 59:1-59:20, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-162-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Jesse Beisegel, Ekkehard Köhler, Robert Scheffler 0001, Martin Strehler 0001 |
Linear Time LexDFS on Chordal Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 28th Annual European Symposium on Algorithms, ESA 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference)., pp. 13:1-13:13, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-162-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Lukasz Kowalik, Shaohua Li 0005, Wojciech Nadara, Marcin Smulewicz, Magnus Wahlström |
Many Visits TSP Revisited. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 28th Annual European Symposium on Algorithms, ESA 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference)., pp. 66:1-66:22, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-162-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Jason W. Bentley, Daniel Gibney, Sharma V. Thankachan |
On the Complexity of BWT-Runs Minimization via Alphabet Reordering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 28th Annual European Symposium on Algorithms, ESA 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference)., pp. 15:1-15:13, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-162-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Ben Strasser, Dorothea Wagner, Tim Zeitz |
Space-Efficient, Fast and Exact Routing in Time-Dependent Road Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 28th Annual European Symposium on Algorithms, ESA 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference)., pp. 81:1-81:14, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-162-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Eva-Maria C. Hols, Stefan Kratsch, Astrid Pieterse |
Approximate Turing Kernelization for Problems Parameterized by Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 28th Annual European Symposium on Algorithms, ESA 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference)., pp. 60:1-60:23, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-162-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Esther M. Arkin, Rathish Das, Jie Gao 0001, Mayank Goswami 0001, Joseph S. B. Mitchell, Valentin Polishchuk, Csaba D. Tóth |
Cutting Polygons into Small Pieces with Chords: Laser-Based Localization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 28th Annual European Symposium on Algorithms, ESA 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference)., pp. 7:1-7:23, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-162-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Lily Li, Aleksandar Nikolov |
On the Computational Complexity of Linear Discrepancy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 28th Annual European Symposium on Algorithms, ESA 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference)., pp. 69:1-69:16, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-162-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Xianghui Zhong |
On the Approximation Ratio of the k-Opt and Lin-Kernighan Algorithm for Metric and Graph TSP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 28th Annual European Symposium on Algorithms, ESA 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference)., pp. 83:1-83:13, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-162-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Friedrich Eisenbrand, Moritz Venzin |
Approximate CVPp in Time 20.802 n. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 28th Annual European Symposium on Algorithms, ESA 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference)., pp. 43:1-43:15, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-162-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Thomas Bläsius, Tobias Friedrich 0001, Martin Schirneck |
The Minimization of Random Hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 28th Annual European Symposium on Algorithms, ESA 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference)., pp. 21:1-21:15, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-162-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Karl Bringmann, Marvin Künnemann, André Nusser |
When Lipschitz Walks Your Dog: Algorithm Engineering of the Discrete Fréchet Distance Under Translation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 28th Annual European Symposium on Algorithms, ESA 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference)., pp. 25:1-25:17, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-162-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Fabrizio Grandoni 0001, Grzegorz Herman, Peter Sanders 0001 (eds.) |
28th Annual European Symposium on Algorithms, ESA 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-162-7 The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
1 | Karolina Okrasa, Marta Piecyk, Pawel Rzazewski |
Full Complexity Classification of the List Homomorphism Problem for Bounded-Treewidth Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 28th Annual European Symposium on Algorithms, ESA 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference)., pp. 74:1-74:24, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-162-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Jan Bok, Nikola Jedlicková, Barnaby Martin, Daniël Paulusma, Siani Smith |
Acyclic, Star and Injective Colouring: A Complexity Picture for H-Free Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 28th Annual European Symposium on Algorithms, ESA 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference)., pp. 22:1-22:22, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-162-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Anup Bhattacharya, Jan Eube, Heiko Röglin, Melanie Schmidt 0001 |
Noisy, Greedy and Not so Greedy k-Means++. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 28th Annual European Symposium on Algorithms, ESA 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference)., pp. 18:1-18:21, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-162-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Tanmay Inamdar 0002, Kasturi R. Varadarajan |
Capacitated Sum-Of-Radii Clustering: An FPT Approximation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 28th Annual European Symposium on Algorithms, ESA 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference)., pp. 62:1-62:17, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-162-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Surender Baswana, Shiv Kumar Gupta 0001, Till Knollmann |
Mincut Sensitivity Data Structures for the Insertion of an Edge. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 28th Annual European Symposium on Algorithms, ESA 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference)., pp. 12:1-12:14, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-162-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Hung Le 0001, Shay Solomon |
Light Euclidean Spanners with Steiner Points. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 28th Annual European Symposium on Algorithms, ESA 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference)., pp. 67:1-67:22, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-162-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Alejandro Flores-Velazco, David M. Mount |
Coresets for the Nearest-Neighbor Rule. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 28th Annual European Symposium on Algorithms, ESA 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference)., pp. 47:1-47:19, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-162-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Eugenio Angriman, Maria Predari, Alexander van der Grinten, Henning Meyerhenke |
Approximation of the Diagonal of a Laplacian's Pseudoinverse for Complex Network Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 28th Annual European Symposium on Algorithms, ESA 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference)., pp. 6:1-6:24, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-162-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Yaron Fairstein, Ariel Kulik, Joseph (Seffi) Naor, Danny Raz, Hadas Shachnai |
A (1-e-1-ε)-Approximation for the Monotone Submodular Multiple Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 28th Annual European Symposium on Algorithms, ESA 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference)., pp. 44:1-44:19, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-162-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Monika Henzinger, Sagar Kale |
Fully-Dynamic Coresets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 28th Annual European Symposium on Algorithms, ESA 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference)., pp. 57:1-57:21, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-162-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Mamadou Moustapha Kanté, Christophe Paul, Dimitrios M. Thilikos |
A Linear Fixed Parameter Tractable Algorithm for Connected Pathwidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 28th Annual European Symposium on Algorithms, ESA 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference)., pp. 64:1-64:16, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-162-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Georg Osang, Mael Rouxel-Labbé, Monique Teillaud |
Generalizing CGAL Periodic Delaunay Triangulations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 28th Annual European Symposium on Algorithms, ESA 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference)., pp. 75:1-75:17, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-162-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Younan Gao, Meng He 0001, Yakov Nekrich |
Fast Preprocessing for Optimal Orthogonal Range Reporting and Range Successor with Applications to Text Indexing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 28th Annual European Symposium on Algorithms, ESA 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference)., pp. 54:1-54:18, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-162-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Chenglin Fan, Benjamin Raichel |
Linear Expected Complexity for Directional and Multiplicative Voronoi Diagrams. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 28th Annual European Symposium on Algorithms, ESA 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference)., pp. 45:1-45:18, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-162-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Amihood Amir, Itai Boneh, Michael Itzhaki, Eitan Kondratovsky |
Analysis of the Period Recovery Error Bound. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 28th Annual European Symposium on Algorithms, ESA 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference)., pp. 5:1-5:21, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-162-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Kevin Buchin, Sariel Har-Peled, Dániel Oláh |
Sometimes Reliable Spanners of Almost Linear Size. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 28th Annual European Symposium on Algorithms, ESA 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference)., pp. 27:1-27:15, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-162-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Zeev Nutov |
Approximating k-Connected m-Dominating Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 28th Annual European Symposium on Algorithms, ESA 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference)., pp. 73:1-73:14, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-162-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Naveen Garg 0001, Nikhil Kumar 0001 |
Dual Half-Integrality for Uncrossable Cut Cover and Its Application to Maximum Half-Integral Flow. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 28th Annual European Symposium on Algorithms, ESA 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference)., pp. 55:1-55:13, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-162-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Tomohiro Koana, Christian Komusiewicz, Frank Sommer |
Exploiting c-Closure in Kernelization Algorithms for Graph Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 28th Annual European Symposium on Algorithms, ESA 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference)., pp. 65:1-65:17, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-162-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Fedor V. Fomin, Petr A. Golovach |
Subexponential Parameterized Algorithms and Kernelization on Almost Chordal Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 28th Annual European Symposium on Algorithms, ESA 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference)., pp. 49:1-49:17, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-162-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Bart M. P. Jansen, Michal Wlodarczyk 0001 |
Optimal Polynomial-Time Compression for Boolean Max CSP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 28th Annual European Symposium on Algorithms, ESA 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference)., pp. 63:1-63:19, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-162-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Franziska Eberle, Nicole Megow, Kevin Schewior |
Optimally Handling Commitment Issues in Online Throughput Maximization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 28th Annual European Symposium on Algorithms, ESA 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference)., pp. 41:1-41:15, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-162-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Rémy Belmonte, Eun Jung Kim 0002, Michael Lampis, Valia Mitsou, Yota Otachi |
Grundy Distinguishes Treewidth from Pathwidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 28th Annual European Symposium on Algorithms, ESA 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference)., pp. 14:1-14:19, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-162-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Jakub Radoszewski, Juliusz Straszynski |
Efficient Computation of 2-Covers of a String. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 28th Annual European Symposium on Algorithms, ESA 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference)., pp. 77:1-77:17, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-162-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Hanrui Zhang |
Improved Prophet Inequalities for Combinatorial Welfare Maximization with (Approximately) Subadditive Agents. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 28th Annual European Symposium on Algorithms, ESA 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference)., pp. 82:1-82:17, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-162-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Sujoy Bhore, Guangping Li 0001, Martin Nöllenburg |
An Algorithmic Study of Fully Dynamic Independent Sets for Map Labeling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 28th Annual European Symposium on Algorithms, ESA 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference)., pp. 19:1-19:24, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-162-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Philipp Czerner, Harald Räcke |
Compact Oblivious Routing in Weighted Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 28th Annual European Symposium on Algorithms, ESA 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference)., pp. 36:1-36:23, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-162-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Petra Berenbrink, David Hammer, Dominik Kaaser, Ulrich Meyer 0001, Manuel Penschuck, Hung Tran |
Simulating Population Protocols in Sub-Constant Time per Interaction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 28th Annual European Symposium on Algorithms, ESA 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference)., pp. 16:1-16:22, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-162-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Fedor V. Fomin, Petr A. Golovach, Pranabendu Misra, M. S. Ramanujan 0001 |
On the Complexity of Recovering Incidence Matrices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 28th Annual European Symposium on Algorithms, ESA 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference)., pp. 50:1-50:13, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-162-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Peter A. Brooksbank, Yinan Li, Youming Qiao, James B. Wilson |
Improved Algorithms for Alternating Matrix Space Isometry: From Theory to Practice. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 28th Annual European Symposium on Algorithms, ESA 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference)., pp. 26:1-26:15, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-162-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Panagiotis Charalampopoulos, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba |
The Number of Repetitions in 2D-Strings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 28th Annual European Symposium on Algorithms, ESA 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference)., pp. 32:1-32:18, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-162-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Dániel Marx, R. B. Sandeep |
Incompressibility of H-Free Edge Modification Problems: Towards a Dichotomy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 28th Annual European Symposium on Algorithms, ESA 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference)., pp. 72:1-72:25, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-162-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Rasmus Pagh, Nina Mesing Stausholm, Mikkel Thorup |
Hardness of Bichromatic Closest Pair with Jaccard Similarity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 27th Annual European Symposium on Algorithms, ESA 2019, September 9-11, 2019, Munich/Garching, Germany., pp. 74:1-74:13, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-124-5. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Vincent Cohen-Addad, Marcin Pilipczuk, Michal Pilipczuk |
Efficient Approximation Schemes for Uniform-Cost Clustering Problems in Planar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 27th Annual European Symposium on Algorithms, ESA 2019, September 9-11, 2019, Munich/Garching, Germany., pp. 33:1-33:14, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-124-5. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Lars Gottesbüren, Michael Hamann, Dorothea Wagner |
Evaluation of a Flow-Based Hypergraph Bipartitioning Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 27th Annual European Symposium on Algorithms, ESA 2019, September 9-11, 2019, Munich/Garching, Germany., pp. 52:1-52:17, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-124-5. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Mees van de Kerkhof, Irina Kostitsyna, Maarten Löffler, Majid Mirzanezhad, Carola Wenk |
Global Curve Simplification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 27th Annual European Symposium on Algorithms, ESA 2019, September 9-11, 2019, Munich/Garching, Germany., pp. 67:1-67:14, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-124-5. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Adam Karczmarz, Jakub Lacki |
Reliable Hubs for Partially-Dynamic All-Pairs Shortest Paths in Directed Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 27th Annual European Symposium on Algorithms, ESA 2019, September 9-11, 2019, Munich/Garching, Germany., pp. 65:1-65:15, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-124-5. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Thomas Bläsius, Tobias Friedrich 0001, Maximilian Katzmann, Ulrich Meyer 0001, Manuel Penschuck, Christopher Weyand |
Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 27th Annual European Symposium on Algorithms, ESA 2019, September 9-11, 2019, Munich/Garching, Germany., pp. 21:1-21:14, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-124-5. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Wojciech Czerwinski, Wojciech Nadara, Marcin Pilipczuk |
Improved Bounds for the Excluded-Minor Approximation of Treedepth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 27th Annual European Symposium on Algorithms, ESA 2019, September 9-11, 2019, Munich/Garching, Germany., pp. 34:1-34:13, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-124-5. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Michael Jünger, Sven Mallach |
Odd-Cycle Separation for Maximum Cut and Binary Quadratic Optimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 27th Annual European Symposium on Algorithms, ESA 2019, September 9-11, 2019, Munich/Garching, Germany., pp. 63:1-63:13, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-124-5. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Moritz Baum, Valentin Buchhold, Jonas Sauer, Dorothea Wagner, Tobias Zündorf |
UnLimited TRAnsfers for Multi-Modal Route Planning: An Efficient Solution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 27th Annual European Symposium on Algorithms, ESA 2019, September 9-11, 2019, Munich/Garching, Germany., pp. 14:1-14:16, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-124-5. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Karl Bringmann, Sándor Kisfaludi-Bak, Michal Pilipczuk, Erik Jan van Leeuwen |
On Geometric Set Cover for Orthants. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 27th Annual European Symposium on Algorithms, ESA 2019, September 9-11, 2019, Munich/Garching, Germany., pp. 26:1-26:18, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-124-5. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Patrick Dinklage, Jonas Ellert, Johannes Fischer 0001, Dominik Köppl, Manuel Penschuck |
Bidirectional Text Compression in External Memory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 27th Annual European Symposium on Algorithms, ESA 2019, September 9-11, 2019, Munich/Garching, Germany., pp. 41:1-41:16, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-124-5. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Benjamin Bergougnoux, Mamadou Moustapha Kanté |
More Applications of the d-Neighbor Equivalence: Connectivity and Acyclicity Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 27th Annual European Symposium on Algorithms, ESA 2019, September 9-11, 2019, Munich/Garching, Germany., pp. 17:1-17:14, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-124-5. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Fabrizio Grandoni 0001, Stefan Kratsch, Andreas Wiese |
Parameterized Approximation Schemes for Independent Set of Rectangles and Geometric Knapsack. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 27th Annual European Symposium on Algorithms, ESA 2019, September 9-11, 2019, Munich/Garching, Germany., pp. 53:1-53:16, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-124-5. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Jean-Daniel Boissonnat, Olivier Devillers, Kunal Dutta, Marc Glisse |
Randomized Incremental Construction of Delaunay Triangulations of Nice Point Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 27th Annual European Symposium on Algorithms, ESA 2019, September 9-11, 2019, Munich/Garching, Germany., pp. 22:1-22:13, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-124-5. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Michael A. Bender, Ola Svensson, Grzegorz Herman (eds.) |
27th Annual European Symposium on Algorithms, ESA 2019, September 9-11, 2019, Munich/Garching, Germany. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-124-5 The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
1 | Loukas Georgiadis, Konstantinos Giannis, Giuseppe F. Italiano, Aikaterini Karanasiou, Luigi Laura |
Dynamic Dominators and Low-High Orders in DAGs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 27th Annual European Symposium on Algorithms, ESA 2019, September 9-11, 2019, Munich/Garching, Germany., pp. 50:1-50:18, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-124-5. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Simon Apers |
Quantum Walk Sampling by Growing Seed Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 27th Annual European Symposium on Algorithms, ESA 2019, September 9-11, 2019, Munich/Garching, Germany., pp. 9:1-9:12, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-124-5. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Roy Schwartz 0002, Ran Yeheskel |
Graph Balancing with Orientation Costs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 27th Annual European Symposium on Algorithms, ESA 2019, September 9-11, 2019, Munich/Garching, Germany., pp. 82:1-82:15, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-124-5. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Tomás Masarík, Irene Muzi, Marcin Pilipczuk, Pawel Rzazewski, Manuel Sorge |
Packing Directed Circuits Quarter-Integrally. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 27th Annual European Symposium on Algorithms, ESA 2019, September 9-11, 2019, Munich/Garching, Germany., pp. 72:1-72:13, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-124-5. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Diodato Ferraioli, Adrian Meier, Paolo Penna, Carmine Ventre |
Obviously Strategyproof Mechanisms for Machine Scheduling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 27th Annual European Symposium on Algorithms, ESA 2019, September 9-11, 2019, Munich/Garching, Germany., pp. 46:1-46:15, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-124-5. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi 0001, Yoshio Okamoto |
Shortest Reconfiguration of Perfect Matchings via Alternating Cycles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 27th Annual European Symposium on Algorithms, ESA 2019, September 9-11, 2019, Munich/Garching, Germany., pp. 61:1-61:15, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-124-5. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Amihood Amir, Itai Boneh, Panagiotis Charalampopoulos, Eitan Kondratovsky |
Repetition Detection in a Dynamic String. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 27th Annual European Symposium on Algorithms, ESA 2019, September 9-11, 2019, Munich/Garching, Germany., pp. 5:1-5:18, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-124-5. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Nicolas Bousquet, Valentin Bartier |
Linear Transformations Between Colorings in Chordal Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 27th Annual European Symposium on Algorithms, ESA 2019, September 9-11, 2019, Munich/Garching, Germany., pp. 24:1-24:15, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-124-5. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Martin Dietzfelbinger, Stefan Walzer |
Dense Peelable Random Uniform Hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 27th Annual European Symposium on Algorithms, ESA 2019, September 9-11, 2019, Munich/Garching, Germany., pp. 38:1-38:16, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-124-5. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Ulrich Bauer, Abhishek Rathod, Jonathan Spreer |
Parametrized Complexity of Expansion Height. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 27th Annual European Symposium on Algorithms, ESA 2019, September 9-11, 2019, Munich/Garching, Germany., pp. 13:1-13:15, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-124-5. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Jurek Czyzowicz, Dariusz Dereniowski, Andrzej Pelc |
Building a Nest by an Automaton. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 27th Annual European Symposium on Algorithms, ESA 2019, September 9-11, 2019, Munich/Garching, Germany., pp. 35:1-35:14, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-124-5. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Yael Hitron, Merav Parter |
Counting to Ten with Two Fingers: Compressed Counting with Spiking Neurons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 27th Annual European Symposium on Algorithms, ESA 2019, September 9-11, 2019, Munich/Garching, Germany., pp. 57:1-57:17, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-124-5. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Haim Kaplan, Katharina Klost, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir |
Triangles and Girth in Disk Graphs and Transmission Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 27th Annual European Symposium on Algorithms, ESA 2019, September 9-11, 2019, Munich/Garching, Germany., pp. 64:1-64:14, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-124-5. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Akshay Krishnamurthy, Arya Mazumdar, Andrew McGregor 0001, Soumyabrata Pal |
Trace Reconstruction: Generalized and Parameterized. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 27th Annual European Symposium on Algorithms, ESA 2019, September 9-11, 2019, Munich/Garching, Germany., pp. 68:1-68:25, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-124-5. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh 0001, Meirav Zehavi |
Going Far From Degeneracy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 27th Annual European Symposium on Algorithms, ESA 2019, September 9-11, 2019, Munich/Garching, Germany., pp. 47:1-47:14, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-124-5. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Antonios Antoniadis 0001, Felix Biermeier, Andrés Cristi, Christoph Damerius, Ruben Hoeksma, Dominik Kaaser, Peter Kling, Lukas Nölke |
On the Complexity of Anchored Rectangle Packing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 27th Annual European Symposium on Algorithms, ESA 2019, September 9-11, 2019, Munich/Garching, Germany., pp. 8:1-8:14, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-124-5. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|