yusuke1997/dblp-id-title huggingface dataset:
Classification Method for Object Feature Extraction Based on Laser Scanning Data
Vortex Extraction Method Based on Compact Ratio
Application of the Evidence Right in the Quantitative Evaluation of Rural Residential Area
Design of Power System Parameters Collection Device Based on Wireless Transform Technology
Dynamic Analysis of Oil Spill in Yangtze Estuary with HJ-1 Imagery
Research and Application of Automatic Classification Method for Patrol Targets of Transmission Lines Based on LiDAR Point Cloud
Water Environment Prediction and Evaluation on Reservoir Dredging and Source Conservation Project - Case Study of Duihekou Reservoir
Spatial Analysis of Gymnasiums in Wuhan City
Study on Urban Multidimensional Niche of Urban Agglomeration in Northern Slope of Tianshan Mountains
Two-Way Quantum Communication in a Single Optical Fiber with Active Polarization Compensation
Manipulating Frequency Entangled Photons
Solutions for Redundancy-Free Error Correction in Quantum Channel
Enhanced Free Space Beam Capture by Improved Optical Tapers
Multipartite Entangled Codewords for Gaussian Channels with Additive Noise and Memory
Few Atom Detection and Manipulation Using Optical Nanofibres
Superconducting Nanowire Single-Photon Detectors for Quantum Communication Applications
Passive Decoy State Quantum Key Distribution
Interferometric Technique for Density Matrix Reconstruction by On/Off Detectors
Generation of Non-Gaussian Quantum State in Telecommunication Band
Properties of Cascade Switch Superconducting Nanowire Single Photon Detectors
Fiber Coupled Single Photon Detector with Niobium Superconducting Nanowire
Using Multi-particle Entanglement in Secure Communication Scenarios
Efficiency of the Eavesdropping in B92 QKD Protocol with a QCM
Entanglement Degree Characterization of Spontaneous Parametric-Down Conversion Biphotons in Frequency Domain
QKD in Standard Optical Telecommunications Networks
Nano-Optical Studies of Superconducting Nanowire Single Photon Detectors
Feasibility Analysis for Quantum Key Distribution between a LEO Satellite and Earth
Network Games with Quantum Strategies
Entanglement Purification with Hybrid Systems
Matter-Matter Entanglement for Quantum Communication
A 2D Electron Gas for Studies on Tunneling Dynamics and Charge Storage in Self-assembled Quantum Dots
Entanglement Based Quantum Key Distribution Using a Bright Sagnac Entangled Photon Source
Subband Tunneling and Coulomb Effects in Coupled Quantum Wells
Entanglement Generation by a Three-Dimensional Qubit Scattering: Concurrence vs. Path (In)Distinguishability
High-Speed Single-Photon Detection Using 2-GHz Sinusoidally Gated InGaAs/InP Avalanche Photodiode
Examples of Quantum Dynamics in Optomechanical Systems
Quantum Communication and Quantum Networking, First International Conference, QuantumComm 2009, Naples, Italy, October 26-30, 2009, Revised Selected Papers
Local Transformation of Two EPR Photon Pairs into a Three-Photon W State Using a Polarization Dependent Beamsplitter
Optical Free-Space Communication on Earth and in Space Regarding Quantum Cryptography Aspects
On QKD Industrialization
Ground-State Entanglement Gives Birth to Quantum Energy Teleportation
An Error Model for the Cirac-Zoller cnot Gate
The Case for Quantum Key Distribution
Simulating BB84 Protocol in Dephasing Qubit Channel
Tailoring the Spatio-temporal Bandwidth of Biphotons via the Non-factorable Structure of Entanglement
CTES Factorization Algorithm
Improvement of Lattice-Based Cryptography Using CRT
Proceedings of the First Workshop on Formal Methods for Wireless Systems, FMWS@CONCUR 2008, Toronto, ON, Canada, August 23, 2008
Improved topology assumptions for threshold cryptography in mobile ad hoc networks
Proceedings of the 2nd ACM Workshop on Security of ad hoc and Sensor Networks, SASN 2004, Washington, DC, USA, October 25, 2004
Mobile traffic sensor network versus motion-MIX: tracing and protecting mobile wireless nodes
Attack-resilient hierarchical data aggregation in sensor networks
Security in wireless sensor networks
AnonDSR: efficient anonymous dynamic source routing for mobile ad-hoc networks
A cooperative intrusion detection system for ad hoc networks
Achieving privacy in mesh networks
Identity certified authentication for ad-hoc networks
Connectivity properties of secure wireless sensor networks
Inverting sensor networks and actuating the environment for spatio-temporal access control
Impact of optimal MAC layer attacks on the network layer
Secure long term communities in ad hoc networks
A security design for a general purpose, self-organizing, multihop ad hoc wireless network
Security support for in-network processing in Wireless Sensor Networks
Towards provable security for ad hoc routing protocols
Secure multicast groups on ad hoc networks
Revisiting random key pre-distribution schemes for wireless sensor networks
Location-aware key predistribution scheme for wide area wireless sensor networks
Resilient aggregation in sensor networks
The security of vehicular ad hoc networks
RFID security without extensive cryptography
Attacker traceback with cross-layer monitoring in wireless multi-hop networks
An attack on the proactive RSA signature scheme in the URSA ad hoc network access control protocol
A specification-based intrusion detection system for AODV
A certificate revocation scheme for wireless ad hoc networks
SIGF: a family of configurable, secure routing protocols for wireless sensor networks
Proceedings of the 3rd ACM Workshop on Security of ad hoc and Sensor Networks, SASN 2005, Alexandria, VA, USA, November 7, 2005
Coordinated sensor deployment for improving secure communications and sensing coverage
A resilient packet-forwarding scheme against maliciously packet-dropping nodes in sensor networks
Time synchronization attacks in sensor networks
Location-aware key management scheme for wireless sensor networks
Securing quality-of-service route discovery in on-demand routing for ad hoc networks
Defending against path-based DoS attacks in wireless sensor networks
Admission control in Peer-to-Peer: design and performance evaluation
Misbehavior resilient multi-path data transmission in mobile ad-hoc networks
TinyPK: securing sensor networks with public key technology
Reputation-based framework for high integrity sensor networks
Diversify sensor nodes to improve resilience against node compromise
Autonomous and distributed node recovery in wireless sensor networks
Robust cooperative trust establishment for MANETs
RANBAR: RANSAC-based resilient aggregation in sensor networks
Seven cardinal properties of sensor network broadcast authentication
Random key-assignment for secure Wireless Sensor Networks
How public key cryptography influences wireless sensor node lifetime
Location-based pairwise key establishments for static sensor networks
On the security of group communication schemes based on symmetric key cryptosystems
SECTOR: secure tracking of node encounters in multi-hop wireless networks
Proceedings of the 4th ACM Workshop on Security of ad hoc and Sensor Networks, SASN 2006, Alexandria, VA, USA, October 30, 2006
An approach to certificate path discovery in mobile Ad Hoc networks
A quantitative trust establishment framework for reliable data packet delivery in MANETs
Detection and prevention of MAC layer misbehavior in ad hoc networks
Key distribution and update for secure inter-group multicast communication
Source-location privacy in energy-constrained sensor network routing
Modelling adversaries and security objectives for routing protocols in wireless sensor networks
Proceedings of the 1st ACM Workshop on Security of ad hoc and Sensor Networks, SASN 2003, Fairfax, Virginia, USA, 2003
Energy-efficient link-layer jamming attacks against wireless sensor network MAC protocols
A key pre-distribution scheme for secure sensor networks using probability density function of node deployment
Advances in sensor and ad-hoc network security: perspective and status
Modeling vulnerabilities of ad hoc routing protocols
Information assurance in manets and wireless sensor networks
An advanced signature system for OLSR
Denial-of-service resistant quality-of-service signaling for mobile ad hoc networks
Open Problems: Open Problems from CCCG 2005
An Iterative Refinement Scheme of Dominating Guards and Witnesses for Art Gallery Problems
The min-# problem, a hybrid error criterion for near linear time performance
A note on the path graph of a set of points in convex position in the plane
Open Problems from CCCG 2014
k-Link Rectilinear Shortest Paths Among Rectilinear Obstacles in the Plane
Computing Rigid Components of Pseudo-triangulation Mechanisms in Linear Time
Optimal Average Case Strategy for Looking Around a Corner
On Nonogram and Graph Planarity Puzzle Generation
Inverting Linkages with Stretch
Cole's Parametric Search Technique Made Practical
Universal Point Sets for Planar Graph Drawings with Circular Arcs
Near-Linear-Time Deterministic Plane Steiner Spanners and TSP Approximation for Well-Spaced Point Sets
Isometric Morphing of Triangular Meshes
Efficient Predicate Evaluation using Statistical Degeneracy Detection
Proceedings of the 7th Canadian Conference on Computational Geometry, Quebec City, Quebec, Canada, August 1995
Largest Triangle inside a Terrain
Orientations of Simplices Determined by Orderings on the Coordinates of their Vertices
Minimum blocking sets of circles for a set of lines in the plane
Minimum Dilation Triangulation: Reaching Optimality Efficiently
Ununfoldable polyhedra
Lower bounds for the number noncrossing free subgraphs of K n
A Note on Guarding Staircase Polygons
Those ubiquitous cut polyhedra
Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, Winnipeg, Manitoba, Canada, August 9-11, 2010
Finding maximum matchings in RDV graphs efficiently
Two-dimensional Computation of the Three-dimensional Reachable Region for a Welding Head
Planarity Preserving Augmentation of Topological and Geometric Plane Graphs to Meet Parity Constraints
When can a graph form an orthogonal polyhedron?
Maintaining Multiple Levels of Detail in the Overlay of Hierarchical Sub Divisions
A Randomized Algorithm for Non-crossing Matching of Online Points
Testing Simple Polygons
Dynamic Computational Topology for Piecewise Linear Curves
Geometric Problems and Structures Arising from the Study of Wireless Networks
A Linear Space Data Structure for Orthogonal Range Reporting and Emptiness Queries
Globally linked pairs in braced maximal outerplanar graphs
A near-quadratic algorithm for the alpha-connected two-center decision problem
Diamonds are Forever in the Blockchain: Geometric Polyhedral Point-Set Pattern Matching
Outerplanar graphs and Delaunay triangulations
Touching geometry
Dispersive Vertex Guarding for Simple and Non-Simple Polygons
Locked and Unlocked Smooth Embeddings of Surfaces
Proceedings of the 16th Canadian Conference on Computational Geometry, CCCG'04, Concordia University, Montréal, Québec, Canada, August 9-11, 2004
Practical methods for set operations on polygons using exact arithmetic
Finding Points in General Position
Approximating Convex Polygons by Histogons
Computing the largest inscribed isothetic rectangle
On Combinatorial Depth Measures
Data Structures for Reporting Extension Violations in a Query Range
Polynomial Time Algorithms for Label Size Maximization on Rotating Maps
How to Look Around a Corner
A bound for Delaunay flip algorithms on flat tori (Best Student Paper Award)
Circular Visibility and Separability
Extended Convex Hull
The visibility graph contains a bounded-degree spanner
On point covers of c-oriented polygons
Approximation and Streaming Algorithms for Projective Clustering via Random Projections
Robust Proximity Queries in Implicit Voronoi Diagrams
Simple Randomized Algorithms for Closest Pair Problems
Bounds on Mutual Visibility Algorithms
Zipper unfoldings of polyhedral complexes
Edge Guarding a Triangulated Polyhedral Terrain
On Guarding Polygons with Holes
The Embroidery Problem
New variations of the reverse facility location problem
Heuristic Motion Planning with Movable Obstacles
Power Domination on Triangular Grids
Approximate Data Depth Revisited
Enumerating pseudo-triangulations in the plane
Heaphull?
Optimal Bounds on Theta-Graphs: More is not Always Better
An Experiment Using LN for Exact Geometric Computations
On the Biplanar Crossing Number of K n
Rigid components in fixed-lattice and cone frameworks
Packing 2×2 unit squares into grid polygons is NP-complete
Edge Unfoldings of Platonic Solids Never Overlap
Balanced partitions of two sets of points in the plane
Efficient Algorithms for the Smallest Enclosing Cylinder Problem
Open Problems from CCCG 2006
Shortest Descending Paths through Given Faces
Flow Complex: General Structure and Algorithm
Area Requirement of Visibility Representations of Trees
On the Space Efficiency of the "Ultimate Planar Convex Hull Algorithm"
Generating Random x-Monotone Polygons with Given Vertices
The Convex Hull of Points on a Sphere is a Spanner
The Duality of Geodesic Voronoi/Delaunay Diagrams For An Intrinsic Discrete Laplace-Beltrami Operator on Simplicial Surfaces
Exact Algorithms and APX-Hardness Results for Geometric Set Cover
Recovery of Convex Hulls From External Visibility Graphs
Weighted Straight Skeletons In The Plane
Constrained Empty-Rectangle Delaunay Graphs
On the omega(n 4/3 ) Weak Lower Bounds for Some 3D Geometric Problems
Translating a convex polygon to contain maximum number of points
Analysis of half-space range search using the k -d search skip list
Stable roommates and geometric spanners
Range-Aggregate Proximity Detection for Design Rule Checking in VLSI Layouts
Common Developments of Several Different Orthogonal Boxes
Constructing piecewise linear homeomorphisms of polygons with holes
Efficient Kinetic Data Structures for MaxCut
Region Counting Distances and Region Counting Circles
On Unfolding Trees and Polygons on Various Lattices
Emanation Graph: A New t-Spanner
Complete enumeration of small realizable oriented matroids
Fault-Tolerant Conflict-Free Coloring
Cross-Stitching Using Little Thread
Domino tilings of orthogonal polygons
Looking at molecules with smart computers
Exact solutions to the Weighted Region Problem
An Efficient Approximation for Point-set Diameter in Higher Dimensions
Massively Winning Congurations in the Convex Grabbing Game on the Plane
Constrainted facility location
A Randomly Embedded Random Graph is Not a Spanner
On the time bound for convex decomposition of simple polygons
On Inducing n-gons
An Efficient Transformation for the Klee's Measure Problem in the Streaming Model
Minimum enclosing area triangle with a fixed angle
Generalizing Halfspaces
The Unified Segment Tree and its Application to the Rectangle Intersection Problem
Computational Geometry Impact Potential: A Business and Industrial Perspective
A Distributed Algorithm for Computing Voronoi Diagram in the Unit Disk Graph Model
Power diagram depth sorting
Minimizing the Number of Arcs Linking a Permutation of Points in the Plane
A Degree 3 Plane 5.19-Spanner for Points in Convex Position
Contraction and Expansion of Convex Sets
Algorithms for Proximity Problems on Colored Point Sets
Computational Geometry from a Non-Euclidean Perspective
Computing Realistic Terrains from Imprecise Elevations
Characterizing lr-visibility polygons and related problems
Connectivity Preserving Iterative Compression
Estimation of the necessary number of points in Riemannian Voronoi
NearptD: A Parallel Implementation of Exact Nearest Neighbor Search using a Uniform Grid
Efficient Algorithms for Computing the beta-spectrum
ETH-Tight Algorithms for Geometric Network Problems Using Geometric Separators
Quality Ratios of Measures for Graph Drawing Styles
LR-visibility in Polygons
On some monotone path problems in line arrangements
Spanning trees across axis-parallel segments
Approximate Matching of Curves to Point Sets
Searching with Advice: Robot Fence-Jumping
On Equiangularity of Delaunay Diagrams in Every Dimension
Inside-Out Dissections of Polygons and Polyhedra
Data Structures for Fréchet Queries in Trajectory Data
Morphing Planar Graph Drawings
Covering Points with Pairs of Concentric Disks
Diamonds Are Not a Minimum Weight Triangulation's Best Friend
Expansive Motions for d-Dimensional Open Chains
On Super-Guarding Convex and Star-Shaped Polygons
Looking through a Window
Open Problems from CCCG 2017
Mapping Points to the Grid with Bounded Hausdor Distance
Closest Segments
Heuristics for placing non-orthogonal axial lines to cross the adjacencies between orthogonal rectangles
Maxmin location of an anchored ray in 3-space and related problems
A New Lower Bound for Kernel Searching
Separating objects in the plane with wedges and strips
Time, Space, and Precision: Revisiting Classic Problems in Computational Geometry with Degree-Driven Analysis, pp. 280
Dynamic point location in fat hyperrectangles with integer coordinates
Data structures for incremental extreme ray enumeration algorithms
The Shadows of a Cycle Cannot All Be Paths
Tight degree bounds for pseudo-triangulations of points
On the Chromatic Art Gallery Problem
Proceedings of the 36th Canadian Conference on Computational Geometry, CCCG 2024, Brock University, St. Catharines, Canada, July 17-19, 2024
A geometric proof of the combinatorial bounds the number of optimal solutions for the 2-center euclidean problem
Multiple Watchman Routes in Staircase Polygons
Dynamic additively weighted voronoi diagrams made easy
Matching Edges and Faces in Polygonal Partitions
Degree-bounded minimum spanning trees
Triangulations with many points of even degree
Fair Covering of Points by Balls
A machine resolution of a four-color hoax
Isotopic Fréchet Distance
Proceedings of the 34th Canadian Conference on Computational Geometry, CCCG 2022, Toronto Metropolitan University, Toronto, Ontario, Canada, August 25-27, 2022
Helly Numbers of Polyominoes
Six-way equipartitioning by three lines in the plane
A Linear Time Euclidean Spanner on Imprecise Points
A Composable Coreset for k-Center in Doubling Metrics
Approximate range searching in higher dimension
If You Must Choose Among Your Children, Pick the Right One
Proceedings of the 33rd Canadian Conference on Computational Geometry, CCCG 2021, August 10-12, 2021, Dalhousie University, Halifax, Nova Scotia, Canada
The Complexity of Illuminating Polygons by alpha-flood-lights
Regular labelings and geometric structures
A Competitive Strategy for Walking in Generalized Streets for a Simple Robot
Staying in the Middle: Exact and Approximate Medians in R1 and R2 for Moving Points
Decontaminating Planar Regions by Sweeping with Barrier Curves
Folding Polyominoes into (Poly)Cubes
Open problems from cccg 2001
Angle-monotone Paths in Non-obtuse Triangulations
Generating random star-shaped polygons
Intersecting general parametric surfaces using bounding volumes
An Improved Algorithm for Shortest Paths in Weighted Unit-Disk Graphs
City Guarding with Cameras of Bounded Field of View
Local Doubling Dimension of Point Sets
On the parameterized complexity of the generalized rush hour puzzle
Exact Pareto-Optimal Coordination of Two Translating Polygonal Robots on a Cyclic Roadmap
Comparing photometric distributions
Polygonal Chain Simplification with Small Angle Constraints
On multi-level k-ranges for range search
Geometric permutations of balls with bounded size disparity
Image Compression Terrain Simplification
The Computational Complexity of Finding Hamiltonian Cycles in Grid Graphs of Semiregular Tessellations
Approximate shortest path algorithms for sequences of pairwise disjoint simple polygons
Approximation Algorithms for the Discrete Piercing Set Problem for Unit Disks
Dihedral Rigidity and Deformation
List coloring and Euclidean Ramsey Theory
The cccg 2001 logo
Bottleneck Bichromatic Full Steiner Trees
Isoperimetric Triangular Enclosure with a Fixed Angle
The Within-Strip Discrete Unit Disk Cover Problem
Data Structures for Range Aggregation by Categories
Shortest Watchman Tours in Weak Visibility Polygons
Fast reconstruction of delaunay triangulations
An Improved Method for Generating Triangle-Mesh Models of Images
Position based physics animating and packing spheres inside polyhedra
Order types and cross-sections of line arrangements in R^3
Computing Dehn Twists and Geometric Intersection Numbers in Polynomial Time
Approximating the Maxmin-angle Covering Triangulation
Morpion Solitaire 5D: a new upper bound 121 on the maximum score
Folding Small Polyominoes into a Unit Cube
Guarding Orthogonal Terrains
Some Geometric Applications of Anti-Chains
Guarding Alcove-Free Galleries
The Lawnmower Problem
Maximal Outerplanar Graphs Are Relative Neighbourhood Graphs
kth Nearest Neighbor Sampling in the Plane
Predicates for Line Transversals in 3D
Computing signed permutations of polygons
Succinct Euler-Tour Trees
On bisectors for convex distance functions in 3-space
Zipper Unfoldability of Domes and Prismoids
Minimizing the trace length of a rod endpoint in the presence of polygonal obstacles is NP-hard
Smallest enclosing circle centered on a query line segment
A Parameterized Algorithm for Flat Folding
A Geometric Perspective on Sparse Filtrations
Density or Discrepancy: A VLSI Designer's Dilemma in Hot Spot Analysis
Covering Points: Minimizing the Maximum Depth
A General and Efficient Representation for Multiresolution Meshes: Application to Quad/Triangle Subdivision
Fast Area-Weighted-Peeling of Convex Hulls for Outlier Detection
Combinatorics of Beacon Routing and Coverage
Inscribing H-Polyhedra in Quadrics Using a Projective Generalization of Closed Sets
The Surveillance of the Walls of an Art Gallery
Discrete Helly type theorems
Computational Balloon Twisting: The Theory of Balloon Polyhedra
The Crossing Number of Semi-Pair-Shellable Drawings of Complete Graphs
On the number of internal and external visibility edges of polygons
On the Computational Complexity of Partitioning Weighted Points into a Grid of Quadrilaterals
Positive and Negative Results on the Floodlight Problem
Duality for Geometric Set Cover and Geometric Hitting Set Problems on Pseudodisks
Watchman tours for polygons with holes
A Faster Algorithm for the Minimum Red-Blue-Purple Spanning Graph Problem for Points on a Circle
Curve Stabbing Depth: Data Depth for Plane Curves
Low Space Data Structures for Geometric Range Mode Query
A linear algorithm for compact box-drawings of trees
Finding the Set of All Minimal Nested Convex Polygons
A modified longest side bisection triangulation
The Number of Non-overlapping Unfoldings in Convex Polyhedra
The 2x2 Simple Packing Problem
Anisotropic Diagrams: Labelle Shewchuk approach revisited
A Constant Approximation Algorithm for Maximum Weight Triangulation
Streaming 1-Center with Outliers in High Dimensions
A Note on Online Steiner Tree Problems
VC-Dimension of Visibility on Terrains
Algorithms for Covering Barrier Points by Mobile Sensors with Line Constraint
A Data Structure Supporting Exclusion Persistence Range Search
A generalization of Apollonian packing of circles
Stabbing Polygonal Chains with Rays is Hard to Approximate
Enumerating Triangulation Paths
Tribute to Godfried Toussaint
Non-stretchable pseudo-visibility graphs
Compatible Paths on Labelled Point Sets
Approximating the geometric minimum-diameter spanning tree
An efficient direct approach for computing shortest rectilinear paths among obstacles in a two-layer interconnection model
A note on approximations of rectilinear polygons
Progressive Alignment of Shapes
On Erdős-Szekeres Maker-Breaker games
Systematic Local Flip Rules Are Generalized Delaunay Rules
An Implementation of Chen & Han's Shortest Paths Algorithm
A Paper on Pencils: A Pencil and Paper Puzzle - Pencils is NP-Complete
Topological and geometric methods for graph analysis
Computing 3SAT on a Fold-and-Cut Machine
The Gaussian Centre of a Set of Mobile Points
Partial Searchlight Scheduling is Strongly PSPACE-complete
Ordered theta graphs
The Minimum Cooperative Guards Problem on K-spiral Polygons
An Upper Bound on Trilaterating Simple Polygons
Oja medians and centers of gravity
The periodicity of integral convex hulls for conics in r 2
The Delaunay Triangulation Maximizes the Mean Inradius
Yin-Yang Puzzles are NP-complete
Puzzles are hard enough just by rotations
Practical Methods for the Embroidery Problem