yusuke1997/dblp-id-title huggingface dataset:
Sex-Equal Stable Matchings: Complexity and Exact Algorithms
The Bit Complexity of Distributed Sorting
Approximation Algorithms for Highly Connected Multi-dominating Sets in Unit Disk Graphs
A New Quantum Lower Bound Method, with Applications to Direct Product Theorems and Time-Space Tradeoffs
Binary Pattern Tile Set Synthesis Is NP-Hard
Connected Vertex Cover for (sP 1+P 5) -Free Graphs
On Counting Pairs of Intersecting Segments and Off-Line Triangle Range Searching
Expansion of Linear Steiner Trees
Optimal Two-Description Scalar Quantizer Design
On Making a Distinguished Vertex of Minimum Degree by Vertex Deletion
A Linear Algorithm for Finding [{ g , f }]-Colorings of Partial { k }-Trees
Guest Editorial: Special Issue on Compact Data Structures
Editor's Foreword Special Issue on Graph Algorithms
Drawing Power Law Graphs Using a Local/Global Decomposition
Succinct Encoding of Binary Strings Representing Triangulations
Optimizing a Generalized Gini Index in Stable Marriage Problems: NP-Hardness, Approximation and a Polynomial Time Special Case
A Rigorous Runtime Analysis of the (1 + (λ , λ )) GA on Jump Functions
Polynomial Interpolation and Identity Testing from High Powers Over Finite Fields
Superpolynomial Lower Bounds for the (1+1) EA on Some Easy Combinatorial Problems
Combinatorics and Algorithms for Quasi-Chain Graphs
Problems with Generalized Steiner Problems
Chain Minors are FPT
Decremental 2- and 3-Connectivity on Planar Graphs
Error-Detection-Based Quantum Fault-Tolerance Threshold
Correction: Galloping in Fast-Growth Natural Merge Sorts
Analysis of the SSAP Method for the Numerical Valuation of High-Dimensional Multivariate American Securities
Probabilistic Analysis of MULTIPLE QUICK SELECT
Speeding Up Dynamic Programming with Representative Sets: An Experimental Evaluation of Algorithms for Steiner Tree on Tree Decompositions
Optimization with Uniform Size Queries
Algorithms for p-Faulty Search on a Half-Line
Choosing a Random Peer in Chord
Cleaning Interval Graphs
Algorithms for Projecting Points To Give the Most Uniform Distribution with Applications to Hashing
Path-Distance Heuristics for the Steiner Problem in Undirected Networks
A Polynomial-Time Algorithm to Find von Neumann-Morgenstern Stable Matchings in Marriage Games
How Fast Is the k-Means Method?
Geometric BWT: Compressed Text Indexing via Sparse Suffixes and Range Searching
On-Line Maintenance of Triconnected Components with SPQR-Trees
The Pairing Heap: A New Form of Self-Adjusting Heap
On Scheduling Coflows
Separation Dimension of Graphs and Hypergraphs
Algorithms and Complexity on Indexing Founder Graphs
The Impact of Random Initialization on the Runtime of Randomized Search Heuristics
Computational Approaches to Drug Design
Simultaneous Inner and Outer Approximation of Shapes
Guest Editorial: Special Issue on Matching Under Preferences
Approximation Algorithms for k -hurdle Problems
Dynamically Switching Vertices in Planar Graphs
Quantum and Classical Query Complexities of Local Search Are Polynomially Related
On (1,ϵ)-Restricted Max-Min Fair Allocation Problem
Some Aperture-Angle Optimization Problems
A Unified Framework for Clustering Constrained Data Without Locality Property
Comments on Bern's Probabilistic Results on Rectilinear Steiner Trees
Multiplicative Up-Drift
Characterizing and Recognizing 4-Map Graphs
The Asymptotic Number of Leftist Trees
A New Proof for the Existence of Mutually Unbiased Bases
Linear-Time Algorithms for Visibility and Shortest Path Problems Inside Triangulated Simple Polygons
Discrete Logarithms in GF(p)
A Combinatorial Certifying Algorithm for Linear Feasibility in UTVPI Constraints
Incremental Medians via Online Bidding
A Linear-Time Algorithm for Finding Locally Connected Spanning Trees on Circular-Arc Graphs
Editorial: Special Issue on Algorithms and Computation
Finding a Minimal Cover for Binary Images: An Optimal Parallel Algorithm
Parallel Biomolecular Computation: Models and Simulations
On Learning Decision Trees with Large Output Domains
Drawing Trees Symmetrically in Three Dimensions
External Segment Trees
Fast Approximation Algorithms for p-Centers in Large $$\delta $$ δ -Hyperbolic Graphs
Optimal Parallel Algorithms for Rectilinear Link-Distance Problems
Introduction to Special Issue on Randomized and Derandomized Algorithms
Dynamical Sources in Information Theory: Fundamental Intervals and Word Prefixes
Fully Dynamic Recognition of Proper Circular-Arc Graphs
Optimal Online Algorithms for an Electronic Commerce Money Distribution System
Parallel Algorithms for Maximal Acyclic Sets
General Perfectly Periodic Scheduling
A Fast and Simple Algorithm for the Money Changing Problem
Universal Slope Sets for 1-Bend Planar Drawings
Finding Optimal Solutions with Neighborly Help
An Optimal Algorithm for the Boundary of a Cell in a Union of Rays
Drawing Planar Graphs Symmetrically, III: Oneconnected Planar Graphs
Guest Editorial: Special Issue on Latin American Theoretical Informatics Symposium (LATIN)
Computing Approximate Shortest Paths on Convex Polytopes
Generation of Configuration Space Obstacles: The Case of Moving Algebraic Curves
VISOR: Vast Independence System Optimization Routine
Algorithms for the Boundary Selection Problem
Multi-sided Boundary Labeling
Efficient Parallel Algorithms for Computing All Pair Shortest Paths in Directed Graphs
Partition Strategies for the Maker-Breaker Domination Game
Mechanical Parts Orienting: The Case of a Polyhedron on a Table
A Direct Product Theorem for Two-Party Bounded-Round Public-Coin Communication Complexity
On the Least Trimmed Squares Estimator
Computing Dense Tensor Decompositions with Optimal Dimension Trees
Editor's Foreword: Special Issur on Network Flow Algorithms
Probing a Scene of Nonconvex Polyhedra
Approximation Algorithms for Aligning Points
New Techniques for Regular Expression Searching
O(f) Bi-criteria Approximation for Capacitated Covering with Hard Capacities
An Algorithm for the Three-Dimensional Packing Problem with Asymptotic Performance Analysis
Colored Bin Packing: Online Algorithms and Lower Bounds
Bipartite Matching in the Semi-streaming Model
Fixed-Parameter and Approximation Algorithms for Maximum Agreement Forests of Multifurcating Trees
Tight Approximation Ratio of a General Greedy Splitting Algorithm for the Minimum k -Way Cut Problem
Approximation Schemes for Degree-Restricted MST and Red-Blue Separation Problems
A Fully Polynomial-Time Approximation Scheme for Speed Scaling with a Sleep State
$$(k, n-k)$$ ( k , n - k ) -Max-Cut: An $$\mathcal{O}^*(2^p)$$ O ∗ ( 2 p ) -Time Algorithm and a Polynomial Kernel
Minimising the Number of Bends and Volume in 3-Dimensional Orthogonal Graph Drawings with a Diagonal Vertex Layout
Separators in Graphs with Negative and Multiple Vertex Weights
Streaming Algorithms for Maximizing Monotone Submodular Functions Under a Knapsack Constraint
Computing Convexity Properties of Images on a Pyramid Computer
Reconstructing Curves without Delaunay Computation
Maintaining the Visibility Map of Spheres While Moving the Viewpoint on a Circle at Infinity
Lower Bounds for Fully Dynamic Connectivity Problems in Graphs
The Seat Reservation Problem
Scheduling with Deadlines and Buffer Management with Processing Requirements
The Searching over Separators Strategy To Solve Some NP-Hard Problems in Subexponential Time
Wait-Free Clock Synchronization
Exact Algorithms for Minimum Weighted Dominating Induced Matching
Fast, Fair and Frugal Bandwidth Allocation in ATM Networks
Solving Some Combinatorial Problems on Arrays with One-Way Dataflow
A Distributed O(1)-Approximation Algorithm for the Uniform Facility Location Problem
Convex-Straight-Skeleton Voronoi Diagrams for Segments and Convex Polygons
Improved Algorithms for Uniform Partitions of Points
The Hausdorff Voronoi Diagram of Point Clusters in the Plane
Preface to the Special Issue on Computing and Combinatorics
Maximizing Dominance in the Plane and its Applications
A Minimum-Area Circuit for l-Selection
On Nonlinear Parametric Search
QuickXsort: A Fast Sorting Scheme in Theory and Practice
On the Intractability of Protein Folding with a Finite Alphabet of Amino Acids
The Approximability of Multiple Facility Location on Directed Networks with Random Arc Failures
The Directed Orienteering Problem
On the Analysis of Trajectory-Based Search Algorithms: When is it Beneficial to Reject Improvements?
Distributed and On-Line Routing on Tori
Approximate and Randomized Algorithms for Computing a Second Hamiltonian Cycle
The (2, k)-Connectivity Augmentation Problem: Algorithmic Aspects
Weaving Patterns of Lines and Line Segments in Space
An O(n²) Incremental Algorithm for Modular Decomposition of Graphs and 2-Structures
Simple Stochastic Games, Parity Games, Mean Payoff Games and Discounted Payoff Games Are All LP-Type Problems
Theoretical Analysis of Git Bisect
A Semidynamic Construction of Higher-Order Voronoi Diagrams and Its Randomized Analysis
Resource-Constrained Scheduling Algorithms for Stochastic Independent Tasks With Unknown Probability Distribution
Isotonic Regression for Multiple Independent Variables
A Note on the Expected Time for Finding Maxima by List Algorithms
Planning Motions of Polyhedral Parts by Rolling
The Parameterized Complexity of Stabbing Rectangles
Practical and Efficient Split Decomposition via Graph-Labelled Trees
PAC Learning Intersections of Halfspaces with Membership Queries
Space Efficient Merging of de Bruijn Graphs and Wheeler Graphs
An Optimal Time Bound for Oblivious Routing
Efficiency of Randomized Parallel Backtrack Search
An Exact Algorithm for TSP in Degree-3 Graphs Via Circuit Procedure and Amortization on Connectivity Structure
Succinct Encodings for Families of Interval Graphs
Analysis of the Standard Deletion Algorithms in Exact Fit Domain Binary Search Trees
Divided k-d Trees
An Experimental Study of Compression Methods for Dynamic Tries
Multi-Color Pebble Motion on Graphs
Homogeneous String Segmentation using Trees and Weighted Independent Sets
Boltzmann Machines as a Model for Parallel Annealing
Complexity Issues on of Secondary Domination Number
Scheduling Techniques for Media-on-Demand
f-Sensitivity Distance Oracles and Routing Schemes
3-Colouring P t -Free Graphs Without Short Odd Cycles
A Pinwheel Scheduler for Three Distinct Numbers with a Tight Schedulability Bound
Computing on Rings by Oblivious Robots: A Unified Approach for Different Tasks
An Efficient Parallel Algorithm for Finding Rectangular Duals of Plane Triangular Graphs
Simulated Annealing Type Algorithms for Multivariate Optimization
Finding a Minimum-depth Embedding of a Planar Graph in O ( n 4 ) Time
An Efficient Sum Query Algorithm for Distance-Based Locally Dominating Functions
Location-Oblivious Distributed Unit Disk Graph Coloring
Sensor Network Topology Design and Analysis for Efficient Data Gathering by a Mobile Mule
Smoothed Analysis of the 2-Opt Heuristic for the TSP under Gaussian Noise
Power Domination in Circular-Arc Graphs
Geometry Helps in Bottleneck Matching and Related Problems
The Induced Separation Dimension of a Graph
Complexities of Efficient Solutions of Rectilinear Polygon Cover Problems
Solving Systems of Difference Constraints Incrementally
Pareto Sums of Pareto Sets: Lower Bounds and Algorithms
On the (Non-)Existence of Polynomial Kernels for P l -Free Edge Modification Problems
Some Chain Visibility Problems in a Simple Polygon
Approximation Algorithms for Cost-robust Discrete Minimization Problems Based on their LP-Relaxations
On Independent Vertex Sets in Subclasses of Apple-Free Graphs
Geometric Path Problems with Violations
A Randomized Algorithm for Approximate String Matching
On "An Improved Algorithm for Finding the Median Distributively"
Analysis of an Adaptive Algorithm to Find the Two Nearest Neighbors
Scheduling Tree DAGs on Parallel Architectures
Point Set Pattern Matching in d-Dimensions
Guest Editorial: Selected Papers from ISAAC 2017
Strategyproof Mechanisms for Competitive Influence in Networks
A 3-Party Simultaneous Protocol for SUM-INDEX
Fair Repetitive Interval Scheduling
A New Lower Bound on the Maximum Number of Satisfied Clauses in Max-SAT and Its Algorithmic Applications
An Algorithmic Approach to Discovering and Proving q-Series Identities
Multicast Pull Scheduling: When Fairness Is Fine
Parallel Computation of the Topology of Level Sets
An Optimal Algorithm for the Weighted Backup 2-Center Problem on a Tree
A o(n)-Competitive Deterministic Algorithm for Online Matching on a Line
Adaptive Disk Spindown via Optimal Rent-to-Buy in Probabilistic Environments
Efficient Coordination Mechanisms for Unrelated Machine Scheduling
On Approximation Behavior of the Greedy Triangulation for Convex Polygons
Parallel Computational Geometry of Rectangles
Asymptotic Speed-Ups in Constructive Solid Geometry
Efficient 1-Space Bounded Hypercube Packing Algorithm
Finding a Shortest Non-zero Path in Group-Labeled Graphs via Permanent Computation
The Swap Edges of a Multiple-Sources Routing Tree
A Dynamic Fixed Windowing Problem
Dynamic Programming and Convex Clustering
From Constrained to Unconstrained Maximum Agreement Subtree in Linear Time
Online Unit Clustering and Unit Covering in Higher Dimensions
Average Case Analysis of Bounded Space Bin Packing Algorithms
A Generalization of Multiple Choice Balls-into-Bins: Tight Bounds
Homotopy Techniques in Linear Programming
Preface to Special Issue Dedicated to the 60th Birthday of Gregory Gutin
Pinwheel Scheduling: Achievable Densities
Assembly Sequences for Polyhedra
Max-Stretch Reduction for Tree Spanners
Primal-Dual Approximation Algorithms for Integral Flow and Multicut in Trees
A Linear-Time Algorithm To Construct a Rectilinear Steiner Minimal Tree for k-Extremal Point Sets
Energy-Efficient Paths in Radio Networks
On Enumerating Minimal Dicuts and Strongly Connected Subgraphs
Contextual Building Typification in Automated Map Generalization
Edge Crossings in Drawings of Bipartite Graphs
A Sub-exponential FPT Algorithm and a Polynomial Kernel for Minimum Directed Bisection on Semicomplete Digraphs
Graph Isomorphism for (H 1, H 2) -Free Graphs: An Almost Complete Dichotomy
Linear-Time Recognition of Circular-Arc Graphs
Crochemore's Partitioning on Weighted Strings and Applications
The Two-Handed Tile Assembly Model is not Intrinsically Universal
Concentration of First Hitting Times Under Additive Drift
Spin-the-Bottle Sort and Annealing Sort: Oblivious Sorting via Round-Robin Random Comparisons
Path-Matching Problems
Self-Assembling Rulers for Approximating Generalized Sierpinski Carpets
Improved Approximation Algorithms for MAX k-CUT and MAX BISECTION
Reinforcement Learning with Immediate Rewards and Linear Hypotheses
Turing Kernelization for Finding Long Paths in Graph Classes Excluding a Topological Minor
Exact Sampling from Perfect Matchings of Dense Regular Bipartite Graphs
Partial Lifting and the Elliptic Curve Discrete Logarithm Problem
The Random Multisection Problem, Travelling Waves and the Distribution of the Height of m-Ary Search Trees
On-Line Load Balancing and Network Flow
Translation Invariant Fréchet Distance Queries
Can Finite Samples Detect Singularities of Reao-Valued Functions?
Runtime Analysis of Non-elitist Populations: From Classical Optimisation to Partial Information
On the Succinct Representation of Equivalence Classes
Housing Markets Through Graphs
Complexity of Anticipated Rejection Algorithms and the Darling-Mandelbrot Distribution
Faster Algorithms for Security Games on Matroids
Delayed Binary Search, or Playing Twenty Questions with a Procrastinator
On Centralized Smooth Scheduling
Geometric Eccentricity and the Complexity of Manipulation Plans
On Greedy Heuristics for Steiner Minimum Trees
Induced Minor Free Graphs: Isomorphism and Clique-Width
Sorting by Short Block-Moves
Towards Constant-Factor Approximation for Chordal/Distance-Hereditary Vertex Deletion
An Analytic Approach to the Height of Binary Search Trees
Order Statistics in the Farey Sequences in Sublinear Time and Counting Primitive Lattice Points in Polygons
A Timing Assumption and Two t -Resilient Protocols for Implementing an Eventual Leader Service in Asynchronous Shared Memory Systems
A Lower Bound of 1+ φ for Truthful Scheduling Mechanisms
The Complexity of Finding and Enumerating Optimal Subgraphs to Represent Spatial Correlation
Eulerian Walks in Temporal Graphs
Efficient Convexity and Domination Algorithms for Fine-and Medium-Grain Hypercube Computers
The Inverse Voronoi Problem in Graphs II: Trees
Trading Off Worst and Expected Cost in Decision Tree Problems
Maximum Likelihood Analysis of the Ford-Fulkerson Method on Special Graphs
Dynamic and Internal Longest Common Substring
Reconstructing Phylogenetic Level-1 Networks from Nondense Binet and Trinet Sets
Generalizing a Theorem of Wilber on Rotations in Binary Search Trees to Encompass Unordered Binary Trees
The Analysis of Evolutionary Algorithms - A Proof That Crossover Really Can Help
An Axiomatic Approach to Time-Dependent Shortest Path Oracles
On the Influence of Lookahead in Competitive Paging Algorithms
A 2-Approximation Algorithm for Finding a Spanning Tree with Maximum Number of Leaves
Randomized Multipacket Routing and Sorting on Meshes
Harmonic Analysis, Real Approximation, and the Communication Complexity of Boolean Functions
Maintaining Bridge-Connected and Biconnected Components On-Line
Linear-Time Algorithms for Finding the Shadow Volumes from a Convex Area Light Source
Efficient Perturbations for Handling Geometric Degeneracies
Efficient Parallel Algorithms for r-Dominating Set and p-Center Problems on Trees
Combinatorial and Experimental Methods for Approximate Point Pattern Matching
Public Bayesian Persuasion: Being Almost Optimal and Almost Persuasive
Clustering What Matters in Constrained Settings
How to Eat Your Entropy and Have it Too: Optimal Recovery Strategies for Compromised RNGs
Randomized Weighted Caching with Two Page Weights
Randomized Geometric Algorithms and Pseudorandom Generators
Fast Compressed Self-indexes with Deterministic Linear-Time Construction
Geometric Complexity of Some Loction Problems
On the Power of Randomization in On-Line Algorithms
The Set LCS Problem
Computing Betti Numbers via Combinatiorial Laplacians
Detecting False Matches in String-Matching Algorithms
On Colorful Vertex and Edge Cover Problems
Convergecast and Broadcast by Power-Aware Mobile Agents
Fast Heuristic Algorithms for Rectilinear Steiner Trees
Communication - Processor Tradeoffs in a Limited Resources PRAM
A Constant-Time Algorithm for Middle Levels Gray Codes
GCD of Random Linear Combinations
Random Walks, Bisections and Gossiping in Circulant Graphs
Simulations Among Concurrent-Write PRAMs
Min Orderings and List Homomorphism Dichotomies for Graphs and Signed Graphs
On the Analysis of Linear Probing Hashing
Error Compensation in Leaf Power Problems
Relaxed Balance Using Standard Rotations
Distance and Routing Labeling Schemes for Cube-Free Median Graphs
An Algorithm for Computing a Convex and Simple Path of Bounded Curvature in a Simple Polygon
Improved Space-Time Tradeoffs for Approximate Full-Text Indexing with One Edit Error
Erratum to: Linear Time Algorithms for Generalized Edge Dominating Set Problems
Biased Range Trees
Shellsort with a Constant Number of Increments
Shortest Noncrossing Paths in Plane Graphs
Restricted Max-Min Allocation: Integrality Gap and Approximation Algorithm
Reallocation Problems in Scheduling
I/O-Efficient Path Traversal in Succinct Planar Graphs
External-Memory Algorithms for Processing Line Segments in Geographic Information Systems
On-Line Multi-Threaded Paging
1-Local 7/5-Competitive Algorithm for Multicoloring Hexagonal Graphs
Constructing the Voronoi Diagram of a Set of Line Segments in Parallel
Practical Budgeted Submodular Maximization
Super-Pattern Matching
Finding All Minimal Shapes in a Routing Channel
Equispreading Tree in Manhattan Distance
Scheduling Malleable Parallel Tasks: An Asymptotic Fully Polynomial Time Approximation Scheme
A Technique for Constructing Highly Available Services
Fault-Tolerant Covering Problems in Metric Spaces
Data Reduction and Fast Routing: A Strategy for Efficient Algorithms for Message-Passing Parallel Computers
Using Nondeterminism to Design Efficient Deterministic Algorithms
Constrained Minimum Passage Time in Random Geometric Graphs
An On-line Competitive Algorithm for Coloring Bipartite Graphs Without Long Induced Paths
On Partitioning Rectilinear Polygons into Star-Shaped Polygons
Range Majorities and Minorities in Arrays
Fractional Path Coloring in Bounded Degree Trees with Applications
Testing Planarity of Geometric Automorphisms in Linear Time
Preface Algorithms and Computation (ISAAC 2012)
An Algorithm for Straight-Line Drawing of Planar Graphs
On Minimum-Area Hulls
Approximating Maximum Weight Cycle Covers in Directed Graphs with Weights Zero and One
Three-Sided Stable Matchings with Cyclic Preferences
The Iterative Step in the Linear Programming Algorithm of N. Karmarkar
Using Geometry To Solve the Transportation Problem in the Plane
Improved Quantum Query Algorithms for Triangle Detection and Associativity Testing
Transitional Behaviors of the Average Cost of Quicksort with Median-of-(2t+1)
A Generalization of AT-Free Graphs and a Generic Algorithm for Solving Triangulation Problems
A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals with Demands
Stochastic Rearrangement Rules for Self-Organizing Data Structures
Distributed Matrix-Free Solution of Large Sparse Linear Systems over Finite Fields
The List Update Problem: Improved Bounds for the Counter Scheme
A Faster Interior-Point Method for Sum-of-Squares Optimization
Does Comma Selection Help to Cope with Local Optima?
Maintaining the Classes of 4-Edge-Connectivity in a Graph On-Line
Maximum Concurrent Flows and Minimum Cuts
An Efficient Parallel Algorithm for Computing a Large Independent Set in Planar Graph
Simulating Boolean Circuits on a DNA Computer
On the Approximability of the Single Allocation p-Hub Center Problem with Parameterized Triangle Inequality
Combinatorial Relaxation Algorithm for the Entire Sequence of the Maximum Degree of Minors
Deciding k -Colorability of P 5 -Free Graphs in Polynomial Time
Efficient Simulated Annealing on Fractal Energy Landscapes
Island Models Meet Rumor Spreading
Quantum Pattern Matching Fast on Average
Sample Complexity for Computational Classification Problems
A Method for Obtaining Randomized Algorithms with Small Tail Probabilities
The k-Nearest-Neighbor Voronoi Diagram Revisited
A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs
On Total Unimodularity of Edge-Edge Adjacency Matrices
Editor's Foreword: Special Issue on Algorithmic Aspects of Communications
Non-Monochromatic and Conflict-Free Colorings on Tree Spaces and Planar Network Spaces
Approximation Schemes for Stochastic Mean Payoff Games with Perfect Information and Few Random Positions
Augmenting Trees to Meet Biconnectivity and Diameter Constraints
New Algorithms for Facility Location Problems on the Real Line
Efficient Elections in Chordal Ring Networks
The Complexity of Almost-Optimal Simultaneous Coordination
Augmenting the Rigidity of a Graph in R 2
Extending Convex Partial Drawings of Graphs
Swapping a Failing Edge of a Single Source Shortest Paths Tree Is Good and Fast
A Simple Projection Algorithm for Linear Programming Problems
A Grouping Approach for Succinct Dynamic Dictionary Matching
An Incremental Distributed Algorithm for Computing Biconnected Components in Dynamic Graphs
Derandomized Constructions of k -Wise (Almost) Independent Permutations
Beyond Representing Orthology Relations by Trees
Additive Approximation of Generalized Turán Questions
An Algorithmic Approach to the Identification of Rigid Domains in Proteins
Parallel Computation of Distance Transforms - Erratum
Processor-Time Optimal Parallel Algorithms for Digitized Images on Mesh-Connected Processor Arrays
Parallelizing Feature Selection
Achieving Tight O(4 k) Runtime Bounds on Jump k by Proving that Genetic Algorithms Evolve Near-Maximal Population Diversity
Placing Labels in Road Maps: Algorithms and Complexity
Edge Bipartization Faster than $$2^k$$ 2 k
A Faster Parametric Minimum-Cut Algorithm
An 11/6-Approximation Algorithm for the Network Steiner Problem
On Maximizing Sums of Non-monotone Submodular and Linear Functions