Christian Schulz

Citirano

	Sve	Od 2018.
Citati	3174	2249
H-indeks	27	25
i10-indeks	53	50

580

290

145

435

201120122013201420152016201720182019202020212022202314 37 80 109 153 206 233 249 331 475 491 579 104

Javni pristup

Prikaži sve

42 članka

0 članaka

dostupno

nije dostupno

Na temelju uvjeta financiranja

Suautori

Peter SandersProfessor of Computer Science, Karlsruhe Institute of TechnologyPotvrđena adresa e-pošte na kit.edu
Henning MeyerhenkeProfessor of Computer Science, HU BerlinPotvrđena adresa e-pošte na hu-berlin.de
Darren StrashHamilton CollegePotvrđena adresa e-pošte na hamilton.edu
Sebastian LammKarlsruhe Institute of Technology (KIT)Potvrđena adresa e-pošte na kit.edu
Monika HenzingerProfessor of Computer Science, University of ViennaPotvrđena adresa e-pošte na univie.ac.at
Ilya SafroAssociate Professor of Computer Science, University of DelawarePotvrđena adresa e-pošte na udel.edu
Sebastian SchlagAlgorithm Engineer at ApplePotvrđena adresa e-pošte na sebastianschlag.de
Alexander NoePhD Student, University of ViennaPotvrđena adresa e-pošte na univie.ac.at
Dorothea WagnerProfessor of Computer Science, Karlsruhe Institute of Technology (KIT)Potvrđena adresa e-pošte na kit.edu
Tobias HeuerPhD Student, Karlsruhe Institute of TechnologyPotvrđena adresa e-pošte na kit.edu
Renato WerneckAmazonPotvrđena adresa e-pošte na cs.princeton.edu
Marcelo Fonseca FarajUniversität HeidelbergPotvrđena adresa e-pošte na informatik.uni-heidelberg.de
Kathrin HanauerUniversity of ViennaPotvrđena adresa e-pošte na univie.ac.at
Demian HespeKarlsruhe Institute of TechnologyPotvrđena adresa e-pošte na kit.edu
Aydın BuluçLawrence Berkeley National Laboratory and UC BerkeleyPotvrđena adresa e-pošte na lbl.gov
Yaroslav AkhremtsevKarlsruhe Institute of TechnologyPotvrđena adresa e-pošte na kit.edu
Merten PoppBMW AGPotvrđena adresa e-pošte na bmw.de
Martin NöllenburgProfessor, Algorithms and Complexity Group, TU WienPotvrđena adresa e-pošte na ac.tuwien.ac.at
Manuel HoltgreweCore Unit Bioinformatics, Berlin Institute of HealthPotvrđena adresa e-pošte na bih-charite.de
Daniel SeemaierKarlsruhe Institute of Technology (KIT)Potvrđena adresa e-pošte na kit.edu

Prati

Christian Schulz

Professor of Computer Science, Heidelberg University

Potvrđena adresa e-pošte na informatik.uni-heidelberg.de - Početna stranica

Graph Partitioning Algorithm Engineering Graph Algorithms Practical Data Reduction Dynamic Algorithms


Naslov Poredaj po navodima Poredaj po godini Poredaj po naslovu	Citirano Citirano	Godina
Recent Advances in Graph Partitioning A Buluc, H Meyerhenke, I Safro, P Sanders, C Schulz Algorithm Engineering 9220, 117--158, 2016	493	2016
Think locally, act globally: Highly balanced graph partitioning P Sanders, C Schulz Experimental Algorithms: 12th International Symposium, SEA 2013, Rome, Italy …, 2013	253	2013
Engineering multilevel graph partitioning algorithms P Sanders, C Schulz Algorithms–ESA 2011, 469-480, 2011	221	2011
Benchmarking for Graph Clustering and Partitioning D Bader, A Kappes, H Meyerhenke, P Sanders, C Schulz, D Wagner Encyclopedia of Social Network Analysis and Mining, 2014	194*	2014
Parallel graph partitioning for complex networks H Meyerhenke, P Sanders, C Schulz IEEE Transactions on Parallel and Distributed Systems 28 (9), 2625-2638, 2017	153	2017
Distributed Evolutionary Graph Partitioning P Sanders, C Schulz ALENEX 2012, 2012	138	2012
Engineering a scalable high quality graph partitioner M Holtgrewe, P Sanders, C Schulz Parallel & Distributed Processing (IPDPS), 2010 IEEE International Symposium …, 2010	131	2010
Advanced coarsening schemes for graph partitioning I Safro, P Sanders, C Schulz Journal of Experimental Algorithmics (JEA) 19, 1-24, 2015	109	2015
The Future is Big Graphs! A Community View on Graph Processing Systems S Sakr, A Bonifati, H Voigt, A Iosup, K Ammar, R Angles, W Aref, M Arenas, ... Communications of the ACM, 2021	87	2021
Partitioning (hierarchically clustered) complex networks via size-constrained graph clustering H Meyerhenke, P Sanders, C Schulz Journal of Heuristics 22, 759-782, 2016	87*	2016
Finding near-optimal independent sets at scale S Lamm, P Sanders, C Schulz, D Strash, RF Werneck 2016 Proceedings of the Eighteenth Workshop on Algorithm Engineering and …, 2016	79	2016
High quality graph partitioning P Sanders, C Schulz Graph Partitioning and Graph Clustering, 1-18, 2012	66	2012
Communication-free massively distributed graph generation D Funke, S Lamm, U Meyer, M Penschuck, P Sanders, C Schulz, D Strash, ... Journal of Parallel and Distributed Computing 131, 200-217, 2019	62	2019
k-way Hypergraph Partitioning via n-Level Recursive Bisection S Schlag, V Henne, T Heuer, H Meyerhenke, P Sanders, C Schulz 2016 Proceedings of the Eighteenth Workshop on Algorithm Engineering and …, 2016	52	2016
Drawing Large Graphs by Multilevel Maxent-Stress Optimization H Meyerhenke, M Nöllenburg, C Schulz IEEE Transactions on Visualization and Computer Graphics 24 (5), 1814--1827, 2017	47	2017
Optimized hybrid parallel lattice Boltzmann fluid flow simulations on complex geometries J Fietz, MJ Krause, C Schulz, P Sanders, V Heuveline Euro-Par 2012 Parallel Processing: 18th International Conference, Euro-Par …, 2012	47	2012
High quality graph partitioning C Schulz epubli GmbH, 2013	45	2013
KaHIP–Karlsruhe High Qualtity Partitioning Homepage P Sanders, C Schulz	43*	2016
High-quality shared-memory graph partitioning Y Akhremtsev, P Sanders, C Schulz IEEE Transactions on Parallel and Distributed Systems 31 (11), 2710-2722, 2020	39	2020
Accelerating Local Search for the Maximum Independent Set Problem J Dahlum, S Lamm, P Sanders, C Schulz, D Strash, RF Werneck http://arxiv.org/abs/1602.01659, 2016	39	2016

Sustav trenutno ne može provesti ovu radnju. Pokušajte ponovo kasnije.

Članci 1–20

Godišnji broj citata

Dvostruki navodi

Spojeni navodi

Dodavanje suautoraSuautori

Prati

Citirano

Suautori