Follow
Val Polishchuk
Val Polishchuk
Linköping University
Verified email at alumni.stonybrook.edu - Homepage
Title
Cited by
Cited by
Year
Airspace throughput analysis considering stochastic weather
JSB Mitchell, V Polishchuk, J Krozel
AIAA Guidance, Navigation, and Control Conference, 2006
1022006
Capacity estimation for airspaces with convective weather constraints
J Krozel, JSB Mitchell, V Polishchuk, J Prete
AIAA Guidance, Navigation, and Control Conference, 2007
882007
Airspace capacity estimation with convective weather constraints
J Krozel, JSB Mitchell, V Polishchuk, J Prete
AIAA Guidance, Navigation, and Control Conference, 2007
88*2007
Improved Approximation Algorithms for Relay Placement
A Efrat, SP Fekete, JSB Mitchell, V Polishchuk, J Suomela
ACM Transactions on Algorithms (TALG) 12 (2), 20, 2015
83*2015
Maximum flow rates for capacity estimation in level flight with convective weather constraints
J Krozel, JSB Mitchell, V Polishchuk, J Prete
Air Traffic Control Quarterly 15 (3), 209-238, 2007
722007
Not being (super) thin or solid is hard: A study of grid Hamiltonicity
EM Arkin, SP Fekete, K Islam, H Meijer, JSB Mitchell, Y Núñez-Rodríguez, ...
Computational Geometry 42 (6), 582-605, 2009
67*2009
Geometric stable roommates
EM Arkin, SW Bae, A Efrat, K Okamoto, JSB Mitchell, V Polishchuk
Information Processing Letters 109 (4), 219-224, 2009
632009
Not being (super) thin or solid is hard: A study of grid Hamiltonicity
EM Arkin, SP Fekete, K Islam, H Meijer, JSB Mitchell, Y Núñez-Rodríguez, ...
Computational Geometry: Theory and Applications 42 (6-7), 582-605, 2009
552009
Algorithmic traffic abstraction and its application to NextGen generic airspace
G Sabhnani, A Yousefi, DP Kierstead, I Kostitsyna, JSB Mitchell, ...
10th AIAA Aviation Technology, Integration, and Operations Conference, Fort …, 2010
54*2010
A local 2-approximation algorithm for the vertex cover problem
M Åstrand, P Floréen, V Polishchuk, J Rybicki, J Suomela, J Uitto
Distributed Computing, 191-205, 2009
542009
A simple local 3-approximation algorithm for vertex cover
V Polishchuk, J Suomela
Information Processing Letters 109 (12), 642-645, 2009
512009
Optimization schemes for protective jamming
S Sankararaman, K Abu-Affash, A Efrat, SD Eriksson-Bique, V Polishchuk, ...
Proceedings of the thirteenth ACM international symposium on Mobile Ad Hoc …, 2012
502012
Almost stable matchings by truncating the Gale–Shapley algorithm
P Floréen, P Kaski, V Polishchuk, J Suomela
Algorithmica 58 (1), 102-118, 2010
502010
Almost stable matchings by truncating the Gale–Shapley algorithm
P Floréen, P Kaski, V Polishchuk, J Suomela
Algorithmica 58, 102-118, 2010
482010
Thick non-crossing paths and minimum-cost flows in polygonal domains
V Polishchuk, JSB Mitchell
Proceedings of the twenty-third annual symposium on Computational geometry …, 2007
482007
Dynamic one-sided boundary labeling
M Nöllenburg, V Polishchuk, M Sysikaski
Proceedings of the 18th SIGSPATIAL International Conference on Advances in …, 2010
392010
Order-k α-hulls and α-shapes
D Krasnoshchekov, V Polishchuk
Information Processing Letters 114 (1), 76-83, 2014
37*2014
isBF: scalable in-packet bloom filter based multicast
I Nikolaevskiy, A Lukyanenko, T Polishchuk, V Polishchuk, A Gurtov
Computer communications 70, 79-85, 2015
362015
Minimum-link paths revisited
JSB Mitchell, V Polishchuk, M Sysikaski
Special Issue on the 27th European Workshop on Computational Geometry, 19-22, 2014
322014
Visual analytics for spatial clustering: Using a heuristic approach for guided exploration
E Packer, P Bak, M Nikkilä, V Polishchuk, HJ Ship
IEEE transactions on visualization and computer graphics 19 (12), 2179-2188, 2013
322013
The system can't perform the operation now. Try again later.
Articles 1–20