- Proteomics: Finding the Needle in theProteomics: Finding the Needle in the HaystackHaystack
- Data Transmission and Base-Station Placement for Optimizing Network Lifetime
- Local 3-approximation algorithms for weighted dominating set and vertex cover
- Shortest Tour of a Sequence of Disjoint Segments in L1 Esther Arkin
- Faster algorithms for minimum-link paths with restricted orientations
- Shortest Tour of a Sequence of Disjoint Segments in L1
- Two New Classes of Hamiltonian Graphs (Extended Abstract)
- Comparison of Unsupervised and Supervised Training of RBF Neural Networks. Case Study: Mapping of Contamination Data
- Routing a Maximum Number of Disks through a Scene of Moving Obstacles
- Maximum Thick Paths in Static and Dynamic Environments Esther M. Arkin
- February 22, 2007 14:29 WSPC/Guidelines L1segsIJCGA International Journal of Computational Geometry & Applications
- Thick Non-Crossing Paths and Minimum-Cost Continuous
- The TSP and the Sum of its Marginal Values James B. Orlin
- Touring Convex Bodies A Conic Programming Solution Valentin Polishchuk
- Shortest Tour of a Sequence of Disjoint Segments in L1 Esther Arkin
- Bid for SoCG 2011 in Helsinki
- Robust Curve Reconstruction with k-Order -Shapes Dmitry Krasnoshchekov
- Geometric Flows in Grids: Static, Dynamic, and In-Between Joseph S.B. Mitchell
- An approximation algorithm for minimum-link paths in polygonal domains
- Not Being (Super)Thin or Solid is Hard: A Study of Grid Hamiltonicity
- A Local 2-approximation Algorithm for the Vertex Cover Problem
- Airspace Throughput Analysis Considering Stochastic Weather
- American Institute of Aeronautics and Astronautics Capacity Estimation for Airspaces
- Geometric Stable Roommates Esther M. Arkin
- Throughput/Complexity Tradeoffs for Routing Traffic in the Presence of Dynamic Weather
- Decision-Oriented Environmental Mapping with Radial Basis Function Neural Networks
- k-Order -Hulls and -Shapes Dmitry Krasnoshchekov
- Capacitated Routing in Grid Graphs
- Eighth USA/Europe Air Traffic Management Research and Development Seminar (ATM2009) Advance Path-Strecth Planning in Weather-Impacted
- Maximum Thick Paths in Static and Dynamic Environments Esther M. Arkin
- Optimal Backlog in the Plane Valentin Polishchuk and Jukka Suomela
- 16th Canadian Conference on Computational Geometry, 2004 The Box Mover Problem
- Routing Air Traffic Flows: from Continuous to Discrete
- Shortest Tour of a Sequence of Disjoint Segments in L1 Esther Arkin
- Minimum-Perimeter Enclosures Joseph S. B. Mitchell 1
- Touring Convex Polytopes A Conic Programming Valentin Polishchuk
- Touring Convex Polytopes A Conic Programming Solution
- HIIT is a joint research institution of Helsinki University of Technology (TKK) and the University of Helsinki (UH).
- Algorithmic Traffic Abstraction and its Application to NextGen Generic Airspace
- Robust Delineation of Seismic Coda with k-Order -Hull Dmitry Krasnoshchekov1
- On Geometric Stable Roommates and Minimum-Weight Matching Robustness (Extended Abstract)
- CCCG 2006, Kingston, Ontario, August 1416, 2006 Hamiltonian Cycles in Triangular Grids
- Almost Stable Matchings by Truncating the GaleShapley Algorithm
- Local 3-approximation algorithms for weighted dominating set and vertex cover
- Periodic Multi-Labeling of Public Transit Lines Valentin Polishchuk and Arto Vihavainen
- On Matching Robustness Valentin Polishchuk Esther M. Arkin Kobus Barnard Kevin Coogan
- On Matching Robustness and Geometric Stable Valentin Polishchuk Esther M. Arkin Boris Aronov
- Pay less today for a rainy day: Improved approximations for robust mincut and shortest path
- The Snowblower Problem Esther M. Arkin
- Thick Non-Crossing Paths and Minimum-Cost Continuous
- Simple Wriggling is Hard unless You Are a Fat Hippo
- Paderborn, 22 October 2009 Jukka Suomela --HIIT, University of Helsinki, Finland
- k-Link Rectilinear Shortest Paths Among Rectilinear Obstacles in the Plane Valentin Polishchuk
- Convex Transversals Esther M. Arkin1
- CCCG 2007, Ottawa, Ontario, August 2022, 2007 Hamilton Circuits in Hexagonal Grid Graphs
- Improved Approximation Algorithms for Relay Placement
- A simple local 3-approximation algorithm for vertex cover Valentin Polishchuk, Jukka Suomela
- THICK NON-CROSSING PATHS JOSEPH S. B. MITCHELL AND VALENTIN POLISHCHUK
- Maximum Flow Rates for Capacity Estimation in Level Flight with Convective Weather Constraints
- Maximum Thick Paths in Static and Dynamic Environments6
- Minimum-Perimeter Enclosing k-gon Joseph S. B. Mitchell Valentin Polishchuk
- Dynamic One-Sided Boundary Labeling Martin Nllenburg
- COMPARISON OF KERNELBASED MODELS FOR BINARY CLASSIFICATION OF ENVIRONMENTAL DATA
- Robust Delineation of Seismic Coda with k-Order -Hull Krasnoshchekov D.N.
- NEURAL NETWORK RESIDUAL STOCHASTIC COSIMULATION FOR ENVIRONMENTAL DATA ANALYSIS
- American Institute of Aeronautics and Astronautics Planning Routes with Wiggle Room in En Route Weather-
- Minimum-Link Paths Revisited Joseph S. B. Mitchell
- Analysing local algorithms in location-aware quasi unit-disk graphs
- Flexible Airlane Generation to Maximize Flow Under Hard and Soft Constraints
- 10.4 METRICS FOR EVALUATING THE IMPACT OF WEATHER ON JET ROUTES Jimmy Krozel, Ph.D., and Moein Ganji, Ph.D.
- American Institute of Aeronautics and Astronautics Strategies to Mitigate Off-Nominal Events in
- Data Transmission and Base-Station Placement for Optimizing the Lifetime of Wireless Sensor Networks
- Scandinavian Thins over a Fat Top: on the Smallest One-Size-Fits-All Box
- Live and Learn from Mistakes: A Lightweight System for Document Classification
