default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSebastian Schlag
Person information
- affiliation: Apple, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j5]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)- 2023
- [j4]Ü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) - [i18]Lars Gottesbüren, Tobias Heuer, Nikolai Maas, Peter Sanders, Sebastian Schlag:
Scalable High-Quality Hypergraph Partitioning. CoRR abs/2303.17679 (2023) - [i17]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) - [i16]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
- [j3]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 - [i15]Ü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) - 2021
- [j2]Sebastian Schlag, Matthias Schmitt, Christian Schulz:
Faster Support Vector Machines. ACM J. Exp. Algorithmics 26: 15:1-15:21 (2021) - [c14]Merten Popp, Sebastian Schlag, Christian Schulz, Daniel Seemaier:
Multilevel Acyclic Hypergraph Partitioning. ALENEX 2021: 1-15 - [c13]Lars Gottesbüren, Tobias Heuer, Peter Sanders, Sebastian Schlag:
Scalable Shared-Memory Hypergraph Partitioning. ALENEX 2021: 16-30 - [c12]Tobias Heuer, Nikolai Maas, Sebastian Schlag:
Multilevel Hypergraph Partitioning with Vertex Weights Revisited. SEA 2021: 8:1-8:20 - [i14]Tobias Heuer, Nikolai Maas, Sebastian Schlag:
Multilevel Hypergraph Partitioning with Vertex Weights Revisited. CoRR abs/2102.01378 (2021) - [i13]Lars Gottesbüren, Tobias Heuer, Peter Sanders, Sebastian Schlag:
Shared-Memory n-level Hypergraph Partitioning. CoRR abs/2104.08107 (2021) - [i12]Sebastian Schlag, Tobias Heuer, Lars Gottesbüren, Yaroslav Akhremtsev, Christian Schulz, Peter Sanders:
High-Quality Hypergraph Partitioning. CoRR abs/2106.08696 (2021) - 2020
- [b1]Sebastian Schlag:
High-Quality Hypergraph Partitioning. Karlsruhe Institute of Technology, Germany, 2020 - [c11]Lars Gottesbüren, Michael Hamann, Sebastian Schlag, Dorothea Wagner:
Advanced Flow-Based Multilevel Hypergraph Partitioning. SEA 2020: 11:1-11:15 - [i11]Johannes Langguth, Sebastian Schlag, Christian Schulz:
Load-Balanced Bottleneck Objectives in Process Mapping. CoRR abs/2001.09645 (2020) - [i10]Merten Popp, Sebastian Schlag, Christian Schulz, Daniel Seemaier:
Multilevel Acyclic Hypergraph Partitioning. CoRR abs/2002.02962 (2020) - [i9]Lars Gottesbüren, Michael Hamann, Sebastian Schlag, Dorothea Wagner:
Advanced Flow-Based Multilevel Hypergraph Partitioning. CoRR abs/2003.12110 (2020) - [i8]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) - [c10]Sebastian Schlag, Matthias Schmitt, Christian Schulz:
Faster Support Vector Machines. ALENEX 2019: 199-210 - [c9]Sebastian Schlag, Christian Schulz, Daniel Seemaier, Darren Strash:
Scalable Edge Partitioning. ALENEX 2019: 211-225 - [c8]Ivo Baar, Lukas Hübner, Peter Oettig, Adrian Zapletal, Sebastian Schlag, Alexandros Stamatakis, Benoit Morel:
Data Distribution for Phylogenetic Inference with Site Repeats via Judicious Hypergraph Partitioning. IPDPS Workshops 2019: 175-184 - 2018
- [c7]Robin Andre, Sebastian Schlag, Christian Schulz:
Memetic multilevel hypergraph partitioning. GECCO 2018: 347-354 - [c6]Tobias Heuer, Peter Sanders, Sebastian Schlag:
Network Flow-Based Refinement for Multilevel Hypergraph Partitioning. SEA 2018: 1:1-1:19 - [i7]Tobias Heuer, Peter Sanders, Sebastian Schlag:
Network Flow-Based Refinement for Multilevel Hypergraph Partitioning. CoRR abs/1802.03587 (2018) - [i6]Sebastian Schlag, Matthias Schmitt, Christian Schulz:
Faster Support Vector Machines. CoRR abs/1808.06394 (2018) - [i5]Sebastian Schlag, Christian Schulz, Daniel Seemaier, Darren Strash:
Scalable Edge Partitioning. CoRR abs/1808.06411 (2018) - 2017
- [c5]Yaroslav Akhremtsev, Tobias Heuer, Peter Sanders, Sebastian Schlag:
Engineering a direct k-way Hypergraph Partitioning Algorithm. ALENEX 2017: 28-42 - [c4]Tobias Heuer, Sebastian Schlag:
Improving Coarsening Schemes for Hypergraph Partitioning by Exploiting Community Structure. SEA 2017: 21:1-21:19 - [i4]Robin Andre, Sebastian Schlag, Christian Schulz:
Memetic Multilevel Hypergraph Partitioning. CoRR abs/1710.01968 (2017) - 2016
- [c3]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 - [c2]Timo Bingmann, Michael Axtmann, Emanuel Jöbstl, Sebastian Lamm, Huyen Chau Nguyen, Alexander Noe, Sebastian Schlag, Matthias Stumpp, Tobias Sturm, Peter Sanders:
Thrill: High-performance algorithmic distributed batch data processing with C++. IEEE BigData 2016: 172-183 - [i3]Timo Bingmann, Michael Axtmann, Emanuel Jöbstl, Sebastian Lamm, Huyen Chau Nguyen, Alexander Noe, Sebastian Schlag, Matthias Stumpp, Tobias Sturm, Peter Sanders:
Thrill: High-Performance Algorithmic Distributed Batch Data Processing with C++. CoRR abs/1608.05634 (2016) - 2015
- [i2]Vitali Henne, Henning Meyerhenke, Peter Sanders, Sebastian Schlag, Christian Schulz:
n-Level Hypergraph Partitioning. CoRR abs/1505.00693 (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) - 2013
- [c1]Peter Sanders, Sebastian Schlag, Ingo Müller:
Communication efficient algorithms for fundamental big data problems. IEEE BigData 2013: 15-23
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:13 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:
