Valentin Polishchuk

Available identifiers

zbMath Open polishchuk.valentinMaRDI QIDQ390126

List of research outcomes

Publication	Date of Publication	Type
https://portal.mardi4nfdi.de/entity/Q6059972	2023-11-02	Paper
https://portal.mardi4nfdi.de/entity/Q5875617	2023-02-03	Paper
https://portal.mardi4nfdi.de/entity/Q3301019	2020-08-11	Paper
Most vital segment barriers	2020-01-16	Paper
Altitude terrain guarding and guarding uni-monotone polygons	2019-10-25	Paper
An optimal algorithm for minimum-link rectilinear paths in triangulated rectilinear domains	2019-01-11	Paper
Improved Approximation Algorithms for Relay Placement	2018-10-30	Paper
Optimal Geometric Flows via Dual Programs	2018-04-23	Paper
https://portal.mardi4nfdi.de/entity/Q3132885	2018-01-30	Paper
https://portal.mardi4nfdi.de/entity/Q4601866	2018-01-24	Paper
https://portal.mardi4nfdi.de/entity/Q5368719	2017-10-10	Paper
Geometric k Shortest Paths	2017-10-05	Paper
https://portal.mardi4nfdi.de/entity/Q5282814	2017-07-17	Paper
Computing the \(L_1\) geodesic diameter and center of a polygonal domain	2017-05-11	Paper
https://portal.mardi4nfdi.de/entity/Q2978407	2017-04-24	Paper
Shortest path to a segment and quickest visibility queries	2017-03-30	Paper
On Minimizing Crossings in Storyline Visualizations	2017-02-10	Paper
The minimum backlog problem	2015-10-30	Paper
An optimal algorithm for minimum-link rectilinear paths in triangulated rectilinear domains	2015-10-27	Paper
On Polygonal Paths with Bounded Discrete-Curvature: The Inflection-Free Case	2015-09-14	Paper
Order-\(k\) \(\alpha\)-hulls and \(\alpha\)-shapes	2015-06-25	Paper
Optimizing airspace closure with respect to politicians' egos	2015-05-26	Paper
Improved approximations for two-stage MIN-cut and shortest path problems under uncertainty	2015-02-09	Paper
Scandinavian thins on top of cake: new and improved algorithms for stacking and packing	2015-01-21	Paper
Minimum-link paths revisited	2014-05-19	Paper
Shape approximation using k-order alpha-hulls	2014-04-03	Paper
Convex transversals	2014-01-22	Paper
Simple wriggling is hard unless you are a fat hippo	2012-12-06	Paper
Routing multi-class traffic flows in the plane	2012-06-13	Paper
Analysing local algorithms in location-aware quasi-unit-disk graphs	2011-10-27	Paper
Convex Transversals	2011-08-12	Paper
Faster Algorithms for Minimum-Link Paths with Restricted Orientations	2011-08-12	Paper
The snowblower problem	2011-08-02	Paper
Almost stable matchings by truncating the Gale-Shapley algorithm	2010-10-07	Paper
A simple local 3-approximation algorithm for vertex cover	2010-08-16	Paper
Geometric stable roommates	2010-06-16	Paper
The Snowblower Problem	2010-06-02	Paper
Minimum-perimeter enclosures	2010-04-19	Paper
A Local 2-Approximation Algorithm for the Vertex Cover Problem	2009-11-19	Paper
Maximum thick paths in static and dynamic environments	2009-11-16	Paper
Not being (super)thin or solid is hard: A study of grid Hamiltonicity	2009-07-27	Paper
Thick non-crossing paths and minimum-cost flows in polygonal domains	2009-02-12	Paper
Routing a maximum number of disks through a scene of moving obstacles	2009-02-12	Paper
Maximum thick paths in static and dynamic environments	2009-02-12	Paper
Improved Approximation Algorithms for Relay Placement	2008-11-25	Paper
Two New Classes of Hamiltonian Graphs	2008-06-05	Paper
THE TSP AND THE SUM OF ITS MARGINAL VALUES	2006-09-04	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Valentin Polishchuk