A Unified Framework for Clustering Constrained Data Without Locality Property
来源期刊:AlgorithmicaDOI:10.1007/s00453-019-00616-2
Attenuate Locally, Win Globally: Attenuation-Based Frameworks for Online Stochastic Matching with Timeouts
来源期刊:AlgorithmicaDOI:10.1007/s00453-019-00603-7
Deleting Vertices to Graphs of Bounded Genus
来源期刊:AlgorithmicaDOI:10.1007/s00453-019-00592-7
QuickXsort: A Fast Sorting Scheme in Theory and Practice
来源期刊:AlgorithmicaDOI:10.1007/s00453-019-00634-0
Nested Convex Bodies are Chaseable
来源期刊:AlgorithmicaDOI:10.1007/s00453-019-00661-x
An Optimal XP Algorithm for Hamiltonian Cycle on Graphs of Bounded Clique-Width
来源期刊:AlgorithmicaDOI:10.1007/s00453-019-00663-9
Optimal Data Reduction for Graph Coloring Using Low-Degree Polynomials
来源期刊:AlgorithmicaDOI:10.1007/s00453-019-00578-5
Local Algorithms for Sparse Spanning Graphs
来源期刊:AlgorithmicaDOI:10.1007/s00453-019-00612-6
A Constant-Time Algorithm for Middle Levels Gray Codes
来源期刊:AlgorithmicaDOI:10.1007/s00453-019-00640-2
Turing Kernelization for Finding Long Paths in Graph Classes Excluding a Topological Minor
来源期刊:AlgorithmicaDOI:10.1007/s00453-019-00614-4
A Tight Lower Bound for Planar Steiner Orientation
来源期刊:AlgorithmicaDOI:10.1007/s00453-019-00580-x
Stochastic Dominance and the Bijective Ratio of Online Algorithms
来源期刊:AlgorithmicaDOI:10.1007/s00453-019-00638-w
Region-Based Approximation of Probability Distributions (for Visibility Between Imprecise Points Among Obstacles)
来源期刊:AlgorithmicaDOI:10.1007/s00453-019-00551-2
Streaming Algorithms for Maximizing Monotone Submodular Functions Under a Knapsack Constraint
来源期刊:AlgorithmicaDOI:10.1007/s00453-019-00628-y
Sublinear-Space and Bounded-Delay Algorithms for Maximal Clique Enumeration in Graphs
来源期刊:AlgorithmicaDOI:10.1007/s00453-019-00656-8
Improving and Extending the Testing of Distributions for Shape-Restricted Properties
来源期刊:AlgorithmicaDOI:10.1007/s00453-019-00598-1
Space-Efficient DFS and Applications to Connectivity Problems: Simpler, Leaner, Faster
来源期刊:AlgorithmicaDOI:10.1007/s00453-019-00629-x
A Polynomial Time Algorithm for Read-Once Certification of Linear Infeasibility in UTVPI Constraints
来源期刊:AlgorithmicaDOI:10.1007/s00453-019-00554-z
A Faster Tree-Decomposition Based Algorithm for Counting Linear Extensions
来源期刊:AlgorithmicaDOI:10.1007/s00453-019-00633-1
Optimality Program in Segment and String Graphs
来源期刊:AlgorithmicaDOI:10.1007/s00453-019-00568-7
Parameterized Complexity of Geometric Covering Problems Having Conflicts
来源期刊:AlgorithmicaDOI:10.1007/s00453-019-00600-w
Two Approaches to Building Time-Windowed Geometric Data Structures
来源期刊:AlgorithmicaDOI:10.1007/s00453-019-00588-3
Consensus Strings with Small Maximum Distance and Small Distance Sum
来源期刊:AlgorithmicaDOI:10.1007/s00453-019-00647-9
The Homogeneous Broadcast Problem in Narrow and Wide Strips I: Algorithms
来源期刊:AlgorithmicaDOI:10.1007/s00453-019-00567-8
Revisiting Connected Dominating Sets: An Almost Optimal Local Information Algorithm
来源期刊:AlgorithmicaDOI:10.1007/s00453-019-00545-0
The Parameterised Complexity of Computing the Maximum Modularity of a Graph
来源期刊:AlgorithmicaDOI:10.1007/s00453-019-00649-7
A Nearly Optimal Algorithm for the Geodesic Voronoi Diagram of Points in a Simple Polygon
来源期刊:AlgorithmicaDOI:10.1007/s00453-019-00624-2
Deterministic Dynamic Matching in O(1) Update Time
来源期刊:AlgorithmicaDOI:10.1007/s00453-019-00630-4
Nearly Constant Tile Complexity for any Shape in Two-Handed Tile Assembly
来源期刊:AlgorithmicaDOI:10.1007/s00453-019-00573-w
Reachability Oracles for Directed Transmission Graphs
来源期刊:AlgorithmicaDOI:10.1007/s00453-019-00641-1
Maximum Induced Matching Algorithms via Vertex Ordering Characterizations
来源期刊:AlgorithmicaDOI:10.1007/s00453-018-00538-5
Subset Feedback Vertex Set in Chordal and Split Graphs
来源期刊:AlgorithmicaDOI:10.1007/s00453-019-00590-9
Connected Vertex Cover for $$(sP_1+P_5)$$(sP1+P5)-Free Graphs
来源期刊:AlgorithmicaDOI:10.1007/s00453-019-00601-9
Assortment Optimisation Under a General Discrete Choice Model: A Tight Analysis of Revenue-Ordered Assortments
来源期刊:AlgorithmicaDOI:10.1007/s00453-019-00610-8
The Parameterized Complexity of Cycle Packing: Indifference is Not an Issue
来源期刊:AlgorithmicaDOI:10.1007/s00453-019-00599-0
An Algorithm to Compute the Nucleolus of Shortest Path Games
来源期刊:AlgorithmicaDOI:10.1007/s00453-019-00574-9
Approximately Coloring Graphs Without Long Induced Paths
来源期刊:AlgorithmicaDOI:10.1007/s00453-019-00577-6
Non-Monochromatic and Conflict-Free Colorings on Tree Spaces and Planar Network Spaces
来源期刊:AlgorithmicaDOI:10.1007/s00453-019-00639-9
Maximum Matching on Trees in the Online Preemptive and the Incremental Graph Models
来源期刊:AlgorithmicaDOI:10.1007/s00453-019-00593-6
Optimizing a Generalized Gini Index in Stable Marriage Problems: NP-Hardness, Approximation and a Polynomial Time Special Case
来源期刊:AlgorithmicaDOI:10.1007/s00453-019-00550-3
A Faster Algorithm for Truth Discovery via Range Cover
来源期刊:AlgorithmicaDOI:10.1007/s00453-019-00562-z
Asymptotic Analysis of Regular Sequences
来源期刊:AlgorithmicaDOI:10.1007/s00453-019-00631-3
Tight Tradeoffs for Real-Time Approximation of Longest Palindromes in Streams
来源期刊:AlgorithmicaDOI:10.1007/s00453-019-00591-8
Online Clique Clustering
来源期刊:AlgorithmicaDOI:10.1007/s00453-019-00625-1
Speeding Up the Gomory-Hu Parallel Cut Tree Algorithm with Efficient Graph Contractions
来源期刊:AlgorithmicaDOI:10.1007/s00453-019-00658-6
Preface to the Special Issue on Computing and Combinatorics
来源期刊:AlgorithmicaDOI:10.1007/s00453-019-00632-2
Dynamic Space Efficient Hashing
来源期刊:AlgorithmicaDOI:10.1007/s00453-019-00572-x
The Geodesic Farthest-Point Voronoi Diagram in a Simple Polygon
来源期刊:AlgorithmicaDOI:10.1007/s00453-019-00651-z
Making Bidirected Graphs Strongly Connected
来源期刊:AlgorithmicaDOI:10.1007/s00453-019-00613-5
Extended Learning Graphs for Triangle Finding
来源期刊:AlgorithmicaDOI:10.1007/s00453-019-00627-z