yusuke1997/dblp-id-title huggingface dataset:
Composition Orderings for Linear Functions and Matrix Multiplication Orderings
Improved Algorithms for Finding Consistent Superstrings Based on a New Graph Model
On Random Hard Sets for NP
Computing Weighted Rectilinear Median and Center Set in the Presence of Obstacles
On-the-Fly Array Initialization in Less Space
Exploiting Sparsity for Bipartite Hamiltonicity
Routing from Pentagon to Octagon Delaunay Graphs
The Complexity of Solving Stochastic Games on Graphs
Treemaps with Bounded Aspect Ratio
On Efficient Fixed Parameter Algorithms for WEIGHTED VERTEX COVER
Constrained Boundary Labeling
Minimum Degree Up to Local Complementation: Bounds, Parameterized Complexity, and Exact Algorithms
Deterministic Local Problems in Radio Networks: On the Impact of Local Domination and a Bit of Advice
A Better Approximation for the Two-Stage Assembly Scheduling Problem with Two Machines at the First Stage
Computational Philosophy: On Fairness in Automated Decision Making
Simple, Strict, Proper, and Directed: Comparing Reachability in Directed and Undirected Temporal Graphs
Simple Envy-Free and Truthful Mechanisms for Cake Cutting with a Small Number of Cuts
Finding Shortest Non-Crossing Rectilinear Paths in Plane Regions
Plane Sweep Algorithms for the Polygonal Approximation Problems with Applications
Structural Parameters for Steiner Orientation
Computing Optimal Solutions for the min 3-set covering Problem
On-Line Multicasting in All-Optical Networks
Maximum Overlap of Convex Polytopes under Translation
Bounded Length UCFG Equivalence
Chew's Theorem Revisited -Uniquely Normalizing Property of Nonlinear Term Rewriting Systems-
Techniques for Indexing and Querying Temporal Observations for a Collection of Objects
The k-Server Problem with Delays on the Uniform Metric Space
Multi-unit Auctions with Budgets and Non-uniform Valuations
Meaningful Information
Generalized H -Coloring of Graphs
Improved Approximation Algorithm for Capacitated Facility Location with Uniform Facility Cost
Enumerating the Irreducible Closed Sets of an Acyclic Implicational Base of Bounded Degree
A Probabilistic Analysis of Kademlia Networks
The First Subquadratic Algorithm for Complete Linkage Clustering
On the Approximability of Multiprocessor Task Scheduling Problems
General Splay: A Basic Theory and Calculus
New Bounds on Map Labeling with Circular Labels
A Randomized Linear Work EREW PRAM Algorithm to Find a Minimum Spanning Forest
Hypergraph Decomposition and Secret Sharing
Finding Contractions and Induced Minors in Chordal Graphs via Disjoint Paths
On Multi-threaded Paging
Constant Unary Constraints and Symmetric Real-Weighted Counting CSPs
Configurations with Few Crossings in Topological Graphs
The Identity Correspondence Problem and Its Applications
Approximation and Exact Algorithms for RNA Secondary Structure Prediction and Recognition of Stochastic Context-Free Languages
Editing Graphs into Disjoint Unions of Dense Clusters
Faster Parameterized Algorithms for Minimum Fill-In
A Near-Optimal Algorithm for Finding an Optimal Shortcut of a Tree
Provable Efficiency of Contraction Hierarchies with Randomized Preprocessing
Adaptive Regularized Submodular Maximization
Compressed Text Databases with Efficient Query Algorithms Based on the Compressed Suffix Array
A Combinatorial Toolbox for Protein Sequence Design and Landscape Analysis in the Grand Canonical Model
Expected Acceptance Counts for Finite Automata with Almost Uniform Input
On Protein Structure Alignment under Distance Constraint
Maximum-Weight Matching in Sliding Windows and Beyond
Algorithms for Pattern Involvement in Permutations
Weighted and Unweighted Selection Algorithms for k Sorted Sequences
Quantum Advantage with Shallow Circuits Under Arbitrary Corruption
Distributions of Points and Large Quadrangles
Solving NP-hard Combinatorial Problems in the Practical Sense (Abstract)
On the Parameterized Complexity of Consensus Clustering
Selection Networks with 8 n log 2 n Size and O (log n ) Depth
Flexible List Colorings in Graphs with Special Degeneracy Conditions
Succinct Index for Dynamic Dictionary Matching
Dynamic Range Majority Data Structures
BUSHWHACK: An Approximation Algorithm for Minimal Paths through Pseudo-Euclidean Spaces
Unique-Neighbor-Like Expansion and Group-Independent Cosystolic Expansion
Exact Algorithms for Clustered Planarity with Linear Saturators
Navigating Weighted Regions with Scattered Skinny Tetrahedra
Quantum-Inspired Algorithms for Solving Low-Rank Linear Equation Systems with Logarithmic Dependence on the Dimension
Algorithms for Max Hamming Exact Satisfiability
Fast Algorithms for Transversal Matroid Intersection Problems
Program Size and Temperature in Self-Assembly
Approximating the Volume of Unions and Intersections of High-Dimensional Geometric Objects
A Faster One-Dimensional Topological Compaction Algorithm
Puzzles, Art, and Magic with Algorithms
Signal Passing Self-Assembly Simulates Tile Automata
Reasoning with Ordered Binary Decision Diagrams
Linear Kernels and Linear-Time Algorithms for Finding Large Cuts
The Use of a Pruned Modular Decomposition for Maximum Matching Algorithms on Some Graph Classes
35th International Symposium on Algorithms and Computation, ISAAC 2024, Sydney, Australia, December 8-11, 2024
On the Number of p4-Tilings by an n-Omino
Voronoi Diagrams for Parallel Halflines and Line Segments in Space
The Maximum Agreement of Two Nested Phylogenetic Networks
Half-Duplex Communication Complexity
Algorithmic Aspects of the Intersection and Overlap Numbers of a Graph
Flows in One-Crossing-Minor-Free Graphs
The Tragedy of Being Almost but Not Quite Planar (Invited Talk)
Internal Dictionary Matching
Decision Making Based on Approximate and Smoothed Pareto Curves
A Cut Tree Representation for Pendant Pairs
Two-Face Horn Extensions
Space-Efficient and Fast Algorithms for Multidimensional Dominance Reporting and Counting
Dynamic Tree Cross Products
Minimum Weight Triangulation by Cutting Out Triangles
Reconstructing Numbers from Pairwise Function Values
Revisit the Scheduling Problem with Calibrations
Polynomial Threshold Functions for Decision Lists
Voronoi-Based Systems of Coordinates and Surface Reconstruction
Parameterized Approximation Algorithms for TSP
Colouring (P_r+P_s)-Free Graphs
An FPTAS of Minimizing Total Weighted Completion Time on Single Machine with Position Constraint
33rd International Symposium on Algorithms and Computation, ISAAC 2022, Seoul, South Korea, December 19-21, 2022
The I/O - Complexity of Ordered Binary - Decision Diagram Manipulation
A Linear Time Algorithm For Finding Maximal Planar Subgraphs
Nested Active-Time Scheduling
Network Optimization on Partitioned Pairs of Points
Folding a Better Checkerboard
Shortest Beer Path Queries in Outerplanar Graphs
Anonymity-Preserving Space Partitions
32nd International Symposium on Algorithms and Computation, ISAAC 2021, Fukuoka, Japan, December 6-8, 2021
On the Complexity of Rainbow Vertex Colouring Diametral Path Graphs
Detecting Induced Minors in AT-Free Graphs
Topology-Oriented Approach to Robust Geometric Computation
Regular Labelings and Geometric Structures
Testing Properties of Distributions in the Streaming Model
Improved Algorithms for Clustering with Outliers
More Efficient Parallel Flow Algorithms
New Bounds for the Nearly Equitable Edge Coloring Problem
Reachability in High Treewidth Graphs
Probabilistic Analysis of Euclidean Capacitated Vehicle Routing
Independent Feedback Vertex Set for P_5-free Graphs
When Can Cluster Deletion with Bounded Weights Be Solved Efficiently?
Counting Spanning Trees and Other Structures in Non-constant-jump Circulant Graphs
Dynamic Distance Hereditary Graphs Using Split Decomposition
Fast k-Means Algorithms with Constant Approximation
Searching Informed Game Trees
Anonymous Fuzzy Identity-Based Encryption for Similarity Search
Infinitely-Often Autoreducible Sets
Hard Instance Generation for SAT (Extended Abstract)
An Approximation Algorithm for Two-Edge-Connected Subgraph Problem via Triangle-Free Two-Edge-Cover
FPT Approximation Using Treewidth: Capacitated Vertex Cover, Target Set Selection and Vector Dominating Set
Smoothed Analysis of Binary Search Trees
Locating an Obnoxious Line among Planar Objects
Algorithms on Graphs with Small Dominating Targets
A Structural Lemma in 2-Dimensional Packing, and Its Implications on Approximability
Finding Diverse Minimum s-t Cuts
Space-Efficient Data Structures for Flexible Text Retrieval Systems
Covering a Graph with a Constrained Forest (Extended Abstract)
Randomized Shared Queues Applied to Distributed Optimization Algorithms
Shared vs Private Randomness in Distributed Interactive Proofs
A Fast Algorithm for Computing Optimal Rectilinear Steiner Trees for Extremal Point Sets
DNA Self-Assembly For Constructing 3D Boxes
Neighborhood Inclusions for Minimal Dominating Sets Enumeration: Linear and Polynomial Delay Algorithms in P 7 -Free and P 8 -Free Chordal Graphs
Finding d-Cuts in Claw-Free Graphs
Simple 2^f-Color Choice Dictionaries
Squaring the Circle with Weak Mobile Robots
Distance Oracles for Interval Graphs via Breadth-First Rank/Select in Succinct Trees
A Polynomial Kernel for Deletion to the Scattered Class of Cliques and Trees
The Two-Guard Problem Revisited and Its Generalization
Simultaneous Interval Graphs
A Simple Efficient Interior Point Method for Min-Cost Flow
Augmenting Graphs to Minimize the Diameter
Spanning Trees with Many Leaves in Regular Bipartite Graphs
Problem Kernels for NP-Complete Edge Deletion Problems: Split and Related Graphs
Better Bounds for Online k-Frame Throughput Maximization in Network Switches
Local Search in Evolutionary Algorithms: The Impact of the Local Search Frequency
A Proof of the Molecular Conjecture
Fault-Tolerant Broadcasting in Binary Jumping Networks
Drawing Plane Graphs
k-Pairwise Cluster Fault Tolerant Routing in Hypercubes
A Dimension-Reducing Fréchet Simplification Oracle
The Parallel Complexity of Approximating the High Degree Subgraph Problem
On the Minimum Cost Range Assignment Problem
Computing All Small Cuts in Undirected Networks
Budgeted Out-Tree Maximization with Submodular Prizes
Self-Improving Voronoi Construction for a Hidden Mixture of Product Distributions
Minimizing the Maximum Flow Time in the Online Food Delivery Problem
Finding a Length-Constrained Maximum-Density Path in a Tree
Lower Bounds for On-line Graph Colorings
The ABCs of AVDs: Geometric Retrieval Made Simple
Constrained Two-Line Center Problems
Dual-Mode Greedy Algorithms Can Save Energy
The Complexity of Probabilistic versus Deterministic Finite Automata
How to Guard a Graph?
Coloring Triangle-Free Graphs on Surfaces
Graph Searching on Chordal Graphs
Single Vehicle Scheduling Problems on Path/Tree/Cycle Networks with Release and Handling Times
Unbalanced and Hierarchical Bipartite Matchings with Applications to Labeled Tree Comparison
On the Power of Reading and Writing Simultaneously in Parallel Computation
Polynomial Equations-Solving and its Applications
Proving the Turing Universality of Oritatami Co-Transcriptional Folding
Approximation Algorithms for Cumulative Vehicle Routing with Stochastic Demands
Cake Cutting: An Envy-Free and Truthful Mechanism with a Small Number of Cuts
Competitive Searching in Polygons - Beyond Generalised Streets
Algorithms for Local Forest Similarity
Super-Cubic Lower Bound for Generalized Karchmer-Wigderson Games
The Number of Different Unfoldings of Polyhedra
k-Best Cuts for Circular-Arc Graphs
A Promising Key Agreement Protocol
An O(1) Time Algorithm for Generating Multiset Permutations
Impatient PPSZ - A Faster Algorithm for CSP
Efficient Algorithms for Optimizing Whole Genome Alignment with Noise
Bounds on Double-Sided Myopic Algorithms for Unconstrained Non-monotoneSubmodular Maximization
Computing Homomorphisms in Hereditary Graph Classes: The Peculiar Case of the 5-Wheel and Graphs with No Long Claws
New Algorithmic Directions in Optimal Transport and Applications for Product Spaces
Online Sorted Range Reporting
Succinct Data Structures for Baxter Permutation and Related Families
Folding Equilateral Plane Graphs
Integer Complexity and Mixed Binary-Ternary Representation
Unit Cost Buyback Problem
A Relaxed FPTAS for Chance-Constrained Knapsack
Lower Bounds for Myopic DPLL Algorithms with a Cut Heuristic
Optimal Matroid Partitioning Problems
Efficient Sequential and Parallel Algorithms for the Negative Cycle Problem
Slaying Hydrae: Improved Bounds for Generalized k-Server in Uniform Metrics
Simple Algorithms for a Weighted Interval Selection Problem
Unbounded-Error Classical and Quantum Communication Complexity
A Faster Algorithm for the Maximum Even Factor Problem
Optimal Nonpreemptive Scheduling in a Smart Grid Model
Closing Complexity Gaps for Coloring Problems on H-Free Graphs
Rectilinear Covering for Imprecise Input Points - (Extended Abstract)
Shifting Strategy for Geometric Graphs without Geometry
Local Routing on Ordered Θ-Graphs
New Algorithms for Edge Induced König-Egerváry Subgraph Based on Gallai-Edmonds Decomposition
Optimal Beam Penetrations in Two and Three Dimensions
Exponential Lower Bounds on the Size of OBDDs Representing Integer Divistion
Connectivity Graphs of Uncertainty Regions
Gathering and Election by Mobile Robots in a Continuous Cycle
Optimization, Randomized Approximability, and Boolean Constraint Satisfaction Problems
Approximating Minimum Bending Energy Path in a Simple Corridor
Convertibility among Grid Filling Curves
Parallel and On-line Graph Coloring Algorithms
An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner
Approximate Regular Expression Searching with Arbitrary Integer Weights
Detecting and Characterizing Small Dense Bipartite-Like Subgraphs by the Bipartiteness Ratio Measure
Voronoi Diagram of a Circle Set Constructed from Voronoi Diagram of a Point Set
Separating Populations with Wide Data: A Spectral Analysis
Fair Cost Allocations under Conflicts - A Game-Theoretic Point of View
Popularity at Minimum Cost
Hardness and Algorithms for Variants of Line Graphs of Directed Graphs
Online Scheduling of Car-Sharing Requests Between Two Locations with Many Cars and Flexible Advance Bookings
Partitioning H-Free Graphs of Bounded Diameter
Multimodal Transportation with Ridesharing of Personal Vehicles
Broadcasting with Universal Lists Revisited: Using Competitive Analysis
Polyhedral Structure of Submodular and Posi-modular Systems
Multicriteria Global Minimum Cuts
Filling Crosswords Is Very Hard
Lower Bounds on the Deterministic and Quantum Communication Complexities of Hamming-Distance Problems
On-Line Algorithms for Cardinality Constrained Bin Packing Problems
Stabbing Rectangles by Line Segments - How Decomposition Reduces the Shallow-Cell Complexity
Multiple Spin-Block Decisions
OBDDs of a Monotone Function and of Its Prime Implicants
Succinct and I/O Efficient Data Structures for Traversal in Trees
Competitive Analysis of On-Line Disk Scheduling
Adaptivity vs. Postselection, and Hardness Amplification for Polynomial Approximation
Extended MSO Model Checking via Small Vertex Integrity
A Dynamic Stabbing-Max Data Structure with Sub-Logarithmic Query Time
Efficient Approximation Algorithms for Multi-label Map Labeling
New Bounds on the Average Distance from the Fermat-Weber Center of a Planar Convex Body
Dynamic Point Labeling is Strongly PSPACE-Complete
Edge-Pancyclicity of Twisted Cubes
Counting in the Presence of Memory Faults
Reachability Problems on Directed Graphs
The Weighted k-Center Problem in Trees for Fixed k
Fully Retroactive Approximate Range and Nearest Neighbor Searching
A Generalization of Magic Squares with Applications to Digital Halftoning
Group Fairness: From Multiwinner Voting to Participatory Budgeting (Invited Talk)
List Locally Surjective Homomorphisms in Hereditary Graph Classes
The Totally-Perfect Bipartite Graph and Its Construction
Electric Routing and Concurrent Flow Cutting
Geodesic-Preserving Polygon Simplification
Quantum Merlin-Arthur Proof Systems: Are Multiple Merlins More Helpful to Arthur?
Achieving the Shortest Clock Period by Inserting the Minimum Amount of Delay
Temporal Hierarchical Clustering
On the Complexity of Global Constraint Satisfaction
A 1.5-Approximation of the Minimal Manhattan Network Problem
On the Existence and Determination of Satisfactory Partitions in a Graph
Linear-Time Algorithms for Computing Twinless Strong Articulation Points and Related Problems
An Optimal Algorithm for Computing Angle-Constrained Spanners
The Parameterized Complexity of the Unique Coverage Problem
A Simple and Quick Approximation Algorithm for Traveling Salesman Problem in the Plane
Practical Approach to a Facility Location Problem for Large-Scale Logistics
Approximate Euclidean Shortest Paths in Polygonal Domains
On Horn Envelopes and Hypergraph Transversals
On the Complexity of Free Monoid Morphisms
Runtime Analysis of a Simple Ant Colony Optimization Algorithm
Unbounded Discrepancy of Deterministic Random Walks on Grids
Preference-Based Trajectory Clustering - An Application of Geometric Hitting Sets
On HTLC-Based Protocols for Multi-Party Cross-Chain Swaps
Algorithmic Analysis of Multithreaded Algorithms (Abstract)
Efficient Indexes for the Positional Pattern Matching Problem and Two Related Problems over Small Alphabets
Searching for a Monotone Function by Independent Threshold Queries
External-Memory Multimaps
Wiring Knock-Knee Layouts: A Global Appoach
Measure and Conquer for Max Hamming Distance XSAT
On the Expressive Power of Planar Perfect Matching and Permanents of Bounded Treewidth Matrices
Testing Mutual Duality of Planar Graphs
Satisfiability Algorithm for Syntactic Read-$k$-times Branching Programs
Correlation Clustering and Consensus Clustering
The Capacitated Traveling Salesman Problem with Pickups and Deliveries on a Tree
On the Kernel and Related Problems in Interval Digraphs
Bounded Tree-Width and CSP-Related Problems
A Tight Lower Bound for Online Service with Deadlines and Lazy Server
The (1|1)-Centroid Problem on the Plane Concerning Distance Constraints
The Maximum Latency and Identification of Positive Boolean Functions
Making Arbitrary Graphs Transitively Orientable: Minimal Comparability Completions
Many-to-one Matchings with Lower Quotas: Algorithms and Complexity
Approximate Shortest Homotopic Paths in Weighted Regions
Update Query Time Trade-Off for Dynamic Suffix Arrays
k -cyclic Orientations of Graphs
Computing the Map of Geometric Minimal Cuts
Bounds on Contention Management Algorithms
Euclidean TSP with Few Inner Points in Linear Space
Many-to-many Disjoint Path Covers in a Graph with Faulty Elements
Hotlink Enhancement Algorithms for Web Directories: (Extended Abstract)
Hybrid VCSPs with Crisp and Valued Conservative Templates
Bottleneck Partial-Matching Voronoi Diagrams and Applications
A Game Theoretic Approach for Efficient Graph Coloring
Extending Partial Representations of Subclasses of Chordal Graphs
Randomized K-Dimensional Binary Search Trees
An Efficient Algorithm for Enumerating Pseudo Cliques
On Lower Bounds for Constant Width Arithmetic Circuits
On Compact and Efficient Routing in Certain Graph Classes
A Novel Adaptive Learning Algorithm for Stock Market Prediction
Sorting by Prefix Block-Interchanges
Optimal Sensitivity Oracle for Steiner Mincut
All-Cavity Maximum Matchings
Hardness of Approximation for H-Free Edge Modification Problems: Towards a Dichotomy
The Power and Limitations of Static Binary Search Trees with Lazy Finger
Faster Combinatorial Algorithms for Determinant and Pfaffian
Substring Complexity in Sublinear Space
Deciding Bisimulation and Trace Equivalences for Systems with Many Identical Processes
Locating Facilities on a Network to Minimize Their Average Service Radius
Covering Points by Unit Disks of Fixed Location
Compact Representation of Posets
Hardness of Approximating Graph Transformation Problem
A New Approximation Algorithm for Multidimensional Rectangle Tiling
Linear matching-time algorithm for the directed graph isomorphism problem
Towards Plane Spanners of Degree 3
Nonuniform Lowness and Strong Nonuniform Lowness
Abstract Voronoi Diagrams with Disconnected Regions
Equilibria for Networks with Malicious Users
Enumeration of Perfect Sequences of Chordal Graph
Approximation of Minimum Triangulation for Polyhedron with Bounded Degrees
Induced Packing of Odd Cycles in a Planar Graph
Distributed Complexity of P_k-Freeness: Decision and Certification
PTAS for k -Tour Cover Problem on the Plane for Moderately Large Values of k
An Improvement of the Digital Cash Protocol of Okamoto and Ohta
Page Migration Algorithms Using Work Functions
Complexity of Coloring Reconfiguration under Recolorability Constraints
A Compact DAG for Storing and Searching Maximal Common Subsequences
Random Access in Persistent Strings
On One-Round Discrete Voronoi Games
On Removing the Pushdown Stack in Reachability Constructions
A Complete Characterization of Tolerable Adversary Structures for Secure Point-to-Point Transmissions Without Feedback
Obtaining a Triangular Matrix by Independent Row-Column Permutations
Minmax Regret 1-Facility Location on Uncertain Path Networks
Anonymous Self-Stabilising Localisation via Spatial Population Protocols
Rapid Mixing for the Hardcore Glauber Dynamics and Other Markov Chains in Bounded-Treewidth Graphs
Approximating MIN k-SAT
Sparsification Lower Bounds for List H-Coloring
An O(n log n)-Time Algorithm for the Maximum Constrained Agreement Subtree Problem for Binary Trees
Encoding 2D Range Maximum Queries
Checking Value-Sensitive Data Structures in Sublinear Space
Non-Delaunay-Based Curve Reconstruction
On the Complexity of Composite Numbers
Methods in Parallel Algorithmics and Who May Need to Know Them?
Algorithms for Computing the Length-Constrained Max-Score Segments with Applications to DNA Copy Number Data Analysis
A Method to Overcome Computer Word Size Limitation in Bit-Parallel Pattern Matching
Streaming Algorithms for Planar Convex Hulls
Finding a Two-Core of a Tree in Linear Time
An Optimal Parallel Algorithm for c-Vertex-Ranking of Trees
On the Number of Upward Planar Orientations of Maximal Planar Graphs
The Complexity of Sharing a Pizza
From Tree-Width to Clique-Width: Excluding a Unit Interval Graph
Principal Lattice of Partition of submodular functions on Graphs: Fast algorithms for Principal Partition and Generic Rigidity
Deterministic Random Walks on the Two-Dimensional Grid
I/O-Efficient Contour Tree Simplification
Envy-free Matchings with Lower Quotas
Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for NP-Hard Problems
Discovering Unbounded Unions of Regular Pattern Languages from Positive Examples (Extended Abstract)
Facility Location on Terrains
On Game-Theoretic Models of Networks
Constant Ratio Approximations of the Weighted Feedback Vertex Set Problem for Undirected Graphs
Hardness and Approximation of Octilinear Steiner Trees
Sorting In-Place with a Worst Case Complexity of n log n -1.3 n + O (log n ) Comparisons and epsilon n log n + O (1) Transports
Canonical Data Structure for Interval Probe Graphs
Minimum Convex Partition of a Polygon with Holes by Cuts in Given Directions
A Generalized Gale-Shapley Algorithm for a Discrete-Concave Stable-Marriage Model
The Complexity of Some Basic Problems for Dynamic Process Graphs
Run Generation Revisited: What Goes Up May or May Not Come Down
Faster Fixed Parameter Tractable Algorithms for Undirected Feedback Vertex Set
Computing Approximate Statistical Discrepancy
Testing Simultaneous Planarity When the Common Graph Is 2-Connected
Range Non-overlapping Indexing
An Index Structure for Spaced Seed Search
Distance Labeling in Hyperbolic Graphs
Route-Enabling Graph Orientation Problems
On the Stability of Web Crawling and Web Search
Exact Algorithms for Finding the Minimum Independent Dominating Set in Graphs
Increasing Speed Scheduling and Flow Scheduling
Effectiveness of Structural Restrictions for Hybrid CSPs
Two-Layer Planarization in Graph Drawing
Linear Time Algorithms for Disjoint Two-Face Paths Problems in Planar Graphs
A Better Lower Bound for Two-Circle Point Labeling
On the Spanning and Routing Ratios of the Yao-Four Graph
An Optimal Algorithm for Reconstructing Point Set Order Types from Radial Orderings
The st-Planar Edge Completion Problem Is Fixed-Parameter Tractable
Signature Theory in Holographic Algorithms