Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from EDBT 2026 / reviewers in the wild / expert

Markus G. Wloka

dblp:04/942 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
0since 2021 · last 1992
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 2Theory of computation · 2

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Graph algorithms and graph theory · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Parallel and multicore computing · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Graph algorithms and graph theory
graph partitioning		 0.011990
On Parallelizing Graph-Partitioning Heuristics · ICALP 1990
Parallel and multicore computing
parallel algorithms		 0.011990
On Parallelizing Graph-Partitioning Heuristics · ICALP 1990
Parallel and multicore computing › parallel algorithms › parallel search
parallel heuristic search		 0.011990
On Parallelizing Graph-Partitioning Heuristics · ICALP 1990

Methods — techniques the papers use, named apart from their topics

graph-partitioning heuristics · 0.0graph partitioning heuristics · 0.0
YearPublicationVenuePosition
1992 The parallel complexity of minimizing column conflicts
abstract
Two-layer channel routers typically require a post-processing phase to reduce or eliminate column conflicts. Attempts have been made to parallelize this problem using local search heuristics that swap horizontal channel wire segments. The authors show that all such heuristics for this problem are P-hard and unlikely to be efficiently parallelizable.>
John E. Savage, Markus G. Wloka
 Great Lakes Symposium on VLSI2
1991 Parallelism in Graph-Partitioning
John E. Savage, Markus G. Wloka
 J. Parallel Distributed Comput.2
1990 On Parallelizing Graph-Partitioning Heuristics
John E. Savage, Markus G. Wloka
 ICALP2
1988 A Parallel Algorithm for Channel Routing
John E. Savage, Markus G. Wloka
 WG2