default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChristian Schulz 0003
Person information
- affiliation: Heidelberg University, Germany
- affiliation (former): University of Vienna, Austria
- affiliation (former): Karlsruhe Institute of Technology, Institute of Theoretical Informatics, Germany
Other persons with the same name
- Christian Schulz 0001 — Dortmund University, Biochemical and Chemical Engineering, Germany
- Christian Schulz 0002 — SINTEF, Information and Communication Technology, Norway (and 1 more)
- Christian Schulz 0004 — Max Planck Institute for Informatics, Saarbruecken, Germany (and 2 more)
- Christian Schulz 0005 — ETH Zurich, Department of Humanities and Social Sciences, Switzerland
- Christian Schulz 0006 — University of Magdeburg, Research and Competence Cluster for Very Large Business Applications, Germany
- Christian Schulz 0007 — Rose Hulman Institute of Technology, Terre Haute, IN, USA
- Christian Schulz 0008 — Kaiserslautern University of Technology, Germany
- Christian Husodo-Schulz (aka: Christian Schulz 0009) — German Research Center for Artificial Intelligence (DFKI)
- Christian Schulz 0010
![[0000-0002-2708-0632]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0002-2708-0632")
— Ruhr-University Bochum, Institute of Microwave Systems, Germany - Christian Schulz 0011 — Norwegian University of Science and Technology, Department of Biotechnology and Food Science, Trondheim, Norway
- Christian Schulz 0012 — TU Berlin, Institute for Landscape Architecture and Environmental Planning, Germany
- Christian Schulz 0013 — University of Waterloo, Department of Pure Mathematics, Canada (and 1 more)
- Christian Schulz 0014 — Paderborn University, Germany
- Christian Schulz 0015 — University Hospital Regensburg, Germany
- Christian Schulz 0016 — University of Leipzig, Innovation Center Computer Assisted Surgery (ICCAS), Germany
- Christian Schulz 0017 — Helmholtz Centre for Environmental Research, Leipzig, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j22]Ernestine Großmann, Sebastian Lamm, Christian Schulz, Darren Strash:
Finding Near-Optimal Weight Independent Sets at Scale. J. Graph Algorithms Appl. 28(1): 439-473 (2024)- [c71]Henrik Reinstädtler, Christian Schulz, Bora Uçar:
Engineering Edge Orientation Algorithms. ESA 2024: 97:1-97:18 - [c70]Adil Chhabra, Marcelo Fonseca Faraj, Christian Schulz, Daniel Seemaier:
Buffered Streaming Edge Partitioning. SEA 2024: 5:1-5:21 - [c69]Marcelo Fonseca Faraj, Ernestine Großmann, Felix Joos, Thomas Möller, Christian Schulz:
Engineering Weighted Connectivity Augmentation Algorithms. SEA 2024: 11:1-11:22 - [i88]Marcelo Fonseca Faraj, Ernestine Großmann, Felix Joos, Thomas Möller, Christian Schulz:
Engineering Weighted Connectivity Augmentation Algorithms. CoRR abs/2402.07753 (2024) - [i87]Adil Chhabra, Marcelo Fonseca Faraj, Christian Schulz, Daniel Seemaier:
Buffered Streaming Edge Partitioning. CoRR abs/2402.11980 (2024) - [i86]Henrik Reinstädtler, Christian Schulz, Bora Uçar:
Engineering Edge Orientation Algorithms. CoRR abs/2404.13997 (2024) - [i85]Jannick Borowitz, Ernestine Großmann, Christian Schulz:
Optimal Neighborhood Exploration for Dynamic Independent Sets. CoRR abs/2407.06912 (2024) - [i84]Ernestine Großmann, Henrik Reinstädtler, Christian Schulz, Fabian Walliser:
Engineering Fully Dynamic Exact Δ-Orientation Algorithms. CoRR abs/2407.12595 (2024) - [i83]Ernestine Großmann, Felix Joos, Henrik Reinstädtler, Christian Schulz:
Engineering Hypergraph b-Matching Algorithms. CoRR abs/2408.06924 (2024) - [i82]Adil Chhabra, Florian Kurpicz, Christian Schulz, Dominik Schweisgut, Daniel Seemaier:
Partitioning Trillion Edge Graphs on Edge Devices. CoRR abs/2410.07732 (2024) - 2023
- [j21]Ü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) - [c68]Jannick Borowitz, Ernestine Großmann, Christian Schulz:
Engineering Fully Dynamic Δ-Orientation Algorithms. ACDA 2023: 25-37 - [c67]Adil Chhabra, Marcelo Fonseca Faraj, Christian Schulz:
Local Motif Clustering via (Hyper)Graph Partitioning. ALENEX 2023: 96-109 - [c66]Adil Chhabra, Marcelo Fonseca Faraj, Christian Schulz:
Faster Local Motif Clustering via Maximum Flows. ESA 2023: 34:1-34:16 - [c65]Felix Hausberger, Marcelo Fonseca Faraj, Christian Schulz:
A Distributed Multilevel Memetic Algorithm for Signed Graph Clustering. GECCO Companion 2023: 207-210 - [c64]Ernestine Großmann, Sebastian Lamm, Christian Schulz, Darren Strash:
Finding Near-Optimal Weight Independent Sets at Scale. GECCO 2023: 293-302 - [c63]Kamal Eyubov, Marcelo Fonseca Faraj, Christian Schulz:
FREIGHT: Fast Streaming Hypergraph Partitioning. SEA 2023: 15:1-15:16 - [c62]Ernestine Großmann, Jonas Sauer, Christian Schulz, Patrick Steil:
Arc-Flags Meet Trip-Based Public Transit Routing. SEA 2023: 16:1-16:18 - [i81]Jannick Borowitz, Ernestine Großmann, Christian Schulz:
Engineering Fully Dynamic Δ-Orientation Algorithms. CoRR abs/2301.06968 (2023) - [i80]Adil Chhabra, Marcelo Fonseca Faraj, Christian Schulz:
Faster Local Motif Clustering via Maximum Flows. CoRR abs/2301.07145 (2023) - [i79]Roman Erhardt, Kathrin Hanauer, Nils M. Kriege, Christian Schulz, Darren Strash:
Improved Exact and Heuristic Algorithms for Maximum Weight Clique. CoRR abs/2302.00458 (2023) - [i78]Kamal Eyubov, Marcelo Fonseca Faraj, Christian Schulz:
FREIGHT: Fast Streaming Hypergraph Partitioning. CoRR abs/2302.06259 (2023) - [i77]Ernestine Großmann, Jonas Sauer, Christian Schulz, Patrick Steil:
Arc-Flags Meet Trip-Based Public Transit Routing. CoRR abs/2302.07168 (2023) - [i76]Jannick Borowitz, Ernestine Großmann, Christian Schulz, Dominik Schweisgut:
Finding Optimal 2-Packing Sets on Arbitrary Graphs at Scale. CoRR abs/2308.15515 (2023) - [i75]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) - [i74]Ernestine Großmann, Jonas Sauer, Christian Schulz, Patrick Steil, Sascha Witt:
FLASH-TB: Integrating Arc-Flags and Trip-Based Public Transit Routing. CoRR abs/2312.13146 (2023) - [i73]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
- [j20]Marcelo Fonseca Faraj, Christian Schulz:
Buffered Streaming Graph Partitioning. ACM J. Exp. Algorithmics 27: 1.10:1-1.10:26 (2022) - [j19]Kathrin Hanauer, Monika Henzinger, Christian Schulz:
Recent Advances in Fully Dynamic Graph Algorithms - A Quick Reference Guide. ACM J. Exp. Algorithmics 27: 1.11:1-1.11:45 (2022) - [j18]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) - [j17]Kathrin Hanauer, Christian Schulz, Jonathan Trummer:
O'Reach: Even Faster Reachability in Large Graphs. ACM J. Exp. Algorithmics 27: 4.2:1-4.2:27 (2022) - [c61]Monika Henzinger, Alexander Noe, Christian Schulz:
Practical Fully Dynamic Minimum Cut Algorithms. ALENEX 2022: 13-26 - [c60]Marcelo Fonseca Faraj, Christian Schulz:
Recursive Multi-Section on the Fly: Shared-Memory Streaming Algorithms for Hierarchical Graph Partitioning and Process Mapping. CLUSTER 2022: 473-483 - [c59]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 - [c58]Kathrin Hanauer, Monika Henzinger, Christian Schulz:
Recent Advances in Fully Dynamic Graph Algorithms (Invited Talk). SAND 2022: 1:1-1:47 - [c57]Adil Chhabra, Marcelo Fonseca Faraj, Christian Schulz:
Local Motif Clustering via (Hyper)Graph Partitioning. SOCS 2022: 261-263 - [p4]Manuel Penschuck, Ulrik Brandes, Michael Hamann, Sebastian Lamm, Ulrich Meyer, Ilya Safro, Peter Sanders, Christian Schulz:
Recent Advances in Scalable Network Generation1. Massive Graph Analytics 2022: 333-376 - [p3]Faisal N. Abu-Khzam, Sebastian Lamm, Matthias Mnich, Alexander Noe, Christian Schulz, Darren Strash:
Recent Advances in Practical Data Reduction. Algorithms for Big Data 2022: 97-133 - [e1]Christian Schulz, Bora Uçar:
20th International Symposium on Experimental Algorithms, SEA 2022, July 25-27, 2022, Heidelberg, Germany. LIPIcs 233, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2022, ISBN 978-3-95977-251-8 [contents] - [i72]Marcelo Fonseca Faraj, Christian Schulz:
Recursive Multi-Section on the Fly: Shared-Memory Streaming Algorithms for Hierarchical Graph Partitioning and Process Mapping. CoRR abs/2202.00394 (2022) - [i71]Adil Chhabra, Marcelo Fonseca Faraj, Christian Schulz:
Local Motif Clustering via (Hyper)Graph Partitioning. CoRR abs/2205.06176 (2022) - [i70]Ü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) - [i69]Felix Hausberger, Marcelo Fonseca Faraj, Christian Schulz:
A Distributed Multilevel Memetic Algorithm for Signed Graph Clustering. CoRR abs/2208.13618 (2022) - [i68]Ernestine Großmann, Sebastian Lamm, Christian Schulz, Darren Strash:
Finding Near-Optimal Weight Independent Sets at Scale. CoRR abs/2208.13645 (2022) - 2021
- [j16]Sherif Sakr, Angela Bonifati, Hannes Voigt, Alexandru Iosup, Khaled Ammar, Renzo Angles, Walid G. Aref, Marcelo Arenas, Maciej Besta, Peter A. Boncz, Khuzaima Daudjee, Emanuele Della Valle, Stefania Dumbrava, Olaf Hartig, Bernhard Haslhofer, Tim Hegeman, Jan Hidders, Katja Hose, Adriana Iamnitchi, Vasiliki Kalavri, Hugo Kapp, Wim Martens, M. Tamer Özsu, Eric Peukert, Stefan Plantikow, Mohamed Ragab, Matei Ripeanu, Semih Salihoglu, Christian Schulz, Petra Selmer, Juan F. Sequeda, Joshua Shinavier, Gábor Szárnyas, Riccardo Tommasini, Antonino Tumeo, Alexandru Uta, Ana Lucia Varbanescu, Hsiang-Yun Wu, Nikolay Yakovets, Da Yan, Eiko Yoneki:
The future is big graphs: a community view on graph processing systems. Commun. ACM 64(9): 62-71 (2021) - [j15]Sebastian Schlag, Matthias Schmitt, Christian Schulz:
Faster Support Vector Machines. ACM J. Exp. Algorithmics 26: 15:1-15:21 (2021) - [c56]Eugenio Angriman, Henning Meyerhenke, Christian Schulz, Bora Uçar:
Fully-dynamic Weighted Matching Approximation in Practice. ACDA 2021: 32-44 - [c55]Monika Henzinger, Alexander Noe, Christian Schulz:
Faster Parallel Multiterminal Cuts. ACDA 2021: 100-110 - [c54]Merten Popp, Sebastian Schlag, Christian Schulz, Daniel Seemaier:
Multilevel Acyclic Hypergraph Partitioning. ALENEX 2021: 1-15 - [c53]Lara Ost, Christian Schulz, Darren Strash:
Engineering Data Reduction for Nested Dissection. ALENEX 2021: 113-127 - [c52]Alexander Gellner, Sebastian Lamm, Christian Schulz, Darren Strash, Bogdán Zaválnij:
Boosting Data Reduction for the Maximum Weight Independent Set Problem Using Increasing Transformations. ALENEX 2021: 128-142 - [c51]Gramoz Goranci, Monika Henzinger, Dariusz Leniowski, Christian Schulz, Alexander Svozil:
Fully Dynamic k-Center Clustering in Low Dimensional Metrics. ALENEX 2021: 143-153 - [c50]Lars Gottesbüren, Tobias Heuer, Peter Sanders, Christian Schulz, Daniel Seemaier:
Deep Multilevel Graph Partitioning. ESA 2021: 48:1-48:17 - [c49]Maria Predari, Charilaos Tzovas, Christian Schulz, Henning Meyerhenke:
An MPI-based Algorithm for Mapping Complex Networks onto Hierarchical Architectures. Euro-Par 2021: 167-182 - [c48]Kathrin Hanauer, Christian Schulz, Jonathan Trummer:
O'Reach: Even Faster Reachability in Large Graphs. SEA 2021: 13:1-13:24 - [i67]Monika Henzinger, Alexander Noe, Christian Schulz:
Practical Fully Dynamic Minimum Cut Algorithms. CoRR abs/2101.05033 (2021) - [i66]Marcelo Fonseca Faraj, Christian Schulz:
Buffered Streaming Graph Partitioning. CoRR abs/2102.09384 (2021) - [i65]Kathrin Hanauer, Monika Henzinger, Christian Schulz:
Recent Advances in Fully Dynamic Graph Algorithms. CoRR abs/2102.11169 (2021) - [i64]Eugenio Angriman, Henning Meyerhenke, Christian Schulz, Bora Uçar:
Fully-dynamic Weighted Matching Approximation in Practice. CoRR abs/2104.13098 (2021) - [i63]Lars Gottesbüren, Tobias Heuer, Peter Sanders, Christian Schulz, Daniel Seemaier:
Deep Multilevel Graph Partitioning. CoRR abs/2105.02022 (2021) - [i62]Sebastian Schlag, Tobias Heuer, Lars Gottesbüren, Yaroslav Akhremtsev, Christian Schulz, Peter Sanders:
High-Quality Hypergraph Partitioning. CoRR abs/2106.08696 (2021) - [i61]Maria Predari, Charilaos Tzovas, Christian Schulz, Henning Meyerhenke:
An MPI-based Algorithm for Mapping Complex Networks onto Hierarchical Architectures. CoRR abs/2107.02539 (2021) - 2020
- [j14]Orlando Moreira, Merten Popp, Christian Schulz:
Evolutionary multi-level acyclic graph partitioning. J. Heuristics 26(5): 771-799 (2020) - [j13]Alexandra Henzinger, Alexander Noe, Christian Schulz:
ILP-Based Local Search for Graph Partitioning. ACM J. Exp. Algorithmics 25: 1-26 (2020) - [j12]Konrad von Kirchbach, Christian Schulz, Jesper Larsson Träff:
Better Process Mapping and Sparse Quadratic Assignment. ACM J. Exp. Algorithmics 25: 1-19 (2020) - [j11]Yaroslav Akhremtsev, Peter Sanders, Christian Schulz:
High-Quality Shared-Memory Graph Partitioning. IEEE Trans. Parallel Distributed Syst. 31(11): 2710-2722 (2020) - [c47]Damir Ferizovic, Demian Hespe, Sebastian Lamm, Matthias Mnich, Christian Schulz, Darren Strash:
Engineering Kernelization for Maximum Cut. ALENEX 2020: 27-41 - [c46]Monika Henzinger, Alexander Noe, Christian Schulz:
Shared-Memory Branch-and-Reduce for Multiterminal Cuts. ALENEX 2020: 42-55 - [c45]Kathrin Hanauer, Monika Henzinger, Christian Schulz:
Fully Dynamic Single-Source Reachability in Practice: An Experimental Study. ALENEX 2020: 106-119 - [c44]Konrad von Kirchbach, Markus Lehr, Sascha Hunold, Christian Schulz, Jesper Larsson Träff:
Efficient Process-to-Node Mapping Algorithms for Stencil Computations. CLUSTER 2020: 1-11 - [c43]Monika Henzinger, Shahbaz Khan, Richard Paul, Christian Schulz:
Dynamic Matching Algorithms in Practice. ESA 2020: 58:1-58:20 - [c42]Monika Henzinger, Alexander Noe, Christian Schulz, Darren Strash:
Finding All Global Minimum Cuts in Practice. ESA 2020: 59:1-59:20 - [c41]Demian Hespe, Sebastian Lamm, Christian Schulz, Darren Strash:
WeGotYouCovered: The Winning Solver from the PACE 2019 Challenge, Vertex Cover Track. CSC 2020: 1-11 - [c40]Marcelo Fonseca Faraj, Alexander van der Grinten, Henning Meyerhenke, Jesper Larsson Träff, Christian Schulz:
High-Quality Hierarchical Process Mapping. SEA 2020: 4:1-4:15 - [c39]Kathrin Hanauer, Monika Henzinger, Christian Schulz:
Faster Fully Dynamic Transitive Closure in Practice. SEA 2020: 14:1-14:14 - [p2]Sonja Biedermann, Monika Henzinger, Christian Schulz, Bernhard Schuster:
Vienna Graph Clustering. Protein-Protein Interaction Networks 2020: 215-231 - [i60]Marcelo Fonseca Faraj, Alexander van der Grinten, Henning Meyerhenke, Jesper Larsson Träff, Christian Schulz:
High-Quality Hierarchical Process Mapping. CoRR abs/2001.07134 (2020) - [i59]Johannes Langguth, Sebastian Schlag, Christian Schulz:
Load-Balanced Bottleneck Objectives in Process Mapping. CoRR abs/2001.09645 (2020) - [i58]Kathrin Hanauer, Monika Henzinger, Christian Schulz:
Faster Fully Dynamic Transitive Closure in Practice. CoRR abs/2002.00813 (2020) - [i57]Merten Popp, Sebastian Schlag, Christian Schulz, Daniel Seemaier:
Multilevel Acyclic Hypergraph Partitioning. CoRR abs/2002.02962 (2020) - [i56]Monika Henzinger, Alexander Noe, Christian Schulz, Darren Strash:
Finding All Global Minimum Cuts In Practice. CoRR abs/2002.06948 (2020) - [i55]Manuel Penschuck, Ulrik Brandes, Michael Hamann, Sebastian Lamm, Ulrich Meyer, Ilya Safro, Peter Sanders, Christian Schulz:
Recent Advances in Scalable Network Generation. CoRR abs/2003.00736 (2020) - [i54]Monika Henzinger, Shahbaz Khan, Richard Paul, Christian Schulz:
Dynamic Matching Algorithms in Practice. CoRR abs/2004.09099 (2020) - [i53]Lara Ost, Christian Schulz, Darren Strash:
Engineering Data Reduction for Nested Dissection. CoRR abs/2004.11315 (2020) - [i52]Monika Henzinger, Alexander Noe, Christian Schulz:
Faster Parallel Multiterminal Cuts. CoRR abs/2004.11666 (2020) - [i51]Sascha Hunold, Konrad von Kirchbach, Markus Lehr, Christian Schulz, Jesper Larsson Träff:
Efficient Process-to-Node Mapping Algorithms for Stencil Computations. CoRR abs/2005.09521 (2020) - [i50]Alexander Gellner, Sebastian Lamm, Christian Schulz, Darren Strash, Bogdán Zaválnij:
Boosting Data Reduction for the Maximum Weight Independent Set Problem Using Increasing Transformations. CoRR abs/2008.05180 (2020) - [i49]Kathrin Hanauer, Christian Schulz, Jonathan Trummer:
Faster Reachability in Static Graphs. CoRR abs/2008.10932 (2020) - [i48]Sherif Sakr, Angela Bonifati, Hannes Voigt, Alexandru Iosup, Khaled Ammar, Renzo Angles, Walid G. Aref, Marcelo Arenas, Maciej Besta, Peter A. Boncz, Khuzaima Daudjee, Emanuele Della Valle, Stefania Dumbrava, Olaf Hartig, Bernhard Haslhofer, Tim Hegeman, Jan Hidders, Katja Hose, Adriana Iamnitchi, Vasiliki Kalavri, Hugo Kapp, Wim Martens, M. Tamer Özsu, Eric Peukert, Stefan Plantikow, Mohamed Ragab, Matei Ripeanu, Semih Salihoglu, Christian Schulz, Petra Selmer, Juan F. Sequeda, Joshua Shinavier, Gábor Szárnyas, Riccardo Tommasini, Antonino Tumeo, Alexandru Uta, Ana Lucia Varbanescu, Hsiang-Yun Wu, Nikolay Yakovets, Da Yan, Eiko Yoneki:
The Future is Big Graphs! A Community View on Graph Processing Systems. CoRR abs/2012.06171 (2020) - [i47]Faisal N. Abu-Khzam, Sebastian Lamm, Matthias Mnich, Alexander Noe, Christian Schulz, Darren Strash:
Recent Advances in Practical Data Reduction. CoRR abs/2012.12594 (2020)
2010 – 2019
- 2019
- [j10]Demian Hespe, Christian Schulz, Darren Strash:
Scalable Kernelization for Maximum Independent Sets. ACM J. Exp. Algorithmics 24(1): 1.16:1-1.16:22 (2019) - [j9]Daniel Funke, Sebastian Lamm, Ulrich Meyer, Manuel Penschuck, Peter Sanders, Christian Schulz, Darren Strash, Moritz von Looz:
Communication-free massively distributed graph generation. J. Parallel Distributed Comput. 131: 200-217 (2019) - [c38]Sebastian Lamm, Christian Schulz, Darren Strash, Robert Williger, Huashuo Zhang:
Exactly Solving the Maximum Weight Independent Set Problem on Large Real-World Graphs. ALENEX 2019: 144-158 - [c37]Sebastian Schlag, Matthias Schmitt, Christian Schulz:
Faster Support Vector Machines. ALENEX 2019: 199-210 - [c36]Sebastian Schlag, Christian Schulz, Daniel Seemaier, Darren Strash:
Scalable Edge Partitioning. ALENEX 2019: 211-225 - [c35]Monika Henzinger, Alexander Noe, Christian Schulz:
Shared-Memory Exact Minimum Cuts. IPDPS 2019: 13-22 - [c34]Kai Fieger, Tomás Balyo, Christian Schulz, Dominik Schreiber:
Finding Optimal Longest Paths by Dynamic Programming in Parallel. SOCS 2019: 61-69 - [r3]Christian Schulz, Darren Strash:
Graph Partitioning: Formulations and Applications to Big Data. Encyclopedia of Big Data Technologies 2019 - [i46]Kathrin Hanauer, Monika Henzinger, Christian Schulz:
Fully Dynamic Single-Source Reachability in Practice: An Experimental Study. CoRR abs/1905.01216 (2019) - [i45]Kai Fieger, Tomás Balyo, Christian Schulz, Dominik Schreiber:
Finding Optimal Longest Paths by Dynamic Programming in Parallel. CoRR abs/1905.03645 (2019) - [i44]Damir Ferizovic, Demian Hespe, Sebastian Lamm, Matthias Mnich, Christian Schulz, Darren Strash:
Engineering Kernelization for Maximum Cut. CoRR abs/1905.10902 (2019) - [i43]Monika Henzinger, Alexander Noe, Christian Schulz:
Shared-Memory Branch-and-Reduce for Multiterminal Cuts. CoRR abs/1908.04141 (2019) - [i42]Demian Hespe, Sebastian Lamm, Christian Schulz, Darren Strash:
WeGotYouCovered: The Winning Solver from the PACE 2019 Implementation Challenge, Vertex Cover Track. CoRR abs/1908.06795 (2019) - [i41]Christian Schulz:
Scalable Graph Algorithms. CoRR abs/1912.00245 (2019) - [i40]Bart M. P. Jansen, Christian Schulz, Hisao Tamaki:
Parameterized Graph Algorithms & Data Reduction: Theory Meets Practice (NII Shonan Meeting 144). NII Shonan Meet. Rep. 2019 (2019) - 2018
- [j8]Monika Henzinger, Alexander Noe, Christian Schulz, Darren Strash:
Practical Minimum Cut Algorithms. ACM J. Exp. Algorithmics 23 (2018) - [j7]Henning Meyerhenke, Martin Nöllenburg, Christian Schulz:
Drawing Large Graphs by Multilevel Maxent-Stress Optimization. IEEE Trans. Vis. Comput. Graph. 24(5): 1814-1827 (2018) - [c33]Monika Henzinger, Alexander Noe, Christian Schulz, Darren Strash:
Practical Minimum Cut Algorithms. ALENEX 2018: 48-61 - [c32]Demian Hespe, Christian Schulz, Darren Strash:
Scalable Kernelization for Maximum Independent Sets. ALENEX 2018: 223-237 - [c31]Yaroslav Akhremtsev, Peter Sanders, Christian Schulz:
High-Quality Shared-Memory Graph Partitioning. Euro-Par 2018: 659-671 - [c30]Orlando Moreira, Merten Popp, Christian Schulz:
Evolutionary multi-level acyclic graph partitioning. GECCO 2018: 332-339 - [c29]Robin Andre, Sebastian Schlag, Christian Schulz:
Memetic multilevel hypergraph partitioning. GECCO 2018: 347-354 - [c28]Daniel Funke, Sebastian Lamm, Peter Sanders, Christian Schulz, Darren Strash, Moritz von Looz:
Communication-Free Massively Distributed Graph Generation. IPDPS 2018: 336-347 - [c27]Sonja Biedermann, Monika Henzinger, Christian Schulz, Bernhard Schuster:
Memetic Graph Clustering. SEA 2018: 3:1-3:15 - [c26]Alexandra Henzinger, Alexander Noe, Christian Schulz:
ILP-based Local Search for Graph Partitioning. SEA 2018: 4:1-4:15 - [r2]David A. Bader, Andrea Kappes, Henning Meyerhenke, Peter Sanders, Christian Schulz, Dorothea Wagner:
Benchmarking for Graph Clustering and Partitioning. Encyclopedia of Social Network Analysis and Mining. 2nd Ed. 2018 - [i39]Sonja Biedermann, Monika Henzinger, Christian Schulz, Bernhard Schuster:
Memetic Graph Clustering. CoRR abs/1802.07034 (2018) - [i38]Alexandra Henzinger, Alexander Noe, Christian Schulz:
ILP-based Local Search for Graph Partitioning. CoRR abs/1802.07144 (2018) - [i37]Monika Henzinger, Alexander Noe, Christian Schulz:
Shared-memory Exact Minimum Cuts. CoRR abs/1808.05458 (2018) - [i36]Sebastian Schlag, Matthias Schmitt, Christian Schulz:
Faster Support Vector Machines. CoRR abs/1808.06394 (2018) - [i35]Sebastian Schlag, Christian Schulz, Daniel Seemaier, Darren Strash:
Scalable Edge Partitioning. CoRR abs/1808.06411 (2018) - [i34]Sebastian Lamm, Christian Schulz, Darren Strash, Robert Williger, Huashuo Zhang:
Exactly Solving the Maximum Weight Independent Set Problem on Large Real-World Graphs. CoRR abs/1810.10834 (2018) - 2017
- [j6]Sebastian Lamm, Peter Sanders, Christian Schulz, Darren Strash, Renato F. Werneck:
Finding near-optimal independent sets at scale. J. Heuristics 23(4): 207-229 (2017) - [j5]Henning Meyerhenke, Peter Sanders, Christian Schulz:
Parallel Graph Partitioning for Complex Networks. IEEE Trans. Parallel Distributed Syst. 28(9): 2625-2638 (2017) - [c25]Peter Sanders, Christian Schulz, Darren Strash, Robert Williger:
Distributed evolutionary k-way node separators. GECCO 2017: 345-352 - [c24]Christian Schulz, Jesper Larsson Träff:
Better Process Mapping and Sparse Quadratic Assignment. SEA 2017: 4:1-4:15 - [c23]Orlando Moreira, Merten Popp, Christian Schulz:
Graph Partitioning with Acyclicity Constraints. SEA 2017: 30:1-30:15 - [i33]Peter Sanders, Christian Schulz, Darren Strash, Robert Williger:
Distributed Evolutionary k-way Node Separators. CoRR abs/1702.01692 (2017) - [i32]Christian Schulz, Jesper Larsson Träff:
Better Process Mapping and Sparse Quadratic Assignment. CoRR abs/1702.04164 (2017) - [i31]Tomás Balyo, Kai Fieger, Christian Schulz:
Optimal Longest Paths by Dynamic Programming. CoRR abs/1702.04170 (2017) - [i30]Christian Schulz, Jesper Larsson Träff:
VieM v1.00 - Vienna Mapping and Sparse Quadratic Assignment User Guide. CoRR abs/1703.05509 (2017) - [i29]Orlando Moreira, Merten Popp, Christian Schulz:
Graph Partitioning with Acyclicity Constraints. CoRR abs/1704.00705 (2017) - [i28]Monika Henzinger, Alexander Noe, Christian Schulz, Darren Strash:
Practical Minimum Cut Algorithms. CoRR abs/1708.06127 (2017) - [i27]Demian Hespe, Christian Schulz, Darren Strash:
Scalable Kernelization for Maximum Independent Sets. CoRR abs/1708.06151 (2017) - [i26]Orlando Moreira, Merten Popp, Christian Schulz:
Evolutionary Acyclic Graph Partitioning. CoRR abs/1709.08563 (2017) - [i25]Robin Andre, Sebastian Schlag, Christian Schulz:
Memetic Multilevel Hypergraph Partitioning. CoRR abs/1710.01968 (2017) - [i24]Daniel Funke, Sebastian Lamm, Peter Sanders, Christian Schulz, Darren Strash, Moritz von Looz:
Communication-free Massively Distributed Graph Generation. CoRR abs/1710.07565 (2017) - [i23]Yaroslav Akhremtsev, Peter Sanders, Christian Schulz:
High-Quality Shared-Memory Graph Partitioning. CoRR abs/1710.08231 (2017) - 2016
- [j4]Henning Meyerhenke, Peter Sanders, Christian Schulz:
Partitioning (hierarchically clustered) complex networks via size-constrained graph clustering. J. Heuristics 22(5): 759-782 (2016) - [j3]Peter Sanders, Christian Schulz:
Scalable generation of scale-free graphs. Inf. Process. Lett. 116(7): 489-491 (2016) - [j2]Roland Glantz, Henning Meyerhenke, Christian Schulz:
Tree-Based Coarsening and Partitioning of Complex Networks. ACM J. Exp. Algorithmics 21(1): 1.6:1-1.6:20 (2016) - [c22]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 - [c21]Sebastian Lamm, Peter Sanders, Christian Schulz, Darren Strash, Renato F. Werneck:
Finding Near-Optimal Independent Sets at Scale. ALENEX 2016: 138-150 - [c20]Jakob Dahlum, Sebastian Lamm, Peter Sanders, Christian Schulz, Darren Strash, Renato F. Werneck:
Accelerating Local Search for the Maximum Independent Set Problem. SEA 2016: 118-133 - [c19]Peter Sanders, Christian Schulz:
Advanced Multilevel Node Separator Algorithms. SEA 2016: 294-309 - [p1]Aydin Buluç, Henning Meyerhenke, Ilya Safro, Peter Sanders, Christian Schulz:
Recent Advances in Graph Partitioning. Algorithm Engineering 2016: 117-158 - [i22]Jakob Dahlum, Sebastian Lamm, Peter Sanders, Christian Schulz, Darren Strash, Renato F. Werneck:
Accelerating Local Search for the Maximum Independent Set Problem. CoRR abs/1602.01659 (2016) - [i21]Peter Sanders, Christian Schulz:
Scalable Generation of Scale-free Graphs. CoRR abs/1602.07106 (2016) - 2015
- [c18]Yaroslav Akhremtsev, Peter Sanders, Christian Schulz:
(Semi-)External Algorithms for Graph Partitioning and Clustering. ALENEX 2015: 33-43 - [c17]Henning Meyerhenke, Martin Nöllenburg, Christian Schulz:
Drawing Large Graphs by Multilevel Maxent-Stress Optimization. GD 2015: 30-43 - [c16]Nitin Ahuja, Matthias Bender, Peter Sanders, Christian Schulz, Andreas Wagner:
Incorporating road networks into territory design. SIGSPATIAL/GIS 2015: 4:1-4:10 - [c15]Henning Meyerhenke, Peter Sanders, Christian Schulz:
Parallel Graph Partitioning for Complex Networks. IPDPS 2015: 1055-1064 - [c14]Michael Axtmann, Timo Bingmann, Peter Sanders, Christian Schulz:
Practical Massively Parallel Sorting. SPAA 2015: 13-23 - [c13]Sebastian Lamm, Peter Sanders, Christian Schulz:
Graph Partitioning for Independent Sets. SEA 2015: 68-81 - [i20]Sebastian Lamm, Peter Sanders, Christian Schulz:
Graph Partitioning for Independent Sets. CoRR abs/1502.01687 (2015) - [i19]Nitin Ahuja, Matthias Bender, Peter Sanders, Christian Schulz, Andreas Wagner:
Incorporating Road Networks into Territory Design. CoRR abs/1504.07846 (2015) - [i18]Vitali Henne, Henning Meyerhenke, Peter Sanders, Sebastian Schlag, Christian Schulz:
n-Level Hypergraph Partitioning. CoRR abs/1505.00693 (2015) - [i17]Henning Meyerhenke, Martin Nöllenburg, Christian Schulz:
Drawing Large Graphs by Multilevel Maxent-Stress Optimization. CoRR abs/1506.04383 (2015) - [i16]Sebastian Lamm, Peter Sanders, Christian Schulz, Darren Strash, Renato F. Werneck:
Finding Near-Optimal Independent Sets at Scale. CoRR abs/1509.00764 (2015) - [i15]Peter Sanders, Christian Schulz:
Advanced Multilevel Node Separator Algorithms. CoRR abs/1509.01190 (2015) - [i14]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) - 2014
- [j1]Ilya Safro, Peter Sanders, Christian Schulz:
Advanced Coarsening Schemes for Graph Partitioning. ACM J. Exp. Algorithmics 19(1) (2014) - [c12]Henning Meyerhenke, Peter Sanders, Christian Schulz:
Partitioning Complex Networks via Size-Constrained Clustering. SEA 2014: 351-363 - [c11]Roland Glantz, Henning Meyerhenke, Christian Schulz:
Tree-Based Coarsening and Partitioning of Complex Networks. SEA 2014: 364-375 - [r1]David A. Bader, Henning Meyerhenke, Peter Sanders, Christian Schulz, Andrea Kappes, Dorothea Wagner:
Benchmarking for Graph Clustering and Partitioning. Encyclopedia of Social Network Analysis and Mining 2014: 73-82 - [i13]Roland Glantz, Henning Meyerhenke, Christian Schulz:
Tree-based Coarsening and Partitioning of Complex Networks. CoRR abs/1402.2782 (2014) - [i12]Henning Meyerhenke, Peter Sanders, Christian Schulz:
Partitioning Complex Networks via Size-constrained Clustering. CoRR abs/1402.3281 (2014) - [i11]Henning Meyerhenke, Peter Sanders, Christian Schulz:
Parallel Graph Partitioning for Complex Networks. CoRR abs/1404.4797 (2014) - [i10]Yaroslav Akhremtsev, Peter Sanders, Christian Schulz:
(Semi-)External Algorithms for Graph Partitioning and Clustering. CoRR abs/1404.4887 (2014) - [i9]Michael Axtmann, Timo Bingmann, Peter Sanders, Christian Schulz:
Practical Massively Parallel Sorting - Basic Algorithmic Ideas. CoRR abs/1410.6754 (2014) - 2013
- [b1]Christian Schulz:
High Quality Graph Partitioning. Karlsruhe Institute of Technology, 2013 - [c10]Marcel Birn, Vitaly Osipov, Peter Sanders, Christian Schulz, Nodari Sitchinava:
Efficient Parallel and External Matching. Euro-Par 2013: 659-670 - [c9]Peter Sanders, Christian Schulz:
Think Locally, Act Globally: Highly Balanced Graph Partitioning. SEA 2013: 164-175 - [i8]Marcel Birn, Vitaly Osipov, Peter Sanders, Christian Schulz, Nodari Sitchinava:
Efficient Parallel and External Matching. CoRR abs/1302.4587 (2013) - [i7]Peter Sanders, Christian Schulz:
KaHIP v0.53 - Karlsruhe High Quality Partitioning - User Guide. CoRR abs/1311.1714 (2013) - [i6]Aydin Buluç, Henning Meyerhenke, Ilya Safro, Peter Sanders, Christian Schulz:
Recent Advances in Graph Partitioning. CoRR abs/1311.3144 (2013) - 2012
- [c8]Peter Sanders, Christian Schulz:
Distributed Evolutionary Graph Partitioning. ALENEX 2012: 16-29 - [c7]Peter Sanders, Christian Schulz:
High quality graph partitioning. Graph Partitioning and Graph Clustering 2012: 1-18 - [c6]Jonas Fietz, Mathias J. Krause, Christian Schulz, Peter Sanders, Vincent Heuveline:
Optimized Hybrid Parallel Lattice Boltzmann Fluid Flow Simulations on Complex Geometries. Euro-Par 2012: 818-829 - [c5]Vitaly Osipov, Peter Sanders, Christian Schulz:
Engineering Graph Partitioning Algorithms. SEA 2012: 18-26 - [c4]Ilya Safro, Peter Sanders, Christian Schulz:
Advanced Coarsening Schemes for Graph Partitioning. SEA 2012: 369-380 - [i5]Ilya Safro, Peter Sanders, Christian Schulz:
Advanced Coarsening Schemes for Graph Partitioning. CoRR abs/1201.6488 (2012) - [i4]Peter Sanders, Christian Schulz:
Think Locally, Act Globally: Perfectly Balanced Graph Partitioning. CoRR abs/1210.0477 (2012) - 2011
- [c3]Peter Sanders, Christian Schulz:
Engineering Multilevel Graph Partitioning Algorithms. ESA 2011: 469-480 - [i3]Peter Sanders, Christian Schulz:
Distributed Evolutionary Graph Partitioning. CoRR abs/1110.0477 (2011) - 2010
- [c2]Manuel Holtgrewe, Peter Sanders, Christian Schulz:
Engineering a scalable high quality graph partitioner. IPDPS 2010: 1-12 - [i2]Peter Sanders, Christian Schulz:
Engineering Multilevel Graph Partitioning Algorithms. CoRR abs/1012.0006 (2010)
2000 – 2009
- 2009
- [c1]Daniel Delling, Robert Görke, Christian Schulz, Dorothea Wagner:
Orca Reduction and ContrAction Graph Clustering. AAIM 2009: 152-165 - [i1]Manuel Holtgrewe, Peter Sanders, Christian Schulz:
Engineering a Scalable High Quality Graph Partitioner. CoRR abs/0910.2004 (2009)
Coauthor Index
[j21] [j18] [p4] [i70] [c50] [i63] [i62] [j11] [i55] [j9] [c31] [c28] [r2] [j6] [j5] [c25] [i33] [i24] [i23] [j4] [j3] [c22] [c21] [c20] [c19] [p1] [i22] [i21] [c18] [c16] [c15] [c14] [c13] [i20] [i19] [i18] [i16] [i15] [i14] [j1] [c12] [r1] [i12] [i11] [i10] [i9] [c10] [c9] [i8] [i7] [i6] [c8] [c7] [c6] [c5] [c4] [i5] [i4] [c3] [i3] [c2] [i2] [i1]
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-12-04 21:12 CET 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:
