Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
1 | Fabrice Lécuyer, Louis Jachiet, Clémence Magnien, Lionel Tabourier |
Tailored vertex ordering for faster triangle listing in large graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2023, Florence, Italy, January 22-23, 2023, pp. 77-85, 2023, SIAM, 978-1-61197-756-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Florian Kurpicz, Hans-Peter Lehmann, Peter Sanders 0001 |
PaCHash: Packed and Compressed Hash Tables. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2023, Florence, Italy, January 22-23, 2023, pp. 162-175, 2023, SIAM, 978-1-61197-756-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Ivan Khomutovskiy, Rebekka Dunker, Jessica Dierking, Julian Egbert, Christian Helms, Finn Schöllkopf, Katrin Casel, Philipp Fischbeck, Tobias Friedrich 0001, Davis Issac, Simon Krogmann, Pascal Lenzner |
Applying Skeletons to Speed Up the Arc-Flags Routing Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2023, Florence, Italy, January 22-23, 2023, pp. 110-122, 2023, SIAM, 978-1-61197-756-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Daniel Allendorf, Ulrich Meyer 0001, Manuel Penschuck, Hung Tran |
Parallel and I/O-Efficient Algorithms for Non-Linear Preferential Attachment. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2023, Florence, Italy, January 22-23, 2023, pp. 65-76, 2023, SIAM, 978-1-61197-756-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Ángel Javier Alonso, Michael Kerber, Siddharth Pritam |
Filtration-Domination in Bifiltered Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2023, Florence, Italy, January 22-23, 2023, pp. 27-38, 2023, SIAM, 978-1-61197-756-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Sándor P. Fekete, Dominik Krupke, Michael Perk, Christian Rieck, Christian Scheffer |
A Closer Cut: Computing Near-Optimal Lawn Mowing Tours. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2023, Florence, Italy, January 22-23, 2023, pp. 1-14, 2023, SIAM, 978-1-61197-756-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Maximilian Böther, Otto Kißig, Christopher Weyand |
Efficiently Computing Directed Minimum Spanning Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2023, Florence, Italy, January 22-23, 2023, pp. 86-95, 2023, SIAM, 978-1-61197-756-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Rajan Shankar, Jonathan Spreer |
A Uniform Sampling Procedure for Abstract Triangulations of Surfaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2023, Florence, Italy, January 22-23, 2023, pp. 15-26, 2023, SIAM, 978-1-61197-756-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Shion Fukuzawa, Christopher Ho, Sandy Irani, Jasen Zion |
Modified Iterative Quantum Amplitude Estimation is Asymptotically Optimal. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2023, Florence, Italy, January 22-23, 2023, pp. 135-147, 2023, SIAM, 978-1-61197-756-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Brian Wheatman, Randal C. Burns, Aydin Buluç, Helen Xu 0001 |
Optimizing Search Layouts in Packed Memory Arrays. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2023, Florence, Italy, January 22-23, 2023, pp. 148-161, 2023, SIAM, 978-1-61197-756-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Gonzalo Navarro 0001, Julian Shun (eds.) |
Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2023, Florence, Italy, January 22-23, 2023 ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![SIAM, 978-1-61197-756-1 The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | William Cawley Gelling, Markus E. Nebel, Benjamin Smith, Sebastian Wild |
Multiway Powersort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2023, Florence, Italy, January 22-23, 2023, pp. 190-200, 2023, SIAM, 978-1-61197-756-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Timon Behr, Sabine Storandt |
Lossy Reduction Rules for the Directed Feedback Vertex Set Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2023, Florence, Italy, January 22-23, 2023, pp. 53-64, 2023, SIAM, 978-1-61197-756-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Aaron Hong, Massimiliano Rossi 0001, Christina Boucher |
LZ77 via Prefix-Free Parsing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2023, Florence, Italy, January 22-23, 2023, pp. 123-134, 2023, SIAM, 978-1-61197-756-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Rafael Kiesel, André Schidler |
A Dynamic MaxSAT-based Approach to Directed Feedback Vertex Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2023, Florence, Italy, January 22-23, 2023, pp. 39-52, 2023, SIAM, 978-1-61197-756-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Hans-Peter Lehmann, Peter Sanders 0001, Stefan Walzer |
SicHash - Small Irregular Cuckoo Tables for Perfect Hashing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2023, Florence, Italy, January 22-23, 2023, pp. 176-189, 2023, SIAM, 978-1-61197-756-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Adil Chhabra, Marcelo Fonseca Faraj, Christian Schulz 0003 |
Local Motif Clustering via (Hyper)Graph Partitioning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2023, Florence, Italy, January 22-23, 2023, pp. 96-109, 2023, SIAM, 978-1-61197-756-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Florian Stober, Armin Weiß |
Lower Bounds for Sorting 16, 17, and 18 Elements. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2023, Florence, Italy, January 22-23, 2023, pp. 201-213, 2023, SIAM, 978-1-61197-756-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | André Schidler, Stefan Szeider |
A SAT Approach to Twin-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2022, Alexandria, VA, USA, January 9-10, 2022, pp. 67-77, 2022, SIAM, 978-1-61197-704-2. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Guy E. Blelloch, Magdalen Dobson |
Parallel Nearest Neighbors in Low Dimensions with Batch Updates. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2022, Alexandria, VA, USA, January 9-10, 2022, pp. 195-208, 2022, SIAM, 978-1-61197-704-2. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Thomas Bläsius, Tobias Friedrich 0001, David Stangl, Christopher Weyand |
An Efficient Branch-and-Bound Solver for Hitting Set. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2022, Alexandria, VA, USA, January 9-10, 2022, pp. 209-220, 2022, SIAM, 978-1-61197-704-2. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Dena Tayebi, Saurabh Ray, Deepak Ajwani |
Learning to Prune Instances of k-median and Related Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2022, Alexandria, VA, USA, January 9-10, 2022, pp. 184-194, 2022, SIAM, 978-1-61197-704-2. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | David Coudert, André Nusser, Laurent Viennot |
Computing Graph Hyperbolicity Using Dominating Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2022, Alexandria, VA, USA, January 9-10, 2022, pp. 78-90, 2022, SIAM, 978-1-61197-704-2. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Monika Henzinger, Alexander Noe, Christian Schulz 0003 |
Practical Fully Dynamic Minimum Cut Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2022, Alexandria, VA, USA, January 9-10, 2022, pp. 13-26, 2022, SIAM, 978-1-61197-704-2. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Daniel Allendorf, Ulrich Meyer 0001, Manuel Penschuck, Hung Tran, Nick Wormald |
Engineering Uniform Sampling of Graphs with a Prescribed Power-law Degree Sequence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2022, Alexandria, VA, USA, January 9-10, 2022, pp. 27-40, 2022, SIAM, 978-1-61197-704-2. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Tamal K. Dey, Simon Zhang |
Approximating 1-Wasserstein Distance between Persistence Diagrams by Graph Sparsification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2022, Alexandria, VA, USA, January 9-10, 2022, pp. 169-183, 2022, SIAM, 978-1-61197-704-2. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Moritz Potthoff, Jonas Sauer |
Fast Multimodal Journey Planning for Three Criteria. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2022, Alexandria, VA, USA, January 9-10, 2022, pp. 145-157, 2022, SIAM, 978-1-61197-704-2. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Jonas Charfreitag, Michael Jünger, Sven Mallach, Petra Mutzel |
McSparse: Exact Solutions of Sparse Maximum Cut and Sparse Unconstrained Binary Quadratic Optimization Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2022, Alexandria, VA, USA, January 9-10, 2022, pp. 54-66, 2022, SIAM, 978-1-61197-704-2. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Emil Biju, Sundar Raman P. |
Perturbation Analysis of Practical Algorithms for the Maximum Scatter Travelling Salesman Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2022, Alexandria, VA, USA, January 9-10, 2022, pp. 158-168, 2022, SIAM, 978-1-61197-704-2. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Daniel Bahrdt, Stefan Funke, Sokol Makolli, Claudius Proissl |
Distance Closures: Unifying Search- and Lookup-based Shortest Path Speedup Techniques. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2022, Alexandria, VA, USA, January 9-10, 2022, pp. 1-12, 2022, SIAM, 978-1-61197-704-2. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Sebastian Berndt 0001, Max A. Deppert, Klaus Jansen, Lars Rohwedder |
Load Balancing: The Long Road from Theory to Practice. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2022, Alexandria, VA, USA, January 9-10, 2022, pp. 104-116, 2022, SIAM, 978-1-61197-704-2. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Lars Gottesbüren, Tobias Heuer, Peter Sanders 0001, Sebastian Schlag |
Shared-Memory n-level Hypergraph Partitioning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2022, Alexandria, VA, USA, January 9-10, 2022, pp. 131-144, 2022, SIAM, 978-1-61197-704-2. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Darren Strash, Louise Thompson |
Effective Data Reduction for the Vertex Clique Cover Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2022, Alexandria, VA, USA, January 9-10, 2022, pp. 41-53, 2022, SIAM, 978-1-61197-704-2. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Leszek Gasieniec, Benjamin Smith, Sebastian Wild |
Towards the 5/6-Density Conjecture of Pinwheel Scheduling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2022, Alexandria, VA, USA, January 9-10, 2022, pp. 91-103, 2022, SIAM, 978-1-61197-704-2. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Yifan Xu 0007, Anchengcheng Zhou, Grace Q. Yin, Kunal Agrawal, I-Ting Angelina Lee, Tao B. Schardl |
Efficient Access History for Race Detection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2022, Alexandria, VA, USA, January 9-10, 2022, pp. 117-130, 2022, SIAM, 978-1-61197-704-2. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Cynthia A. Phillips, Bettina Speckmann (eds.) |
Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2022, Alexandria, VA, USA, January 9-10, 2022 ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![SIAM, 978-1-61197-704-2 The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | |
Front Matter. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2022, Alexandria, VA, USA, January 9-10, 2022, pp. i-iii, 2022, SIAM, 978-1-61197-704-2. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Lars Gottesbüren, Tobias Heuer, Peter Sanders 0001, Sebastian Schlag |
Scalable Shared-Memory Hypergraph Partitioning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2021, Virtual Conference, January 10-11, 2021, pp. 16-30, 2021, SIAM, 978-1-61197-647-2. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Rick Plachetta, Alexander van der Grinten |
SAT-and-Reduce for Vertex Cover: Accelerating Branch-and-Reduce by SAT Solving. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2021, Virtual Conference, January 10-11, 2021, pp. 169-180, 2021, SIAM, 978-1-61197-647-2. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Alexander Gellner, Sebastian Lamm, Christian Schulz 0003, Darren Strash, Bogdán Zaválnij |
Boosting Data Reduction for the Maximum Weight Independent Set Problem Using Increasing Transformations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2021, Virtual Conference, January 10-11, 2021, pp. 128-142, 2021, SIAM, 978-1-61197-647-2. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Clément Maria, Owen Rouillé |
Computation of Large Asymptotics of 3-Manifold Quantum Invariants. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2021, Virtual Conference, January 10-11, 2021, pp. 193-206, 2021, SIAM, 978-1-61197-647-2. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Gramoz Goranci, Monika Henzinger, Dariusz Leniowski, Christian Schulz 0003, Alexander Svozil |
Fully Dynamic k-Center Clustering in Low Dimensional Metrics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2021, Virtual Conference, January 10-11, 2021, pp. 143-153, 2021, SIAM, 978-1-61197-647-2. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Michael Kerber, Alexander Rolle |
Fast Minimal Presentations of Bi-graded Persistence Modules. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2021, Virtual Conference, January 10-11, 2021, pp. 207-220, 2021, SIAM, 978-1-61197-647-2. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Markus Anders, Pascal Schweitzer |
Engineering a Fast Probabilistic Isomorphism Test. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2021, Virtual Conference, January 10-11, 2021, pp. 73-84, 2021, SIAM, 978-1-61197-647-2. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Loukas Georgiadis, Dionysios Kefallinos, Luigi Laura, Nikos Parotsidis |
An Experimental Study of Algorithms for Computing the Edge Connectivity of a Directed Graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2021, Virtual Conference, January 10-11, 2021, pp. 85-97, 2021, SIAM, 978-1-61197-647-2. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Antonio Boffa, Paolo Ferragina, Giorgio Vinciguerra |
A "Learned" Approach to Quicken and Compress Rank/Select Dictionaries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2021, Virtual Conference, January 10-11, 2021, pp. 46-59, 2021, SIAM, 978-1-61197-647-2. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Eugenio Angriman, Ruben Becker, Gianlorenzo D'Angelo, Hugo Gilbert, Alexander van der Grinten, Henning Meyerhenke |
Group-Harmonic and Group-Closeness Maximization - Approximation and Engineering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2021, Virtual Conference, January 10-11, 2021, pp. 154-168, 2021, SIAM, 978-1-61197-647-2. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Brian Wheatman, Helen Xu 0001 |
A Parallel Packed Memory Array to Store Dynamic Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2021, Virtual Conference, January 10-11, 2021, pp. 31-45, 2021, SIAM, 978-1-61197-647-2. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Martin Farach-Colton, Sabine Storandt (eds.) |
Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2021, Virtual Conference, January 10-11, 2021 ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![SIAM, 978-1-61197-647-2 The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Michael Barlow, Christian Konrad 0001, Charana Nandasena |
Streaming Set Cover in Practice. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2021, Virtual Conference, January 10-11, 2021, pp. 181-192, 2021, SIAM, 978-1-61197-647-2. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Christina Boucher, Ondrej Cvacho, Travis Gagie, Jan Holub 0001, Giovanni Manzini, Gonzalo Navarro 0001, Massimiliano Rossi 0001 |
PFP Compressed Suffix Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2021, Virtual Conference, January 10-11, 2021, pp. 60-72, 2021, SIAM, 978-1-61197-647-2. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Wolfgang Ost, Christian Schulz 0003, Darren Strash |
Engineering Data Reduction for Nested Dissection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2021, Virtual Conference, January 10-11, 2021, pp. 113-127, 2021, SIAM, 978-1-61197-647-2. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Merten Popp, Sebastian Schlag, Christian Schulz 0003, Daniel Seemaier |
Multilevel Acyclic Hypergraph Partitioning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2021, Virtual Conference, January 10-11, 2021, pp. 1-15, 2021, SIAM, 978-1-61197-647-2. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Valentin Buchhold, Peter Sanders 0001, Dorothea Wagner |
Fast, Exact and Scalable Dynamic Ridesharing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2021, Virtual Conference, January 10-11, 2021, pp. 98-112, 2021, SIAM, 978-1-61197-647-2. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Patrick Dinklage, Johannes Fischer 0001, Florian Kurpicz |
Constructing the Wavelet Tree and Wavelet Matrix in Distributed Memory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2020, Salt Lake City, UT, USA, January 5-6, 2020., pp. 214-228, 2020, SIAM, 978-1-61197-600-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Kamer Kaya, Johannes Langguth, Ioannis Panagiotas, Bora Uçar |
Karp-Sipser based kernels for bipartite graph matching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2020, Salt Lake City, UT, USA, January 5-6, 2020., pp. 134-145, 2020, SIAM, 978-1-61197-600-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Jens Zentgraf, Henning Timm, Sven Rahmann |
Cost-optimal assignment of elements in genome-scale multi-way bucketed Cuckoo hash tables. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2020, Salt Lake City, UT, USA, January 5-6, 2020., pp. 186-198, 2020, SIAM, 978-1-61197-600-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Lukas Barth, Dorothea Wagner |
Engineering Top-Down Weight-Balanced Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2020, Salt Lake City, UT, USA, January 5-6, 2020., pp. 161-174, 2020, SIAM, 978-1-61197-600-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Moritz Beck 0001, Sabine Storandt |
Puzzling Grid Embeddings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2020, Salt Lake City, UT, USA, January 5-6, 2020., pp. 94-105, 2020, SIAM, 978-1-61197-600-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Christian Komusiewicz, Frank Sommer |
FixCon: A Generic Solver for Fixed-Cardinality Subgraph Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2020, Salt Lake City, UT, USA, January 5-6, 2020., pp. 12-26, 2020, SIAM, 978-1-61197-600-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Brian Lavallee, Hayley Russell, Blair D. Sullivan, Andrew van der Poel |
Approximating Vertex Cover using Structural Rounding. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2020, Salt Lake City, UT, USA, January 5-6, 2020., pp. 70-80, 2020, SIAM, 978-1-61197-600-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Andre Droschinsky, Petra Mutzel, Erik Thordsen |
Shrinking Trees not Blossoms: A Recursive Maximum Matching Approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2020, Salt Lake City, UT, USA, January 5-6, 2020., pp. 146-160, 2020, SIAM, 978-1-61197-600-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Giulia Bernardini 0001, Huiping Chen, Gabriele Fici, Grigorios Loukides, Solon P. Pissis |
Reverse-Safe Data Structures for Text Indexing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2020, Salt Lake City, UT, USA, January 5-6, 2020., pp. 199-213, 2020, SIAM, 978-1-61197-600-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Maleq Khan, Gopal Pandurangan, Nguyen Dinh Pham, Anil Vullikanti, Qin Zhang 0001 |
A Multi-criteria Approximation Algorithm for Influence Maximization with Probabilistic Guarantees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2020, Salt Lake City, UT, USA, January 5-6, 2020., pp. 81-93, 2020, SIAM, 978-1-61197-600-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | André Schidler, Stefan Szeider |
Computing Optimal Hypertree Decompositions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2020, Salt Lake City, UT, USA, January 5-6, 2020., pp. 1-11, 2020, SIAM, 978-1-61197-600-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Guy E. Blelloch, Irene Finocchi (eds.) |
Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2020, Salt Lake City, UT, USA, January 5-6, 2020. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![SIAM, 978-1-61197-600-7 The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Damir Ferizovic, Demian Hespe, Sebastian Lamm, Matthias Mnich, Christian Schulz 0003, Darren Strash |
Engineering Kernelization for Maximum Cut. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2020, Salt Lake City, UT, USA, January 5-6, 2020., pp. 27-41, 2020, SIAM, 978-1-61197-600-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Kathrin Hanauer, Monika Henzinger, Christian Schulz 0003 |
Fully Dynamic Single-Source Reachability in Practice: An Experimental Study. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2020, Salt Lake City, UT, USA, January 5-6, 2020., pp. 106-119, 2020, SIAM, 978-1-61197-600-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Fritz Bökler, Markus Chimani |
Approximating Multiobjective Shortest Path in Practice. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2020, Salt Lake City, UT, USA, January 5-6, 2020., pp. 120-133, 2020, SIAM, 978-1-61197-600-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Eugenio Angriman, Alexander van der Grinten, Aleksandar Bojchevski, Daniel Zügner, Stephan Günnemann, Henning Meyerhenke |
Group Centrality Maximization for Large-scale Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2020, Salt Lake City, UT, USA, January 5-6, 2020., pp. 56-69, 2020, SIAM, 978-1-61197-600-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Emmanuel Esposito, Thomas Mueller Graf, Sebastiano Vigna |
RecSplit: Minimal Perfect Hashing via Recursive Splitting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2020, Salt Lake City, UT, USA, January 5-6, 2020., pp. 175-185, 2020, SIAM, 978-1-61197-600-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Monika Henzinger, Alexander Noe, Christian Schulz 0003 |
Shared-Memory Branch-and-Reduce for Multiterminal Cuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2020, Salt Lake City, UT, USA, January 5-6, 2020., pp. 42-55, 2020, SIAM, 978-1-61197-600-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Robert Ganian, Neha Lodha, Sebastian Ordyniak, Stefan Szeider |
SAT-Encodings for Treecut Width and Treedepth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments, ALENEX 2019, San Diego, CA, USA, January 7-8, 2019., pp. 117-129, 2019, SIAM. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Adalat Jabrayilov, Petra Mutzel |
A new Integer Linear Program for the Steiner Tree Problem with Revenues, Budget and Hop Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments, ALENEX 2019, San Diego, CA, USA, January 7-8, 2019., pp. 107-116, 2019, SIAM. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Stefan Edelkamp, Armin Weiß |
Worst-Case Efficient Sorting with QuickMergesort. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments, ALENEX 2019, San Diego, CA, USA, January 7-8, 2019., pp. 1-14, 2019, SIAM. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Sebastian Lamm, Christian Schulz 0003, Darren Strash, Robert Williger, Huashuo Zhang |
Exactly Solving the Maximum Weight Independent Set Problem on Large Real-World Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments, ALENEX 2019, San Diego, CA, USA, January 7-8, 2019., pp. 144-158, 2019, SIAM. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Stephen G. Kobourov, Henning Meyerhenke (eds.) |
Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments, ALENEX 2019, San Diego, CA, USA, January 7-8, 2019. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![SIAM The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Sebastian Schlag, Matthias Schmitt, Christian Schulz 0003 |
Faster Support Vector Machines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments, ALENEX 2019, San Diego, CA, USA, January 7-8, 2019., pp. 199-210, 2019, SIAM. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Yihan Sun 0001, Guy E. Blelloch |
Parallel Range, Segment and Rectangle Queries with Augmented Maps. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments, ALENEX 2019, San Diego, CA, USA, January 7-8, 2019., pp. 159-173, 2019, SIAM. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Thomas Tseng, Laxman Dhulipala, Guy E. Blelloch |
Batch-Parallel Euler Tour Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments, ALENEX 2019, San Diego, CA, USA, January 7-8, 2019., pp. 92-106, 2019, SIAM. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Thom Castermans, Bettina Speckmann, Kevin Verbeek |
A Practical Algorithm for Spatial Agglomerative Clustering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments, ALENEX 2019, San Diego, CA, USA, January 7-8, 2019., pp. 174-185, 2019, SIAM. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Daniel Delling, Julian Dibbelt, Thomas Pajor |
Fast and Exact Public Transit Routing with Restricted Pareto Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments, ALENEX 2019, San Diego, CA, USA, January 7-8, 2019., pp. 54-65, 2019, SIAM. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Romain Azaïs, Jean-Baptiste Durand, Christophe Godin |
Approximation of trees by self-nested trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments, ALENEX 2019, San Diego, CA, USA, January 7-8, 2019., pp. 39-53, 2019, SIAM. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Sándor P. Fekete, Dominik Krupke |
Practical Methods for Computing Large Covering Tours and Cycle Covers with Turn Cost. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments, ALENEX 2019, San Diego, CA, USA, January 7-8, 2019., pp. 186-198, 2019, SIAM. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Sebastian Schlag, Christian Schulz 0003, Daniel Seemaier, Darren Strash |
Scalable Edge Partitioning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments, ALENEX 2019, San Diego, CA, USA, January 7-8, 2019., pp. 211-225, 2019, SIAM. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Johannes Fischer 0001, Florian Kurpicz |
Lightweight Distributed Suffix Array Construction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments, ALENEX 2019, San Diego, CA, USA, January 7-8, 2019., pp. 27-38, 2019, SIAM. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Thomas Bläsius, Tobias Friedrich 0001, Julius Lischeid, Kitty Meeks, Martin Schirneck |
Efficiently Enumerating Hitting Sets of Hypergraphs Arising in Data Profiling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments, ALENEX 2019, San Diego, CA, USA, January 7-8, 2019., pp. 130-143, 2019, SIAM. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Florian Barth, Stefan Funke, Sabine Storandt |
Alternative Multicriteria Routes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments, ALENEX 2019, San Diego, CA, USA, January 7-8, 2019., pp. 66-80, 2019, SIAM. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Moritz Beck 0001, Kam-yiu Lam, Joseph Kee-Yin Ng, Sabine Storandt, Chun Jiang Zhu |
Concatenated k-Path Covers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments, ALENEX 2019, San Diego, CA, USA, January 7-8, 2019., pp. 81-91, 2019, SIAM. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Martin Aumüller 0001, Nikolaj Hass |
Simple and Fast BlockQuicksort using Lomuto's Partitioning Scheme. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments, ALENEX 2019, San Diego, CA, USA, January 7-8, 2019., pp. 15-26, 2019, SIAM. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | David Eppstein, Sariel Har-Peled, Gabriel Nivasch |
Grid peeling and the affine curve-shortening flow. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments, ALENEX 2018, New Orleans, LA, USA, January 7-8, 2018., pp. 109-116, 2018, SIAM, 978-1-61197-505-5. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Kyle Kloster, Philipp Kuinke, Michael P. O'Brien, Felix Reidl, Fernando Sánchez Villaamil, Blair D. Sullivan, Andrew van der Poel |
A practical fpt algorithm for Flow Decomposition and transcript assembly. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments, ALENEX 2018, New Orleans, LA, USA, January 7-8, 2018., pp. 75-86, 2018, SIAM, 978-1-61197-505-5. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Petteri Kaski |
Engineering a Delegatable and Error-Tolerant Algorithm for Counting Small Subgraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments, ALENEX 2018, New Orleans, LA, USA, January 7-8, 2018., pp. 184-198, 2018, SIAM, 978-1-61197-505-5. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Elisabetta Bergamini, Tanya Gonser, Henning Meyerhenke |
Scaling up Group Closeness Maximization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments, ALENEX 2018, New Orleans, LA, USA, January 7-8, 2018., pp. 209-222, 2018, SIAM, 978-1-61197-505-5. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Thomas Mendel |
Area-Preserving Subdivision Simplification with Topology Constraints: Exactly and in Practice. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments, ALENEX 2018, New Orleans, LA, USA, January 7-8, 2018., pp. 117-128, 2018, SIAM, 978-1-61197-505-5. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Thomas Bläsius, Tobias Friedrich 0001, Maximilian Katzmann, Anton Krohmer |
Hyperbolic Embeddings for Near-Optimal Greedy Routing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments, ALENEX 2018, New Orleans, LA, USA, January 7-8, 2018., pp. 199-208, 2018, SIAM, 978-1-61197-505-5. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Juan José Besa Vial, William E. Devanny, David Eppstein, Michael T. Goodrich, Timothy Johnson |
Quadratic Time Algorithms Appear to be Optimal for Sorting Evolving Data. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments, ALENEX 2018, New Orleans, LA, USA, January 7-8, 2018., pp. 87-96, 2018, SIAM, 978-1-61197-505-5. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Héctor Ferrada, Dominik Kempa, Simon J. Puglisi |
Hybrid Indexing Revisited. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments, ALENEX 2018, New Orleans, LA, USA, January 7-8, 2018., pp. 1-8, 2018, SIAM, 978-1-61197-505-5. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Marcel Radermacher, Klara Reichard, Ignaz Rutter, Dorothea Wagner |
A Geometric Heuristic for Rectilinear Crossing Minimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments, ALENEX 2018, New Orleans, LA, USA, January 7-8, 2018., pp. 129-138, 2018, SIAM, 978-1-61197-505-5. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Loukas Georgiadis, Giuseppe F. Italiano, Aikaterini Karanasiou, Nikos Parotsidis, Nilakantha Paudel |
Computing 2-Connected Components and Maximal 2-Connected Subgraphs in Directed Graphs: An Experimental Study. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments, ALENEX 2018, New Orleans, LA, USA, January 7-8, 2018., pp. 169-183, 2018, SIAM, 978-1-61197-505-5. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|