| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Renee Mirka, David P. Williamson |
An Experimental Evaluation of Semidefinite Programming and Spectral Algorithms for Max Cut.  |
ACM J. Exp. Algorithmics  |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Leo Liberti, Benedetto Manca, Pierre-Louis Poirion |
Random Projections for Linear Programming: An Improved Retrieval Phase. |
ACM J. Exp. Algorithmics |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Loïc Crombez, Guilherme Dias da Fonseca, Florian Fontan, Yan Gerard, Aldo Gonzalez-Lorenzo, Pascal Lafourcade 0001, Luc Libralesso, Benjamin Momège, Jack Spalding-Jamieson, Brandon Zhang, Da Wei Zheng |
Conflict Optimization for Binary CSP Applied to Minimum Partition into Plane Subgraphs and Graph Coloring. |
ACM J. Exp. Algorithmics |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Hu Ding, Wenjie Liu, Mingquan Ye |
A Data-dependent Approach for High-dimensional (Robust) Wasserstein Alignment. |
ACM J. Exp. Algorithmics |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Ali Al Zoobi, David Coudert, Nicolas Nisse |
Finding the k Shortest Simple Paths: Time and Space Trade-offs. |
ACM J. Exp. Algorithmics |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | José Alejandro Cornejo-Acosta, Jesus Garcia-Diaz, Julio César Pérez Sansalvador, Roger Z. Ríos-Mercado, Saúl Eduardo Pomares Hernández |
A Constructive Heuristic for the Uniform Capacitated Vertex k-center Problem. |
ACM J. Exp. Algorithmics |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Beling |
Fingerprinting-based Minimal Perfect Hashing Revisited. |
ACM J. Exp. Algorithmics |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Simon D. Fink, Matthias Pfretzschner, Ignaz Rutter |
Experimental Comparison of PC-Trees and PQ-Trees. |
ACM J. Exp. Algorithmics |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Frederick Anderson, Anirban Ghosh 0002, Matthew Graham, Lucas Mougeot, David Wisnosky |
Bounded-Degree Plane Geometric Spanners in Practice. |
ACM J. Exp. Algorithmics |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Apostolos Chalkis, Ioannis Z. Emiris, Vissarion Fisikopoulos |
A Practical Algorithm for Volume Estimation based on Billiard Trajectories and Simulated Annealing. |
ACM J. Exp. Algorithmics |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Darko Drakulic, Christelle Loiodice, Vassilissa Lehoux |
Routing in Multimodal Transportation Networks with Non-scheduled Lines. |
ACM J. Exp. Algorithmics |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Rachel G. de Jong, Mark P. J. van der Loo, Frank W. Takes |
Algorithms for Efficiently Computing Structural Anonymity in Complex Networks. |
ACM J. Exp. Algorithmics |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Sándor P. Fekete, Phillip Keldenich, Dominik Krupke, Stefan Schirra |
Minimum Partition into Plane Subgraphs: The CG:SHOP Challenge 2022. |
ACM J. Exp. Algorithmics |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | André Schidler, Stefan Szeider |
SAT-boosted Tabu Search for Coloring Massive Graphs. |
ACM J. Exp. Algorithmics |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Grötschel, Michael Jünger, Gerhard Reinelt |
Comments on "An Exact Method for the Minimum Feedback Arc Set Problem". |
ACM J. Exp. Algorithmics |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Marcelo Vaz Netto, Sahudy Montenegro González |
SSLC: A Search Algorithm Based on Linear Collisions and Poisson Probability Distribution. |
ACM J. Exp. Algorithmics |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Marco Calamai, Pierluigi Crescenzi, Andrea Marino 0001 |
On Computing the Diameter of (Weighted) Link Streams. |
ACM J. Exp. Algorithmics |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Abdurrahman Yasar, Muhammed Fatih Balin, Xiaojing An, Kaan Sancak, Ümit V. Çatalyürek |
On Symmetric Rectilinear Partitioning. |
ACM J. Exp. Algorithmics |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Sujoy Bhore, Guangping Li 0001, Martin Nöllenburg |
An Algorithmic Study of Fully Dynamic Independent Sets for Map Labeling. |
ACM J. Exp. Algorithmics |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | David Coudert, André Nusser, Laurent Viennot |
Enumeration of Far-apart Pairs by Decreasing Distance for Faster Hyperbolicity Computation. |
ACM J. Exp. Algorithmics |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Kathrin Hanauer, Christian Schulz 0003, Jonathan Trummer |
O'Reach: Even Faster Reachability in Large Graphs. |
ACM J. Exp. Algorithmics |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Erik D. Demaine, Sándor P. Fekete, Phillip Keldenich, Dominik Krupke, Joseph S. B. Mitchell |
Area-Optimal Simple Polygonalizations: The CG Challenge 2019. |
ACM J. Exp. Algorithmics |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Loïc Crombez, Guilherme Dias da Fonseca, Yan Gerard, Aldo Gonzalez-Lorenzo, Pascal Lafourcade 0001, Luc Libralesso |
Shadoks Approach to Low-Makespan Coordinated Motion Planning. |
ACM J. Exp. Algorithmics |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Marcelo Fonseca Faraj, Christian Schulz 0003 |
Buffered Streaming Graph Partitioning. |
ACM J. Exp. Algorithmics |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Xu T. Liu, Andrew Lumsdaine, Mahantesh Halappanavar, Kevin J. Barker, Assefaw Hadish Gebremedhin |
Direction-optimizing Label Propagation Framework for Structure Detection in Graphs: Design, Implementation, and Experimental Analysis. |
ACM J. Exp. Algorithmics |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan-Hendrik Lorenz, Florian Wörz |
Toward an Understanding of Long-tailed Runtimes of SLS Algorithms. |
ACM J. Exp. Algorithmics |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Hyeyun Yang, Antoine Vigneron |
Coordinated Path Planning through Local Search and Simulated Annealing. |
ACM J. Exp. Algorithmics |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Julien Lepagnot, Laurent Moalic, Dominique Schmitt |
Optimal Area Polygonization by Triangulation and Visibility Search. |
ACM J. Exp. Algorithmics |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Loïc Crombez, Guilherme Dias da Fonseca, Yan Gerard |
Greedy and Local Search Heuristics to Build Area-Optimal Polygons. |
ACM J. Exp. Algorithmics |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Saad Nogueira Nunes, Felipe A. Louza, Simon Gog, Mauricio Ayala-Rincón, Gonzalo Navarro 0001 |
Grammar Compression by Induced Suffix Sorting. |
ACM J. Exp. Algorithmics |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Nir Goren, Efi Fogel, Dan Halperin |
Area Optimal Polygonization Using Simulated Annealing. |
ACM J. Exp. Algorithmics |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Sebastian Schlag, Tobias Heuer, Lars Gottesbüren, Yaroslav Akhremtsev, Christian Schulz 0003, Peter Sanders 0001 |
High-Quality Hypergraph Partitioning. |
ACM J. Exp. Algorithmics |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Günther Eder, Martin Held, Steinþór Jasonarson, Philipp Mayer, Peter Palfrader |
2-Opt Moves and Flips for Area-optimal Polygonizations. |
ACM J. Exp. Algorithmics |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Sándor P. Fekete, Phillip Keldenich, Dominik Krupke, Joseph S. B. Mitchell |
Computing Coordinated Motion Plans for Robot Swarms: The CG: SHOP Challenge 2021. |
ACM J. Exp. Algorithmics |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Eugenio Angriman, Michal Boron, Henning Meyerhenke |
A Batch-dynamic Suitor Algorithm for Approximating Maximum Weighted Matching. |
ACM J. Exp. Algorithmics |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Natanael Ramos, Raí C. de Jesus, Pedro J. de Rezende, Cid C. de Souza, Fábio Luiz Usberti |
Triangle-Based Heuristics for Area Optimal Polygonizations. |
ACM J. Exp. Algorithmics |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Jessica Shi 0001, Louisa Ruixue Huang, Julian Shun |
Parallel Five-cycle Counting Algorithms. |
ACM J. Exp. Algorithmics |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Georg Gottlob, Matthias Lanzinger, Davide Mario Longo, Cem Okulmus |
Incremental Updates of Generalized Hypertree Decompositions. |
ACM J. Exp. Algorithmics |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Kevin Buchin, Alexander Hill, Sándor P. Fekete, Linda Kleist, Irina Kostitsyna, Dominik Krupke, Roel Lambers, Martijn Struijs |
Minimum Scan Cover and Variants: Theory and Experiments. |
ACM J. Exp. Algorithmics |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Mueller Graf, Daniel Lemire |
Binary Fuse Filters: Fast and Smaller Than Xor Filters. |
ACM J. Exp. Algorithmics |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Ben Strasser, Tim Zeitz |
Using Incremental Many-to-One Queries to Build a Fast and Tight Heuristic for A* in Road Networks. |
ACM J. Exp. Algorithmics |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Liu 0001, Jack Spalding-Jamieson, Brandon Zhang, Da Wei Zheng |
Coordinated Motion Planning Through Randomized k-Opt. |
ACM J. Exp. Algorithmics |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander van der Grinten, Elisabetta Bergamini, Oded Green, David A. Bader, Henning Meyerhenke |
Scalable Katz Ranking Computation in Large Static and Dynamic Graphs. |
ACM J. Exp. Algorithmics |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Jules Bertrand, Fanny Dufossé, Somesh Singh 0001, Bora Uçar |
Algorithms and Data Structures for Hyperedge Queries. |
ACM J. Exp. Algorithmics |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Kathrin Hanauer, Monika Henzinger, Christian Schulz 0003 |
Recent Advances in Fully Dynamic Graph Algorithms - A Quick Reference Guide. |
ACM J. Exp. Algorithmics |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Sándor P. Fekete, Andreas Haas, Phillip Keldenich, Michael Perk, Arne Schmidt 0001 |
Computing Area-Optimal Simple Polygonizations. |
ACM J. Exp. Algorithmics |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Max Franck, Sorrachai Yingchareonthawornchai |
Engineering Nearly Linear-time Algorithms for Small Vertex Connectivity. |
ACM J. Exp. Algorithmics |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Sebastian Schlag, Matthias Schmitt, Christian Schulz 0003 |
Faster Support Vector Machines. |
ACM J. Exp. Algorithmics |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Wolfgang Fischl, Georg Gottlob, Davide Mario Longo, Reinhard Pichler |
HyperBench: A Benchmark and Tool for Hypergraphs and Empirical Findings. |
ACM J. Exp. Algorithmics |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Giulia Bernardini 0001, Huiping Chen, Gabriele Fici, Grigorios Loukides, Solon P. Pissis |
Reverse-Safe Text Indexing. |
ACM J. Exp. Algorithmics |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Zirou Qiu, Ruslan Shaydulin, Xiaoyuan Liu 0001, Yuri Alexeev, Christopher S. Henry, Ilya Safro |
ELRUNA: Elimination Rule-based Network Alignment. |
ACM J. Exp. Algorithmics |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomohiro Koana, Viatcheslav Korenwein, André Nichterlein, Rolf Niedermeier, Philipp Zschoche |
Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments. |
ACM J. Exp. Algorithmics |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Zsuzsanna Lipták, Simon J. Puglisi, Massimiliano Rossi 0001 |
Pattern Discovery in Colored Strings. |
ACM J. Exp. Algorithmics |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Johannes Klaus Fichte, Markus Hecher, Florim Hamiti |
The Model Counting Competition 2020. |
ACM J. Exp. Algorithmics |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerth Stølting Brodal, Konstantinos Mampentzidis |
Cache Oblivious Algorithms for Computing the Triplet Distance between Trees. |
ACM J. Exp. Algorithmics |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Timothy D. Goodrich, Eric Horton, Blair D. Sullivan |
An Updated Experimental Evaluation of Graph Bipartization Methods. |
ACM J. Exp. Algorithmics |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Patrick Dinklage, Jonas Ellert, Johannes Fischer 0001, Florian Kurpicz, Marvin Löbel |
Practical Wavelet Tree Construction. |
ACM J. Exp. Algorithmics |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Hecht, Krzysztof Gonciarz, Szabolcs Horvát |
Tight Localizations of Feedback Sets. |
ACM J. Exp. Algorithmics |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Jünger, Elisabeth Lobe, Petra Mutzel, Gerhard Reinelt, Franz Rendl, Giovanni Rinaldi, Tobias Stollenwerk |
Quantum Annealing versus Digital Computing: An Experimental Comparison. |
ACM J. Exp. Algorithmics |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Diego Arroyuelo, Rodrigo Cánovas, Johannes Fischer 0001, Dominik Köppl, Marvin Löbel, Gonzalo Navarro 0001, Rajeev Raman |
Engineering Practical Lempel-Ziv Tries. |
ACM J. Exp. Algorithmics |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Ali Baharev, Hermann Schichl, Arnold Neumaier, Tobias Achterberg |
An Exact Method for the Minimum Feedback Arc Set Problem. |
ACM J. Exp. Algorithmics |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Farach-Colton, Katia Leal, Miguel A. Mosteiro, Christopher Thraves Caro |
Dynamic Windows Scheduling with Reallocation. |
ACM J. Exp. Algorithmics |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Allan Borodin, Christodoulos Karavasilis, Denis Pankratov |
An Experimental Study of Algorithms for Online Bipartite Matching. |
ACM J. Exp. Algorithmics |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Jacob Focke, Nicole Megow, Julie Meißner |
Minimum Spanning Tree under Explorable Uncertainty in Theory and Experiments. |
ACM J. Exp. Algorithmics |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Panagiotis Charalampopoulos, Costas S. Iliopoulos, Chang Liu 0035, Solon P. Pissis |
Property Suffix Array with Applications in Indexing Weighted Sequences. |
ACM J. Exp. Algorithmics |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Konrad von Kirchbach, Christian Schulz 0003, Jesper Larsson Träff |
Better Process Mapping and Sparse Quadratic Assignment. |
ACM J. Exp. Algorithmics |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Shunsuke Kanda, Dominik Köppl, Yasuo Tabei, Kazuhiro Morita, Masao Fuketa |
Dynamic Path-decomposed Tries. |
ACM J. Exp. Algorithmics |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Mitzenmacher, Salvatore Pontarelli, Pedro Reviriego |
Adaptive Cuckoo Filters. |
ACM J. Exp. Algorithmics |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Jakob L. Andersen, Daniel Merkle |
A Generic Framework for Engineering Graph Canonization Algorithms. |
ACM J. Exp. Algorithmics |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Guillaume Escamocher, Barry O'Sullivan, Steven David Prestwich |
Generating Difficult CNF Instances in Unexplored Constrainedness Regions. |
ACM J. Exp. Algorithmics |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Mueller Graf, Daniel Lemire |
Xor Filters. |
ACM J. Exp. Algorithmics |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Alathea Jensen, Isabel Beichl |
A Sequential Importance Sampling Algorithm for Counting Linear Extensions. |
ACM J. Exp. Algorithmics |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexandra Henzinger, Alexander Noe, Christian Schulz 0003 |
ILP-Based Local Search for Graph Partitioning. |
ACM J. Exp. Algorithmics |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Bläsius, Tobias Friedrich 0001, Maximilian Katzmann, Anton Krohmer |
Hyperbolic Embeddings for Near-Optimal Greedy Routing. |
ACM J. Exp. Algorithmics |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Miguel Coviello Gonzalez, Marek Chrobak |
A Waste-Efficient Algorithm for Single-Droplet Sample Preparation on Microfluidic Chips. |
ACM J. Exp. Algorithmics |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Rebecca J. Stones, Raúl M. Falcón, Daniel Kotlar, Trent G. Marbach |
Computing Autotopism Groups of Partial Latin Rectangles. |
ACM J. Exp. Algorithmics |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthias Bentert, Anne-Sophie Himmel, Hendrik Molter, Marco Morik, Rolf Niedermeier, René Saitenmacher |
Listing All Maximal k-Plexes in Temporal Graphs. |
ACM J. Exp. Algorithmics |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Valentin Buchhold, Peter Sanders 0001, Dorothea Wagner |
Real-time Traffic Assignment Using Engineered Customizable Contraction Hierarchies. |
ACM J. Exp. Algorithmics |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Edelkamp, Armin Weiß |
BlockQuicksort: Avoiding Branch Mispredictions in Quicksort. |
ACM J. Exp. Algorithmics |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Tuukka Korhonen, Jeremias Berg, Matti Järvisalo |
Solving Graph Problems via Potential Maximal Cliques: An Experimental Evaluation of the Bouchitté-Todinca Algorithm. |
ACM J. Exp. Algorithmics |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephan Beyer, Markus Chimani |
Strong Steiner Tree Approximations in Practice. |
ACM J. Exp. Algorithmics |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Juha Kärkkäinen, Dominik Kempa |
Better External Memory LCP Array Construction. |
ACM J. Exp. Algorithmics |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Michal Ziobro, Marcin Pilipczuk |
Finding Hamiltonian Cycle in Graphs of Bounded Treewidth: Experimental Evaluation. |
ACM J. Exp. Algorithmics |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Moritz Baum, Valentin Buchhold, Julian Dibbelt, Dorothea Wagner |
Fast Exact Computation of Isocontours in Road Networks. |
ACM J. Exp. Algorithmics |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Michele Borassi, Emanuele Natale |
KADABRA is an ADaptive Algorithm for Betweenness via Random Approximation. |
ACM J. Exp. Algorithmics |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Tobias Heuer, Peter Sanders 0001, Sebastian Schlag |
Network Flow-Based Refinement for Multilevel Hypergraph Partitioning. |
ACM J. Exp. Algorithmics |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Marcel Radermacher, Klara Reichard, Ignaz Rutter, Dorothea Wagner |
Geometric Heuristics for Rectilinear Crossing Minimization. |
ACM J. Exp. Algorithmics |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Tamal K. Dey, Dayu Shi, Yusu Wang 0001 |
SimBa: An Efficient Tool for Approximating Rips-filtration Persistence via Simplicial Batch Collapse. |
ACM J. Exp. Algorithmics |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Abu Reyan Ahmed, Patrizio Angelini, Faryad Darabi Sahneh, Alon Efrat, David Glickenstein, Martin Gronemann, Niklas Heinsohn, Stephen G. Kobourov, Richard Spence, Joseph Watkins, Alexander Wolff 0001 |
Multi-level Steiner Trees. |
ACM J. Exp. Algorithmics |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni |
Fully Dynamic 2-Hop Cover Labeling. |
ACM J. Exp. Algorithmics |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Katerina Altmanová, Dusan Knop, Martin Koutecký |
Evaluating and Tuning n-fold Integer Programming. |
ACM J. Exp. Algorithmics |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Gianlorenzo D'Angelo |
Introduction to the Special Issue SEA 2018. |
ACM J. Exp. Algorithmics |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Demian Hespe, Christian Schulz 0003, Darren Strash |
Scalable Kernelization for Maximum Independent Sets. |
ACM J. Exp. Algorithmics |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Stoicho D. Stoichev |
New Exact and Heuristic Algorithms for Graph Automorphism Group and Graph Isomorphism. |
ACM J. Exp. Algorithmics |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Björklund, Brajesh Gupt, Nicolás Quesada |
A Faster Hafnian Formula for Complex Matrices and Its Benchmarking on a Supercomputer. |
ACM J. Exp. Algorithmics |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Chimani, Ivo Hedtke, Tilo Wiedera |
Exact Algorithms for the Maximum Planar Subgraph Problem: New Models and Experiments. |
ACM J. Exp. Algorithmics |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Domenico Cantone, Simone Faro, Arianna Pavone |
Linear and Efficient String Matching Algorithms Based on Weak Factor Recognition. |
ACM J. Exp. Algorithmics |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Leonid Barenboim, Tzalik Maimon |
Fully Dynamic Graph Algorithms Inspired by Distributed Computing: Deterministic Maximal Matching and Edge Coloring in Sublinear Update-Time. |
ACM J. Exp. Algorithmics |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Frédéric Cazals, Dorian Mazauric, Romain Tetley, Rémi Watrigant |
Comparing Two Clusterings Using Matchings between Clusters of Clusters. |
ACM J. Exp. Algorithmics |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Harry A. Levin, Sorelle A. Friedler |
Automated Congressional Redistricting. |
ACM J. Exp. Algorithmics |
2019 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")
data released under the ODC-BY 1.0 license