Valentin Polishchuk

From MaRDI portal
Person:390126

Available identifiers

zbMath Open polishchuk.valentinMaRDI QIDQ390126

List of research outcomes

PublicationDate of PublicationType
Geometric Secluded Paths and Planar Satisfiability2023-11-02Paper
https://portal.mardi4nfdi.de/entity/Q58756172023-02-03Paper
https://portal.mardi4nfdi.de/entity/Q33010192020-08-11Paper
Most vital segment barriers2020-01-16Paper
Altitude terrain guarding and guarding uni-monotone polygons2019-10-25Paper
An optimal algorithm for minimum-link rectilinear paths in triangulated rectilinear domains2019-01-11Paper
Improved Approximation Algorithms for Relay Placement2018-10-30Paper
Optimal Geometric Flows via Dual Programs2018-04-23Paper
On the complexity of minimum-link path problems2018-01-30Paper
Computing the L1 Geodesic Diameter and Center of a Polygonal Domain2018-01-24Paper
Shortest path to a segment and quickest visibility queries2017-10-10Paper
Geometric k Shortest Paths2017-10-05Paper
Recognizing a DOG is Hard but not when it is Thin and Unit2017-07-17Paper
Computing the \(L_1\) geodesic diameter and center of a polygonal domain2017-05-11Paper
https://portal.mardi4nfdi.de/entity/Q29784072017-04-24Paper
Shortest path to a segment and quickest visibility queries2017-03-30Paper
On Minimizing Crossings in Storyline Visualizations2017-02-10Paper
The minimum backlog problem2015-10-30Paper
An optimal algorithm for minimum-link rectilinear paths in triangulated rectilinear domains2015-10-27Paper
On Polygonal Paths with Bounded Discrete-Curvature: The Inflection-Free Case2015-09-14Paper
Order-\(k\) \(\alpha\)-hulls and \(\alpha\)-shapes2015-06-25Paper
Optimizing airspace closure with respect to politicians' egos2015-05-26Paper
Improved approximations for two-stage MIN-cut and shortest path problems under uncertainty2015-02-09Paper
Scandinavian thins on top of cake: new and improved algorithms for stacking and packing2015-01-21Paper
Minimum-link paths revisited2014-05-19Paper
Shape approximation using k-order alpha-hulls2014-04-03Paper
Convex transversals2014-01-22Paper
Simple wriggling is hard unless you are a fat hippo2012-12-06Paper
Routing multi-class traffic flows in the plane2012-06-13Paper
Analysing local algorithms in location-aware quasi-unit-disk graphs2011-10-27Paper
Convex Transversals2011-08-12Paper
Faster Algorithms for Minimum-Link Paths with Restricted Orientations2011-08-12Paper
The snowblower problem2011-08-02Paper
Almost stable matchings by truncating the Gale-Shapley algorithm2010-10-07Paper
A simple local 3-approximation algorithm for vertex cover2010-08-16Paper
Geometric stable roommates2010-06-16Paper
The Snowblower Problem2010-06-02Paper
Minimum-perimeter enclosures2010-04-19Paper
A Local 2-Approximation Algorithm for the Vertex Cover Problem2009-11-19Paper
Maximum thick paths in static and dynamic environments2009-11-16Paper
Not being (super)thin or solid is hard: A study of grid Hamiltonicity2009-07-27Paper
Thick non-crossing paths and minimum-cost flows in polygonal domains2009-02-12Paper
Routing a maximum number of disks through a scene of moving obstacles2009-02-12Paper
Maximum thick paths in static and dynamic environments2009-02-12Paper
Improved Approximation Algorithms for Relay Placement2008-11-25Paper
Two New Classes of Hamiltonian Graphs2008-06-05Paper
THE TSP AND THE SUM OF ITS MARGINAL VALUES2006-09-04Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Valentin Polishchuk