Christian Schulz

Bora Uçar

Dataset, November, 2024

Finding Near-Optimal Weight Independent Sets at Scale.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2024

A Comprehensive Survey of Data Reduction Rules for the Maximum Weighted Independent Set Problem.

[BibT_eX]

[DOI]

Ernestine Großmann

Kenneth Langedal

CoRR, 2024

Partitioning Trillion Edge Graphs on Edge Devices.

[BibT_eX]

[DOI]

CoRR, 2024

Engineering Hypergraph b-Matching Algorithms.

[BibT_eX]

[DOI]

CoRR, 2024

Engineering Fully Dynamic Exact Δ-Orientation Algorithms.

[BibT_eX]

[DOI]

CoRR, 2024

Optimal Neighborhood Exploration for Dynamic Independent Sets.

[BibT_eX]

[DOI]

Jannick Borowitz

Ernestine Großmann

CoRR, 2024

Engineering Weighted Connectivity Augmentation Algorithms.

[BibT_eX]

[DOI]

Proceedings of the 22nd International Symposium on Experimental Algorithms, 2024

Buffered Streaming Edge Partitioning.

[BibT_eX]

[DOI]

Adil Chhabra

Daniel Seemaier

Proceedings of the 22nd International Symposium on Experimental Algorithms, 2024

Engineering Edge Orientation Algorithms.

[BibT_eX]

[DOI]

Henrik Reinstädtler

Bora Uçar

Proceedings of the 32nd Annual European Symposium on Algorithms, 2024

2023

More Recent Advances in (Hyper)Graph Partitioning.

[BibT_eX]

[DOI]

Ümit V. Çatalyürek

Karen D. Devine

ACM Comput. Surv., December, 2023

Recent Trends in Graph Decomposition (Dagstuhl Seminar 23331).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2023

FLASH-TB: Integrating Arc-Flags and Trip-Based Public Transit Routing.

[BibT_eX]

[DOI]

CoRR, 2023

Open Problems in (Hyper)Graph Decomposition.

[BibT_eX]

[DOI]

CoRR, 2023

Finding Optimal 2-Packing Sets on Arbitrary Graphs at Scale.

[BibT_eX]

[DOI]

CoRR, 2023

Improved Exact and Heuristic Algorithms for Maximum Weight Clique.

[BibT_eX]

[DOI]

CoRR, 2023

Arc-Flags Meet Trip-Based Public Transit Routing.

[BibT_eX]

[DOI]

Proceedings of the 21st International Symposium on Experimental Algorithms, 2023

FREIGHT: Fast Streaming Hypergraph Partitioning.

[BibT_eX]

[DOI]

Kamal Eyubov

Proceedings of the 21st International Symposium on Experimental Algorithms, 2023

A Distributed Multilevel Memetic Algorithm for Signed Graph Clustering.

[BibT_eX]

[DOI]

Felix Hausberger

Proceedings of the Companion Proceedings of the Conference on Genetic and Evolutionary Computation, 2023

Faster Local Motif Clustering via Maximum Flows.

[BibT_eX]

[DOI]

Adil Chhabra

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

Engineering Fully Dynamic Δ-Orientation Algorithms.

[BibT_eX]

[DOI]

Jannick Borowitz

Ernestine Großmann

Proceedings of the SIAM Conference on Applied and Computational Discrete Algorithms, 2023

2022

High-Quality Hypergraph Partitioning.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, December, 2022

O'Reach: Even Faster Reachability in Large Graphs.

[BibT_eX]

[DOI]

Jonathan Trummer

ACM J. Exp. Algorithmics, 2022

Recent Advances in Fully Dynamic Graph Algorithms - A Quick Reference Guide.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2022

Buffered Streaming Graph Partitioning.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2022

Local Motif Clustering via (Hyper)Graph Partitioning.

[BibT_eX]

[DOI]

Adil Chhabra

Proceedings of the Fifteenth International Symposium on Combinatorial Search, 2022

Recent Advances in Fully Dynamic Graph Algorithms (Invited Talk).

[BibT_eX]

[DOI]

Proceedings of the 1st Symposium on Algorithmic Foundations of Dynamic Networks, 2022

The PACE 2022 Parameterized Algorithms and Computational Experiments Challenge: Directed Feedback Vertex Set.

