1: Inverse Fractional Knapsack Problem with Profits and Costs Modification
2: Local Guarantees in Graph Cuts and Clustering
3: Local Algorithms for Hierarchical Dense Subgraph Discovery
4: A Message-Passing Algorithm for Graph Isomorphism
5: Optimizing Communication by Compression for Multi-GPU Scalable Breadth-First Searches
6: Dynamic Planar Embeddings of Dynamic Graphs
7: Optimal lower bounds for universal relation, and for samplers and finding duplicates in streams
8: Loop Tiling in Large-Scale Stencil Codes at Run-time with OPS
9: Graph Partitioning with Acyclicity Constraints
10: Quantum Algorithms for Graph Connectivity and Formula Evaluation
11: Synchronization Strings: Codes for Insertions and Deletions Approaching the Singleton Bound
12: Locally Self-Adjusting Skip Graphs
13: Dynamic Rank Maximal Matchings
14: (1, k)-Swap Local Search for Maximum Clique Problem
15: On the Combinatorial Power of the Weisfeiler-Lehman Algorithm
16: A new algorithm for Solving 3-CNF-SAT problem
17: Link Prediction using Top-$k$ Shortest Distances
18: Computing top-k Closeness Centrality Faster in Unweighted Graphs
19: The integrality gap of the Goemans–Linial SDP relaxation for Sparsest Cut is at least a constant multiple of $\sqrt{\log n}$
20: Storing complex data sharing policies with the Min Mask Sketch
21: Local Flow Partitioning for Faster Edge Connectivity
22: Optimal trade-offs for pattern matching with $k$ mismatches
23: Comparison Based Nearest Neighbor Search
24: Streaming Pattern Matching with d Wildcards
25: Greed is Good: Near-Optimal Submodular Maximization via Greedy Optimization
26: Multi-Personality Partitioning for Heterogeneous Systems
27: Approximate Clustering with Same-Cluster Queries
28: Randomized Linear Programming Solves the Discounted Markov Decision Problem In Nearly-Linear (Sometimes Sublinear) Running Time
29: A Characterization of Undirected Graphs Admitting Optimal Cost Shares
30: Optimizing Adiabatic Quantum Program Compilation using a Graph-Theoretic Framework
31: Optimal Las Vegas Locality Sensitive Data Structures
32: Probabilistic Recurrence Relations for Work and Span of Parallel Algorithms
33: Tree-based unrooted phylogenetic networks
34: Hierarchical Clustering: Objective Functions and Algorithms
35: New Subquadratic Approximation Algorithms for the Girth
36: Proportional Approval Voting, Harmonic k-median, and Negative Association
37: 'Echantillonnage de signaux sur graphes via des processus d'eterminantaux