Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
1 | Jean Cardinal, Justin Dallant, John Iacono |
An Instance-Optimal Algorithm for Bichromatic Rectangular Visibility. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference)., pp. 24:1-24:14, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-204-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Simon D. Fink, Matthias Pfretzschner, Ignaz Rutter |
Experimental Comparison of PC-Trees and PQ-Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference)., pp. 43:1-43:13, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-204-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Hu Ding |
Stability Yields Sublinear Time Algorithms for Geometric Optimization in Machine Learning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference)., pp. 38:1-38:19, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-204-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Florian Wörz, Jan-Hendrik Lorenz |
Evidence for Long-Tails in SLS Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference)., pp. 82:1-82:16, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-204-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Alejandro Flores-Velazco, David M. Mount |
Boundary-Sensitive Approach for Approximate Nearest-Neighbor Classification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference)., pp. 44:1-44:15, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-204-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Loukas Georgiadis, Giuseppe F. Italiano, Evangelos Kosinas |
Computing the 4-Edge-Connected Components of a Graph in Linear Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference)., pp. 47:1-47:17, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-204-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Alexander Braun, Matthias Buttkus, Thomas Kesselheim |
Asymptotically Optimal Welfare of Posted Pricing for Multiple Items with MHR Distributions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference)., pp. 22:1-22:16, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-204-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Radu Curticapean, Holger Dell, Thore Husfeldt |
Modular Counting of Subgraphs: Matchings, Matching-Splittable Graphs, and Paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference)., pp. 34:1-34:17, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-204-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Ojas Parekh, Kevin Thompson 0007 |
Beating Random Assignment for Approximating Quantum 2-Local Hamiltonian Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference)., pp. 74:1-74:18, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-204-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Daniel Lokshtanov, Subhash Suri, Jie Xue 0003 |
Efficient Algorithms for Least Square Piecewise Polynomial Regression. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference)., pp. 63:1-63:15, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-204-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Thomas Bläsius, Tobias Friedrich 0001, Maximilian Katzmann |
Efficiently Approximating Vertex Cover on Scale-Free Networks with Underlying Hyperbolic Geometry. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference)., pp. 20:1-20:15, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-204-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Eden Pelleg, Stanislav Zivný |
Additive Sparsification of CSPs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference)., pp. 75:1-75:15, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-204-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Klaus Jansen, Malin Rau |
Closing the Gap for Single Resource Constraint Scheduling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference)., pp. 53:1-53:15, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-204-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Claire Mathieu, Hang Zhou 0001 |
A Simple Algorithm for Graph Reconstruction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference)., pp. 68:1-68:18, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-204-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Yishu Wang 0002, Arnaud Mary, Marie-France Sagot, Blerina Sinaimeri |
A General Framework for Enumerating Equivalence Classes of Solutions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference)., pp. 80:1-80:14, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-204-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Michael A. Bender, Tsvi Kopelowitz, William Kuszmaul, Ely Porat, Clifford Stein 0001 |
Incremental Edge Orientation in Forests. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference)., pp. 12:1-12:18, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-204-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Karthekeyan Chandrasekaran, Weihang Wang 0002 |
ℓp-Norm Multiway Cut. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference)., pp. 29:1-29:15, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-204-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Fabrizio Grandoni 0001, Tobias Mömke, Andreas Wiese |
Faster (1+ε)-Approximation for Unsplittable Flow on a Path via Resource Augmentation and Back. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference)., pp. 49:1-49:15, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-204-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | |
Front Matter, Table of Contents, Preface, Conference Organization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference)., pp. 0:1-0:20, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-204-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Sepehr Assadi, Deeparnab Chakrabarty, Sanjeev Khanna |
Graph Connectivity and Single Element Recovery via Linear and OR Queries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference)., pp. 7:1-7:19, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-204-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Lin Chen, Hossein Esfandiari, Gang Fu, Vahab S. Mirrokni, Qian Yu |
Feature Cross Search via Submodular Optimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference)., pp. 31:1-31:16, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-204-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Daniel Dadush, Zhuan Khye Koh, Bento Natura, László A. Végh |
An Accelerated Newton-Dinkelbach Method and Its Application to Two Variables per Inequality Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference)., pp. 36:1-36:15, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-204-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Hendrik Fichtenberger, Monika Henzinger, Lara Ost |
Differentially Private Algorithms for Graphs Under Continual Observation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference)., pp. 42:1-42:16, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-204-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Grigorios Loukides, Solon P. Pissis |
Bidirectional String Anchors: A New String Sampling Mechanism. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference)., pp. 64:1-64:21, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-204-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Kolja Junginger, Ioannis Mantas, Evanthia Papadopoulou, Martin Suderland, Chee Yap |
Certified Approximation Algorithms for the Fermat Point and n-Ellipses. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference)., pp. 54:1-54:19, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-204-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Thomas Bläsius, Tobias Friedrich 0001, Christopher Weyand |
Efficiently Computing Maximum Flows in Scale-Free Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference)., pp. 21:1-21:14, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-204-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Yaron Fairstein, Ariel Kulik, Hadas Shachnai |
Modular and Submodular Optimization with Multiple Knapsack Constraints via Fractional Grouping. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference)., pp. 41:1-41:16, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-204-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Wojciech Nadara, Mateusz Radecki, Marcin Smulewicz, Marek Sokolowski 0001 |
Determining 4-Edge-Connected Components in Linear Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference)., pp. 71:1-71:15, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-204-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Ryoga Mahara |
Extension of Additive Valuations to General Valuations on the Existence of EFX. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference)., pp. 66:1-66:15, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-204-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Yassine Hamoudi |
Quantum Sub-Gaussian Mean Estimator. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference)., pp. 50:1-50:17, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-204-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Zdenek Dvorák 0001, Abhiruk Lahiri |
Approximation Schemes for Bounded Distance Problems on Fractionally Treewidth-Fragile Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference)., pp. 40:1-40:10, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-204-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Pavel Dvorák, Michal Koucký 0001, Karel Král 0002, Veronika Slívová |
Data Structures Lower Bounds and Popular Conjectures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference)., pp. 39:1-39:15, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-204-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Jasper C. H. Lee, Jerry Li 0001, Christopher Musco, Jeff M. Phillips, Wai Ming Tai |
Finding an Approximate Mode of a Kernel Density Estimate. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference)., pp. 61:1-61:19, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-204-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Markus Anders, Pascal Schweitzer |
Parallel Computation of Combinatorial Symmetries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference)., pp. 6:1-6:18, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-204-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Moses Ganardi |
Compression by Contracting Straight-Line Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference)., pp. 45:1-45:16, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-204-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Sujoy Bhore, Csaba D. Tóth |
Online Euclidean Spanners. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference)., pp. 16:1-16:19, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-204-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Marvin Williams, Peter Sanders 0001, Roman Dementiev |
Engineering MultiQueues: Fast Relaxed Concurrent Priority Queues. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference)., pp. 81:1-81:17, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-204-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Aaron Roth 0001 |
A User Friendly Power Tool for Deriving Online Learning Algorithms (Invited Talk). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference)., pp. 2:1-2:1, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-204-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Guillaume Sagnol, Daniel Schmidt genannt Waldschmidt |
Restricted Adaptivity in Stochastic Scheduling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference)., pp. 79:1-79:14, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-204-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Zhiyang He, Jason Li 0006, Magnus Wahlström |
Near-Linear-Time, Optimal Vertex Cut Sparsifiers in Directed Acyclic Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference)., pp. 52:1-52:14, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-204-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Thomas Bläsius, Simon D. Fink, Ignaz Rutter |
Synchronized Planarity with Applications to Constrained Planarity Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference)., pp. 19:1-19:14, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-204-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Anna Lubiw, Anurag Murty Naredla |
The Visibility Center of a Simple Polygon. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference)., pp. 65:1-65:14, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-204-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Marilena Leichter, Benjamin Moseley, Kirk Pruhs |
An Efficient Reduction of a Gammoid to a Partition Matroid. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference)., pp. 62:1-62:13, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-204-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | M. S. Ramanujan 0001 |
On Approximate Compressions for Connected Minor-Hitting Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference)., pp. 78:1-78:16, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-204-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Timothy M. Chan, Zhengcheng Huang |
Dynamic Colored Orthogonal Range Searching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference)., pp. 28:1-28:13, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-204-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Mark de Berg, Morteza Monemizadeh, Yu Zhong |
k-Center Clustering with Outliers in the Sliding-Window Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference)., pp. 13:1-13:13, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-204-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Jørgen Bang-Jensen, Kristine Vitting Klinkby, Saket Saurabh 0001 |
k-Distinct Branchings Admits a Polynomial Kernel. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference)., pp. 11:1-11:15, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-204-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Lars Gottesbüren, Tobias Heuer, Peter Sanders 0001, Christian Schulz 0003, Daniel Seemaier |
Deep Multilevel Graph Partitioning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference)., pp. 48:1-48:17, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-204-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Krzysztof Potepa |
Faster Deterministic Modular Subset Sum. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference)., pp. 76:1-76:16, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-204-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Panagiotis Charalampopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski |
Faster Algorithms for Longest Common Substring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference)., pp. 30:1-30:17, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-204-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | David J. Lee, Samuel McCauley, Shikha Singh 0002, Max Stein |
Telescoping Filter: A Practical Adaptive Filter. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference)., pp. 60:1-60:18, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-204-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | J. Ian Munro, Patrick K. Nicholson, Louisa Seelbach Benkner, Sebastian Wild |
Hypersuccinct Trees - New Universal Tree Source Codes for Optimal Compressed Tree Data Structures and Range Minima. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference)., pp. 70:1-70:18, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-204-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | David Caballero, Timothy Gomez, Robert T. Schweller, Tim Wylie |
Covert Computation in Staged Self-Assembly: Verification Is PSPACE-Complete. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference)., pp. 23:1-23:18, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-204-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | William Maxwell, Amir Nayyeri |
Generalized Max-Flows and Min-Cuts in Simplicial Complexes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference)., pp. 69:1-69:16, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-204-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Daniel Neuen |
Isomorphism Testing Parameterized by Genus and Beyond. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference)., pp. 72:1-72:18, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-204-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Lukas Glomb, Benno Hoch, Frauke Liers, Florian Rösel |
Network Planning and Routing Problems over Time: Models, Complexity and Algorithms (Invited Talk). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference)., pp. 1:1-1:3, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-204-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Leon Kellerhals, Malte Renken, Philipp Zschoche |
Parameterized Algorithms for Diverse Multistage Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference)., pp. 55:1-55:17, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-204-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Benoît Larose, Petar Markovic, Barnaby Martin, Daniël Paulusma, Siani Smith, Stanislav Zivný |
QCSP on Reflexive Tournaments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference)., pp. 58:1-58:15, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-204-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Katarzyna Paluch 0001, Mateusz Wasylkiewicz |
Restricted t-Matchings via Half-Edges. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference)., pp. 73:1-73:17, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-204-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Sariel Har-Peled, Timothy Zhou |
Improved Approximation Algorithms for Tverberg Partitions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference)., pp. 51:1-51:15, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-204-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Carlos Alegría, Ioannis Mantas, Evanthia Papadopoulou, Marko Savic, Hendrik Schrezenmaier, Carlos Seara, Martin Suderland |
The Voronoi Diagram of Rotating Rays With applications to Floodlight Illumination. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference)., pp. 5:1-5:16, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-204-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Petra Mutzel, Rasmus Pagh, Grzegorz Herman (eds.) |
29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-204-4 The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
1 | Tomás Martínez-Muñoz, Andreas Wiese |
FPT and FPT-Approximation Algorithms for Unsplittable Flow on Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference)., pp. 67:1-67:15, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-204-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Dominik Kempa, Ben Langmead |
Fast and Space-Efficient Construction of AVL Grammars from the LZ77 Parsing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference)., pp. 56:1-56:14, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-204-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Therese Biedl, Anna Lubiw, Anurag Murty Naredla, Peter Dominik Ralbovsky, Graeme Stroud |
Distant Representatives for Rectangles in the Plane. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference)., pp. 17:1-17:18, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-204-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Nikhil Ayyadevara, Ashish Chiplunkar |
The Randomized Competitive Ratio of Weighted k-Server Is at Least Exponential. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference)., pp. 9:1-9:11, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-204-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Thomas Lavastida, Benjamin Moseley, R. Ravi 0001, Chenyang Xu 0002 |
Learnable and Instance-Robust Predictions for Online Matching, Flows and Load Balancing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference)., pp. 59:1-59:17, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-204-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Marek Cygan, Alexander S. Kulikov, Ivan Mihajlin, Maksim Nikolaev, Grigory Reznikov |
Minimum Common String Partition: Exact Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference)., pp. 35:1-35:16, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-204-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Jean Cardinal, John Iacono, Grigorios Koumoutsos |
Worst-Case Efficient Dynamic Geometric Independent Set. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference)., pp. 25:1-25:15, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-204-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Michal Debski, Marta Piecyk, Pawel Rzazewski |
Faster 3-Coloring of Small-Diameter Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference)., pp. 37:1-37:15, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-204-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Sepehr Assadi, Shay Solomon |
Fully Dynamic Set Cover via Hypergraph Maximal Matching: An Optimal Approximation Through a Local Approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference)., pp. 8:1-8:18, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-204-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Davide Bilò, Sarel Cohen, Tobias Friedrich 0001, Martin Schirneck |
Near-Optimal Deterministic Single-Source Distance Sensitivity Oracles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference)., pp. 18:1-18:17, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-204-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Katrin Casel, Tobias Friedrich 0001, Davis Issac, Aikaterini Niklanovits, Ziena Zeif |
Balanced Crown Decomposition for Connectivity Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference)., pp. 26:1-26:15, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-204-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Evripidis Bampis, Christoph Dürr, Thomas Erlebach, Murilo Santos de Lima, Nicole Megow, Jens Schlöter |
Orienting (Hyper)graphs Under Explorable Stochastic Uncertainty. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference)., pp. 10:1-10:18, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-204-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba |
Hardness of Detecting Abelian and Additive Square Factors in Strings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference)., pp. 77:1-77:19, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-204-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Boris Klemz |
Convex Drawings of Hierarchical Graphs in Linear Time, with Applications to Planar Graph Morphing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference)., pp. 57:1-57:15, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-204-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Timothy M. Chan |
All-Pairs Shortest Paths for Real-Weighted Undirected Graphs with Small Additive Error. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference)., pp. 27:1-27:9, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-204-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Aaron Bernstein, Aditi Dudeja, Seth Pettie |
Incremental SCC Maintenance in Sparse Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference)., pp. 14:1-14:16, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-204-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Jana Cslovjecsek, Friedrich Eisenbrand, Michal Pilipczuk, Moritz Venzin, Robert Weismantel |
Efficient Sequential and Parallel Algorithms for Multistage Stochastic Integer Programming Using Proximity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference)., pp. 33:1-33:14, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-204-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Maor Akav, Liam Roditty |
A Unified Approach for All Pairs Approximate Shortest Paths in Weighted Undirected Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference)., pp. 4:1-4:18, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-204-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Younan Gao, Meng He 0001 |
Space Efficient Two-Dimensional Orthogonal Colored Range Counting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference)., pp. 46:1-46:17, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-204-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Saman Ahmadi, Guido Tack, Daniel Harabor, Philip Kilby |
Bi-Objective Search with Bi-Directional A. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference)., pp. 3:1-3:15, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-204-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Éric Colin de Verdière, Thomas Magnard |
An FPT Algorithm for the Embeddability of Graphs into Two-Dimensional Simplicial Complexes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference)., pp. 32:1-32:17, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-204-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Nico Bertram, Jonas Ellert, Johannes Fischer 0001 |
Lyndon Words Accelerate Suffix Sorting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference)., pp. 15:1-15:13, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-204-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Fedor V. Fomin, Petr A. Golovach |
Kernelization of Whitney Switches. ![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. 48:1-48: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 | Victor Lecomte, Omri Weinstein |
Settling the Relationship Between Wilber's Bounds for Dynamic Optimality. ![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. 68:1-68: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 | Parinya Chalermsook, Wanchote Po Jiamjitrak |
New Binary Search Tree Bounds via Geometric Inversions. ![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. 28:1-28: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 | Lin Chen 0009, Martin Koutecký, Lei Xu 0012, Weidong Shi |
New Bounds on Augmenting Steps of Block-Structured Integer Programs. ![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. 33:1-33: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 | A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi, Joseph S. B. Mitchell |
Planar Bichromatic Bottleneck Spanning 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. 1:1-1: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 | Martin Held, Stefan de Lorenzo |
An Efficient, Practical Algorithm and Implementation for Computing Multiplicatively Weighted 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. 56:1-56: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 | Dániel Marx |
Chordless Cycle Packing Is Fixed-Parameter Tractable. ![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. 71:1-71: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, Shahbaz Khan 0004, Richard Paul, Christian Schulz 0003 |
Dynamic Matching Algorithms 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. 58:1-58: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 | Maria Chudnovsky, Jason King, Michal Pilipczuk, Pawel Rzazewski, Sophie Spirkl |
Finding Large H-Colorable Subgraphs in Hereditary Graph Classes. ![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. 35:1-35: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 | Abu Reyan Ahmed, Faryad Darabi Sahneh, Keaton Hamm, Stephen G. Kobourov, Richard Spence |
Kruskal-Based Approximation Algorithm for the Multi-Level Steiner 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. 4:1-4: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 | Édouard Bonnet, Stéphan Thomassé, Xuan Thang Tran, Rémi Watrigant |
An Algorithmic Weakening of the Erdős-Hajnal Conjecture. ![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. 23:1-23: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 | Jan Dreier, Philipp Kuinke, Peter Rossmanith |
First-Order Model-Checking in Random Graphs and Complex 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. 40:1-40: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 | Patrick Dinklage, Johannes Fischer 0001, Alexander Herlez, Tomasz Kociumaka, Florian Kurpicz |
Practical Performance of Space Efficient Data Structures for Longest Common Extensions. ![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. 39:1-39: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 | Henry Förster, Michael Kaufmann 0001 |
On Compact RAC Drawings. ![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. 53:1-53: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 | Sayan Bandyapadhyay |
Improved Bounds for Metric Capacitated Covering 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. 9:1-9: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 | Rajiv Raman 0001, Saurabh Ray |
Improved Approximation Algorithm for Set Multicover with Non-Piercing Regions. ![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. 78:1-78: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 |
|