The following pages link to Piotr Sankowski (Q334927):
Displaying 50 items.
- Online network design with outliers (Q334928) (← links)
- The ring design game with fair cost allocation (Q476847) (← links)
- Dynamic normal forms and dynamic characteristic polynomial (Q633626) (← links)
- Fast dynamic transitive closure with lookahead (Q848959) (← links)
- Maximum weight bipartite matching in matrix multiplication time (Q1035683) (← links)
- Optimal decremental connectivity in planar graphs (Q1693990) (← links)
- Shortest augmenting paths for online matchings on trees (Q1743118) (← links)
- Improved distance queries and cycle counting by Frobenius normal form (Q2321929) (← links)
- Maximum matchings in planar graphs via Gaussian elimination (Q2369872) (← links)
- Processor efficient parallel matching (Q2471700) (← links)
- Shortest Augmenting Paths for Online Matchings on Trees (Q2788991) (← links)
- Locality-Sensitive Hashing Without False Negatives for $$l_p$$ (Q2817854) (← links)
- Set Covering with Our Eyes Closed (Q2848202) (← links)
- Approximation Algorithms for Union and Intersection Covering Problems (Q2911608) (← links)
- A Path-Decomposition Theorem with Applications to Pricing and Covering on Trees (Q2912854) (← links)
- (Q2934589) (← links)
- Revenue Maximizing Envy-Free Fixed-Price Auctions with Budgets (Q2936988) (← links)
- Efficiency of Truthful and Symmetric Mechanisms in One-Sided Matching (Q2938642) (← links)
- The Power of Dynamic Distance Oracles (Q2941483) (← links)
- Optimal Decremental Connectivity in Planar Graphs. (Q2955027) (← links)
- Subexponential-Time Parameterized Algorithm for Steiner Tree on Planar Graphs (Q2957897) (← links)
- Reachability in graph timelines (Q2986875) (← links)
- Catch them if you can (Q2986895) (← links)
- Min-Cuts and Shortest Cycles in Planar Graphs in O(n loglogn) Time (Q3092225) (← links)
- Algorithmic Applications of Baur-Strassen’s Theorem (Q3177733) (← links)
- Network Elicitation in Adversarial Environment (Q3179201) (← links)
- Dynamic Normal Forms and Dynamic Characteristic Polynomial (Q3521938) (← links)
- Dynamic Plane Transitive Closure (Q3527250) (← links)
- (Q3579386) (← links)
- Fast Approximation in Subspaces by Doubling Metric Decomposition (Q3586452) (← links)
- Online Network Design with Outliers (Q3587373) (← links)
- Algebraic Graph Algorithms (Q3599116) (← links)
- Weighted Bipartite Matching in Matrix Multiplication Time (Q3613766) (← links)
- (Q4418670) (← links)
- Online Pricing with Impatient Bidders (Q4575591) (← links)
- Algorithmic Complexity of Power Law Networks (Q4575673) (← links)
- Negative-Weight Shortest Paths and Unit Capacity Minimum Cost Flow in Õ (<i>m</i><sup>10/7</sup> log <i>W</i>) Time (Extended Abstract) (Q4575786) (← links)
- (Q4607988) (← links)
- Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs (Q4629967) (← links)
- Improved Distance Queries and Cycle Counting by Frobenius Normal Form (Q4636657) (← links)
- Min <i>st</i> -Cut Oracle for Planar Graphs with Near-Linear Preprocessing Time (Q4962174) (← links)
- Decremental single-source reachability in planar digraphs (Q4978051) (← links)
- NC Algorithms for Weighted Planar Perfect Matching and Related Problems (Q5002779) (← links)
- (Q5009578) (← links)
- Min-Cost Flow in Unit-Capacity Planar Graphs (Q5075811) (← links)
- Contracting a Planar Graph Efficiently (Q5111739) (← links)
- Round Compression for Parallel Matching Algorithms (Q5130844) (← links)
- Approximate Nearest Neighbors Search Without False Negatives For l_2 For c>sqrt{loglog{n}}. (Q5136284) (← links)
- Walking randomly, massively, and efficiently (Q5144923) (← links)
- Round compression for parallel matching algorithms (Q5230311) (← links)
