Tobias Heuer

According to our database, Tobias Heuer authored at least 24 papers between 2015 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Scalable High-Quality Hypergraph Partitioning.

Lars Gottesbüren, Tobias Heuer, Nikolai Maas, Peter Sanders, Sebastian Schlag

ACM Trans. Algorithms, January, 2024

2023

More Recent Advances in (Hyper)Graph Partitioning.

Ümit V. Çatalyürek, Karen D. Devine, Marcelo Fonseca Faraj, Lars Gottesbüren, Tobias Heuer, Henning Meyerhenke, Peter Sanders, Sebastian Schlag, Christian Schulz, Daniel Seemaier, Dorothea Wagner

ACM Comput. Surv., December, 2023

Recent Trends in Graph Decomposition (Dagstuhl Seminar 23331).

George Karypis, Christian Schulz, Darren Strash, Deepak Ajwani, Rob H. Bisseling, Katrin Casel, Ümit V. Çatalyürek, Cédric Chevalier, Florian Chudigiewitsch, Marcelo Fonseca Faraj, Michael R. Fellows, Lars Gottesbüren, Tobias Heuer, Kamer Kaya, Jakub Lacki, Johannes Langguth, Xiaoye Sherry Li, Ruben Mayer, Johannes Meintrup, Yosuke Mizutani, François Pellegrini, Fabrizio Petrini, Frances A. Rosamond, Ilya Safro, Sebastian Schlag, Roohani Sharma, Blair D. Sullivan, Bora Uçar, Albert-Jan Yzelman

Dagstuhl Reports, 2023

Open Problems in (Hyper)Graph Decomposition.

Deepak Ajwani, Rob H. Bisseling, Katrin Casel, Ümit V. Çatalyürek, Cédric Chevalier, Florian Chudigiewitsch, Marcelo Fonseca Faraj, Michael R. Fellows, Lars Gottesbüren, Tobias Heuer, George Karypis, Kamer Kaya, Jakub Lacki, Johannes Langguth, Xiaoye Sherry Li, Ruben Mayer, Johannes Meintrup, Yosuke Mizutani, François Pellegrini, Fabrizio Petrini, Frances A. Rosamond, Ilya Safro, Sebastian Schlag, Christian Schulz, Roohani Sharma, Darren Strash, Blair D. Sullivan, Bora Uçar, Albert-Jan Yzelman

CoRR, 2023

A Direct k-Way Hypergraph Partitioning Algorithm for Optimizing the Steiner Tree Metric.

Tobias Heuer

CoRR, 2023

2022

High-Quality Hypergraph Partitioning.

Sebastian Schlag, Tobias Heuer, Lars Gottesbüren, Yaroslav Akhremtsev, Christian Schulz, Peter Sanders

ACM J. Exp. Algorithmics, December, 2022

Scalable High-Quality Graph and Hypergraph Partitioning.

Tobias Heuer

PhD thesis, 2022

SATViz: Real-Time Visualization of Clausal Proofs.

Tim Holzenkamp, Kevin Kuryshev, Thomas Oltmann, Lucas Wäldele, Johann Zuber, Tobias Heuer, Markus Iser

CoRR, 2022

Parallel Flow-Based Hypergraph Partitioning.

Lars Gottesbüren, Tobias Heuer, Peter Sanders

Proceedings of the 20th International Symposium on Experimental Algorithms, 2022

A Branch-And-Bound Algorithm for Cluster Editing.

Thomas Bläsius, Philipp Fischbeck, Lars Gottesbüren, Michael Hamann, Tobias Heuer, Jonas Spinner, Christopher Weyand, Marcus Wilhelm

Proceedings of the 20th International Symposium on Experimental Algorithms, 2022

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

Ernestine Großmann, Tobias Heuer, Christian Schulz, Darren Strash

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

Shared-Memory n-level Hypergraph Partitioning.

Lars Gottesbüren, Tobias Heuer, Peter Sanders, Sebastian Schlag

Proceedings of the Symposium on Algorithm Engineering and Experiments, 2022

2021

Multilevel Hypergraph Partitioning with Vertex Weights Revisited.

Tobias Heuer, Nikolai Maas, Sebastian Schlag

Proceedings of the 19th International Symposium on Experimental Algorithms, 2021

PACE Solver Description: KaPoCE: A Heuristic Cluster Editing Algorithm.

Thomas Bläsius, Philipp Fischbeck, Lars Gottesbüren, Michael Hamann, Tobias Heuer, Jonas Spinner, Christopher Weyand, Marcus Wilhelm

Proceedings of the 16th International Symposium on Parameterized and Exact Computation, 2021

PACE Solver Description: The KaPoCE Exact Cluster Editing Algorithm.

Thomas Bläsius, Philipp Fischbeck, Lars Gottesbüren, Michael Hamann, Tobias Heuer, Jonas Spinner, Christopher Weyand, Marcus Wilhelm

Proceedings of the 16th International Symposium on Parameterized and Exact Computation, 2021

Deep Multilevel Graph Partitioning.

Lars Gottesbüren, Tobias Heuer, Peter Sanders, Christian Schulz, Daniel Seemaier

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

Scalable Shared-Memory Hypergraph Partitioning.

Lars Gottesbüren, Tobias Heuer, Peter Sanders, Sebastian Schlag

Proceedings of the Symposium on Algorithm Engineering and Experiments, 2021

2019

Network Flow-Based Refinement for Multilevel Hypergraph Partitioning.

Tobias Heuer, Peter Sanders, Sebastian Schlag

ACM J. Exp. Algorithmics, 2019

2017

Improving Coarsening Schemes for Hypergraph Partitioning by Exploiting Community Structure.

Tobias Heuer, Sebastian Schlag

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

The Quantile Index - Succinct Self-Index for Top-k Document Retrieval.

Niklas Baumstark, Simon Gog, Tobias Heuer, Julian Labeit

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

Practical Range Minimum Queries Revisited.

Niklas Baumstark, Simon Gog, Tobias Heuer, Julian Labeit

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

Engineering a direct <i>k</i>-way Hypergraph Partitioning Algorithm.

Yaroslav Akhremtsev, Tobias Heuer, Peter Sanders, Sebastian Schlag

Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments, 2017

2016

<i>k</i>-way Hypergraph Partitioning via <i>n</i>-Level Recursive Bisection.

Sebastian Schlag, Vitali Henne, Tobias Heuer, Henning Meyerhenke, Peter Sanders, Christian Schulz

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

2015

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

Sebastian Schlag, Vitali Henne, Tobias Heuer, Henning Meyerhenke, Peter Sanders, Christian Schulz

CoRR, 2015