default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTobias Heuer
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j4]Lars Gottesbüren
, Tobias Heuer, Nikolai Maas, Peter Sanders, Sebastian Schlag:
Scalable High-Quality Hypergraph Partitioning. ACM Trans. Algorithms 20(1): 9:1-9:54 (2024)- [c16]Tobias Heuer:
A Direct k-Way Hypergraph Partitioning Algorithm for Optimizing the Steiner Tree Metric. ALENEX 2024: 15-31 - 2023
- [j3]Ü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:
More Recent Advances in (Hyper)Graph Partitioning. ACM Comput. Surv. 55(12): 253:1-253:38 (2023) - [i14]Lars Gottesbüren, Tobias Heuer, Nikolai Maas, Peter Sanders, Sebastian Schlag:
Scalable High-Quality Hypergraph Partitioning. CoRR abs/2303.17679 (2023) - [i13]Tobias Heuer:
A Direct k-Way Hypergraph Partitioning Algorithm for Optimizing the Steiner Tree Metric. CoRR abs/2309.16694 (2023) - [i12]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:
Open Problems in (Hyper)Graph Decomposition. CoRR abs/2310.11812 (2023) - [i11]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:
Recent Trends in Graph Decomposition (Dagstuhl Seminar 23331). Dagstuhl Reports 13(8): 1-45 (2023) - 2022
- [b1]Tobias Heuer:
Scalable High-Quality Graph and Hypergraph Partitioning. Karlsruhe Institute of Technology, Germany, 2022 - [j2]Sebastian Schlag, Tobias Heuer, Lars Gottesbüren, Yaroslav Akhremtsev, Christian Schulz, Peter Sanders:
High-Quality Hypergraph Partitioning. ACM J. Exp. Algorithmics 27: 1.9:1-1.9:39 (2022) - [c15]Lars Gottesbüren, Tobias Heuer, Peter Sanders, Sebastian Schlag:
Shared-Memory n-level Hypergraph Partitioning. ALENEX 2022: 131-144 - [c14]Ernestine Großmann, Tobias Heuer, Christian Schulz, Darren Strash:
The PACE 2022 Parameterized Algorithms and Computational Experiments Challenge: Directed Feedback Vertex Set. IPEC 2022: 26:1-26:18 - [c13]Lars Gottesbüren, Tobias Heuer, Peter Sanders:
Parallel Flow-Based Hypergraph Partitioning. SEA 2022: 5:1-5:21 - [c12]Thomas Bläsius, Philipp Fischbeck, Lars Gottesbüren, Michael Hamann, Tobias Heuer, Jonas Spinner, Christopher Weyand, Marcus Wilhelm:
A Branch-And-Bound Algorithm for Cluster Editing. SEA 2022: 13:1-13:19 - [i10]Lars Gottesbüren, Tobias Heuer, Peter Sanders:
Parallel Flow-Based Hypergraph Partitioning. CoRR abs/2201.01556 (2022) - [i9]Ü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:
More Recent Advances in (Hyper)Graph Partitioning. CoRR abs/2205.13202 (2022) - [i8]Tim Holzenkamp, Kevin Kuryshev, Thomas Oltmann, Lucas Wäldele, Johann Zuber, Tobias Heuer, Markus Iser:
SATViz: Real-Time Visualization of Clausal Proofs. CoRR abs/2209.05838 (2022) - 2021
- [c11]Lars Gottesbüren, Tobias Heuer, Peter Sanders, Sebastian Schlag:
Scalable Shared-Memory Hypergraph Partitioning. ALENEX 2021: 16-30 - [c10]Lars Gottesbüren, Tobias Heuer, Peter Sanders, Christian Schulz, Daniel Seemaier:
Deep Multilevel Graph Partitioning. ESA 2021: 48:1-48:17 - [c9]Thomas Bläsius, Philipp Fischbeck, Lars Gottesbüren, Michael Hamann, Tobias Heuer, Jonas Spinner, Christopher Weyand, Marcus Wilhelm:
PACE Solver Description: The KaPoCE Exact Cluster Editing Algorithm. IPEC 2021: 27:1-27:3 - [c8]Thomas Bläsius, Philipp Fischbeck, Lars Gottesbüren, Michael Hamann, Tobias Heuer, Jonas Spinner, Christopher Weyand, Marcus Wilhelm:
PACE Solver Description: KaPoCE: A Heuristic Cluster Editing Algorithm. IPEC 2021: 31:1-31:4 - [c7]Tobias Heuer, Nikolai Maas, Sebastian Schlag:
Multilevel Hypergraph Partitioning with Vertex Weights Revisited. SEA 2021: 8:1-8:20 - [i7]Tobias Heuer, Nikolai Maas, Sebastian Schlag:
Multilevel Hypergraph Partitioning with Vertex Weights Revisited. CoRR abs/2102.01378 (2021) - [i6]Lars Gottesbüren, Tobias Heuer, Peter Sanders, Sebastian Schlag:
Shared-Memory n-level Hypergraph Partitioning. CoRR abs/2104.08107 (2021) - [i5]Lars Gottesbüren, Tobias Heuer, Peter Sanders, Christian Schulz, Daniel Seemaier:
Deep Multilevel Graph Partitioning. CoRR abs/2105.02022 (2021) - [i4]Sebastian Schlag, Tobias Heuer, Lars Gottesbüren, Yaroslav Akhremtsev, Christian Schulz, Peter Sanders:
High-Quality Hypergraph Partitioning. CoRR abs/2106.08696 (2021) - 2020
- [i3]Lars Gottesbüren, Tobias Heuer, Peter Sanders, Sebastian Schlag:
Scalable Shared-Memory Hypergraph Partitioning. CoRR abs/2010.10272 (2020)
2010 – 2019
- 2019
- [j1]Tobias Heuer, Peter Sanders, Sebastian Schlag:
Network Flow-Based Refinement for Multilevel Hypergraph Partitioning. ACM J. Exp. Algorithmics 24(1): 2.3:1-2.3:36 (2019) - 2018
- [c6]Tobias Heuer, Peter Sanders, Sebastian Schlag:
Network Flow-Based Refinement for Multilevel Hypergraph Partitioning. SEA 2018: 1:1-1:19 - [i2]Tobias Heuer, Peter Sanders, Sebastian Schlag:
Network Flow-Based Refinement for Multilevel Hypergraph Partitioning. CoRR abs/1802.03587 (2018) - 2017
- [c5]Yaroslav Akhremtsev, Tobias Heuer, Peter Sanders, Sebastian Schlag:
Engineering a direct k-way Hypergraph Partitioning Algorithm. ALENEX 2017: 28-42 - [c4]Niklas Baumstark, Simon Gog, Tobias Heuer, Julian Labeit:
Practical Range Minimum Queries Revisited. SEA 2017: 12:1-12:16 - [c3]Niklas Baumstark, Simon Gog, Tobias Heuer, Julian Labeit:
The Quantile Index - Succinct Self-Index for Top-k Document Retrieval. SEA 2017: 15:1-15:14 - [c2]Tobias Heuer, Sebastian Schlag:
Improving Coarsening Schemes for Hypergraph Partitioning by Exploiting Community Structure. SEA 2017: 21:1-21:19 - 2016
- [c1]Sebastian Schlag, Vitali Henne, Tobias Heuer, Henning Meyerhenke, Peter Sanders, Christian Schulz:
k-way Hypergraph Partitioning via n-Level Recursive Bisection. ALENEX 2016: 53-67 - 2015
- [i1]Sebastian Schlag, Vitali Henne, Tobias Heuer, Henning Meyerhenke, Peter Sanders, Christian Schulz:
k-way Hypergraph Partitioning via n-Level Recursive Bisection. CoRR abs/1511.03137 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:10 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