[BibT_eX]

[DOI]

Proceedings of the 17th International Symposium on Parameterized and Exact Computation, 2022

Recursive Multi-Section on the Fly: Shared-Memory Streaming Algorithms for Hierarchical Graph Partitioning and Process Mapping.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Cluster Computing, 2022

Practical Fully Dynamic Minimum Cut Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Algorithm Engineering and Experiments, 2022

Recent Advances in Practical Data Reduction.

[BibT_eX]

[DOI]

Proceedings of the Algorithms for Big Data - DFG Priority Program 1736, 2022

Recent Advances in Scalable Network Generation1.

[BibT_eX]

[DOI]

Proceedings of the Massive Graph Analytics, 2022

2021

Faster Support Vector Machines.

[BibT_eX]

[DOI]

Sebastian Schlag

Matthias Schmitt

ACM J. Exp. Algorithmics, 2021

Recent Advances in Fully Dynamic Graph Algorithms.

[BibT_eX]

[DOI]

CoRR, 2021

The future is big graphs: a community view on graph processing systems.

[BibT_eX]

[DOI]

Commun. ACM, 2021

An MPI-based Algorithm for Mapping Complex Networks onto Hierarchical Architectures.

[BibT_eX]

[DOI]

Proceedings of the Euro-Par 2021: Parallel Processing, 2021

Deep Multilevel Graph Partitioning.

[BibT_eX]

[DOI]

Proceedings of the 29th Annual European Symposium on Algorithms, 2021

Multilevel Acyclic Hypergraph Partitioning.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Algorithm Engineering and Experiments, 2021

Engineering Data Reduction for Nested Dissection.

[BibT_eX]

[DOI]

Lara Ost

Darren Strash

Proceedings of the Symposium on Algorithm Engineering and Experiments, 2021

Fully Dynamic k-Center Clustering in Low Dimensional Metrics.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Algorithm Engineering and Experiments, 2021

Boosting Data Reduction for the Maximum Weight Independent Set Problem Using Increasing Transformations.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Algorithm Engineering and Experiments, 2021

Faster Parallel Multiterminal Cuts.

[BibT_eX]

[DOI]

Proceedings of the 2021 SIAM Conference on Applied and Computational Discrete Algorithms, 2021

Fully-dynamic Weighted Matching Approximation in Practice.

[BibT_eX]

[DOI]

Proceedings of the 2021 SIAM Conference on Applied and Computational Discrete Algorithms, 2021

2020

Vienna Graph Clustering.

[BibT_eX]

[DOI]

Proceedings of the Protein-Protein Interaction Networks, Methods and Protocols., 2020

High-Quality Shared-Memory Graph Partitioning.

[BibT_eX]

[DOI]

Yaroslav Akhremtsev

IEEE Trans. Parallel Distributed Syst., 2020

Better Process Mapping and Sparse Quadratic Assignment.

[BibT_eX]

[DOI]

Konrad von Kirchbach

ACM J. Exp. Algorithmics, 2020

ILP-Based Local Search for Graph Partitioning.

[BibT_eX]

[DOI]

Alexandra Henzinger

ACM J. Exp. Algorithmics, 2020

Evolutionary multi-level acyclic graph partitioning.

[BibT_eX]

[DOI]

Orlando Moreira

Merten Popp

J. Heuristics, 2020

Recent Advances in Practical Data Reduction.

[BibT_eX]

[DOI]

CoRR, 2020

Faster Reachability in Static Graphs.

[BibT_eX]

[DOI]

Jonathan Trummer

CoRR, 2020

Recent Advances in Scalable Network Generation.

[BibT_eX]

[DOI]

CoRR, 2020

Load-Balanced Bottleneck Objectives in Process Mapping.

[BibT_eX]

[DOI]

Johannes Langguth

Sebastian Schlag

CoRR, 2020

Faster Fully Dynamic Transitive Closure in Practice.

[BibT_eX]

[DOI]

Proceedings of the 18th International Symposium on Experimental Algorithms, 2020

High-Quality Hierarchical Process Mapping.

[BibT_eX]

[DOI]

Alexander van der Grinten

Proceedings of the 18th International Symposium on Experimental Algorithms, 2020

