Valentin Polishchuk

According to our database1, Valentin Polishchuk authored at least 83 papers between 2004 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Optimizing Visibility-Based Search in Polygonal Domains.
Proceedings of the 19th Scandinavian Symposium and Workshops on Algorithm Theory, 2024

Eating Ice-Cream with a Colander.
Proceedings of the 12th International Conference on Fun with Algorithms, 2024

2023
Fair subgraph selection for contagion containment (Brief Announcement).
Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, 2023

On Flipping the Fréchet Distance.
Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023

Constant-Factor Approximation Algorithms for Convex Cover and Hidden Set in a Simple Polygon.
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

2022
How to Stay Socially Distant: A Geometric Approach.
CoRR, 2022

2021
Prediction and Prevention of Pandemics via Graphical Model Inference and Convex Programming.
CoRR, 2021

2020
Special Issue on the 33rd European Workshop on Computational Geometry, Guest Editors' Foreword.
Comput. Geom., 2020

Cutting Polygons into Small Pieces with Chords: Laser-Based Localization.
Proceedings of the 28th Annual European Symposium on Algorithms, 2020

Geometric Secluded Paths and Planar Satisfiability.
Proceedings of the 36th International Symposium on Computational Geometry, 2020

2019
Euclidean TSP, Motorcycle Graphs, and Other New Applications of Nearest-Neighbor Chains.
CoRR, 2019

Geometric secluded paths and planar satisfiability.
CoRR, 2019

Altitude terrain guarding and guarding uni-monotone polygons.
Comput. Geom., 2019

An Optimal Algorithm for Minimum-Link Rectilinear Paths in Triangulated Rectilinear Domains.
Algorithmica, 2019

Most Vital Segment Barriers.
Proceedings of the Algorithms and Data Structures - 16th International Symposium, 2019

New Applications of Nearest-Neighbor Chains: Euclidean TSP and Motorcycle Graphs.
Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

2018
Editorial: ALENEX 2017 Special Issue.
ACM J. Exp. Algorithmics, 2018

Altitude Terrain Guarding and Guarding Uni-Monotone Polygons.
CoRR, 2018

Are Friends of My Friends Too Social?: Limitations of Location Privacy in a Socially-Connected World.
Proceedings of the Nineteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing, 2018

Service Allocation in a Mobile Fog Infrastructure under Availability and QoS Constraints.
Proceedings of the IEEE Global Communications Conference, 2018

Gender-Aware Facility Location in Multi-Gender World.
Proceedings of the 9th International Conference on Fun with Algorithms, 2018

2017
On the complexity of minimum-link path problems.
J. Comput. Geom., 2017

Computing the L<sub>1</sub> Geodesic Diameter and Center of a Polygonal Domain.
Discret. Comput. Geom., 2017

A threshold based airspace capacity estimation method for UAS traffic management.
Proceedings of the 2017 Annual IEEE International Systems Conference, 2017

2016
Improved Approximation Algorithms for Relay Placement.
ACM Trans. Algorithms, 2016

Shortest path to a segment and quickest visibility queries.
J. Comput. Geom., 2016

Computing the L1 Geodesic Diameter and Center of a Polygonal Domain.
Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

Recognizing a DOG is Hard, But Not When It is Thin and Unit.
Proceedings of the 8th International Conference on Fun with Algorithms, 2016

Automatic Design of Aircraft Arrival Routes with Limited Turning Angle.
Proceedings of the 16th Workshop on Algorithmic Approaches for Transportation Modelling, 2016

2015
Optimizing airspace closure with respect to politicians' egos.
Theor. Comput. Sci., 2015

The minimum backlog problem.
Theor. Comput. Sci., 2015

Improved approximations for two-stage min-cut and shortest path problems under uncertainty.
Math. Program., 2015

isBF: Scalable in-packet bloom filter based multicast.
Comput. Commun., 2015

Geometric <i>k</i> Shortest Paths.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

On Minimizing Crossings in Storyline Visualizations.
Proceedings of the Graph Drawing and Network Visualization - 23rd International Symposium, 2015

2014
Scandinavian Thins on Top of Cake: New and Improved Algorithms for Stacking and Packing.
Theory Comput. Syst., 2014

Optimization Schemes for Protective Jamming.
Mob. Networks Appl., 2014

Order-k α-hulls and α-shapes.
Inf. Process. Lett., 2014

Minimum-link paths revisited.
Comput. Geom., 2014

Convex transversals.
Comput. Geom., 2014

