| 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.  |
ALENEX  |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Florian Kurpicz, Hans-Peter Lehmann, Peter Sanders 0001 |
PaCHash: Packed and Compressed Hash Tables. |
ALENEX |
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. |
ALENEX |
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. |
ALENEX |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Ángel Javier Alonso, Michael Kerber, Siddharth Pritam |
Filtration-Domination in Bifiltered Graphs. |
ALENEX |
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. |
ALENEX |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Maximilian Böther, Otto Kißig, Christopher Weyand |
Efficiently Computing Directed Minimum Spanning Trees. |
ALENEX |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Rajan Shankar, Jonathan Spreer |
A Uniform Sampling Procedure for Abstract Triangulations of Surfaces. |
ALENEX |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Shion Fukuzawa, Christopher Ho, Sandy Irani, Jasen Zion |
Modified Iterative Quantum Amplitude Estimation is Asymptotically Optimal. |
ALENEX |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Brian Wheatman, Randal C. Burns, Aydin Buluç, Helen Xu 0001 |
Optimizing Search Layouts in Packed Memory Arrays. |
ALENEX |
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 |
ALENEX |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | William Cawley Gelling, Markus E. Nebel, Benjamin Smith, Sebastian Wild |
Multiway Powersort. |
ALENEX |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Timon Behr, Sabine Storandt |
Lossy Reduction Rules for the Directed Feedback Vertex Set Problem. |
ALENEX |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Aaron Hong, Massimiliano Rossi 0001, Christina Boucher |
LZ77 via Prefix-Free Parsing. |
ALENEX |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Rafael Kiesel, André Schidler |
A Dynamic MaxSAT-based Approach to Directed Feedback Vertex Sets. |
ALENEX |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans-Peter Lehmann, Peter Sanders 0001, Stefan Walzer |
SicHash - Small Irregular Cuckoo Tables for Perfect Hashing. |
ALENEX |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Adil Chhabra, Marcelo Fonseca Faraj, Christian Schulz 0003 |
Local Motif Clustering via (Hyper)Graph Partitioning. |
ALENEX |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Florian Stober, Armin Weiß |
Lower Bounds for Sorting 16, 17, and 18 Elements. |
ALENEX |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | André Schidler, Stefan Szeider |
A SAT Approach to Twin-Width. |
ALENEX |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Guy E. Blelloch, Magdalen Dobson |
Parallel Nearest Neighbors in Low Dimensions with Batch Updates. |
ALENEX |
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. |
ALENEX |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Dena Tayebi, Saurabh Ray, Deepak Ajwani |
Learning to Prune Instances of k-median and Related Problems. |
ALENEX |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | David Coudert, André Nusser, Laurent Viennot |
Computing Graph Hyperbolicity Using Dominating Sets. |
ALENEX |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Monika Henzinger, Alexander Noe, Christian Schulz 0003 |
Practical Fully Dynamic Minimum Cut Algorithms. |
ALENEX |
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. |
ALENEX |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Tamal K. Dey, Simon Zhang |
Approximating 1-Wasserstein Distance between Persistence Diagrams by Graph Sparsification. |
ALENEX |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Moritz Potthoff, Jonas Sauer |
Fast Multimodal Journey Planning for Three Criteria. |
ALENEX |
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. |
ALENEX |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Emil Biju, Sundar Raman P. |
Perturbation Analysis of Practical Algorithms for the Maximum Scatter Travelling Salesman Problem. |
ALENEX |
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. |
ALENEX |
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. |
ALENEX |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Lars Gottesbüren, Tobias Heuer, Peter Sanders 0001, Sebastian Schlag |
Shared-Memory n-level Hypergraph Partitioning. |
ALENEX |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Darren Strash, Louise Thompson |
Effective Data Reduction for the Vertex Clique Cover Problem. |
ALENEX |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Leszek Gasieniec, Benjamin Smith, Sebastian Wild |
Towards the 5/6-Density Conjecture of Pinwheel Scheduling. |
ALENEX |
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. |
ALENEX |
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 |
ALENEX |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | |
Front Matter. |
ALENEX |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Lars Gottesbüren, Tobias Heuer, Peter Sanders 0001, Sebastian Schlag |
Scalable Shared-Memory Hypergraph Partitioning. |
ALENEX |
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. |
ALENEX |
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. |
ALENEX |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Clément Maria, Owen Rouillé |
Computation of Large Asymptotics of 3-Manifold Quantum Invariants. |
ALENEX |
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. |
ALENEX |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Kerber, Alexander Rolle |
Fast Minimal Presentations of Bi-graded Persistence Modules. |
ALENEX |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Anders, Pascal Schweitzer |
Engineering a Fast Probabilistic Isomorphism Test. |
ALENEX |
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. |
ALENEX |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Antonio Boffa, Paolo Ferragina, Giorgio Vinciguerra |
A "Learned" Approach to Quicken and Compress Rank/Select Dictionaries. |
ALENEX |
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. |
ALENEX |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Brian Wheatman, Helen Xu 0001 |
A Parallel Packed Memory Array to Store Dynamic Graphs. |
ALENEX |
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 |
ALENEX |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Barlow, Christian Konrad 0001, Charana Nandasena |
Streaming Set Cover in Practice. |
ALENEX |
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. |
ALENEX |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Wolfgang Ost, Christian Schulz 0003, Darren Strash |
Engineering Data Reduction for Nested Dissection. |
ALENEX |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Merten Popp, Sebastian Schlag, Christian Schulz 0003, Daniel Seemaier |
Multilevel Acyclic Hypergraph Partitioning. |
ALENEX |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Valentin Buchhold, Peter Sanders 0001, Dorothea Wagner |
Fast, Exact and Scalable Dynamic Ridesharing. |
ALENEX |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Patrick Dinklage, Johannes Fischer 0001, Florian Kurpicz |
Constructing the Wavelet Tree and Wavelet Matrix in Distributed Memory. |
ALENEX |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Kamer Kaya, Johannes Langguth, Ioannis Panagiotas, Bora Uçar |
Karp-Sipser based kernels for bipartite graph matching. |
ALENEX |
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. |
ALENEX |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Lukas Barth, Dorothea Wagner |
Engineering Top-Down Weight-Balanced Trees. |
ALENEX |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Moritz Beck 0001, Sabine Storandt |
Puzzling Grid Embeddings. |
ALENEX |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Komusiewicz, Frank Sommer |
FixCon: A Generic Solver for Fixed-Cardinality Subgraph Problems. |
ALENEX |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Brian Lavallee, Hayley Russell, Blair D. Sullivan, Andrew van der Poel |
Approximating Vertex Cover using Structural Rounding. |
ALENEX |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Andre Droschinsky, Petra Mutzel, Erik Thordsen |
Shrinking Trees not Blossoms: A Recursive Maximum Matching Approach. |
ALENEX |
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. |
ALENEX |
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. |
ALENEX |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | André Schidler, Stefan Szeider |
Computing Optimal Hypertree Decompositions. |
ALENEX |
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. |
ALENEX |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Damir Ferizovic, Demian Hespe, Sebastian Lamm, Matthias Mnich, Christian Schulz 0003, Darren Strash |
Engineering Kernelization for Maximum Cut. |
ALENEX |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Kathrin Hanauer, Monika Henzinger, Christian Schulz 0003 |
Fully Dynamic Single-Source Reachability in Practice: An Experimental Study. |
ALENEX |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Fritz Bökler, Markus Chimani |
Approximating Multiobjective Shortest Path in Practice. |
ALENEX |
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. |
ALENEX |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Emmanuel Esposito, Thomas Mueller Graf, Sebastiano Vigna |
RecSplit: Minimal Perfect Hashing via Recursive Splitting. |
ALENEX |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Monika Henzinger, Alexander Noe, Christian Schulz 0003 |
Shared-Memory Branch-and-Reduce for Multiterminal Cuts. |
ALENEX |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Ganian, Neha Lodha, Sebastian Ordyniak, Stefan Szeider |
SAT-Encodings for Treecut Width and Treedepth. |
ALENEX |
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. |
ALENEX |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Edelkamp, Armin Weiß |
Worst-Case Efficient Sorting with QuickMergesort. |
ALENEX |
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. |
ALENEX |
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. |
ALENEX |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Sebastian Schlag, Matthias Schmitt, Christian Schulz 0003 |
Faster Support Vector Machines. |
ALENEX |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Yihan Sun 0001, Guy E. Blelloch |
Parallel Range, Segment and Rectangle Queries with Augmented Maps. |
ALENEX |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Tseng, Laxman Dhulipala, Guy E. Blelloch |
Batch-Parallel Euler Tour Trees. |
ALENEX |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Thom Castermans, Bettina Speckmann, Kevin Verbeek |
A Practical Algorithm for Spatial Agglomerative Clustering. |
ALENEX |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Delling, Julian Dibbelt, Thomas Pajor |
Fast and Exact Public Transit Routing with Restricted Pareto Sets. |
ALENEX |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Romain Azaïs, Jean-Baptiste Durand, Christophe Godin |
Approximation of trees by self-nested trees. |
ALENEX |
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. |
ALENEX |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Sebastian Schlag, Christian Schulz 0003, Daniel Seemaier, Darren Strash |
Scalable Edge Partitioning. |
ALENEX |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Johannes Fischer 0001, Florian Kurpicz |
Lightweight Distributed Suffix Array Construction. |
ALENEX |
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. |
ALENEX |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Florian Barth, Stefan Funke, Sabine Storandt |
Alternative Multicriteria Routes. |
ALENEX |
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. |
ALENEX |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Aumüller 0001, Nikolaj Hass |
Simple and Fast BlockQuicksort using Lomuto's Partitioning Scheme. |
ALENEX |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | David Eppstein, Sariel Har-Peled, Gabriel Nivasch |
Grid peeling and the affine curve-shortening flow. |
ALENEX |
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. |
ALENEX |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Petteri Kaski |
Engineering a Delegatable and Error-Tolerant Algorithm for Counting Small Subgraphs. |
ALENEX |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Elisabetta Bergamini, Tanya Gonser, Henning Meyerhenke |
Scaling up Group Closeness Maximization. |
ALENEX |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Mendel |
Area-Preserving Subdivision Simplification with Topology Constraints: Exactly and in Practice. |
ALENEX |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Bläsius, Tobias Friedrich 0001, Maximilian Katzmann, Anton Krohmer |
Hyperbolic Embeddings for Near-Optimal Greedy Routing. |
ALENEX |
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. |
ALENEX |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Héctor Ferrada, Dominik Kempa, Simon J. Puglisi |
Hybrid Indexing Revisited. |
ALENEX |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Marcel Radermacher, Klara Reichard, Ignaz Rutter, Dorothea Wagner |
A Geometric Heuristic for Rectilinear Crossing Minimization. |
ALENEX |
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. |
ALENEX |
2018 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")
data released under the ODC-BY 1.0 license