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

Mikko Sysikaski

dblp:53/8655 · DBLP profile ↗
← Back
6ranked-venue papers
0as first author
0since 2021 · last 2019
—ORCID · none

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

Theory of computation · 4Artificial intelligence and machine learning · 1Databases, data management, data science and information retrieval · 1Graphics, computer vision, multimedia, augmented reality and games · 1Applied, interdisciplinary, general and emerging computing · 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
2 papers
Computational geometry · 52% Mathematical optimization · 24% Graph algorithms and graph theory · 24%

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

TopicWeightPapersLastEvidence papers
Computational geometry › motion planning
path planning		 0.212015
An Optimal Algorithm for Minimum-Link Rectilinear Paths in Triangulated Rectilinear Domains · ICALP (1) 2015
Mathematical optimization
geometric flow		 0.212014
Optimal Geometric Flows via Dual Programs · SoCG 2014
Graph algorithms and graph theory › graph algorithms › network flow › maximum flow
planar network flow		 0.212014
Optimal Geometric Flows via Dual Programs · SoCG 2014

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

dual linear programming · 0.2
YearPublicationVenuePosition
2019 An Optimal Algorithm for Minimum-Link Rectilinear Paths in Triangulated Rectilinear Domains
Joseph S. B. Mitchell, Valentin Polishchuk, Mikko Sysikaski, Haitao Wang 0001
 Algorithmica3
2015 An Optimal Algorithm for Minimum-Link Rectilinear Paths in Triangulated Rectilinear Domains
Joseph S. B. Mitchell, Valentin Polishchuk, Mikko Sysikaski, Haitao Wang 0001
 ICALP (1)3
2014 Optimal Geometric Flows via Dual Programs
abstract
Considering potentials in the dual of a planar network has proved to be a powerful tool for computing planar maximum flows. In this paper we explore the use of potentials for giving algorithmic and combinatorial results on continuous flows in geometric domains -- a (far going) generalization of discrete flows in unit-capacity planar networks.
Sylvester David Eriksson-Bique, Valentin Polishchuk, Mikko Sysikaski
 SoCG3
2014 Minimum-link paths revisited
Joseph S. B. Mitchell, Valentin Polishchuk, Mikko Sysikaski
 Comput. Geom.3
2011 Faster Algorithms for Minimum-Link Paths with Restricted Orientations
Valentin Polishchuk, Mikko Sysikaski
 WADS2
2010 Dynamic one-sided boundary labeling
abstract
In boundary labeling, features on a map are connected to a stack of labels on the map boundary, using simple polylines called leaders. We consider the setting that the labels are axis-aligned non-overlapping rectangles placed on one side of the map, and leaders are rectilinear polylines with at most one bend. The goal is to find a labeling that minimizes the total length of the leaders.
Martin Nöllenburg, Valentin Polishchuk, Mikko Sysikaski
 GIS3