Showing 1–20 of 72 results
/ Date/ Name
Jul 30, 2018On Approximating (Sparse) Covering Integer ProgramsJul 23, 2018Submodular Function Maximization in Parallel via the Multilinear RelaxationJun 13, 2009Truthful Mechanisms via Greedy Iterative PackingOct 6, 2022$(1-ε)$-approximate fully dynamic densest subgraph: linear space and faster update timeJul 6, 2023Efficient parallel implementation of the multiplicative weight update method for graph-based linear programsJun 3, 2023On the Generalized Mean Densest Subgraph Problem: Complexity and AlgorithmsMay 10, 2011Approximation Algorithms for Submodular Multiway PartitionAug 8, 2016A note on the Survivable Network Design ProblemMar 22, 2023Polyhedral Aspects of Feedback Vertex Set and Pseudoforest Deletion SetMay 23, 2025Corporate Needs You to Find the Difference: Revisiting Submodular and Supermodular Ratio Optimization ProblemsApr 4, 2013Large-Treewidth Graph Decompositions and ApplicationsSep 25, 2020Hypergraph $k$-cut for fixed $k$ in deterministic polynomial timeNov 4, 2019Algorithms for Intersection Graphs of Multiple Intervals and Pseudo DisksApr 15, 2021Faster Algorithms for Rooted Connectivity in Directed GraphsFeb 14, 2017Approximating the Held-Karp Bound for Metric TSP in Nearly Linear TimeOct 29, 2025Hedgegraph PolymatroidsAug 26, 2025Hypergraph Splitting-Off via Element-Connectivity Preserving ReductionsMar 4, 2021Revisiting Priority $k$-Center: Fairness and OutliersJul 8, 2021On Submodular Prophet Inequalities and Correlation GapOct 16, 2019Node-Weighted Network Design in Planar and Minor-Closed Families of Graphs