yusuke1997/dblp-id-title huggingface dataset:
An Optimal Algorithm for the Continuous/Discrete Weighted 2-Center Problem in Trees
On the Advice Complexity of the Knapsack Problem
Powers of Hamilton Cycles in Pseudorandom Graphs
A Faster FPT Algorithm and a Smaller Kernel for Block Graph Vertex Deletion
How to Write Integers in Non-Integer Base
The Online Transportation Problem: On the Exponential Boost of One Extra Server
The Internet, the Web, and Algorithms
Logic of Plotkin Continuous Domain
Efficient Approximate Dictionary Look-Up for Long Words over Small Alphabets
Improved Spanning Ratio for Low Degree Plane Spanners
LATIN 2000: Theoretical Informatics, 4th Latin American Symposium, Punta del Este, Uruguay, April 10-14, 2000, Proceedings
Batch Verification with Applications to Cryptography and Checking
The Power of Fair Pricing Mechanisms
Approximating the Edge Length of 2-Edge Connected Planar Geometric Graphs on a Set of Points
On Logical Descriptions of Regular Languages
Algorithms for Local Alignment with Length Constraints
Median and Hybrid Median K-Dimensional Trees
On Symmetry and Initialization for Neural Networks
Colouring Graphs whose Chromatic Number Is Almost Their Maximum Degree
Simulation Permutation Networks on Hypercubes
Finding the Smallest Gap between Sums of Square Roots
The Impact of Locality on the Detection of Cycles in the Broadcast Congested Clique Model
Unambiguous Büchi Automata
Sharp Separation and Applications to Exact and Parameterized Algorithms
On Binary Networked Public Goods Game with Altruism
Uniform Multi-hop All-to-All Optical Routings in Rings
A Representation Theorem for Union-Difference Families and Application
Bounds on Oblivious Multiparty Quantum Communication Complexity
New Lower Bound on Max Cut of Hypergraphs with an Application to r -Set Splitting
The CREW PRAM Complexity of Modular Inversion
Designing Small Keyboards Is Hard
On the Collection of Fringe Subtrees in Random Binary Trees
On Mobile Agent Verifiable Problems
On Minimal-Perimeter Lattice Animals
The "Last" Decision Problem for Rational Trace Languages
Reversible Cellular Automaton Able to Simulate Any Other Reversible One Using Partitioning Automata
The Consequences of Imre Simon's Work in the Theory of Automata, Languages, and Semigroups
Continuous and Discrete Methods in Computer Science
On the Zombie Number of Various Graph Classes
LATIN '92, 1st Latin American Symposium on Theoretical Informatics, São Paulo, Brazil, April 6-10, 1992, Proceedings
On Monotonous Oracle Machines
Unfolding Parametric Automata
Independence of Tabulation-Based Hash Classes
Complexity of Operations on Cofinite Languages
Separating Path Systems in Complete Graphs
Improved Approximate Pattern Matching on Hypertext
A Bounded-Risk Mechanism for the Kidney Exchange Game
State Complexity of SBTA Languages
Simulations Between Cellular Automata on Cayley Graphs
Cutting a Tree with Subgraph Complementation is Hard, Except for Some Small Trees
Scheduling Transfers of Resources over Time: Towards Car-Sharing with Flexible Drop-Offs
Semantics of Attack-Defense Trees for Dynamic Countermeasures and a New Hierarchy of Star-Free Languages
Global Synchronization in Sensornets
Subresultants Revisited
An Improved Algorithm for Sequence Comparison with Block Reversals
Computing Minimum Geodetic Sets of Proper Interval Graphs
Finding All Minimal Infrequent Multi-dimensional Intervals
Spanners of Complete k -Partite Geometric Graphs
The Hardness of Local Certification of Finite-State Dynamics
Data Structures and Terminating Petri Nets
A Simplified, Dynamic Unified Structure
Guided Search and a Faster Deterministic Algorithm for 3-SAT
Minimum-Width Double-Slabs and Widest Empty Slabs in High Dimensions
From Algorithms to Cryptography
Finding k-Connected Subgraphs with Minimum Average Weight
Achieving Optimality for Gate Matrix Layout and PLA Folding: a Graph Theoretic Approach
A Parallel Algorithm for Finding All Successive Minimal Maximum Subsequences
Sparse Approximate Solutions to Semidefinite Programs
Gauss Periods and Fast Exponentiation in Finite Fields (Extended Abstract)
Universal Types and Simulation of Individual Sequences
Rapid Mixing of k-Class Biased Permutations
Listing Acyclic Orientations of Graphs with Single and Multiple Sources
Survivable Network Activation Problems
On Linear-Time Alphabet-Independent 2-Dimensional Pattern Matching
Phase Transitions in Computer Science
Simplifying 3D Polygonal Chains Under the Discrete Fréchet Distance
Improved Approximation Algorithms for Capacitated Fault-Tolerant k-Center
A Proof System and a Decision Procedure for Equality Logic
Oblivious Medians Via Online Bidding
Multiple Mobile Agent Rendezvous in a Ring
Approximation Schemes for Packing Problems with ℓ p -norm Diversity Constraints
Erdős-Rényi Sequences and Deterministic Construction of Expanding Cayley Graphs
Euclidean Prize-Collecting Steiner Forest
Complexity of Coloring Graphs without Paths and Cycles
C-Varieties, Actions and Wreath Product
Relations Among Notions of Security for Identity Based Encryption Schemes
On the Computability of Relations on λ-Terms and Rice's Theorem - The Case of the Expansion Problem for Explicit Substitutions
Two-Dimensional Knapsack for Circles
Embracing the Giant Component
On the Density and Core of the Complexity Classes
The Generalized Weil Pairing and the Discrete Logarithm Problem on Elliptic Curves
Rank Reduction of Directed Graphs by Vertex and Edge Deletions
Towards a Definitive Measure of Repetitiveness
Pathlength of Outerplanar Graphs
Iterated Shared Memory Models
Nash Equilibria via Polynomial Equations
Electronic Jury Voting Protocols
Multidimensional Manhattan Preferences
Analysis of Scheduling Algorithms for Proportionate Fairness
On χ-Diperfect Digraphs with Stability Number Two
Approximating Vector Scheduling: Almost Matching Upper and Lower Bounds
Containment and Evasion in Stochastic Point Data
Lower Bounds for the Matrix Chain Ordering Problem (Extended bstract)
Customized Newspaper Broadcast: Data Broadcast with Dependencies
Dynamics of Sand-Piles Games on Graphs
Equivalent Conditions for Regularity (Extended Abstract)
A Linear Time Algorithm to Recognize Clustered Graphs and Its Parallelization
Analysis of Rabin's Polynomial Irreducability Test
Shortest Rectilinear Path Queries to Rectangles in a Rectangular Domain
Enumerating m-Length Walks in Directed Graphs with Constant Delay
Biased Predecessor Search
Query Minimization Under Stochastic Uncertainty
The Interval Constrained 3-Coloring Problem
Quotient Complexity of Ideal Languages
Parameters in Pure Type Systems
On the Biased Partial Word Collector Problem
Linear Grammars with One-Sided Contexts and Their Automaton Representation
LATIN 2020: Theoretical Informatics - 14th Latin American Symposium, São Paulo, Brazil, January 5-8, 2021, Proceedings
On Weak Growing Context-Sensitive Grammars
Gathering Non-oblivious Mobile Robots
A Fully Dynamic Algorithm for Distributed Shortest Paths
Square Roots Modulo p
Iterated Straight-Line Programs
New Upper Bound on Vertex Folkman Numbers
Paging More Than One Page
Algorithmic Challenges in Web Search Engines
Improved Upper Bounds on the Growth Constants of Polyominoes and Polycubes
Speeding-Up Lattice Reduction with Random Projections (Extended Abstract)
LATIN 2016: Theoretical Informatics - 12th Latin American Symposium, Ensenada, Mexico, April 11-15, 2016, Proceedings
Batched Predecessor and Sorting with Size-Priced Information in External Memory
Thresholds in the Lattice of Subspaces of $\mathbb {F}_q^n$
Visibility Graphs of 2-Spiral Polygons (Extended Abstract)
Paths and Trails in Edge-Colored Graphs
Near-Optimal Search Time in δ-Optimal Space
Embedding Arbitrary Boolean Circuits into Fungal Automata
Communication-Efficient Parallel Multiway and Approximate Minimum Cut Computation
A 2-Approximation for the k-Prize-Collecting Steiner Tree Problem
On Plane Constrained Bounded-Degree Spanners
Probabilities of 2-Xor Functions
Time-Space Trade-Offs for Computing Euclidean Minimum Spanning Trees
The Feedback Arc Set Problem with Triangle Inequality Is a Vertex Cover Problem
Newton-Type Algorithms for Inverse Optimization: Weighted Span Objective
Fully-Compressed Suffix Trees
LATIN 2018: Theoretical Informatics - 13th Latin American Symposium, Buenos Aires, Argentina, April 16-19, 2018, Proceedings
Tight Bounds for Finding Degrees from the Adjacency Matrix
Algorithms for Modular Counting of Roots of Multivariate Polynomials
Decomposing a k -valued Transducer into k Unambiguous Ones
Simpler Constant-Seed Condensers
Packet Forwarding Algorithms in a Line Network
Heights in Generalized Tries and PATRICIA Tries
Spectral Techniques in Graph Algorithms
Optimization and Recognition for K 5-minor Free Graphs in Linear Time
On the Power of BFS to Determine a Graphs Diameter
The Complexity of Counting Eulerian Tours in 4-Regular Graphs
Open Problems in Computational Geometry
Sublinear Methods for Detecting Periodic Trends in Data Streams
Communication Complexity and Fourier Coefficients of the Diffie-Hellman Key
Reoptimization of Some Maximum Weight Induced Hereditary Subgraph Problems
Weighted Connected Matchings
Oblivious Two-Way Finite Automata: Decidability and Complexity
Parameterized Complexity of Red Blue Set Cover for Lines
Eliminating Cycles in the Discrete Torus
Position-Restricted Substring Searching
Automata and Codes with Bounded Deciphering Delay
New Bounds for Online Packing LPs
q -Regular Sequences and Other Generalizations of q -Automatic Sequences
Pure Future Local Temporal Logics Are Expressively Complete for Mazurkiewicz Traces
Submodular Maximization with Uncertain Knapsack Capacity
A Characterization of Those Automata That Structurally Generate Finite Groups
Linear-Time Algorithms for Parametric Minimum Spanning Tree Problems on Planar Graphs
The Branch-Width of Circular-Arc Graphs
The Flip Diameter of Rectangulations and Convex Subdivisions
On APN Functions Whose Graphs are Maximal Sidon Sets
A Theory of Operational Equivalence for Interaction Nets
Klee's Measure Problem Made Oblivious
On the Expressivity and Complexity of Quantitative Branching-Time Temporal Logics
Advances in the Regularity Method
Parameterized Algorithms for Minimum Sum Vertex Cover
Coloring Graph Powers: Graph Product Bounds and Hardness of Approximation
Algorithmic and Hardness Results for the Colorful Components Problems
Matching Points with Things
Improved Parallel Algorithms for Generalized Baumslag Groups
Minimal Split Completions of Graphs
Tight Kernels for Covering and Hitting: Point Hyperplane Cover and Polynomial Point Hitting Set
A Polynomial Sized Kernel for Tracking Paths Problem
k-pseudosnakes in Large Grids
Semantic Word Cloud Representations: Hardness and Approximation Algorithms
How to Color a French Flag - Biologically Inspired Algorithms for Scale-Invariant Patterning
Gradual Sub-lattice Reduction and a New Complexity for Factoring Polynomials
On Behalf of the Seller and Society: Bicriteria Mechanisms for Unit-Demand Auctions
Efficient Edge Domination on Hole-Free Graphs in Polynomial Time
Routing in Unit Disk Graphs
Dihomotopy as a Tool in State Space Analysis
Counting and Generating Permutations Using Timed Languages
Smooth Orthogonal Drawings of Planar Graphs
A General Approach to Ammann Bars for Aperiodic Tilings
Opportunistic Information Dissemination in Mobile Ad-Hoc Networks: Adaptiveness vs. Obliviousness and Randomization vs. Determinism
Transmitting once to Elect a Leader on Wireless Networks
Better Algorithms for Online Bin Stretching via Computer Search
Knapsack: Connectedness, Path, and Shortest-Path
Effciently Computing the Density of Regular Languages
Algorithms for Some H-Join Decompositions
LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31 - April 4, 2014. Proceedings
A Larger Lower Bound on the OBDD Complexity of the Most Significant Bit of Multiplication
Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams
The Online Connected Facility Location Problem
Lossless Data Compression Via Error Correction
Pushdown Automata with Bounded Nondeterminism and Bounded Anbiguity
On 1-Bend Upward Point-Set Embeddings of st-Digraphs
Select and Permute: An Improved Online Framework for Scheduling to Minimize Weighted Completion Time
An Algorithm for a Generalized Maximum Subsequence Problem
Budget Feasible Mechanisms for Experimental Design
Fast Two-Dimensional Approximate Pattern Matching
Properties of Recognizable M -Subsets of a Free Monoid
A BWT-Based Algorithm for Random de Bruijn Sequence Construction
Iteration Algebras Are Not Finitely Axiomatizable. Extended Abstract
Obtaining Approximately Optimal and Diverse Solutions via Dispersion
A Metric Index for Approximate String Matching
I/O-Efficient Algorithms on Near-Planar Graphs
Almost Linear Time Computation of the Chromatic Polynomial of a Graph of Bounded Tree-Width
Cube Packing
Regular Expressions into Finite Automata
Limit Theorems for Random MAX-2-XORSAT
Schnyder Woods and Long Induced Paths in 3-Connected Planar Graphs
Scheduling Parallelizable Jobs Online to Maximize Throughput
Strength of Two Data Encryption Standard Implementations under Timing Attacks
A Parameterized Algorithm for Mixed-Cut
Multiple Alignment of Biological Sequences with Gap Flexibility
Bidimensional Parameters and Local Treewidth
Constrained Integer Partitions
Connected Treewidth and Connected Graph Searching
The Power and Weakness of Randomness in Computation
On the Complexity of Computing the Greatest Common Divisor of Several Univariate Polynomials
Fully Analyzing an Algebraic Pólya Urn Model
From Semantics to Spatial Distribution
Ambiguity and Deficiency in Costas Arrays and APN Permutations
Hausdorff Rank of Scattered Context-Free Linear Orders
A New Approach for Routing in Arrangement Graphs and its Performance Evaluation
In-Place Planar Convex Hull Algorithms
A Polyhedral Investigation of the LCS Problem and a Repetition-Free Variant
Graph Hamiltonicity Parameterized by Proper Interval Deletion Set
Maximal and Convex Layers of Random Point Sets
On the Helly Subclasses of Interval Bigraphs and Circular Arc Bigraphs
Farthest Color Voronoi Diagrams: Complexity and Algorithms
On Some Recent Approximation Algorithms for MAX SAT
Exact Learning of Multitrees and Almost-Trees Using Path Queries
An Average-Case Lower Bound Against \mathsf ACC^0 ACC 0
Advantage of Overlapping Clusters for Minimizing Conductance
Period Recovery over the Hamming and Edit Distances
Approximating Real-Time Scheduling on Identical Machines
Conversion between Two Multiplicatively Dependent Linear Numeration Systems
Walking Through Waypoints
Packing Dicycle Covers in Planar Graphs with No K 5 - e Minor
Quantum Property Testing of Group Solvability
Undecidable Problems in Unreliable Computations
Unambiguous Simulations of Auxiliary Pushdown Automata and Circuits (Extended Abstract)
Bidirectional Variable-Order de Bruijn Graphs
The Grandmama de Bruijn Sequence for Binary Strings
Expected Length of the Longest Common Subsequence for Large Alphabets
Super-State Automata and Rational Trees
Tight Bounds for Online Class-Constrained Packing
LATIN '98: Theoretical Informatics, Third Latin American Symposium, Campinas, Brazil, April, 20-24, 1998, Proceedings
On the Performance of Smith's Rule in Single-Machine Scheduling with Nonlinear Cost
Finding Lower Bounds on the Complexity of Secret Sharing Schemes by Linear Programming
Equations in Free Semigroups with Anti-involution and Their Relation to Equations in Free Groups
Constructions of Approximately Mutually Unbiased Bases
The Planar Slope Number of Subcubic Graphs
Elastic-Degenerate String Matching with 1 Error
A Simple Randomized Parallel Algorithm for Maximal f -Matching
Profile of Tries
Integrated Supply Chain Management via Randomized Rounding
Coloring Planar Homothets and Three-Dimensional Hypergraphs
Some Regularity Conditions Based on Well Quasi-Orders
Solving Equations in Strings: On Makanin's Algorithm
Pebbling in Kneser Graphs
On Split B_1 B 1 -EPG Graphs
Rotation and Lighting Invariant Template Matching
Maximizing Throughput in Queueing Networks with Limited Flexibility
Fundamental Structures in Well-Structured Infinite Transition Systems
On the Radon Number for P 3-Convexity
On the Complexity of Reconstructing H -free Graphs from Their Star Systems
On the Relation Betwen BDDs and FDDs
A New Characterization for Parity Graphs and a Coloring Problem with Costs
Approximation Algorithms for Flexible Job Shop Problems
On Clusters in Markov Chains
Speeding up Approximation Algorithms for NP-Hard Spanning Forest Problems by Multi-objective Optimization
Chasing Convex Bodies and Functions
On Minimum k -Modal Partitions of Permutations
Decidability Classes for Mobile Agents Computing
Spanning Trees with Many Leaves in Graphs without Diamonds and Blossoms
String Attractors and Infinite Words
The Complexity of Diffuse Reflections in a Simple Polygon
Structural Complexity of Multiobjective NP Search Problems
Revisiting the Cache Miss Analysis of Multithreaded Algorithms
Graph Sandwich Problem for the Property of Being Well-Covered and Partitionable into k Independent Sets and ℓ Cliques
Constructing Consistent Digital Line Segments
Independent Set of Convex Polygons: From n ϵ to 1+ϵ via Shrinking
Computing Balanced Convex Partitions of Lines
An Efficient Algorithm for Edge-Coloring Series-Parallel Multigraphs
Locating the Eigenvalues for Graphs of Small Clique-Width
On 2-Subcolourings of Chordal Graphs
Dynamically Optimal Self-adjusting Single-Source Tree Networks
Structural Parameterizations for Equitable Coloring
Geometric Thickness of Multigraphs is ∃ ℝ-Complete
On the Number Components of a Recursive Graph
Drawing HV-Restricted Planar Graphs
New Deterministic Algorithms for Solving Parity Games
A Decidability Result about Convex Polyominoes
Inapproximability Results on Stable Marriage Problems
Stochastic Covering and Adaptivity
Patterns in Ordered (random) Matchings
Don't Rock the Boat: Algorithms for Balanced Dynamic Loading and Unloading
Recognizable Sets of Numbers in Nonstandard Bases
On the Total Number of Bends for Planar Octilinear Drawings
On the Number of Prefix and Border Tables
Polynomial Time Recognition of Clique-Width \le \leq 3 Graphs (Extended Abstract)
Stateless Near Optimal Flow Control with Poly-logarithmic Convergence
Finding Heavy Hitters over the Sliding Window of a Weighted Data Stream
Worst-Case Complexity of the Optimal LLL Algorithm
A New GCD Algorithm for Quadratic Number Rings with Unique Factorization
Approximation Algorithms for the Gromov Hyperbolicity of Discrete Metric Spaces
The Hidden Number Problem in Extension Fields and Its Applications
Bisecting and Gossiping in Circulant Graphs
Communication-Efficient Construction of the Plane Localized Delaunay Graph
Approximating Minimum-Power Degree and Connectivity Problems
Dynamic Packet Routing on Arrays with Bounded Buffers
Procedural Semantics for Fuzzy Disjunctive Programs on Residuated Lattices
Multiply Balanced k -Partitioning
Leafy Spanning Arborescences in DAGs
On the Approximability of some Maximum Spanning Tree Problems
Uniform Service Systems with k Servers
Quintic Reciprocity and Primality Test for Numbers of the Form M = A5 n ±omega n
Space Filling Curves and Their Use in the Design of Geometric Data Structures
Lipschitz Unimodal and Isotonic Regression on Paths and Trees
Join Irreducible Pseudovarieties, Group Mapping, and Kovács-Newman Semigroups
Faster Algorithms to Enumerate Hypergraph Transversals
On Injective Colourings of Chordal Graphs
On the Clique Operator
Bundled Crossings in Embedded Graphs
Kernelization for Maximum Happy Vertices Problem
Upper Bounds on the Spanning Ratio of Constrained Theta-Graphs
Algorithms to Locate Errors Using Covering Arrays
Combining All Pairs Shortest Paths and All Pairs Bottleneck Paths Problems
LATIN 2006: Theoretical Informatics, 7th Latin American Symposium, Valdivia, Chile, March 20-24, 2006, Proceedings
Scoring Matrices That Induce Metrics on Sequences
Odd Graphs Are Prism-Hamiltonian and Have a Long Cycle
Ordered Strip Packing
Vertex Disjoint Paths on Clique-Width Bounded Graphs
Massive Quasi-Clique Detection
An Improved Algorithm Finding Nearest Neighbor Using Kd-trees
Average Parameterization and Partial Kernelization for Computing Medians
Reactive Proximity Data Structures for Graphs
Probabilistic Analysis of the Dual Next-Fit Algorithm for Bin Covering
Hardness Amplification Via Space-Efficient Direct Products
Arithmetic + Logic + Geometry = Concurrency
Linear Time Algorithms for Liveness and Boundedness in Conflict-free Petri Nets
When is Red-Blue Nonblocker Fixed-Parameter Tractable?
Compact Self-Stabilizing Leader Election for General Networks
Algorithms and Bounds for Very Strong Rainbow Coloring
The Efficiency of MapReduce in Parallel External Memory
Suffix Trees, DAWGs and CDAWGs for Forward and Backward Tries
Nearest Neighbour Graph Realizability is NP-hard
LATIN 2008: Theoretical Informatics, 8th Latin American Symposium, Búzios, Brazil, April 7-11, 2008, Proceedings
On the Zero-Sum Ramsey Problem over $\mathbb {Z}_2^d$
Lower Bounds for Max-Cut via Semidefinite Programming
Binary Decision Diagrams: From Tree Compaction to Sampling
Random Bichromatic Matchings
Collective Tree Exploration
Hiring above the m-th Best Candidate: A Generalization of Records in Permutations
Rooted Maximum Agreement Supertrees
On Dissemination Thresholds in Regular and Irregular Graph Classes
Star Height of Reversible Languages and Universal Automata
Reconfigurations in Graphs and Grids
Minimum Cost Homomorphisms to Reflexive Digraphs
Scheduling on Hybrid Platforms: Improved Approximability Window
Randomized Rendez-Vous with Limited Memory
Complexity Issues in Neural Network Computations
On the Computation of the Hilbert Series
Holographic Trees
Packing Arrays
Non-Erasing Turing Machines: A New Frontier Between a Decidable Halting Problem and Universality
Relatively Bridge-Addable Classes of Graphs
The Relationship between Inner Product and Counting Cycles
Computational Complexity of the Hamiltonian Cycle Problem in Dense Hypergraphs
Faithful Representations of Graphs by Islands in the Extended Grid
Computing Maximal Layers of Points in E f(n)
Periodic Planar Straight-Frame Drawings with Polynomial Resolution
Compact Rich-Functional Binary Relation Representations
Homotopic Rectilinear Routing with Few Links and Thick Edges
Equivalence Classes of Random Boolean Trees and Application to the Catalan Satisfiability Problem
Domination in Geometric Intersection Graphs
Core Stability in Altruistic Coalition Formation Games
Signals for Cellular Automata in Dimension 2 or Higher
The Computational Complexity of the Parallel Knock-Out Problem
Counting Proportions of Sets: Expressive Power with Almost Order
Rectilinear Approximation of a Set of Points in the Plane
Transversals of Longest Cycles in Chordal and Bounded Tree-Width Graphs
From Discrepancy to Majority
Algorithmic Aspects of Regularity
On the Complexity of Finding Internally Vertex-Disjoint Long Directed Paths
Induced Tree Covering and the Generalized Yutsis Property
Spelling Approximate Repeated or Common Motifs Using a Suffix Tree
Energy Efficient Monitoring in Sensor Networks
An Improved Upper Bound on the Density of Universal Random Graphs
Approximate Correlation Clustering Using Same-Cluster Queries
On the Approximation Ratio of Lempel-Ziv Parsing
The Least-Unpopularity-Factor and Least-Unpopularity-Margin Criteria for Matching Problems with One-Sided Preferences
On-line Algorithms for Edge-Disjoint Paths in Trees of Rings
Computing a Geodesic Two-Center of Points in a Simple Polygon
Tilings Robust to Errors
Satisfying Neighbor Preferences on a Circle
Conelikes and Ranker Comparisons
A Faster Algorithm for Finding Maximum Independent Sets in Sparse Graphs
Renaming Is Weaker Than Set Agreement But for Perfect Renaming: A Map of Sub-consensus Tasks
Random 2-XORSAT at the Satisfiability Threshold
A Method to Prove the Nonrationality of Some Combinatorial Generating Functions
Unshuffling Permutations
Approximating Steiner Networks with Node Weights
On Reversible Automata
The Committee Decision Problem
Constructive Ramsey Numbers for Loose Hyperpaths
The Language Theory of Bounded Context-Switching
Querying Priced Information in Databases: The Conjunctive Case