yusuke1997/dblp-id-title huggingface dataset:
Digital Geometry (Abstract)
Packing Geometric Objects with Optimal Worst-Case Density (Multimedia Exposition)
Bounds on the Size of Tetrahedralizations
The All-Geodesic-Furthest Neighbor Problem for Simple Polygons
On-Line Steiner Trees in the Euclidean Plane
Terrain Visibility Graphs: Persistence Is Not Enough
The scale axis transform
Distance Visibility Graphs
An Improved Lower Bound on the Number of Pseudoline Arrangements
Bucket-Like Space Partitioning Data Structures with Applications to Ray-Tracing
A sum of squares theorem for visibility
Triangulation and CSG Representation of Polyhedra with Arbitrary Genus
On the expected complexity of voronoi diagrams on terrains
On Maximum Flows in Polyhedral Domains
Interactive Visualization of Weighted Three-Dimensional Alpha Hulls
Toughness and Delaunay Triangulations
Computing Low-Cost Convex Partitions for Planar Point Sets with Randomized Local Search and Constraint Programming (CG Challenge)
31st International Symposium on Computational Geometry, SoCG 2015, Eindhoven, The Netherlands, June 22-25, 2015
Piecewise-Linear Interpolation Between Polygonal Slices
The Voronoi Diagram of Curved Objects
Minors in random and expanding hypergraphs
Linear Time Algorithms for Visibility and Shortest Path Problems Inside Simple Polygons
Efficient Two-Parameter Persistence Computation via Cohomology
Traversing a set of points with a minimum number of turns
A Practical Evaluation of Kinetic Data Structures
Smoothing of Polyhedral Hodels
Faster Algorithms for the Geometric Transportation Problem
Pach's Animal Problem Within the Bounding Box
Matching Shapes with a Reference Point
Distribution of Distances and Triangles in a Point Set and Algorithms for Computing the Largest Common Point Sets
An Optimal O(n log n) Algorithm for Contour Reconstruction from Rays
Good Orders for Incremental (Re)construction
Approximating Maximum Diameter-Bounded Subgraph in Unit Disk Graphs
Best Laid Plans of Lions and Men
Proceedings of the 19th ACM Symposium on Computational Geometry, San Diego, CA, USA, June 8-10, 2003
Point guards and point clouds: solving general art gallery problems
On Spheres with k Points Inside
RAPID: Randomized Pharmacophore Identification for Drug Design
A faster algorithm for computing motorcycle graphs
Morphing between shapes by using their straight skeletons
Sampling Conditions for Conforming Voronoi Meshing by the VoroCrust Algorithm
Approximating Monotone Polygonal Curves Using the Uniform Metric
Embeddings of surfaces, curves, and moving points in euclidean space
Packing Squares into a Disk with Optimal Worst-Case Density
On Simultaneous Inner and Outer Approximation of Shapes
Linear Complexity Hexahedral Mesh Generation
Almost-Monochromatic Sets and the Chromatic Number of the Plane
Approximating the Maximum Independent Set of Convex Polygons with a Bounded Number of Directions
On Undecided LP, Clustering and Active Learning
Visualizing Fortune's Sweepline Algorithm for Planar Voronoi Diagrams
A Simpler Linear-Time Algorithm for Intersecting Two Convex Polyhedra in Three Dimensions
Lower bounds for weak epsilon-nets and stair-convexity
Viro's method disproves Ragsdale's conjecture: a story
Gromov Hyperbolicity, Geodesic Defect, and Apparent Pairs in Vietoris-Rips Filtrations
An Interactive Tool for Experimenting with Bounded-Degree Plane Geometric Spanners (Media Exposition)
Tiling the Plane with One Tile
Escaping the Curse of Spatial Partitioning: Matchings with Low Crossing Numbers and Their Applications
Kinetic data structures for all nearest neighbors and closest pair in the plane
On triple intersections of three families of unit circles
Boundary of a non-uniform point cloud for reconstruction: extended abstract
Embedding Graphs as Euclidean kNN-Graphs
Topological Beam Tracing
Flat Folding an Unassigned Single-Vertex Complex (Combinatorially Embedded Planar Graph with Specified Edge Lengths) Without Flat Angles
Topologically Sweeping the Visibility Complex of Polygonal Scenes
Approximate Decision Algorithms for Point Set Congruence
LiveCG: an Interactive Visualization Environment for Computational Geometry
Colorful Intersections and Tverberg Partitions
Efficient Partition Trees
On Bend-Minimized Orthogonal Drawings of Planar 3-Graphs
Untangling Planar Curves
An Optimal Bound for Conforming Quality Triangulations (Extended Abstract)
Rounding Arrangements Dynamically
Online Packing to Minimize Area or Perimeter
Lower bounds for k-distance approximation
Efficient data structure for representing and simplifying simplicial complexes in high dimensions
Theoretical and practical results on straight skeletons of planar straight-line graphs
AUTO-FOLLOW: getting a piece of the action all the time
A Parallel Batch-Dynamic Data Structure for the Closest Pair Problem
Vertical Decompositions for Triangles in 3-Space
Further Consequences of the Colorful Helly Hypothesis
Quality meshing for polyhedra with small angles
How to play a coloring game against a color-blind adversary
Intersection Detection and Separators for Simple Polygons
On the Twin-Width of Smooth Manifolds
MatchTheNet - An Educational Game on 3-Dimensional Polytopes (Multimedia Contribution)
Protein geometry as a function of time
Curve Reconstruction: Connecting Dots with Good Reason
Computing Many Faces in Arrangements of Lines and Segments
Scene Analysis and Geometric Homology
Reliable Spanners for Metric Spaces
Exact Computation of the Matching Distance on 2-Parameter Persistence Modules
Competitive query strategies for minimising the ply of the potential locations of moving points
I/O-efficient batched union-find and its applications to terrain analysis
The Topological Correctness of PL-Approximations of Isomanifolds
Combinatorial Discrepancy for Boxes via the gamma_2 Norm
On Piercing Sets of Objects
Controlled Perturbation for Arrangements of Polyhedral Surfaces with Application to Swept Volumes
Deferred Data Structuring: Query-Driven Preprocessing for Geometric Search Problems
There is a Planar Graph Almost as Good as the Complete Graph
Castles in the Air Revisited
Dominance Range-Query: The One-Reporting Case
Approximate center points with proofs
3D Snap Rounding
A Deterministic Linear Time Algorithm for Geometric Separators and its Applications
Fast Algorithms for Computing the Largest Empty Rectangle
Convex Hulls of Random Order Types
Sheaf-Theoretic Stratification Learning
Between umbra and penumbra
Optimal Morphs of Convex Drawings
Incremental Voronoi diagrams
Computing Continuous Dynamic Time Warping of Time Series in Polynomial Time
Topological k-Metrics
Kinetic convex hulls and delaunay triangulations in the black-box model
Map-Matching Queries Under Fréchet Distance on Low-Density Spanners
Preprocessing Ambiguous Imprecise Points
Optimality of the Johnson-Lindenstrauss Dimensionality Reduction for Practical Measures
Pre-triangulations and liftable complexes
Searching for 2D RNA geometries in bacterial genomes
Optimal in-place algorithms for 3-D convex hulls and 2-D segment intersection
Parallel Processing for Efficient Subdivision Search
Exact geometric-topological analysis of algebraic surfaces
Near-Optimal Algorithms for Shortest Paths in Weighted Unit-Disk Graphs
Numerical Stability of Algorithms for Line Arrangements
Efficiently hex-meshing things with topology
On Approximability of ℓ₂² Min-Sum Clustering
Choosing Corners of Rectangles for Mapped Meshing
The Furthest-Site Geodesic Voronoi Diagram
Scalable Parallel Geometric Algorithms for Coarse Grained Multicomputers
Strongly Sublinear Separators and Bounded Asymptotic Dimension for Sphere Intersection Graphs
Ray Shooting in Convex Polytopes
The effect of corners on the complexity of approximate range searching
The Two Guards Problem
Union of Spheres (UoS) Model for Volumetric Data
Hierarchical morse complexes for piecewise linear 2-manifolds
On the Impossibility of Dimension Reduction for Doubling Subsets of ℓp
Capacitated Covering Problems in Geometric Spaces
On the continuous Weber and k -median problems (extended abstract)
Geometric packing under non-uniform constraints
Space-Time Tradeoffs for Emptiness Queries (Extended Abstract)
Numerical Stability of Algorithms for 2D Delaunay Triangulations
Probabilistic Smallest Enclosing Ball in High Dimensions via Subgradient Sampling
Algorithms for Line Transversals in Space
Persistence of the Conley Index in Combinatorial Dynamical Systems
Optical Computational Geometry
Analyzing rigidity with pebble games
Fast Greedy Triangulation Algorithms
Minkowski-Type Theorems and Least-Squares Partitioning
Delpsc: a delaunay mesher for piecewise smooth complexes
Penumbral Shadows
On lines avoiding unit balls in three dimensions
Lower bounds on locality sensitive hashing
Higher-order Erdos-Szekeres theorems
Locality-sensitive hashing scheme based on p-stable distributions
Dynamic Geometric Data Structures via Shallow Cuttings
A deterministic o(m log m) time algorithm for the reeb graph
Linear Optimization Queries
A Manual Comparison of Convex Hull Algorithms (Multimedia Exposition)
Finding a Maximum Clique in a Disk Graph
A practical approach for computing the diameter of a point set
A new approach to crushing 3-manifold triangulations
Combinatorial and Experimental Results for Randomized Point Matching Algorithms
Front Matter, Table of Contents, Foreword, Conference Organization, Additional Reviewers, Acknowledgement of Support, Invited Talks
Lower Bounds for Kinetic Planar Subdivisions
Finding Global Optimum for Truth Discovery: Entropy Based Geometric Variance
Bisector Energy and Few Distinct Distances
Enumeration of Regular Triangulations
The complexity of cutting paper (extended abstract)
New Lower Bounds for Hopcroft's Problem (Extended Abstract)
A Nearly Quadratic Bound for the Decision Tree Complexity of k-SUM
Representing Geometric Structures in d Dimensions: Topology and Order
Geometric Realizations of the 3D Associahedron (Multimedia Exposition)
Proceedings of the Sixth Annual Symposium on Computational Geometry, Berkeley, CA, USA, June 6-8, 1990
Bounded-Diameter Minimum Spanning Trees and Related Problems
Using Convex Relaxations for Efficiently and Privately Releasing Marginals
Interactive 2D Periodic Graphs (Media Exposition)
Fast segment insertion and incremental construction of constrained delaunay triangulations
An Efficient Algorithm for the Euclidean Two-Center Problem
A Generalization of Self-Improving Algorithms
Optimal Algorithms for Some Smallest Intersection Radius Problems (Extended Abstract)
Monotonicity of Rectilinear Geodesics in d -Space (Extended Abstract)
AmoebotSim 2.0: A Visual Simulation Environment for the Amoebot Model with Reconfigurable Circuits and Joint Movements (Media Exposition)
Polygon-Universal Graphs
Area-preserving piecewise affine mappings
A tree traversal algorithm for decision problems in knot theory and 3-manifold topology
Compressive sensing using locality-preserving matrices
Local Search with Weighting Schemes for the CG: SHOP 2022 Competition (CG Challenge)
How to Cut Pseudo-Parabolas into Segments
Incidences of not-too-degenerate hyperplanes
On Geometric Matching
Deterministic sampling and range counting in geometric data streams
Tight bounds for dynamic convex hull queries (again)
New techniques for computing order statistics in Euclidean space (extended abstract)
Ray Shooting and Other Applications of Spanning Trees with Low Stabbing Number
Geometric Computations with Algebraic Varieties of Bounded Degree
An Animated Library of Combinatorial VLSI-Routing Algorithms
Stabbing and Ray Shooting in 3 Dimensional Space
Turtlegons: generating simple polygons for sequences of angles
Approximating Shortest Paths on a Convex Polytope in Three Dimensions
How Hard is Halfspace Range Searching?
Transitions in Geometric Minimum Spanning Trees (Extended Abstract)
Disjoint Faces in Drawings of the Complete Graph and Topological Heilbronn Problems
A global approach to automatic solution of jigsaw puzzles
A Combinatorial Approach to Cartograms
Almost Tight Lower Bounds for Hard Cutting Problems in Embedded Graphs
Printed Circuit Board Simplification: Simplifying Subdivisions in Practice
Free Edge Lengths in Plane Graphs
Guaranteed: quality parallel delaunay refinement for restricted polyhedral domains
Duals of orphan-free anisotropic voronoi diagrams are embedded meshes
Computational Topology and the Unique Games Conjecture
Weight Balancing on Boundaries and Skeletons
Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn's technique
Orthogonal range reporting: query lower bounds, optimal structures in 3-d, and higher-dimensional improvements
Tight lower bounds for the size of epsilon-nets
On sub-determinants and the diameter of polyhedra
On the Edge Crossings of the Greedy Spanner
An Algorithm for Approximate Closest-Point Queries
The Parameterized Complexity of Coordinated Motion Planning
Shadoks Approach to Minimum Partition into Plane Subgraphs (CG Challenge)
Polychromatic Colorings of Geometric Hypergraphs via Shallow Hitting Sets
Point Set Labeling with Sliding Labels
Efficient Exact Geometric Computation Made Easy
Topological graphs: empty triangles and disjoint matchings
Spanners and Reachability Oracles for Directed Transmission Graphs
Quadtrees, octrees, hyperoctrees: a unified analytical approach to tree data structures used in graphics, geometric modeling and image processing
Discrete Fréchet Distance Oracles
Uncluttering Force-Directed Graph Layouts
Ham-Sandwich Cuts and Center Transversals in Subspaces
An Integer Programming Formulation Using Convex Polygons for the Convex Partition Problem
Approximate Matching of Polygonal Shapes (Extended Abstract)
Optimal Parallel Algorithm for Visibility of a Simple Polygon from a Point
H-Walk : Hierarchical Distance Computation for Moving Convex Bodies
Congruence Testing of Point Sets in 4-Space
The limited blessing of low dimensionality: when 1-1/d is the best possible exponent for d-dimensional geometric problems
Proceedings of the 28th ACM Symposium on Computational Geometry, Chapel Hill, NC, USA, June 17-20, 2012
Approximate Range Queries for Clustering
Greedy Permutations and Finite Voronoi Diagrams (Media Exposition)
On Translational Motion Planning in 3-Space
Optimal adaptive algorithms for finding the nearest and farthest point on a parametric black-box curve
Kinetic connectivity for unit disks
Polygon decomposition based on the straight line skeleton
Proceedings of the Seventh Annual Symposium on Computational Geometry, North Conway, NH, USA, , June 10-12, 1991
Optimal Coreset for Gaussian Kernel Density Estimation
A computational framework for incremental motion
Separation by Convex Pseudo-Circles
Polynomials vanishing on grids: The Elekes-Rónyai problem revisited
Nearly-Doubling Spaces of Persistence Diagrams
Orthogonal Trees
Proceedings of the First Annual Symposium on Computational Geometry, Baltimore, Maryland, USA, June 5-7, 1985
Mountain reduction, block matching, and applications in intensity-modulated radiation therapy
Quantum Combine and Conquer and Its Applications to Sublinear Quantum Convex Hull and Maxima Set Construction
Binary Partitions with Applications to Hidden Surface Removal and Solid Modelling
Quality Mesh Generation in Three Dimensions
Double-permutation sequences and pseudoline transversals
Light Euclidean Steiner Spanners in the Plane
On soft predicates in subdivision motion planning
Topological Data Analysis with Bregman Divergences
Range counting coresets for uncertain data
Conflict-free coloring of points with respect to rectangles and approximation algorithms for discrete independent set
Inflating the cube by shrinking
Godzilla Onions: A Skit and Applet to Explain Euclidean Half-Plane Fractional Cascading (Media Exposition)
Geometric Tree Matching with Applications to 3D Lung Structures
An Optimal Deterministic Algorithm for Geodesic Farthest-Point Voronoi Diagrams in Simple Polygons
On Partial Covering For Geometric Set Systems
Updating and constructing constrained delaunay and constrained regular triangulations by flips
Star Unfolding of Boxes (Multimedia Exposition)
VideHoc : A Visualizer for Homogeneous Coordinates
Lower Bounds for Differential Privacy from Gaussian Width
An Optimal Algorithm for Constructing the Delaunay Triangulation of a Set of Line Segments
Wall Thickness Control in Layered Manufacturing
Fast computation of generalized Voronoi diagrams using graphics hardware
Dynamic Ray Shooting and Shortest Paths Via Balanced Geodesic Triangulations
On Computing Simple Circuits on a Set of Line Segments
Almost tight bound for a single cell in an arrangement of convex polyhedra in R 3
Storing the Subdivision of a Polyhedral Surface
Configuration space visualization
On Conway's Thrackle Conjecture
Visual Demo of Discrete Stratified Morse Theory (Media Exposition)
A fully dynamic algorithm for planar
Output-sensitive algorithm for the edge-width of an embedded graph
Line Intersection Searching Amid Unit Balls in 3-Space
Triangulating Polygons without Large Angles
Efficient Greedy Discrete Subtrajectory Clustering
No Krasnoselskii Number for General Sets
Counting and Enumerating Crossing-free Geometric Graphs
What Kind of Verification of Formal Navigation Modelling for Reliable and Usable Web Applications?
6th International Workshop on Automated Specification and Verification of Web Systems, WWV 2010, Vienna, Austria, July 30-31, 2010
Temporal Patterns for Document Verification
Web Categorisation Using Distance-Based Decision Trees
Modeling Web Applications by the Multiple Levels of Integrity Policy
Validating Scripted Web-Pages
Reconstructing Information Retrieved from Multiple Websites
Anchoring modularity in HTML
Rewriting-based navigation of Web sites
Improving the Quality of Web-based Enterprise Applications with Extended Static Checking: A Case Study
Testing web applications in practice
Generating commercial web applications from precise requirements and formal specifications
Answer Set Programming in a Nutshell
Web Accessibility Evaluation Tools: a survey and some improvements
Specifying Hyperdocuments with Algebraic Methods
Proceedings of the International Workshop on Automated Specification and Verification of Web Sites, WWV 2005, Valencia, Spain, March 14-15, 2005
How Recent is a Web Document?
First International Workshop on Automated Specification and Verification of Web Sites (WWV 2005), March 14-15, 2005 Valencia, Spain
Business Data Validation: lessons from practice
Slicing XML Documents
Proceedings of the 3rd International Workshop on Automated Specification and Verification of Web Systems, WWV 2007, Venice, Italy, December 14, 2007
Verification of Web Services with Timed Automata
EasyChair
Web Verification: Perspective and Challenges
Incremental Construction of Counterexamples in Model Checking Web Documents
Proceedings of the 4th International Workshop on Automated Specification and Verification of Web Systems, WWV 2008, Siena, Italy, July 4, 2008
Feature-based Modelling of a Complex, Online-Reconfigurable Decision Support Service
Development of a Query Language for GML based on XPath
A Language for Verification and Manipulation of Web Documents
Automated Web Site Accessibility Evaluation
Context Sequence Matching for XML
A Rewriting-based system for Web site Verification
Algorithmic Bias in Algorithm-Driven User Interfaces: Recommendations for Fairness
Proceedings of the 12th International Workshop on Behavior Change Support Systems (BCSS 2024), Wollongong, Australia, April 10, 2024
12 years of research into behavior change support systems
Persuasive system design principles for pandemic: A workshop-based inquiry into the comprehensibility of designers
If you reply to me, I will buy from you: A social influence examination of reciprocity on Twitter
Proceedings of the 13th International Workshop on Behavior Change Support Systems (BCSS 2025), co-located with the 20th International Conference on Persuasive Technology 2025, Limassol, Cyprus, May 5, 2025
Persuasive Systems Design and Self Determination Theory: Mapping System Features to Intervention Framework to Foster Motivation
Assessing Trustworthiness in Persuasive Prototypes
Designing for diversity: Dynamic persuasive strategies in mHealth app development
Is Technology Adoption More Than Just Utility? The Role of Social Bonding and Motivation in UTAUT
Investigating the Effects of Implicit and Explicit Personalization on Perceived Credibility
Behavior Change Support Systems in the Era of Emerging Technologies
Co-Designing a Multidomain Digital Toolkit to Support Cognitive Health in the Aging Dutch Population: Schouderklopje
Health-related behavior changes using IoHT for pregnant and postpartum women: From the Be-TWINKLE study
Understanding the effects of watching a nature video on informal caregivers' emotional well-being compared to non-caregivers' emotional well-being
Surfers' perceptions of safe-surfing mobile application
Recommender Systems for Renewable Energy Communities: Tailoring LLM-Powered Recommendations to User Personal Values and Literacy
Designing a Digital Behavior Change Intervention for Online Grocery Stores: A Randomized Controlled Trial
Do Metacognitive Strategies Work? Moodle as a BCSS Tool to Enhance Self-Regulated Learning Behavior in Software Engineering Students
Cost to develop persuasion in health behavior change support systems: A weight management app scenario
Harnessing Increased Client Participation with Cohort-Parallel Federated Learning
Sponge: Inference Serving with Dynamic SLOs Using In-Place Vertical Scaling
ML Training with Cloud GPU Shortages: Is Cross-Region the Answer?
Manage the Workloads not the Cluster: Designing a Control Plane for Large-Scale AI Clusters
TAGC: Optimizing Gradient Communication in Distributed Transformer Training
Temporal Graph Generative Models: An empirical study
Cross-Domain DRL Agents for Efficient Job Placement in the Cloud-Edge Continuum
Towards a Unified Framework for Split Learning
The Environmental Cost of Engineering Machine Learning-Enabled Systems: A Mapping Study
Verifying Semantic Equivalence of Large Models with Equality Saturation
Proceedings of the 4th Workshop on Machine Learning and Systems, EuroMLSys 2024, Athens, Greece, 22 April 2024
Towards Asynchronous Peer-to-Peer Federated Learning for Heterogeneous Systems
A Hybrid Decentralised Learning Topology for Recommendations with Improved Privacy
Decentralized Adaptive Ranking using Transformers
FlexInfer: Breaking Memory Constraint via Flexible and Efficient Offloading for On-Device LLM Inference
Systems Opportunities for LLM Fine-Tuning using Reinforcement Learning
Client Availability in Federated Learning: It Matters!
IA2: Leveraging Instance-Aware Index Advisor with Reinforcement Learning for Diverse Workloads
Analysis of Information Propagation in Ethereum Network Using Combined Graph Attention Network and Reinforcement Learning to Optimize Network Efficiency and Scalability
Do Predictors for Resource Overcommitment Even Predict?
An Analysis of Collocation on GPUs for Deep Learning Training
Accelerating MoE Model Inference with Expert Sharding
Navigating Challenges and Technical Debt in Large Language Models Deployment
Proceedings of the 5th Workshop on Machine Learning and Systems, EuroMLSys 2025, World Trade Center, Rotterdam, The Netherlands, 30 March 2025- 3 April 2025
Towards Low-Energy Adaptive Personalization for Resource-Constrained Devices
Efficient Federated Search for Retrieval-Augmented Generation
Enhancing Named Entity Recognition for Agricultural Commodity Monitoring with Large Language Models
Diagnosing and Resolving Cloud Platform Instability with Multi-modal RAG LLMs
GuaranTEE: Towards Attestable and Private ML with CCA
Deploying Stateful Network Functions Efficiently using Large Language Models
Utilizing Large Language Models for Ablation Studies in Machine Learning and Deep Learning
FedRDMA: Communication-Efficient Cross-Silo Federated LLM via Chunked RDMA Transmission
Performance Aware LLM Load Balancer for Mixed Workloads
De-DSI: Decentralised Differentiable Search Index
Comparative Profiling: Insights Into Latent Diffusion Model Training
Hybrid Task Scheduling for Optimized Neural Network Inference on Skin Lesions in Resource-Constrained Systems
Global-QSGD: Allreduce-Compatible Quantization for Distributed Learning with Theoretical Guarantees
Beyond Test-Time Compute Strategies: Advocating Energy-per-Token in LLM Inference