yusuke1997/dblp-id-title huggingface dataset:
Balanced Scheduling toward Loss-Free Packet Queuing and Delay Fairness
Equipartitions of Measures by 2-Fans
Hardness Amplification for Dynamic Binary Search Trees
Multicommodity Flows in Planar Graphs with Demands on Faces
Finding Matching Cuts in H-Free Graphs
Ordered Binary Decision Diagrams as Knowledge-Bases
Beyond Homothetic Polygons: Recognition and Maximum Clique
On the Hardness of Set Disjointness and Set Intersection with Bounded Universe
Matching Nuts and Bolts Faster
Fast Algorithms for Computing beta-Skeletons and Their Relatives
On Girth and the Parameterized Complexity of Token Sliding and Token Jumping
Structural and Complexity Aspects of Line Systems of Graphs
On the Neighbourhood Helly of Some Graph Classes and Applications to the Enumeration of Minimal Dominating Sets
Counting Distinct Items over Update Streams
Scheduling Algorithms for Strict Multithreaded Computations
A Simple, Memory-Efficient Bounded Concurrent Timestamping Algorithm
Effective Elections for Anonymous Mobile Agents
On-Line Versus Off-Line in Money-Making Strategies with BROKERAGE
Improved Randomized Algorithms for 3-SAT
Randomized On-line Algorithms for the Page Replication Problem
Strategy-Proof Approximation Algorithms for the Stable Marriage Problem with Ties and Incomplete Lists
The Generalized Microscopic Image Reconstruction Problem
Polynomial Time 2-Approximation Algorithms for the Minmax Subtree Cover Problem
Segmenting Doughnut-Shaped Objects in Medical Images
On Graphs Coverable by k Shortest Paths
A Near Optimal Algorithm for Vertex Connectivity Augmentation
The Min-Max Voronoi Diagram of Polygons and Applications in VLSI Manufacturing
Approximation Algorithms Inspired by Kernelization Methods
On the Complexity of Matching Cut in Graphs of Fixed Diameter
Shortest Beer Path Queries in Interval Graphs
Approximating the Average Stretch Factor of Geometric Graphs
Entropy Matters: Understanding Performance of Sparse Random Embeddings
Field Splitting Problems in Intensity-Modulated Radiation Therapy
Universal Point Subsets for Planar Graphs
A Modified Greedy Algorithm for the Set Cover Problem with Weights 1 and 2
On the Monotone Circuit Complexity of Quadratic Boolean Functions
Algorithmic Graph Minor Theory: Improved Grid Minor Bounds and Wagner's Contraction
Preemptive Parallel Task Scheduling in O(n)+Poly(m) Time
A Faster Lattice Reduction Method Using Quantum Search
Dynamic and Multi-Functional Labeling Schemes
A Characterization of Planar Graphs by Pseudo-Line Arrangements
Data Structures for Approximate Orthogonal Range Counting
Rstricted Track Assignment with Applications
On Structural Parameterizations of the Edge Disjoint Paths Problem
Improved Approximation for Fréchet Distance on c-packed Curves Matching Conditional Lower Bounds
Average Cost to Produce Partial Orders
Online Scheduling of Parallel Communications with Individual Deadlines
An Adaptive Version of Brandes' Algorithm for Betweenness Centrality
Random Access to Advice Strings and Collapsing Results
Efficient Enumeration of Induced Subtrees in a K-Degenerate Graph
A Polynomial Kernel for Feedback Arc Set on Bipartite Tournaments
Minimum-Cost b -Edge Dominating Sets on Trees
On the Cop Number of String Graphs
Modeling and Analyzing Massive Terrain Data Sets
Revisiting Circular Arc Graphs
Sublinear-Time Algorithms for Monomer-Dimer Systems on Bounded Degree Graphs
Treewidth of Circle Graphs
Min-Power Covering Problems
An Algorithm for the Maximum Weight Strongly Stable Matching Problem
Approximate Clustering via Metric Partitioning
LexBFS-Ordering in Asteroidal Triple-Free Graphs
On Helping and Interactive Proof Systems
Data Structures for Approximate Fréchet Distance for Realistic Curves
Probability and Recursion
A Reordering Operation for an Ordered Binary Decision Diagram and an Extended Framework for Combinatorics of Graphs
Efficient Algorithms for Weighted Colorings of Series-Parallel Graphs
Interval Query Problem on Cube-Free Median Graphs
Approximating the Fréchet Distance When Only One Curve Is c-Packed
Basic Computations in Wireless Networks
The Dispersive Art Gallery Problem
Distortion-Oblivious Algorithms for Scheduling on Multiple Machines
Finding Two Disjoint Paths in a Network with Normalized alpha + -MIN-SUM Objective Function
Efficient Algorithms for k-Terminal Cuts on Planar Graphs
Lower Bound for Non-Adaptive Estimation of the Number of Defective Items
Square-Contact Representations of Partial 2-Trees and Triconnected Simply-Nested Graphs
Separability and One-Way Functions
The Onion Diagram: A Voronoi-Like Tessellation of a Planar Line Space and Its Applications - (Extended Abstract)
Structural Similarity in Graphs (A Relaxation Approach for Role Assignment)
The Train Delivery Problem Revisited
On the Locality Properties of Space-Filling Curves
Parameterized Query Complexity of Hitting Set Using Stability of Sunflowers
Space-Efficient Depth-First Search via Augmented Succinct Graph Encodings
Complexity of Unordered CNF Games
Parameterizing Cut Sets in a Graph by the Number of Their Components
The k-Fréchet Distance: How to Walk Your Dog While Teleporting
Covering Weighted Points Using Unit Squares
Front Matter, Table of Contents, Preface, Symposium Organization
Tracking Paths in Planar Graphs
The Multi-variable Modular Polynomial and Its Applications to Cryptography
Approximation Algorithms for Min-Max Path Cover Problems with Service Handling Time
Rank-Maximal Matchings - Structure and Algorithms
Super-Exponential Size Advantage of Quantum Finite Automata with Mixed States
On Approximating the Maximum Simple Sharing Problem
Complexity of Stability
On the Camera Placement Problem
An Approximation Algorithm for Scheduling Malleable Tasks Under General Precedence Constraints
Faster Algorithms for Computing the R* Consensus Tree
On the Parameterized Intractability of Determinant Maximization
On the Fine-Grained Query Complexity of Symmetric Functions
The Student-Project Allocation Problem
Parameterized Algorithms for Inclusion of Linear Matchings
Online Linear Optimization over Permutations
Interactive Proofs for Quantum Computation
Improved Bounds for Online Dominating Sets of Trees
The Complexity of Minimum Convex Coloring
Optimal Group Gossiping in Hypercubes Under Wormhole Routing Model
Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement
On Bounded Load Routings for Modeling k -Regular Connection Topologies
Algorithms to Measure Diversity and Clustering in Social Networks through Dot Product Graphs
Search on a Line by Byzantine Robots
Coloring Reconfiguration Under Color Swapping
Data Structures for Range Median Queries
On Reverse Shortest Paths in Geometric Proximity Graphs
On the Complexity of the G -Reconstruction Problem
Interval Finding and Its Application to Data Mining
Deletion without Rebalancing in Multiway Search Trees
Weakly Submodular Function Maximization Using Local Submodularity Ratio
The ( p , q )-total Labeling Problem for Trees
Cryptographic Hardness Under Projections for Time-Bounded Kolmogorov Complexity
Structural Parameterizations of b-Coloring
Complexity of Comparing Hidden Markov Models
Hard Communication Channels for Steganography
ISB-Tree: A New Indexing Scheme with Efficient Expected Behaviour
How Many Potatoes Are in a Mesh?
A Characterization of Individualization-Refinement Trees
Constructing the Simplest Possible Phylogenetic Network from Triplets
A Simple Message Passing Algorithm for Graph Partitioning Problems
Computing the Gromov-Hausdorff Distance for Metric Trees
Verifying the Determinant in Parallel
Robust Asynchronous Algorithms in Networks with a Fault Detection Ring
Orienting Dynamic Graphs, with Applications to Maximal Matchings and Adjacency Queries
Permutation Routing on Reconfigurable Meshes
Chain Reconfiguration. The INs and Outs, Ups and Downs of Moving Polygons and Polygonal Linkages
Efficient Algorithms for the Optimal-Ratio Region Detection Problems in Discrete Geometry with Applications
Bandwidth of Bipartite Permutation Graphs
Efficient Algorithms for the Weighted 2-Center Problem in a Cactus Graph
Simple Approximation Algorithms for MAXNAESP and Hypergraph 2-colorability
An Improved Approximation Algorithm for the Matching Augmentation Problem
On Power-Law Distributed Balls in Bins and Its Applications to View Size Estimation
Identifying Shapes Using Self-assembly - (Extended Abstract)
Faithful Graph Drawing (Invited Talk)
Graph Orientations with Set Connectivity Requirements
Efficient Algorithms for Two Generalized 2-Median Problems on Trees
A Faster Algorithm for Two-Variable Integer Programming
Improved Algorithms for Coloring Random Graphs
Worst-Case Optimal Join Algorithms (Invited Talk)
Minimum Covering with Travel Cost
Maintaining Nets and Net Trees under Incremental Motion
Voronoi Diagram in the Flow Field
External Memory Range Reporting on a Grid
Improved Algorithms for Largest Cardinality 2-Interval Pattern Problem
A General Framework for Finding Diverse Solutions via Network Flow and Its Applications
Diversity Maximization in Doubling Metrics
An Efficient Algorithm for Placing Electric Vehicle Charging Stations
Politician's Firefighting
Closest Periodic Vectors in L p Spaces
Approximability of Partitioning Graphs with Supply and Demand
A Framework for Succinct Labeled Ordinal Trees over Large Alphabets
31st International Symposium on Algorithms and Computation, ISAAC 2020, Hong Kong (Virtual Conference), December 14-18, 2020
Simultaneous Embedding of a Planar Graph and Its Dual on the Grid
On Isomorphism and Canonization of Tournaments and Hypertournaments
Top- k Term-Proximity in Succinct Space
A New Approximate Min-Max Theorem with Applications in Cryptography
Two-Tier Relaxed Heaps
An Improved Algorithm for Subdivision Traversal without Extra Storage
Multicommodity Flows: A Survey of Recent Research
Error Compensation in Leaf Root Problems
Time-Optimal k-Server
Computing Frequency Dominators and Related Problems
Flexibility of Steiner Trees in Uniform Orientation Metrics
On Hardness of the Joint Crossing Number
Pop & Push: Ordered Tree Iteration in 𝒪(1)-Time
On the (In)Approximability of the Monitoring Edge Geodetic Set Problem
Succinct Planar Encoding with Minor Operations
Constructing the Suffix Tree of a Tree with a Large Alphabet
Dynamic 3-Sided Planar Range Queries with Expected Doubly Logarithmic Time
Optimal Rectilinear Steiner Tree for Extremal Point Sets
On r-Guarding Thin Orthogonal Polygons
Tight Bounds on Maximal and Maximum Matchings
27th International Symposium on Algorithms and Computation, ISAAC 2016, Sydney, Australia, December 12-14, 2016
Settlement Fund Circulation Problem
Performance Comparison of Linear Sieve and Cubic Sieve Algorithms for Discrete Logarithms over Prime Fields
Geodesic Spanners on Polyhedral Surfaces
Robust Bichromatic Classification Using Two Lines
Finding Diverse Solutions in Combinatorial Problems with a Distributive Lattice Structure
An Algorithm for Finding Three Dimensional Symmetry in Series Parallel Digraphs
Single and Multiple Device DSA Problem, Complexities and Online Algorithms
Jointly Stable Matchings
Bubblesort and Juggling Sequences
Reconstructing Point Set Order Typesfrom Radial Orderings
Gathering Asynchronous Oblivious Mobile Robots in a Ring
New Results for Energy-Efficient Broadcasting in Wireless Networks
New Support Size Bounds for Integer Programming, Applied to Makespan Minimization on Uniformly Related Machines
Manpower Scheduling with Shift Change Constraints
Complexity and Modeling Aspects of Mesh Refinement into Quadrilaterals
Towards More Precise Parallel Biconnectivity Approximation
Succinct Data Structures for Searchable Partial Sums
Parameterized Complexity of the Firefighter Problem
Computational Complexity Measures of Multipartite Quantum Entanglement
From Balls and Bins to Points and Vertices
Vehicle Scheduling on a Graph Revisited
Sink Evacuation on Trees with Dynamic Confluent Flows
A Polynomial-Time Algorithm for the Universally Quickest Transshipment Problem in a Certain Class of Dynamic Networks with Uniform Path-Lengths
Gauss Period, Sparse Polynomial, Redundant Basis, and Efficient Exponentiation for a Class of Finite Fields with Small Characteristic
Minimal Interval Completion Through Graph Exploration
Algorithmic Problems in Wireless Ad Hoc Networks
An FPTAS for the Volume Computationof 0-1 Knapsack Polytopes Based on Approximate Convolution Integral
A Heuristic for the Stacker Crane Problem on Trees Which Is Almost Surely Exact
Front Matter, Table of Contents, Preface, Program Committee, External Reviewers
Unsatisfiable CNF Formulas contain Many Conflicts
Distributed Relationship Schemes for Trees
Popular Matchings with Variable Job Capacities
Faster Algorithms for Feedback Arc Set Tournament, Kemeny Rank Aggregation and Betweenness Tournament
Hashing and Indexing: Succinct DataStructures and Smoothed Analysis
Laminar Structure of Ptolemaic Graphs and Its Applications
Exact Computation of Polynomial Zeros Expressible by Square Roots
On Finding Short Reconfiguration Sequences Between Independent Sets
Counting Shortest Two Disjoint Paths in Cubic Planar Graphs with an NC Algorithm
Line-Constrained k -Median, k -Means, and k -Center Problems in the Plane
Embedding Point Sets into Plane Graphs of Small Dilation
On the Size of Ordered Binary Decision Diagrams Representing Threshold Functions
29th International Symposium on Algorithms and Computation, ISAAC 2018, Jiaoxi, Yilan, Taiwan, December 16-19, 2018
Settling the Intractability of Multiple Alignment
Finding Maximum Sum Segments in Sequences with Uncertainty
Remembering Conflicts in History Yields Dynamic Algorithms
Online Routing in Convex Subdivisions
Parameterized Problems on Coincidence Graphs
Random Generation and Enumeration of Bipartite Permutation Graphs
Unfolded Modular Multiplication
Some Properties of One-Pebble Turing Machines with Sublogarithmic Space
Cluster Editing in Multi-Layer and Temporal Graphs
Approximation Algorithms for Capacitated k-Travelling Repairmen Problems
Competitive Analysis of the On-line Algorithms for Multiple Stacks Sysytems
Approximation Algorithms for Some Optimum Communication Spanning Tree Problems
Data Stream Algorithms via Expander Graphs
Location Problems Based on Node-Connectivity and Edge-Connectivity between Nodes and Node-Subsets
Offline Sorting Buffers on Line
Kernelization and Parameterized Complexity of Star Editing and Union Editing
An Improved Algorithm for the Minimum Manhattan Network Problem
The Interval Liar Game
Computational Study on Bidimensionality Theory Based Algorithm for Longest Path Problem
Structural Parameterizations of Simultaneous Planarity
coping with Delays and Time-Outs in Binary Search Procedures
Weighted Linear Matroid Parity
A Graph Coloring Result and Its Consequences for Some Guarding Problems
Computing the Tutte Polynomial of a Graph of Moderate Size
Space Efficient Indexes for String Matching with Don't Cares
Quantum Computation and NP-Complete Problems
Branching and Treewidth Based Exact Algorithms
Bisecting a Four-Connected Graph with Three Resource Sets
Realizing Metric Spaces with Convex Obstacles
Sequences of Radius k: How to Fetch Many Huge Objects into Small Memory for Pairwise Computations
Convex Drawings of Internally Triconnected Plane Graphs on O ( n 2 ) Grids
Euclidean Traveling Salesman Tours through Stochastic Neighborhoods
Range-Efficient Consistent Sampling and Locality-Sensitive Hashing for Polygons
Repairing Flaws in a Picture Based on a Geometric Representation of a Digital Image
Spending Is Not Easier Than Trading: On the Computational Equivalence of Fisher and Arrow-Debreu Equilibria
A Strongly Polynomial-Time Algorithm for Weighted General Factors with Three Feasible Degrees
Shortest Disjoint S-Paths Via Weighted Linear Matroid Parity
Interval Scheduling and Colorful Independent Sets
Deterministic Treasure Hunt in the Plane with Angular Hints
Randomized Competitive Algorithms for Successful and Unsuccessful Search on Self-adjusting Linear Lists
Approximate Minimum-Weight Matching with Outliers Under Translation
An In-place Framework for Exact and Approximate Shortest Unique Substring Queries
On Estimating Path Aggregates over Streaming Graphs
On the Infinitesimal Rigidity of Bar-and-Slider Frameworks
On the Complexity of Rocchio's Similarity-Based Relevance Feedback Algorithm
A Sub-cubic Time Algorithm for the k -Maximum Subarray Problem
A New Balanced Subdivision of a Simple Polygon for Time-Space Trade-off Algorithms
The Complexity of Learning Branches and Strategies from Queries
A Dynamic Data Structure for Maintaining Disjoint Paths Information in Digraphs
The Canadian Traveller Problem Revisited
Improving the Bounds of the Online Dynamic Power Management Problem
Succinct List Indexing in Optimal Time
Minimizing Makespan in Batch Machine Scheduling
Almost Optimal Algorithms for Diameter-Optimally Augmenting Trees
Edit Distance to Monotonicity in Sliding Windows
On the Relationship among Cryptographic Physical Assumptions
An Index for the Data Size to Extract Decomposable Structures in LAD
Approximating Smallest Containers for Packing Three-Dimensional Convex Objects
Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions
Linear and Sublinear Time Algorithms for Basis of Abelian Groups
Approximation Algorithms for Channel Assignment with Constraints
Improved Algorithms for the Minmax-Regret 1-Center Problem
Efficient Circuit Simulation in MapReduce
On the Classes of Interval Graphs of Limited Nesting and Count of Lengths
Adaptive Phenotype Testing for AND/OR Items
Concurrent Distributed Serving with Mobile Servers
Algorithmic Learning for Steganography: Proper Learning of k-term DNF Formulas from Positive Samples
Checking Programs Discreetly: Demonstrating Result-Correctness Efficiently while Concealing it
Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular Systems
An Efficient Fixed-Parameter Algorithm for the 2-Plex Bipartition Problem
Deterministic Broadcasting Time with Partial Knowledge of the Network
Maximizing the Strong Triadic Closure in Split Graphs and Proper Interval Graphs
Complexity of Retrograde and Helpmate Chess Problems: Even Cooperative Chess Is Hard
Clique-Based Separators for Geometric Intersection Graphs
Hardness of Approximating Independent Domination in Circle Graphs
Improved FPT Algorithms for Deletion to Forest-Like Structures
Algorithmic Channel Design
The Engineering of Some Bipartite Matching Programs
A Space-Efficient Framework for Dynamic Point Location
Deciding the Closure of Inconsistent Rooted Triples Is NP-Complete
Linear-Time Approximation Scheme for k-Means Clustering of Axis-Parallel Affine Subspaces
Simultaneous Embedding of Embedded Planar Graphs
Robot Mapping: Foot-Prints versus Tokens
Polyline Drawings with Topological Constraints
Complexity of Scheduling Few Types of Jobs on Related and Unrelated Machines
Algorithms and Computation - 22nd International Symposium, ISAAC 2011, Yokohama, Japan, December 5-8, 2011. Proceedings
A Randomized Algorithm for Finding Frequent Elements in Streams Using O(loglogN) Space
Vertex Ranking of Asteroidal Triple-Free Graphs
The Fault-Tolerant Facility Allocation Problem
On the Complexity of Tree Edit Distance with Variables
Optimal Search Trees with 2-Way Comparisons
Precedence-Constrained Min Sum Set Cover
Finding All Approximate Gapped Palindromes
Multiobjective Optimization: Improved FPTAS for Shortest Paths and Non-linear Objectives with Applications
On Quadratic Lattice Approximations
Algorithms and Computation, 16th International Symposium, ISAAC 2005, Sanya, Hainan, China, December 19-21, 2005, Proceedings
Polyline Fitting of Planar Points Under Min-sum Criteria
Beyond-Planarity: Turán-Type Results for Non-Planar Bipartite Graphs
Sliding Token on Bipartite Permutation Graphs
A Branch-and-Cut Approach for Minimum Weight Triangulation
Upper Bounds on the Computational Power of an Optical Model of Computation
Fast Algorithms for Independent Domination and Efficient Domination in Trapezoid Graphs
Efficient Counting of Square Substrings in a Tree
Cubic Augmentation of Planar Graphs
Hash Functions Bridging the Gap from Theory to Practice (Invited Talk)
Fast Algorithms for Comparison of Similar Unordered Trees
Generating Trees on Multisets
Bounded Max-colorings of Graphs
Finding a Weight-Constrained Maximum-Density Subtree in a Tree
On 2-Query Codeword Testing with Near-Perfect Completeness
Algorithmic Aspects of Secure Computation and Communication
A Simple Greedy Algorithm for Dynamic Graph Orientation
Parameterized Algorithms for the Drone Delivery Problem
A Fast Algorithm for Computing a Planar Support for Non-Piercing Rectangles
Online Knapsack Problems with a Resource Buffer
Efficient Algorithms for Weighted Rank-Maximal Matchings and Related Problems
Decision-Making by Hierarchies of Discordant Agents
Two Phase Transitions in Two-Way Bootstrap Percolation
Project Scheduling with Irregular Costs: Complexity, Approximability, and Algorithms
An Improved Approximation Algorithm for the Minimum Common Integer Partition Problem
A Partially Ordered Structure and a Generalization of the Canonical Partition for General Graphs with Perfect Matchings
Competitive Source Routing on Tori and Meshes
Serving Online Requests with Mobile Servers
Combinatorial and Algorithmic Aspects of Monadic Stability
Faster Treasure Hunt and Better Strongly Universal Exploration Sequences
Online Primal-Dual Algorithms with Configuration Linear Programs
Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width
Dynamic Grid Embedding with Few Bends and Changes
Formulation of the Addition-Shift-Sequence Problem and Its Complexity
Approximate String Matching with Swap and Mismatch
On the Algorithmic Effectiveness of Digraph Decompositions and Complexity Measures
Diameter and Broadcast Time of Random Geometric Graphs in Arbitrary Dimensions
Improved Approximations for Buy-at-Bulk and Shallow-Light k-Steiner Trees and (k, 2)-Subgraph
Upward Star-Shaped Polyhedral Graphs
Geometric Restrictions on Producible Polygonal Protein Chains
Non-Crossing Geometric Steiner Arborescences
Tree-Approximations for the Weighted Cost-Distance Problem
Tight Approximation for Partial Vertex Cover with Hard Capacities
Distributed Approximation Algorithms for the Minimum Dominating Set in K_h-Minor-Free Graphs
A New Efficient Off-line Anonymous Cash Scheme
Enumerating Global Roundings of an Outerplanar Graph
Finding k Simple Shortest Paths and Cycles
When Patrolmen Become Corrupted: Monitoring a Graph Using Faulty Mobile Robots
Package Delivery Using Drones with Restricted Movement Areas
An Optimal Algorithm for Tiling the Plane with a Translated Polyomino
Quantum Algorithm for Triangle Finding in Sparse Graphs
Recognition and Orientation Algorithms for P 4 -Comparability Graphs
Space-Time Tradeoffs for Longest-Common-Prefix Array Computation
Covering Problems for Partial Words and for Indeterminate Strings
Minimizing Total Flow-Time: The Unrelated Case
Structural Pattern Matching - Succinctly
Flexible Train Rostering
Optimization Algorithms for Sweeping a Polygonal Region with Mobile Guards
An Optimal Oracle Separation of Classical and Quantum Hybrid Schemes
Packing-Based Approximation Algorithm for the k-Set Cover Problem
Output-Sensitive Algorithms for Uniform Partitions of Points
Rectilinear Paths among Rectilinear Obstacles
Vehicle Scheduling on a Tree with Release and Handling Times
Polygonal Path Approximation: A Query Based Approach
Partially Walking a Polygon
Flat-State Connectivity of Linkages under Dihedral Motions
Exponential Speedup of Fixed-Parameter Algorithms on K 3, 3 -Minor-Free or K 5 -Minor-Free Graphs
Some Geometric Lower Bounds
Minimizing the Diameter of a Spanning Tree for Imprecise Points
Further Computational Geometry in Secondary Memory
Inapproximability Results for Guarding Polygons without Holes
Optimal Information Delivery
Should Static Search Trees Ever Be Unbalanced?
Network Game with Attacker and Protector Entities
An SPQR-Tree-Like Embedding Representation for Level Planarity
Detecting and Counting Small Pattern Graphs
On-Line Scheduling of Parallel Jobs with Runtime Restrictions
Crossing Number Is NP-Hard for Constant Path-Width (And Tree-Width)
D 2 -Tree: A New Overlay with Deterministic Bounds
Raising Permutations to Powers in Place
Computing Multidimensional Persistence