Andreas Weißl

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 VLDB 2026 / reviewers in the wild / expert

dblp:28/4247 · DBLP profile ↗

← Back

3ranked-venue papers

0as first author

0since 2021 · last 2010

—ORCID · none

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

Theory of computation · 2Graphics, computer vision, multimedia, augmented reality and games · 1

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 · 50% Algorithms and data structures · 50%

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

Topic	Weight	Papers	Last	Evidence papers
Algorithms and data structures › combinatorial algorithms counting and enumeration	0.1	1	2005	Random planar graphs with n nodes and a fixed number of edges · SODA 2005
Graph algorithms and graph theory random graphs	0.1	1	2005	Random planar graphs with n nodes and a fixed number of edges · SODA 2005

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

probabilistic combinatorics · 0.1

Year	Publication	Venue	Position
2010	On Euclidean vehicle routing with allocation Jan Remy, Reto Spöhel, Andreas Weißl	Comput. Geom.	3
2007	On Euclidean Vehicle Routing with Allocation Jan Remy, Reto Spöhel, Andreas Weißl	WADS	3
2005	Random planar graphs with n nodes and a fixed number of edges Stefanie Gerke, Colin McDiarmid, Angelika Steger, Andreas Weißl	SODA	4