WeGotYouCovered: The Winning Solver from the PACE 2019 Challenge, Vertex Cover Track.

[BibT_eX]

[DOI]

Proceedings of the SIAM Workshop on Combinatorial Scientific Computing, 2020

Finding All Global Minimum Cuts in Practice.

[BibT_eX]

[DOI]

Proceedings of the 28th Annual European Symposium on Algorithms, 2020

Dynamic Matching Algorithms in Practice.

[BibT_eX]

[DOI]

Proceedings of the 28th Annual European Symposium on Algorithms, 2020

Efficient Process-to-Node Mapping Algorithms for Stencil Computations.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Cluster Computing, 2020

Shared-Memory Branch-and-Reduce for Multiterminal Cuts.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Algorithm Engineering and Experiments, 2020

Fully Dynamic Single-Source Reachability in Practice: An Experimental Study.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Algorithm Engineering and Experiments, 2020

Engineering Kernelization for Maximum Cut.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Algorithm Engineering and Experiments, 2020

2019

Graph Partitioning: Formulations and Applications to Big Data.

[BibT_eX]

[DOI]

Darren Strash

Proceedings of the Encyclopedia of Big Data Technologies., 2019

Parameterized Graph Algorithms & Data Reduction: Theory Meets Practice (NII Shonan Meeting 144).

[BibT_eX]

[DOI]

Bart M. P. Jansen

Hisao Tamaki

NII Shonan Meet. Rep., 2019

Communication-free massively distributed graph generation.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2019

Scalable Kernelization for Maximum Independent Sets.

[BibT_eX]

[DOI]

Demian Hespe

Darren Strash

ACM J. Exp. Algorithmics, 2019

Scalable Graph Algorithms.

[BibT_eX]

[DOI]

CoRR, 2019

WeGotYouCovered: The Winning Solver from the PACE 2019 Implementation Challenge, Vertex Cover Track.

[BibT_eX]

[DOI]

CoRR, 2019

Finding Optimal Longest Paths by Dynamic Programming in Parallel.

[BibT_eX]

[DOI]

Proceedings of the Twelfth International Symposium on Combinatorial Search, 2019

Shared-Memory Exact Minimum Cuts.

[BibT_eX]

[DOI]

Proceedings of the 2019 IEEE International Parallel and Distributed Processing Symposium, 2019

Scalable Edge Partitioning.

[BibT_eX]

[DOI]

Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments, 2019

Exactly Solving the Maximum Weight Independent Set Problem on Large Real-World Graphs.

[BibT_eX]

[DOI]

Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments, 2019

2018

Benchmarking for Graph Clustering and Partitioning.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Social Network Analysis and Mining, 2nd Edition, 2018

Drawing Large Graphs by Multilevel Maxent-Stress Optimization.

[BibT_eX]

[DOI]

Martin Nöllenburg

IEEE Trans. Vis. Comput. Graph., 2018

Practical Minimum Cut Algorithms.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2018

Memetic Graph Clustering.

[BibT_eX]

[DOI]

Proceedings of the 17th International Symposium on Experimental Algorithms, 2018

Communication-Free Massively Distributed Graph Generation.

[BibT_eX]

[DOI]

Proceedings of the 2018 IEEE International Parallel and Distributed Processing Symposium, 2018

Memetic multilevel hypergraph partitioning.

[BibT_eX]

[DOI]

Robin Andre

Sebastian Schlag

Proceedings of the Genetic and Evolutionary Computation Conference, 2018

2017

Parallel Graph Partitioning for Complex Networks.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 2017

Finding near-optimal independent sets at scale.

[BibT_eX]

[DOI]

J. Heuristics, 2017

Evolutionary Acyclic Graph Partitioning.

[BibT_eX]

[DOI]

Orlando Moreira

Merten Popp

CoRR, 2017

VieM v1.00 - Vienna Mapping and Sparse Quadratic Assignment User Guide.

[BibT_eX]

[DOI]

CoRR, 2017

Optimal Longest Paths by Dynamic Programming.

[BibT_eX]

[DOI]

Tomás Balyo

Kai Fieger

CoRR, 2017

Distributed Evolutionary k-way Node Separators.

[BibT_eX]

[DOI]

CoRR, 2017

