yusuke1997/dblp-id-title huggingface dataset:
Maximum Agreement Subtree in a Set of Evolutionary Trees: Metrics and Efficient Algorithms
A Heuristic Scheduling of Independent Tasks with Bottleneck Resource Constraints
Finding Maximum Edge-Disjoint Paths Between Multiple Terminals
I/O-Efficient Planar Separators
Minimum Networks in Uniform Orientation Metrics
An Optimal Algorithm for Euclidean Shortest Paths in the Plane
Decentralized Low-Stretch Trees via Low Diameter Graph Decompositions
All-Pairs Almost Shortest Paths
Algorithms for the Certified Write-All Problem
Diagnosis of t/(t+1)-Diagnosable Systems
Fixed-Parameter Tractability of Directed Multiway Cut Parameterized by the Size of the Cutset
Convergence Criteria for Genetic Algorithms
The Computation of Powers of Symbolic Polynomials
General Dynamic Routing with Per-Packet Delay Guarantees of O (Distance + 1/Session Rate)
Shared Memory Consistency Conditions for Nonsequential Execution: Definitions and Programming Strategies
Revisiting Tucker's Algorithm to Color Circular Arc Graphs
Geometric Complexity Theory I: An Approach to the P vs. NP and Related Problems
An O(n log 2 n) Algorithm for Maximum Flow in Undirected Planar Networks
On the Analysis of Synchronous Computing Systems
Efficient Algorithms for Optimal Stream Merging for Media-on-Demand
Randomized Distributed Edge Coloring via an Extension of the Chernoff-Hoeffding Bounds
Self-Adjusting Heaps
Optimal Algorithms for Multiplication in Certain Finite Fields Using Elliptic Curves
Geometry Helps in Matching
Relativizing Time, Space, and Time-Space
Special Section on the Fiftieth Annual ACM Symposium on Theory of Computing (STOC 2018)
Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication
Analysis and Synthesis of Sorting Algorithms
Theory of Output Set Assignments and Degree Switching Operations
Sparse Dynamic Programming for Evolutionary-Tree Comparison
An Approximation Algorithm for Max-Min Fair Allocation of Indivisible Goods
Sorting Points Along an Algebraic Curve
Computing Matrix Eigenvalues and Polynomial Zeros Where the Output is Real
Axiomatising Finite Concurrent Processes
The Average Complexity of Parallel Comparison Merging
Regular Closure of Deterministic Languages
Fully Dynamic Algorithms for Bin Packing: Being (Mostly) Myopic Helps
A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths
New Bounds for Matching Vector Families
Constraints on Structural Descriptions: Local Transformations
Network Failure Detection and Graph Connectivity
On the Inherent Sequentiality of Concurrent Objects
Efficient Synthesis and Implementation of Large Discrete Fourier Transformations
Relativizations of the P =? NP Question
On the Probable Performance of Heuristics for Bandwidth Minimization
Polynomial Algorithms for Hamiltonian Cycle in Cocomparability Graphs
The Maximum Size of Dynamic Data Structures
Space-Efficient Message Routing in c-Decomposable Networks
On the Lovász Theta Function for Independent Sets in Sparse Graphs
Greedy Matching on the Line
A Logarithmic Lower Bound for Oblivious RAM (For All Parameters)
Routing in Undirected Graphs with Constant Congestion
Constrained Optimum Communication Trees and Sensitivity Analysis
Testing Hereditary Properties of Nonexpanding Bounded-Degree Graphs
A Duality-Based Unified Approach to Bayesian Mechanism Design
The Computational Complexity of Continued Fractions
Fast Fourier Transforms for Metabelian Groups
The Computational Complexity of Tutte Invariants for Planar Graphs
Depth-First Search and Linear Graph Algorithms
Improving the Stretch Factor of a Geometric Network by Edge Augmentation
Super-Polylogarithmic Hypergraph Coloring Hardness via Low-Degree Long Codes
On the Nisan-Ronen Conjecture for Submodular Valuations
The Linkage of a Graph
Derandomizing Approximation Algorithms Based on Semidefinite Programming
A Near-Optimal Algorithm for Shortest Paths Among Curved Obstacles in the Plane
Derandomization from Algebraic Hardness
The Equivalence Problem for Deterministic Two-Way Sequential Transducers is Decidable
Area-Universal and Constrained Rectangular Layouts
Maximizing a Monotone Submodular Function Subject to a Matroid Constraint
Ray Shooting amidst Convex Polyhedra and Polyhedral Terrains in Three Dimensions
Distributed (Δ+1)-Coloring via Ultrafast Graph Shattering
Complexity of Stoquastic Frustration-Free Hamiltonians
Addendum: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
On Languages With Very High Space-Bounded Kolmogorov Complexity
Local Search Heuristics for k-Median and Facility Location Problems
Near Optimal Bounds for Steiner Trees in the Hypercube
On Approximation Algorithms for #P
Primal-Dual Meets Local Search: Approximating MSTs With Nonuniform Degree Bounds
The Efficiency of Resolution and Davis--Putnam Procedures
Minimum Diameter Spanning Trees and Related Problems
Optimum Sequence Trees
Approximating Longest Cycles in Graphs with Bounded Degrees
Quantum Locally Testable Codes
Linear Equations Modulo 2 and the L 1 Diameter of Convex Bodies
Duality and Optimality of Auctions for Uniform Distributions
Algorithms for Scheduling Imprecise Computations with Timing Constraints
Truly Subcubic Algorithms for Language Edit Distance and RNA Folding via Fast Bounded-Difference Min-Plus Product
Strict Polynomial-Time in Simulation and Extraction
Noncanonical Extensions of Bottom-Up Parsing Techniques
Singular and Plural Nondeterministic Parameters
Binary Search on a Tape
Information Dissemination in Trees
Special Section on the Fifty-Fourth Annual IEEE Symposium on Foundations of Computer Science (FOCS 2013)
Considering Suppressed Packets Improves Buffer Management in Quality of Service Switches
Optimization of Cost and Delay in Cellular Permutation Networks
A Lower Bound for Integer Multiplication with Read-Once Branching Programs
Packet Transmission in a Noisy-Channel Ring Network
On the Reuse of Additions in Matrix Multiplication
A Completeness Criterion for Spectra
Verification of Probabilistic Programs
Scheduling Flat Graphs
Scheduling File Transfers for Trees and Odd Cycles
On Certain Polynomial-Time Truth-Table Reducibilities of Complete Sets to Sparse Sets
Tree Pattern Matching to Subset Matching in Linear Time
Compact Labeling Scheme for Ancestor Queries
Membership in Constant Time and Almost-Minimum Space
The Complexity of Pattern Matching for a Random String
Provably Fast and Accurate Recovery of Evolutionary Trees through Harmonic Greedy Triplets
An Algorithm for the Computation of Linear Forms
The Bisimulation Problem for Equational Graphs of Finite Out-Degree
Tree-Walking Automata Do Not Recognize All Regular Languages
Fast Greedy Algorithms for Constructing Sparse Geometric Spanners
The Token Distribution Problem
On Approximating the Number of k-Cliques in Sublinear Time
Link Reversal Routing with Binary Link Labels: Work Complexity
Non-Black-Box Simulation from One-Way Functions and Applications to Resettable Security
Quantum Speedup for Graph Sparsification, Cut Approximation, and Laplacian Solving
Nonmigratory Online Deadline Scheduling on Multiprocessors
Matroid Secretary Problem in the Random-Assignment Model
Improved Bounds for Matroid Partition and Intersection Algorithms
Efficient Solutions to Some Transportation Problems with Applications to Minimizing Robot Arm Travel
A Friendly Smoothed Analysis of the Simplex Method
A Note on "An On-Line Scheduling Heuristic with Better Worst Case Ratio than Graham's List Scheduling"
Small but Unwieldy: A Lower Bound on Adjacency Labels for Small Classes
Finite Capacity Queuing Systems with Applications in Computer Modeling
Randomization Does Not Reduce the Average Delay in Parallel Packet Switches
The Glauber Dynamics on Colorings of a Graph with High Girth and Maximum Degree
The Complexity of the Membership Problem for Two Subclasses of Polynomial Ideals
Computing the Strength of a Graph
Minimal Ascending and Descending Tree Automata
Fast Parallel Algorithms for Sparse Multivariate Polynomial Interpolation over Finite Fields
Exponential Lower Bounds and Integrality Gaps for Tree-Like Lovász-Schrijver Procedures
Towards Sharp Inapproximability for Any 2-CSP
Realization with Feedback Encoding. II: Applications to Distinguishing Sequences
The Boolean Hierarchy II: Applications
The Set Union Problem With Unlimited Backtracking
Sub-Constant Error Low Degree Test of Almost-Linear Size
Estimating the Weight of Metric Minimum Spanning Trees in Sublinear Time
A Linear Tree Partitioning Algorithm
Reporting Neighbors in High-Dimensional Euclidean Space
Rectilinear Path Problems among Rectilinear Obstacles Revisited
The Probabilistic Analysis of a Heuristic for the Assignment Problem
A Proof of the Algebraic Tractability Conjecture for Monotone Monadic SNP
Heuristics That Dynamically Organize Data Structures
Flow in Planar Graphs with Multiple Sources and Sinks
On the Impossibility of a Quantum Sieve Algorithm for Graph Isomorphism
Bipartite Edge Coloring in O(Delta m) Time
Almost Optimal Lower Bounds for Problems Parameterized by Clique-Width
On the Existence of Cook Semantics
Anchored Parallel Repetition for Nonlocal Games
Steiner Point Removal with Distortion O(log k) using the Relaxed-Voronoi Algorithm
Dual-Bounded Generating Problems: All Minimal Integer Solutions for a Monotone System of Linear Inequalities
The Unsolvability of the Equivalence Problem for epsilon-Free NGSM's with Unary Input (Output) Alphabet and Applications
On the Complexity of Optimal Lottery Pricing and Randomized Mechanisms for a Unit-Demand Buyer
The Structure of the Stable Roommate Problem: Efficient Representation and Enumeration of All Stable Assignments
Quantum Query Complexity of Minor-Closed Graph Properties
Black-Box Constructions of Protocols for Secure Computation
Search via Quantum Walk
An Optimal O(log log n) Time Parallel String Matching Algorithm
Position-Based Cryptography
Optimal Sampling Strategies in Quicksort and Quickselect
Fixed-Parameter Algorithms for Maximum Agreement Forests
Bandwidth Allocation with Preemption
Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic Õ(n 5/3 ) Time
Circuit Lower Bounds for Nondeterministic Quasi-polytime from a New Easy Witness Lemma
Macro Tree Translations of Linear Size Increase are MSO Definable
Cops, Robbers, and Threatening Skeletons: Padded Decomposition for Minor-Free Graphs
Kolmogorov Complexity and Instance Complexity of Recursively Enumerable Sets
Improved Lower Bounds for Embeddings intoL 1 $
Linear-Time Haplotype Inference on Pedigrees without Recombinations and Mating Loops
A Note on Merging
An O(log m)-Competitive Algorithm for Online Machine Minimization
An O(N+M)-Time Algorithm for Finding a Minimum-Weight Dominating Set in a Permutation Graph
An Enumerative Geometry Framework for Algorithmic Line Problems in $\mathbb R^3$
Special Section on the 48th Annual ACM Symposium on Theory of Computing (STOC 2016)
Straight-Line Programs with One Input Variable
Derandomization beyond Connectivity: Undirected Laplacian Systems in Nearly Logarithmic Space
Time/Space Trade-Offs for Reversible Computation
Optimal (Euclidean) Metric Compression
A Linear-Time Algorithm for the Homotopic Routing Problem in Grid Graphs
The Theoretical Aspects of the Optimal Fixed Point
Parallel Complexity of Computations with General and Toeplitz-Like Matrices Filled with Integers and Extensions
P-Printable Sets
Succinctness of Descriptions of Unambiguous Context-Free Languages
Readies and Failures in the Algebra of Communicating Processes
Improved Algorithms for Linear Inequalities With Two Variables per Inequality
Corrigenda: A Completeness Criterion for Spectra
Quantum Lower Bounds by Sample-to-Query Lifting
Near-Optimal Column-Based Matrix Reconstruction
An Efficient Parallel Algorithm for the Martix-Chain-Product Problem
A Probabilistic Approach to the Dichotomy Problem
On k-d Range Search with Patricia Tries
Terminal Backup, 3D Matching, and Covering Cubic Graphs
Fail-Stop Signatures
On Regular Tree Embeddings
An Algorithm for Shortest Paths in Bipartite Digraphs with Concave Weight Matrices and its Applications
Efficient Approximations of Conjunctive Queries
Spanners of Complete k-Partite Geometric Graphs
A New Base Change Algorithm for Permutation Groups
Well-Separated Pair Decomposition for the Unit-Disk Graph Metric and Its Applications
Minimum Delay Codes
Downward Separation Fails Catastrophically for Limited Nondeterminism Classes
Sublinear Time Approximation of the Cost of a Metric \({k}\)-Nearest Neighbor Graph
Tight Bounds for Searching a Sorted Array of Strings
A Variational Method for Analysing Unit Clause Search
Constructing Planar Cuttings in Theory and Practice
Hit-and-Run from a Corner
Nondeterministic Quantum Query and Communication Complexities
The Probabilistic Relationship Between the Assignment and Asymmetric Traveling Salesman Problems
Worst Case Exponential Lower Bounds for Input Resolution with Paramodulation
The Boyer-Moore-Galil String Searching Strategies Revisited
Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication)
On the Number of Crossing-Free Matchings, Cycles, and Partitions
Exponential Average Time for the Pure Literal Rule
Multi-Item Nontruthful Auctions Achieve Good Revenue
A Mathematical Model for the Verification of Systolic Networks
Special Section on the Fifty-Seventh Annual IEEE Symposium on Foundations of Computer Science (FOCS 2016)
Finding Augmented-Set Bases
Four-Coloring \(\boldsymbol{P_6}\)-Free Graphs. II. Finding an Excellent Precoloring
A Partial Analysis of Random Height-Balanced Trees
Optimal Envy-Free Pricing with Metric Substitutability
Lower Bounds for Lov[a-acute]sz--Schrijver Systems and Beyond Follow from Multiparty Communication Complexity
Bubbles: Adaptive Routing Scheme for High-Speed Dynamic Networks
Algorithmic Enumeration of Ideal Classes for Quaternion Orders
Atomic Snapshots in O(n log n) Operations
Optimal Binary Search Trees with Restricted Maximal Depth
Random Walks with the Minimum Degree Local Rule Have O(n 2) Cover Time
On Monotone Formula Composition of Perfect Zero-Knowledge Languages
Limiting Negations in Constant Depth Circuits
Geometric Separators and Their Applications to Protein Folding in the HP-Model
Approximate Models for Processor Utilization in Multiprogrammed Computer Systems
Multikey Fully Homomorphic Encryption and Applications
Computational Parallels Between the Regular and Context-Free Languages
Erratum: Lucid - A Formal System for Writing and Proving Programs
An Application of Bin-Packing to Multiprocessor Scheduling
Online Scheduling with General Cost Functions
Approximately Counting Integral Flows and Cell-Bounded Contingency Tables
Structure in Approximation Classes
Algorithmic Stability for Adaptive Data Analysis
Dominators in Linear Time
Feasible Time-Optimal Algorithms for Boolean Functions on Exclusive-Write Parallel Random-Access Machines
A Priori Bounds on the Euclidean Traveling Salesman
Minimean Merging and Sorting: An Algorithm
Efficient Bundle Sorting
A Comparison of Two Algorithms for Global Data Flow Analysis
Partial-Match Retrieval Algorithms
On identifying codes in the triangular and square grids
The All-or-Nothing Multicommodity Flow Problem
Randomized Approximation Schemes for Cuts and Flows in Capacitated Graphs
A Unified Treatment of Discrete Fast Unitary Transforms
Potentials in Undirected Graphs and Planar Multiflows
The Multiparty Communication Complexity of Set Disjointness
Concurrent Probabilistic Programs, Or: How to Schedule if You Must
Decidability of Membership Problems for Flat Rational Subsets of \(\boldsymbol{{\textrm{GL}}(2,\boldsymbol{{\mathbb{Q}}})}\) and Singular Matrices
On Efficient Simulations of Systolic Arrays of Random-Access Machines
An O(n log 2 n) Algorithm for the k-th Longest Path in a Tree with Applications to Location Problems
Sublogarithmic Bounds on Space and Reversals
Contention Resolution with Constant Throughput and Log-Logstar Channel Accesses
Frequent Directions: Simple and Deterministic Matrix Sketching
Orderly Spanning Trees with Applications
Maximum k-Chains in Planar Point Sets: Combinatorial Structure and Algorithms
Jacobian Hits Circuits: Hitting Sets, Lower Bounds for Depth-D Occur-k Formulas and Depth-3 Transcendence Degree-k Circuits
Solving Undirected Graph Problems on VLSI
General Techniques for Analyzing Recursive Algorithms with Applications
On the Optimality of Randomized alpha-beta Search
A Correction on Shiloach's Algorithm for Minimum Linear Arrangement of Trees
On the Complexity of General Graph Factor Problems
Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
Languages that Capture Complexity Classes
Deferred Data Structuring
Constructive Polynomial Partitioning for Algebraic Curves in ℝ 3 with Applications
On Synchronous Parallel Computations with Independent Probabilistic Choice
Improved Bounds for the Union of Locally Fat Objects in the Plane
The Number of Shortest Paths on the Surface of a Polyhedron
Probabilities Related to Father-Son Distances in Binary Search Trees
Solvability of Consensus: Composition Breaks Down for NonDeterministic Types
Algebraic Computations of Scaled Padé Fractions
Transposition Graphs
Optimum Partitions of Tree Addressing Structures
Finding k Disjoint Paths in a Directed Planar Graph
A Monte-Carlo Algorithm for Estimating the Permanent
Approximate Halfspace Range Counting
A Spectral Approach to Network Design
Quantum Query Algorithms Are Completely Bounded Forms
Corrigendum: Explicit Construction of a Small Epsilon-Net for Linear Threshold Functions
Characterizing Propositional Proofs as Noncommutative Formulas
Dequantizing the Quantum Singular Value Transformation: Hardness and Applications to Quantum Chemistry and the Quantum PCP Conjecture
Almost-Ramanujan Expanders From Arbitrary Expanders via Operator Amplification
The Mixing Time of the Thorp Shuffle
Special Section on the Fifty-Second IEEE Annual Symposium on Foundations of Computer Science (FOCS 2011)
Simulating Size-constrained Galton-Watson Trees
Weak Zero-Knowledge beyond the Black-Box Barrier
On the Exact Complexity of String Matching: Upper Bounds
Sampling Lower Bounds: Boolean Average-Case and Permutations
Large Induced Subgraphs via Triangulations and CMSO
Work-Preserving Speed-Up of Parallel Matrix Computations
Optimal Parallel Sorting Scheme by Order Statistics
Polynomial Threshold Functions, AC^0 Functions, and Spectral Norms
Nearly On Line Scheduling of a Uniform Processor System with Release Times
A Note on the Height of Suffix Trees
Quickest Flows Over Time
Average Case Complete Problems
Comments on F. Hadlock's Paper: "Finding a Maximum Cut of a Planar Graph in Polynomial Time"
The Complexity of Quantified Constraint Satisfaction: Collapsibility, Sink Algebras, and the Three-Element Case
Counting Small Induced Subgraphs with Hereditary Properties
The k-Steiner Ratio in Graphs
Towards an Architecture-Independent Analysis of Parallel Algorithms
A Class of Projective Transformations for Linear Programming
Reducing the Steiner Problem in a Normed Space
The Accommodating Function: A Generalization of the Competitive Ratio
A Probabilistic Study on Combinatorial Expanders and Hashing
Nonstochastic Multi-Armed Bandits with Graph-Structured Feedback
Recognizing More Unsatisfiable Random k-SAT Instances Efficiently
A New Algorithm for Generating All the Maximal Independent Sets
Closest Substring Problems with Small Distances
Towards a Genuinely Polynomial Algorithm for Linear Programming
Partial Types and Intervals
First-Order Specifications of Programmable Data Types
On the Dynamic Finger Conjecture for Splay Trees. Part I: Splay Sorting log n-Block Sequences
Adequate Requirements for Rational Functions
A Constant-Factor Approximation Algorithm for Optimal 1.5D Terrain Guarding
The Average Complexity of Deterministic and Randomized Parallel Comparison-Sorting Algorithms
Improved Approximation Guarantees for Packing and Covering Integer Programs
Improved Combinatorial Group Testing Algorithms for Real-World Problem Sizes
Polynomial Space and Transitive Closure
Application-Controlled Paging for a Shared Cache
Parallelism and Time in Hierarchical Self-Assembly
Structure Theorem and Isomorphism Test for Graphs with Excluded Topological Subgraphs
Random Iterations of Threshold Networks and Associative Memory
Computational Complexity of Compaction to Reflexive Cycles
On Translational Motion Planning of a Convex Polyhedron in 3-Space
Computational Complexity of Two-Dimensional Regions
Optimization of Straight Line Programs
A Deterministic Subexponential Algorithm for Solving Parity Games
On Preserving Proximity in Extendible Arrays
Predictors of Context-Free Grammars
An All Pairs Shortest Path Algorithm with Expected Time O(n² log n)
The Boolean Hierarchy and the Polynomial Hierarchy: A Closer Connection
Inapproximability of Matrix p → q Norms
An O(nlog n)-Time Algorithm for the k-Center Problem in Trees
Reconstructing Truncated Integer Variables Satisfying Linear Congruences
Probabilistic Models and Asymptotic Results for Concurrent Processing with Exclusive and Non-Exclusive Locks
Matchings Meeting Quotas and Their Impact on the Blow-Up Lemma
A Constant-Factor Approximation Algorithm for the Geometric k-MST Problem in the Plane
Tight Bounds for Randomized and Quantum Local Search
Error Thresholds for Arbitrary Pauli Noise
Optimal Information Gathering on the Internet with Time and Cost Constraints
Parallel Time O(log n) Acceptance of Deterministic CFLs on an Exclusive-Write P-RAM
More Nearly Optimal Algorithms for Unbounded Searching, Part II: The Transfinite Case
Complexity of Views: Tree and Cyclic Schemas
Finding Four Independent Trees
Polynomial Complete Consecutive Information Retrieval Problems
Note on Weintraub's Minimum-Cost Circulation Algorithm
Approximating the Spanning Star Forest Problem and Its Application to Genomic Sequence Alignment
Jamming-Resistant Backoff with Polylogarithmic Sending and Listening Cost
The Complexity of Weighted Boolean #CSP
Optimal Bounds for Solving Tridiagonal Systems with Preconditioning
Decodable Quantum LDPC Codes beyond the $\sqrt{n}$ Distance Barrier Using High-Dimensional Expanders
Simulating Quantum Computation by Contracting Tensor Networks
Optimal Approximations and Polynomially Levelable Sets
Generalized Syntax Directed Translation, Tree Transducers, and Linear Space
Twin-Width III: Max Independent Set, Min Dominating Set, and Coloring
Digital Search Trees Revisited
Privately Releasing Conjunctions and the Statistical Query Barrier
Verification of Identities
Approximation and Small-Depth Frege Proofs
Stability of a Queueing System with Concurrent Service and Locking
On the Expected Capacity of Binomial and Random Concentrators
Stochastic Relations: Congruences, Bisimulations and the Hennessy--Milner Theorem
Time Complexity of Boolean Functions on CREW PRAMs
Fingerprinting Codes and the Price of Approximate Differential Privacy
The Enumeration of Generalized Double Stochastic Nonnegative Integer Square Matrices
Category and Measure in Complexity Classes
On the Complexity of Timetable and Multicommodity Flow Problems
An Isomorphism Between Subexponential and Parameterized Complexity Theory
A Polynomial Regularity Lemma for Semialgebraic Hypergraphs and Its Applications in Geometry and Property Testing
VLSI Algorithms for the Connected Component Problem
Polygon Retrieval
Search in an Ordered Array Having Variable Probe Cost
Some Remarks on Computing Galois Groups
The Robot Localization Problem
Bounds on the Efficiency of Generic Cryptographic Constructions
New Algorithms for Polynomial Square-Free Decomposition Over the Integers
The Counterfeit Coin Problem Revisited
Graph Sparsification by Effective Resistances
The Shortest Vector in a Lattice is Hard to Approximate to within Some Constant
Equality Sets and Complexity Classes
Quality Mesh Generation in Higher Dimensions
Efficiently Planning Compliant Motion in the Plane
Regular Resolution Versus Unrestricted Resolution
Special Issue Dedicated To The Thirty-Sixth Annual ACM Symposium On Theory Of Computing (STOC 2004)
Pseudotriangulations from Surfaces and a Novel Type of Edge Flip
Corrigendum: Proximity in Arrangements of Algebraic Sets
Rigid Matrices from Rectangular PCPs