BZPEER
More

Discover

About BZPEERSearchGraph

Research tools

HomeCollectionsResearchCollaborationPublish

Network

ExpertsCommunities

Opportunities

Listings

Account

Log inCreate account
Log inCreate account

Graph explorer

Research map

Explore the papers, people and topics connected to your research.

Maximilian Probst Gutenberg
SearchCollections
Map detail
Maximilian Probst Gutenberg16 visible / 16 total nodes / 36 links

Drag to move · Scroll or pinch to zoom · Select a node for details

Related contextCo-authorshipCo-authorshipCo-authorshipAuthorshipAuthorshipAuthorshipAuthorshipWorks onWorks onWorks onWorks onWorks onWorks onAuthorshipAuthorshipAuthorshipAuthorshipAuthorshipAuthorshipAuthorshipAuthorshipAuthorshipTopic signalTopic signalTopic signalTopic signalTopic signalTopic signalTopic signalTopic signalTopic signalTopic signalTopic signalTopic signalAuthorshipMaximilian Probst GutenbergAMaximilian Probst GutenbergResearcherAn Approximation Algorithm for Graph Label SelectionWAn Approximation Algori...preprint / 2026Josia JohnAJosia JohnResearcherSimon MeierhansASimon MeierhansResearcherFully-Dynamic All-Pairs Shortest Paths: Improved Worst-Case Time and Space BoundsWFully-Dynamic All-Pairs...preprint / 2020Decremental SSSP in Weighted Digraphs: Faster and Against an Adaptive AdversaryWDecremental SSSP in Wei...preprint / 2020Deterministic Algorithms for Decremental Approximate Shortest Paths: Faster and SimplerWDeterministic Algorithm...preprint / 2020New Algorithms and Hardness for Incremental Single-Source Shortest Paths in Directed GraphsWNew Algorithms and Hard...preprint / 2020Data Structures and AlgorithmsTData Structures and Alg...3564 worksMachine LearningTMachine Learning49008 worksDeterministic Decremental SSSP and Approximate Min-Cost Flow in Almost-Linear TimeWDeterministic Decrement...preprint / 2021Deterministic Decremental Reachability, SCC, and Shortest Paths via Directed Expanders and Congestion BalancingWDeterministic Decrement...preprint / 2021Near-Optimal Decremental SSSP in Dense Weighted DigraphsWNear-Optimal Decrementa...preprint / 2020Hardness Results for Laplacians of Simplicial Complexes via Sparse-Linear Equation Complete GadgetsWHardness Results for La...preprint / 2022Derandomizing Directed Random Walks in Almost-Linear TimeWDerandomizing Directed ...preprint / 2022Maximum Flow and Minimum-Cost Flow in Almost-Linear TimeWMaximum Flow and Minimu...preprint / 2022
Person15 links

Maximilian Probst Gutenberg

Researcher

PaperAn Approximation Algorithm for Graph Label SelectionAuthorship / preprint / 2026PersonJosia JohnCo-authorship / ResearcherPersonSimon MeierhansCo-authorship / ResearcherPaperFully-Dynamic All-Pairs Shortest Paths: Improved Worst-Case Time and Space BoundsAuthorship / preprint / 2020PaperDecremental SSSP in Weighted Digraphs: Faster and Against an Adaptive AdversaryAuthorship / preprint / 2020PaperDeterministic Algorithms for Decremental Approximate Shortest Paths: Faster and SimplerAuthorship / preprint / 2020PaperNew Algorithms and Hardness for Incremental Single-Source Shortest Paths in Directed GraphsAuthorship / preprint / 2020TopicData Structures and AlgorithmsWorks on / 3564 works

Personal maps

Sign in to save graph views

Saved views keep the query, focus and filters attached so you can return to the same research slice later.

Sign in

Public snapshots

1 shared view(s)