Data transmission and base-station placement for optimizing the lifetime of wireless sensor networks.
Ad Hoc Networks, 2014

Geometric kth Shortest Paths: the Applet.
Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

Optimal Geometric Flows via Dual Programs.
Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

2013
Visual Analytics for Spatial Clustering: Using a Heuristic Approach for Guided Exploration.
IEEE Trans. Vis. Comput. Graph., 2013

Live and learn from mistakes: A lightweight system for document classification.
Inf. Process. Manag., 2013

On Polygonal Paths with Bounded Discrete-Curvature: The Inflection-Free Case.
Proceedings of the Discrete and Computational Geometry and Graphs, 2013

Sweeping a terrain by collaborative aerial vehicles.
Proceedings of the 21st SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2013

2012
Simple Wriggling is Hard Unless You Are a Fat Hippo.
Theory Comput. Syst., 2012

Discrete Dubins Paths
CoRR, 2012

Routing multi-class traffic flows in the plane.
Comput. Geom., 2012

Scandinavian Thins on Top of Cake: On the Smallest One-Size-Fits-All Box.
Proceedings of the Fun with Algorithms - 6th International Conference, 2012

2011
Analysing local algorithms in location-aware quasi-unit-disk graphs.
Discret. Appl. Math., 2011

The snowblower problem.
Comput. Geom., 2011

Faster Algorithms for Minimum-Link Paths with Restricted Orientations.
Proceedings of the Algorithms and Data Structures - 12th International Symposium, 2011

Distributed localization and clustering using data correlation and the Occam's razor principle.
Proceedings of the Distributed Computing in Sensor Systems, 2011

Hardness Results for Two-Dimensional Curvature-Constrained Motion Planning.
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

2010
Improved approximations for robust mincut and shortest path
CoRR, 2010

Geodesic diameter of a polygonal domain in O(n^4 log n) time
CoRR, 2010

Local algorithms in (weakly) coloured graphs
CoRR, 2010

Maximum thick paths in static and dynamic environments.
Comput. Geom., 2010

Almost Stable Matchings by Truncating the Gale-Shapley Algorithm.
Algorithmica, 2010

Brief announcement: distributed almost stable marriage.
Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

Periodic Multi-labeling of Public Transit Lines.
Proceedings of the Geographic Information Science, 6th International Conference, 2010

Dynamic one-sided boundary labeling.
Proceedings of the 18th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, 2010

Data transmission and base-station placement for optimizing network lifetime.
Proceedings of the DIALM-POMC Joint Workshop on Foundations of Mobile Computing, 2010

Shape approximation using k-order alpha-hulls.
Proceedings of the 26th ACM Symposium on Computational Geometry, 2010

2009
A simple local 3-approximation algorithm for vertex cover.
Inf. Process. Lett., 2009

Geometric stable roommates.
Inf. Process. Lett., 2009

Not being (super)thin or solid is hard: A study of grid Hamiltonicity.
Comput. Geom., 2009

A Local 2-Approximation Algorithm for the Vertex Cover Problem.
Proceedings of the Distributed Computing, 23rd International Symposium, 2009

2008
Minimum-perimeter enclosures.
Inf. Process. Lett., 2008

Almost stable matchings in constant time
CoRR, 2008

Robust curve reconstruction with k-order alpha-shapes.
Proceedings of the 2008 International Conference on Shape Modeling and Applications (SMI 2008), 2008

Improved Approximation Algorithms for Relay Placement.
Proceedings of the Algorithms, 2008

Routing a maximum number of disks through a scene of moving obstacles.
Proceedings of the 24th ACM Symposium on Computational Geometry, 2008

Optimal Backlog in the Plane.
Proceedings of the Algorithmic Aspects of Wireless Sensor Networks, 2008

2007
Two New Classes of Hamiltonian Graphs: (Extended Abstract).
Electron. Notes Discret. Math., 2007

Thick non-crossing paths and minimum-cost flows in polygonal domains.
Proceedings of the 23rd ACM Symposium on Computational Geometry, 2007

2006
The Tsp and the Sum of its Marginal Values.
Int. J. Comput. Geom. Appl., 2006

Hamiltonian Cycles in Triangular Grids.
Proceedings of the 18th Annual Canadian Conference on Computational Geometry, 2006

2005
Touring Convex Bodies - A Conic Programming Solution.
Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

k-Link Rectilinear Shortest Paths Among Rectilinear Obstacles in the Plane.
Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

2004
The box mover problem.
Proceedings of the 16th Canadian Conference on Computational Geometry, 2004


  Loading...