Better Process Mapping and Sparse Quadratic Assignment.

[BibT_eX]

[DOI]

Proceedings of the 16th International Symposium on Experimental Algorithms, 2017

Graph Partitioning with Acyclicity Constraints.

[BibT_eX]

[DOI]

Orlando Moreira

Merten Popp

Proceedings of the 16th International Symposium on Experimental Algorithms, 2017

Distributed evolutionary k-way node separators.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2017

2016

Recent Advances in Graph Partitioning.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Engineering - Selected Results and Surveys, 2016

Tree-Based Coarsening and Partitioning of Complex Networks.

[BibT_eX]

[DOI]

Roland Glantz

ACM J. Exp. Algorithmics, 2016

Scalable generation of scale-free graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2016

Partitioning (hierarchically clustered) complex networks via size-constrained graph clustering.

[BibT_eX]

[DOI]

J. Heuristics, 2016

Advanced Multilevel Node Separator Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms - 15th International Symposium, 2016

Accelerating Local Search for the Maximum Independent Set Problem.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms - 15th International Symposium, 2016

k-way Hypergraph Partitioning via n-Level Recursive Bisection.

[BibT_eX]

[DOI]

Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments, 2016

2015

k-way Hypergraph Partitioning via n-Level Recursive Bisection.

[BibT_eX]

[DOI]

CoRR, 2015

n-Level Hypergraph Partitioning.

[BibT_eX]

[DOI]

CoRR, 2015

Graph Partitioning for Independent Sets.

[BibT_eX]

[DOI]

Sebastian Lamm

Proceedings of the Experimental Algorithms - 14th International Symposium, 2015

Practical Massively Parallel Sorting.

[BibT_eX]

[DOI]

Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, 2015

Incorporating road networks into territory design.

[BibT_eX]

[DOI]

Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2015

(Semi-)External Algorithms for Graph Partitioning and Clustering.

[BibT_eX]

[DOI]

Yaroslav Akhremtsev

Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments, 2015

2014

Benchmarking for Graph Clustering and Partitioning.

[BibT_eX]

[DOI]

Encyclopedia of Social Network Analysis and Mining, 2014

Advanced Coarsening Schemes for Graph Partitioning.

[BibT_eX]

[DOI]

Ilya Safro

ACM J. Exp. Algorithmics, 2014

Practical Massively Parallel Sorting - Basic Algorithmic Ideas.

[BibT_eX]

[DOI]

CoRR, 2014

Partitioning Complex Networks via Size-Constrained Clustering.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms - 13th International Symposium, 2014

2013

High Quality Graph Partitioning.

[BibT_eX]

[DOI]

PhD thesis, 2013

KaHIP v0.53 - Karlsruhe High Quality Partitioning - User Guide.

[BibT_eX]

[DOI]

CoRR, 2013

Recent Advances in Graph Partitioning.

[BibT_eX]

[DOI]

CoRR, 2013

Think Locally, Act Globally: Highly Balanced Graph Partitioning.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms, 12th International Symposium, 2013

Efficient Parallel and External Matching.

[BibT_eX]

[DOI]

Proceedings of the Euro-Par 2013 Parallel Processing, 2013

2012

Think Locally, Act Globally: Perfectly Balanced Graph Partitioning

[BibT_eX]

[DOI]

CoRR, 2012

Engineering Graph Partitioning Algorithms.

[BibT_eX]

[DOI]

Vitaly Osipov

Proceedings of the Experimental Algorithms - 11th International Symposium, 2012

Optimized Hybrid Parallel Lattice Boltzmann Fluid Flow Simulations on Complex Geometries.

[BibT_eX]

[DOI]

Proceedings of the Euro-Par 2012 Parallel Processing - 18th International Conference, 2012

High quality graph partitioning.

[BibT_eX]

[DOI]

Proceedings of the Graph Partitioning and Graph Clustering, 2012

Distributed Evolutionary Graph Partitioning.

[BibT_eX]

[DOI]

Proceedings of the 14th Meeting on Algorithm Engineering & Experiments, 2012

2011

Engineering Multilevel Graph Partitioning Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2011, 2011

2010

Engineering a scalable high quality graph partitioner.

[BibT_eX]

[DOI]

Manuel Holtgrewe