yusuke1997/dblp-id-title huggingface dataset:
Structure of psychological stress during the COVID-19 pandemic and effects of essential oil odor exposure: poster abstract
Towards realistic lifetime estimation in battery-powered IoT devices
Identifying impactful devices on disaggregation performance
Generative Model Based Fine-Grained Air Pollution Inference for Mobile Sensing Systems
[MARS] a real time motion capture and muscle fatigue monitoring tool
Towards Real-Time Rich Scene Analysis Using Vision-Guided Wireless Vibrometry
Context Sensing and Feature Discovery for Improving Classifications
Helios: a programmable software-defined solar module
Staffetta: Smart Duty-Cycling for Opportunistic Data Collection
OneFi: One-Shot Recognition for Unseen Gesture via COTS WiFi
The CLEO mobile sensing platform
How much does human mobility behavior affect the COVID-19 infection spread?: poster abstract
A community based vaccination strategy over mobile phone records
Poster Abstract: Operational Similarity in IoT Malware Development Life Cycle
Powering an E-Ink Display from Soil Bacteria
One-month beijing taxi GPS trajectory dataset with taxi IDs and vehicle status
Sensor Identification and Fault Detection in IoT Systems
Synthetic dataset generation for non-intrusive load monitoring in commercial buildings
Brick: Towards a Unified Metadata Schema For Buildings
Frequent Pattern-based Trajectory Completion
Hawk: An Efficient NALM System for Accurate Low-Power Appliance Recognition
MLE+: design and deployment integration for energy-efficient building controls
Non-Intrusive Speaker Diarization via mmWave Sensing
CYDRES: CYber Defense and REsilient System for securing grid-interactive efficient buildings
Greening Electric Bike Sharing Using Solar Charging Stations
Colloidal Luminaries for Architectural Lighting
Quantifying Personal Exposure to Spatio-Temporally Distributed Air Pollutants using Mobile Sensors
SAFE-points: a lightweight algorithm for analyzing remote mobile ECG signals
Fifty shades of black: uncovering physical models from symbolic regressions for scalable building heat dynamics identification
Virtual Keyboard for Wearable Wristbands
Low-Latency Visible Light Backscatter Networking with RetroMUMIMO
Poster Abstract: Efficient Knowledge Distillation to Train Lightweight Neural Network for Heterogeneous Edge Devices
Predicting the Power Consumption of Electric Appliances through Time Series Pattern Matching
ThermoHands: A Benchmark for 3D Hand Pose Estimation from Egocentric Thermal Images
Talos a Platform for Processing Encrypted IoT Data: Demo Abstract
The 10th ACM Conference on Embedded Network Sensor Systems, SenSys '12, Toronto, ON, Canada, November 6-9, 2012
ElastiCL: Elastic Quantization for Communication Efficient Collaborative Learning in IoT
Poster Abstract: Controlling Actuation in Central HVAC Systems in Buildings
Resilience in urban transportation: towards a participatory sensing-based framework
Poster Abstract: Neural Network-based OFDM/QAM Modulation for Wi-Fi-to-X Communication
ROMeasure: Smartwatch-Based Practical Solution To Accurately Calculate Joint Range Of Motion
RF Power Transmission: Energy Harvesting for Self-Sustaining Miniaturized Sensor Nodes
Kyun queue: a sensor network system to monitor road traffic queues
Efficient integration of smart appliances for demand response programs
Low power and low cost tide gauge sensor node using a long distance communication technology -MAD-SS-: poster abstract
BUSICO 3D: building simulation and control in unity 3D
Enabling a New Resource for WSN Radio Tomographic Imaging: LQI in Transitional Links: Poster Abstract
RAM-Hand: Robust Acoustic Multi-Hand Pose Reconstruction Using a Microphone Array
Noninvasive glucose monitoring using polarized light
Team-level programming of drone sensor networks
Radio information management for distributed spectrum sensing
Locally Differentially Private Participant Recruitment for Mobile Crowdsourcing
Dynamic resource look-up and discovery architecture for indoor location-based service
The REKF localization system: node localization using mobile robots
PipeProbe: mapping hidden water pipelines
Emulab's wireless sensor net testbed: true mobility, location precision, and remote access
CASINO: creating alea with a sensor-based interactive network
Fine-grained travel time sensing in heterogeneous mobile networks: poster abstract
Dynamic power management for long-term energy neutral operation of solar energy harvesting systems
CODA + PSFQ + virtual sinks = enabling technologies for resilient sensor networking
Unmasking the Thermal Behavior of Single-Zone Multi-Room Houses: An Empirical Study
Impact of COVID-19 on Academic Campus Energy Use
Poster Abstract: RL-SEP: RL -Based S mart E xit Point Selection for Enhancing Energy Harvested System Longevity
Scalable data aggregation for dynamic events in sensor networks
Piggyback CrowdSensing (PCS): energy efficient crowdsourcing of mobile sensor data by exploiting smartphone app opportunities
Design and implementation of a low-cost arduino-based high-frequency AC waveform meter board for the raspberry pi
Comfort-aware HVAC Aggregation Method based on Deep Reinforcement Learning
Collaborative Channel Estimation in Backscattering Tag-to-Tag Networks
Power - time optimal algorithm for computing FFT over sensor networks
Common Sense: participatory urban sensing using a network of handheld air quality monitors
Sensors on wheels - towards a zero-infrastructure solution for intelligent transportation systems
Demonstration of an Energy-Aware Task Scheduler for Battery-Less IoT Devices
Standardized Localization Service
The impact of resolution of occupancy data on personal comfort model-based HVAC control performance
A Feasibility Study on Energy Harvesting from Soil Temperature Differences
SCHMEAR: scalable construction of holistic models for energy analysis from rooftops
Predicting Blood Glucose Dynamics with Multi-time-series Deep Learning
Catching elephants with mice: sparse sampling for monitoring sensor networks
Efficient time synchronization for wireless sensor networks in an industrial setting
SmartLight: Light-weight 3D Indoor Localization Using a Single LED Lamp
Towards the Plant-Based Sensor: Agricultural Energy Harvesting and Sensing Experiments
Fair versus Unrestricted Bin Packing
Neighborhood Graphs and Distributed Delta+1-Coloring
Sparse Regression via Range Counting
Fast Dynamic Graph Algorithms for Parameterized Problems
Multistage Matchings
Selection in Monotone Matrices and Computing k th Nearest Neighbors
Optimal Planar Orthogonal Skyline Counting Queries
Combining Pattern Discovery and Probabilistic Modeling in Data Mining
Linear Time Approximation Schemes for Vehicle Scheduling
Economical Delone Sets for Approximating Convex Bodies
Algorithm Theory - SWAT 2010, 12th Scandinavian Symposium and Workshops on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings
On an Alternative Sum Useful in the Analysis of Some Data Structures
An O(log N) Algorithm to Compute the Kernel of a Polygon
Upper and Lower Bounds for the Dictionary Problem (Abstract)
A Fast Algorithm for Permutation Pattern Matching Based on Alternating Runs
Consistent Subset Sampling
Parallel Solution of Space Linear Systems
Approximating the Interval Constrained Coloring Problem
Algorithm Theory - SWAT 2004, 9th Scandinavian Workshop on Algorithm Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings
Walking Streets Faster
Time Parameter and Arbitrary Deunions in the Set Union Problem
A Weakly Robust PTAS for Minimum Clique Partition in Unit Disk Graphs
Time, Clocks and Efficiency of Population Protocols (Invited Paper)
Landscape of Locality (Invited Talk)
Finding Induced Subgraphs from Graphs with Small Mim-Width
Determinant: Old Algorithms, New Insights (Extended Abstract)
Finding All Weakly-Visible Chords of a Polygon in Linear Time (Extended Abstract)
Solving Fundamental Problems on Sparse-Meshes
The Enhanced Double Digest Problem for DNA Physical Mapping
On the Hardness of Approximating the Minimum Consistent OBDD Problem
Complete Problems With L-samplable Distributions
Angle Optimization in Target Tracking
Analysis of Heuristics for the Freeze-Tag Problem
Vector Bin Packing with Multiple-Choice
Approximation Algorithms for Clustering to Minimize the Sum of Diameters
The Constrained Minimum Spanning Tree Problem (Extended Abstract)
Dynamic Approximate Multiplicatively-Weighted Nearest Neighbors
Online Selection of Intervals and t -Intervals
Upper Envelope Onion Peeling
Data Structures for Traveling Salesmen (Abstract)
Top-Down Analysis of Path Compression: Deriving the Inverse-Ackermann Bound Naturally (and Easily)
New Results on Linear Programming and Related Problems
On Metric Clustering to Minimize the Sum of Radii
On the Size of Outer-String Representations
A Single-Exponential FPT Algorithm for the K 4-Minor Cover Problem
Improved Approximations of Independent Sets in Bounded-Degree Graphs
Simplified Planar Coresets for Data Streams
Higher Order City Voronoi Diagrams
Asymptotically Optimal Election on Weighted Rings
Generating Binary Trees by Transpositions
Applications of a Semi-Dynamic Convex Hull Algorithm
Exponential Time Algorithms for the Minimum Dominating Set Problem on Some Graph Classes
Tight Lower Bounds for List Edge Coloring
Asynchronous Rumor Spreading in Preferential Attachment Graphs
Dynamic Closest Pairs - A Probabilistic Approach
A Fast 3-Approximation for the Capacitated Tree Cover Problem with Edge Loads
Extractors for Weak Random Sources and Their Applications
Reoptimization of Steiner Trees
Largest and Smallest Tours and Convex Hulls for Imprecise Points
Fast Subexponential Algorithm for Non-local Problems on Graphs of Bounded Genus
Recent Results in Hardness of Approximation
Polychromatic Coloring for Half-Planes
Cops and Robber Game without Recharging
Bin Packing with Fixed Number of Bins Revisited
Competitive Analysis of Maintaining Frequent Items of a Stream
On Matchings and b-Edge Dominating Sets: A 2-Approximation Algorithm for the 3-Edge Dominating Set Problem
An Extrapolation on the Interpolation Search
New Algorithms for Enumerating All Maximal Cliques
Recent Developments in Maximum Flow Algorithms (Invited Lecture)
NC Algorithms for Computing the Number of Perfect Matchings in K3, 3-free Graphs and Related Problems
An Efficient Quasidictionary
A Fast Parallel Algorithm for Computing all Maximal Cliques in a Graph and the Related Problems (Extended Abstract)
Computing the Penetration Depth of Two Convex Polytopes in 3D
Probabilistic Ancestral Sequences and Multiple Alignments
Correlation Clustering with Vertex Splitting
Canonizing Graphs of Bounded Rank-Width in Parallel via Weisfeiler-Leman
19th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2024, Helsinki, Finland, June 12-14, 2024
Priority Queues on Parallel Machines
Unit-Disk Range Searching and Applications
Induced Disjoint Paths in AT-Free Graphs
Improved Approximation Algorithms for the Single-Sink Buy-at-Bulk Network Design Problems
Parameterized Complexity of Submodular Minimization Under Uncertainty
18th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2022, Tórshavn, Faroe Islands, June 27-29, 2022
A Simpler Linear-Time Recognition of Circular-Arc Graphs
Optimal Multi-Packet Routing on the Torus
A Nearly Optimal Parallel Algorithm for the Voronoi Diagram of a Convex Polygon
The List Update Problem and the Retrieval of Sets
Random Arc Allocation and Applications
Approximation Algorithms for the Minimum Convex Partition Problem
The Maximum Energy-Constrained Dynamic Flow Problem
Online Parallel Heuristics and Robot Searching under the Competitive Framework
Railway Delay Management: Exploring Its Algorithmic Complexity
Paging on a RAM with Limited Resources
Stability in Graphs with Matroid Constraints
Compacting Squares: Input-Sensitive In-Place Reconfiguration of Sliding Squares
Graphics in Flatland Revisited
Approximating the Integral Fréchet Distance
On Small Depth Threshold Circuits
Improved Methods For Generating Quasi-gray Codes
Approximation Algorithms for Free-Label Maximization
Partial Matching between Surfaces Using Fréchet Distance
Tight Approximability Results for Test Set Problems in Bioinformatics
Linear Time LexDFS on Cocomparability Graphs
Canonical Representation of Partial 2- and 3-Trees
Time-Space Trade-offs for Triangulating a Simple Polygon
Forewarned Is Fore-Armed: Dynamic Digraph Connectivity with Lookahead Speeds Up a Static Clustering Algorithm
Dominating Cliques in Distance-Hereditary Graphs
Dense Graph Partitioning on Sparse and Dense Graphs
Optimal Online Escape Path Against a Certificate
A d /2 Approximation for Maximum Weight Independent Set in d -Claw Free Graphs
Sorted Range Reporting
Vision-Based Pursuit-Evasion in a Grid
Searching with Uncertainty (Extended Abstract)
Deterministic Parameterized Connected Vertex Cover
Packet Bundling
Making an Arbitrary Filled Graph Minimal by Removing Fill Edges
All-Norm Approximation Algorithms
Colored Range Searching in Linear Space
Comparator Networks for Binary Heap Construction
Two-Variable Linear Programming in Parallel
Online Unit Profit Knapsack with Untrusted Predictions
On the Approximability of the Traveling Salesman Problem with Line Neighborhoods
Triangles, 4-Cycles and Parameterized (In-)Tractability
Online, Non-preemptive Scheduling of Equal-Length Jobs on Two Identical Machines
Expected Linear Time Sorting for Word Size Ω(log2 n loglogn)
Load Thresholds for Cuckoo Hashing with Double Hashing
Efficient Parallel Algorithms for Shortest Paths in Planar Graphs
Dynamic L-Budget Clustering of Curves
Watchman Routes for Lines and Segments
Guarding Art Galleries: The Extra Cost for Sculptures Is Linear
Annotating Simplices with a Homology Basis and Its Applications
Direct Bulk-Synchronous Parallel Algorithms
The Complexity of Scheduling Problems with Communication Delays for Trees
Embeddings of k -Connected Graphs of Pathwidth k
A Preemptive Algorithm for Maximizing Disjoint Paths on Trees
A Linear Time Algorithm for the Feasibility of Pebble Motion on Trees
Algorithms Parameterized by Vertex Cover and Modular Width, through Potential Maximal Cliques
Auctions with Budget Constraints
Online Compression Caching
Gathering by Repulsion
Voronoi Diagrams of Moving Points in Higher Dimensional Spaces
Greedily Finding a Dense Subgraph
The Emergence of Sparse Spanners and Greedy Well-Separated Pair Decomposition
Minimizing the Continuous Diameter when Augmenting Paths and Cycles with Shortcuts
MaxSAT with Absolute Value Functions: A Parameterized Perspective
Bounded Unpopularity Matchings
Exploiting Locality in LT-RAM Computations
Submodular Clustering in Low Dimensions
Reduction Techniques for Graph Isomorphism in the Context of Width Parameters
A Framework for Adaptive Sorting
Improved Algorithms for Quantum Identification of Boolean Oracles
Better Approximation Schemes for Disk Graphs
On the Hardness of Global and Local Approximation
Tree Decompositions with Small Cost
Online Function Tracking with Generalized Penalties
Communication Complexity of Gossiping by Packets
A Simple Framework for the Generalized Nearest Neighbor Problem
Eliminating Crossings in Ordered Graphs
Powers of Geometric Intersection Graphs and Dispersion Algorithms
Isomorphism for Graphs of Bounded Feedback Vertex Set Number
An Optimal Parallel Algorithm for Computing a Near-Optimal Order of Matrix Multiplications
Predecessor on the Ultra-Wide Word RAM
Sparse Cuts in Hypergraphs from Random Walks on Simplicial Complexes
Fixed-Parameter Tractable Certified Algorithms for Covering and Dominating in Planar Graphs and Beyond
Representing a Functional Curve by Curves with Fewer Peaks
Data Structures for Maintaining Set Partitions
Linear-Space Data Structures for Range Minority Query in Arrays
Paging with Request Sets
Kinetic Pie Delaunay Graph and Its Applications
Algorithm Theory - SWAT '94, 4th Scandinavian Workshop on Algorithm Theory, Aarhus, Denmark, July 6-8, 1994, Proceedings
On a Special Co-cycle Basis of Graphs
Delaunay Triangulations in the Hilbert Metric
Fully-Dynamic All-Pairs Shortest Paths: Faster and Allowing Negative Cycles
Local Spanners Revisited
Testing Formula Satisfaction
Computing Depth Orders and Related Problems
Reconfiguration Algorithms for Cubic Modular Robots with Realistic Movement Constraints
The Pathwidth and Treewidth of Cographs
Separability of Imprecise Points
Low-Stretch Spanning Trees of Graphs with Bounded Width
Toward Complete Genome Data Mining in Computational Biology
Feasible and Accurate Algorithms for Covering Semidefinite Programs
Generalized Metric Repair on Graphs
Efficient Rebalancing of Chromatic Search Trees
Amortized Analysis of Smooth Quadtrees in All Dimensions
An Improved Algorithm for Incremental DFS Tree in Undirected Graphs
The Relative Worst Order Ratio Applied to Seat Reservation
All-Norm Approximation for Scheduling on Identical Machines
Computation as a Scientific Weltanschauung (Invited Talk)
On the Complexity of the Sub-permutation Problem
Data Structures with Local Update Operations
Results and Problems on Self-adjusting Search Trees and Related Data Structures
On Neighbors in Geometric Permutations
An Improved ε-Approximation Algorithm for Geometric Bipartite Matching
Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First Search and Shortest Paths
Connecting the Maximum Number of Grid Nodes to the Boundary with Non-Intersecting Line Segments
Generating Sparse Spanners for Weighted Graphs
A Logarithmic Integrality Gap for Generalizations of Quasi-Bipartite Instances of Directed Steiner Tree
Computing the Unrooted Maximum Agreement Subtree in Sub-quadratic Time
The Optimal Online Algorithms for Minimizing Maximum Lateness
Generalized Powers of Graphs and Their Algorithmic Use
Approximating the Complete Euclidean Graph
Approximate Hypergraph Coloring
Acyclic Orientation of Drawings
Recognizing Map Graphs of Bounded Treewidth
On Two Dimensional Packing
Adaptive Algorithms for Constructing Convex Hulls and Triangulations of Polygonal Chains
Generating Sparse 2-spanners
An O(n 2.75 ) Algorithm for Online Topological Ordering
Convex Polygons Made from Few Lines and Convex Decompositions of Polyhedra
Ranking Trees Generated by Rotations
Visibility with Multiple Reflections
A Framework for Dynamic Parameterized Dictionary Matching
I/O-Space Trade-Offs
Fast Multi-Subset Transform and Weighted Sums over Acyclic Digraphs
Pointed Binary Encompassing Trees
Size-Constrained Weighted Ancestors with Applications
Improvement of Nemhauser-Trotter Theorem and Its Applications in Parametrized Complexity
Parameterized Computational Complexity of Dodgson and Young Elections
Algorithm Theory - SWAT 2002, 8th Scandinavian Workshop on Algorithm Theory, Turku, Finland, July 3-5, 2002 Proceedings
Finding Shortest Paths in the Presence of Orthogonal Obstacles Using a Combined L1 and Link Metric
Incremental Maintenance of the 5-Edge-Connectivity Classes of a Graph
Bicriteria Approximation Tradeoff for the Node-Cost Budget Problem
Algorithm Theory - SWAT '96, 5th Scandinavian Workshop on Algorithm Theory, Reykjavík, Iceland, July 3-5, 1996, Proceedings
Computing the L 1 -Diameter and Center of a Simple Rectilinear Polygon in Parallel
Minimizing the Diameter of a Network Using Shortcut Edges
Two New Algorithms for Constructing Min-Max Heaps
Amortized Complexity of Bulk Updates in AVL-Trees
On Graph Powers for Leaf-Labeled Trees
Neighbours on a Grid
Computing β-Stretch Paths in Drawings of Graphs
Parallel Algorithms for All Minimum Link Paths and Link Center Problems
Minimum Membership Set Covering and the Consecutive Ones Property
The MST of Symmetric Disk Graphs Is Light
On Intersection Searching Problems Involving Curved Objects
Phase Transitions in Sampling Algorithms and the Underlying Random Structures
Space-Sweep Algorithms for Parametric Optimization (Extended Abstract)
Linear Algorithms for Graph Separation Problems
Erdős-Selfridge Theorem for Nonmonotone CNFs
Extremal Cost Tree Data Structures
Search-Space Reduction via Essential Vertices Revisited: Vertex Multicut and Cograph Deletion
Star Unfolding of a Polytope with Applications (Extended Abstract)
Sparse Weight Tolerant Subgraph for Single Source Shortest Path
An Optimal Algorithm for Product Structure in Planar Graphs
The p-Center Problem in Tree Networks Revisited
Local Search Algorithms for SAT: Worst-Case Analysis
Facility Location with Dynamic Distance Function (Extended Abstract)
Exact Exponential Algorithms for Two Poset Problems
Toward Grünbaum's Conjecture
On External-Memory MST, SSSP, and Multi-way Planar Graph Separation
Connectability Problems
Polynomial Kernels for Hard Problems on Disk Graphs
A Probabilistic Analysis of Christofides' Algorithm
Finding the k Smallest Spanning Trees
The Kinetic Facility Location Problem
Tree Containment With Soft Polytomies
Partial Complementation of Graphs
A New Algorithm for the Construction of Optimal B-Trees
Improved Upper Bounds for Time-Space Tradeoffs for Selection with Limited Storage
A Clustering-Based Approach to Kinetic Closest Pair
Optimizing Visibility-Based Search in Polygonal Domains
Getting the Best Response for Your Erg
Optimizing Society? Ensuring Fairness in Automated Decision-Making (Invited Talk)
Algorithm Theory - SWAT 2000, 7th Scandinavian Workshop on Algorithm Theory, Bergen, Norway, July 5-7, 2000, Proceedings
Algorithms on Minimizing the Maximum Sensor Movement for Barrier Coverage of a Linear Domain
Sorting and Searching Revisted
A Bottom-Up Method and Fast Algorithms for max independent set
Parallel Dynamic Lowest Common Ancestors
Service-Constrained Network Design Problems
On the Complexities of the Optimal Rounding Problems of Sequences and Matrices
Optimal Algorithm for a Special Point-Labeling Problem
Approximation Schemes for the Crane Scheduling Problem
An Implicit Binomial Queue with Constant Insertion Time
Space-Efficient Data Structure for Posets with Applications
A Note on Determinig the 3-Dimensional Convex Hull of a Set of Points on a Mesh of Processors
Efficient Preprocessing of Simple Binary Pattern Forests
Trees and Co-trees with Bounded Degrees in Planar 3-connected Graphs
A Greedy Algorithm for Subspace Approximation Problem
Extension Complexity, MSO Logic, and Treewidth
How to Update a Balanced Binary Tree with a Constant Number of Rotations
Recognition and Proper Coloring of Unit Segment Intersection Graphs
Approximating the Revenue Maximization Problem with Sharp Demands
Two Space Saving Tricks for Linear Time LCP Array Computation
Approximations for the General Block Distribution of a Matrix
Reoptimization of Minimum and Maximum Traveling Salesman's Tours
Worst-Case External-Memory Priority Queues
Edge Multiway Cut and Node Multiway Cut Are Hard for Planar Subcubic Graphs
Algorithm Theory - SWAT '92, Third Scandinavian Workshop on Algorithm Theory, Helsinki, Finland, July 8-10, 1992, Proceedings
Reconfiguring Independent Sets in Claw-Free Graphs
Well-Separation and Hyperplane Transversals in High Dimensions
Translating Polygons with Applications to Hidden Surface Removal
Faster Algorithms for the Nonemptiness of Streett Automata and for Communication Protocol Pruning
Estimating The Makespan of The Two-Valued Restricted Assignment Problem
Serving Requests with On-line Routing
On the Generality of Phylogenies from Incomplete Directed Characters
Derandomization Via Small Sample Spaces (Abstract)
Parallel Algorithm for Cograph Recognition with Applications
Colorful Bin Packing
Design and Analysis of Dynamic Multithreaded Algorithms
Triangle Counting in Dynamic Graph Streams
Separating Translates in the Plane: Combinatorial Bounds and an Algorithm
Simplex Range Searching and k Nearest Neighbors of a Line Segment in 2D
Optimal Algorithms for Broadcast and Gossip in the Edge-Disjoint Path Modes (Extended Abstract)
Variable Sized Online Interval Coloring with Bandwidth
On Self-Stabilizing Wait-Free Clock Synchronization
Approximation Algorithms for Hitting Triangle-Free Sets of Line Segments
The Randomized Complexity of Maintaining the Minimum
Applications of a Symbolic Perturbation Scheme (Abstract)
Parallel Algorithms for Priority Queue Operations
Sorting by Merging or Merging by Sorting?
Optimum Inapproximability Results for Finding Minimum Hidden Guard Sets in Polygons and Terrains
On the Independence Number of 1-Planar Graphs